./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product56.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec1_product56.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3236d89cedc127e9d85364eeaf0ba1493a1eae64 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 17:24:33,277 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:24:33,280 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:24:33,298 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:24:33,298 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:24:33,300 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:24:33,302 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:24:33,311 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:24:33,316 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:24:33,320 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:24:33,320 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:24:33,322 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:24:33,323 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:24:33,325 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:24:33,326 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:24:33,327 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:24:33,328 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:24:33,329 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:24:33,331 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:24:33,335 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:24:33,339 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:24:33,343 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:24:33,344 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:24:33,345 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:24:33,348 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:24:33,348 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:24:33,349 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:24:33,350 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:24:33,351 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:24:33,352 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:24:33,352 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:24:33,354 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:24:33,355 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:24:33,356 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:24:33,357 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:24:33,357 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:24:33,358 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:24:33,358 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:24:33,358 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:24:33,359 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:24:33,360 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:24:33,361 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 17:24:33,393 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:24:33,393 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:24:33,394 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:24:33,397 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:24:33,397 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:24:33,397 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:24:33,397 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:24:33,398 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:24:33,398 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:24:33,398 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:24:33,398 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:24:33,398 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:24:33,399 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:24:33,399 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:24:33,399 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:24:33,399 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:24:33,399 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:24:33,401 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:24:33,401 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:24:33,401 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:24:33,402 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:24:33,402 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:24:33,402 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:24:33,402 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:24:33,403 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:24:33,403 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:24:33,403 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:24:33,403 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:24:33,403 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:24:33,404 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3236d89cedc127e9d85364eeaf0ba1493a1eae64 [2019-11-28 17:24:33,710 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:24:33,725 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:24:33,728 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:24:33,730 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:24:33,731 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:24:33,732 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product56.cil.c [2019-11-28 17:24:33,798 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbac13fdc/819173cdec994dde965c96d0da6d760a/FLAG1a826cbad [2019-11-28 17:24:34,352 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:24:34,353 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product56.cil.c [2019-11-28 17:24:34,374 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbac13fdc/819173cdec994dde965c96d0da6d760a/FLAG1a826cbad [2019-11-28 17:24:34,624 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbac13fdc/819173cdec994dde965c96d0da6d760a [2019-11-28 17:24:34,628 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:24:34,630 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:24:34,635 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:24:34,635 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:24:34,638 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:24:34,639 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:24:34" (1/1) ... [2019-11-28 17:24:34,642 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38128a2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:34, skipping insertion in model container [2019-11-28 17:24:34,642 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:24:34" (1/1) ... [2019-11-28 17:24:34,651 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:24:34,706 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:24:35,129 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:24:35,152 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:24:35,258 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:24:35,297 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:24:35,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:35 WrapperNode [2019-11-28 17:24:35,298 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:24:35,299 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:24:35,299 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:24:35,299 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:24:35,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:35" (1/1) ... [2019-11-28 17:24:35,328 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:35" (1/1) ... [2019-11-28 17:24:35,397 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:24:35,398 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:24:35,398 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:24:35,398 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:24:35,407 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:35" (1/1) ... [2019-11-28 17:24:35,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:35" (1/1) ... [2019-11-28 17:24:35,415 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:35" (1/1) ... [2019-11-28 17:24:35,415 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:35" (1/1) ... [2019-11-28 17:24:35,433 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:35" (1/1) ... [2019-11-28 17:24:35,445 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:35" (1/1) ... [2019-11-28 17:24:35,450 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:35" (1/1) ... [2019-11-28 17:24:35,458 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:24:35,459 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:24:35,459 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:24:35,459 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:24:35,460 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:24:35,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 17:24:35,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 17:24:35,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:24:35,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:24:36,608 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:24:36,608 INFO L287 CfgBuilder]: Removed 282 assume(true) statements. [2019-11-28 17:24:36,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:24:36 BoogieIcfgContainer [2019-11-28 17:24:36,610 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:24:36,612 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:24:36,612 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:24:36,616 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:24:36,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:24:34" (1/3) ... [2019-11-28 17:24:36,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c763c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:24:36, skipping insertion in model container [2019-11-28 17:24:36,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:35" (2/3) ... [2019-11-28 17:24:36,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c763c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:24:36, skipping insertion in model container [2019-11-28 17:24:36,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:24:36" (3/3) ... [2019-11-28 17:24:36,624 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product56.cil.c [2019-11-28 17:24:36,633 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:24:36,640 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 17:24:36,650 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 17:24:36,672 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:24:36,672 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:24:36,673 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:24:36,673 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:24:36,673 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:24:36,674 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:24:36,674 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:24:36,674 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:24:36,699 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states. [2019-11-28 17:24:36,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 17:24:36,706 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:36,707 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:24:36,707 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:36,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:36,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1937289636, now seen corresponding path program 1 times [2019-11-28 17:24:36,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:36,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578683350] [2019-11-28 17:24:36,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:36,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:36,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:24:36,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578683350] [2019-11-28 17:24:36,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:36,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:24:36,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076400590] [2019-11-28 17:24:36,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 17:24:36,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:37,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 17:24:37,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 17:24:37,007 INFO L87 Difference]: Start difference. First operand 191 states. Second operand 2 states. [2019-11-28 17:24:37,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:37,054 INFO L93 Difference]: Finished difference Result 376 states and 575 transitions. [2019-11-28 17:24:37,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 17:24:37,058 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-28 17:24:37,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:37,074 INFO L225 Difference]: With dead ends: 376 [2019-11-28 17:24:37,075 INFO L226 Difference]: Without dead ends: 187 [2019-11-28 17:24:37,079 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 17:24:37,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-11-28 17:24:37,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2019-11-28 17:24:37,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-11-28 17:24:37,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 279 transitions. [2019-11-28 17:24:37,130 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 279 transitions. Word has length 16 [2019-11-28 17:24:37,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:37,130 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 279 transitions. [2019-11-28 17:24:37,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 17:24:37,130 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 279 transitions. [2019-11-28 17:24:37,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 17:24:37,132 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:37,132 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:24:37,132 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:37,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:37,133 INFO L82 PathProgramCache]: Analyzing trace with hash 890532739, now seen corresponding path program 1 times [2019-11-28 17:24:37,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:37,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816494156] [2019-11-28 17:24:37,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:37,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:37,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:24:37,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816494156] [2019-11-28 17:24:37,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:37,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:24:37,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302197005] [2019-11-28 17:24:37,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:24:37,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:37,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:24:37,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:24:37,274 INFO L87 Difference]: Start difference. First operand 187 states and 279 transitions. Second operand 3 states. [2019-11-28 17:24:37,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:37,307 INFO L93 Difference]: Finished difference Result 187 states and 279 transitions. [2019-11-28 17:24:37,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:24:37,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 17:24:37,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:37,310 INFO L225 Difference]: With dead ends: 187 [2019-11-28 17:24:37,310 INFO L226 Difference]: Without dead ends: 73 [2019-11-28 17:24:37,315 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:24:37,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-28 17:24:37,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-11-28 17:24:37,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-28 17:24:37,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 108 transitions. [2019-11-28 17:24:37,328 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 108 transitions. Word has length 17 [2019-11-28 17:24:37,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:37,329 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 108 transitions. [2019-11-28 17:24:37,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:24:37,330 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 108 transitions. [2019-11-28 17:24:37,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 17:24:37,331 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:37,331 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:24:37,331 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:37,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:37,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1577730230, now seen corresponding path program 1 times [2019-11-28 17:24:37,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:37,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461617791] [2019-11-28 17:24:37,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:37,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:37,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:24:37,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461617791] [2019-11-28 17:24:37,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:37,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:24:37,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327326605] [2019-11-28 17:24:37,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:24:37,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:37,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:24:37,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:24:37,437 INFO L87 Difference]: Start difference. First operand 73 states and 108 transitions. Second operand 3 states. [2019-11-28 17:24:37,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:37,481 INFO L93 Difference]: Finished difference Result 207 states and 312 transitions. [2019-11-28 17:24:37,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:24:37,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-28 17:24:37,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:37,484 INFO L225 Difference]: With dead ends: 207 [2019-11-28 17:24:37,484 INFO L226 Difference]: Without dead ends: 140 [2019-11-28 17:24:37,485 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:24:37,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-28 17:24:37,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 136. [2019-11-28 17:24:37,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-28 17:24:37,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 205 transitions. [2019-11-28 17:24:37,502 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 205 transitions. Word has length 22 [2019-11-28 17:24:37,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:37,502 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 205 transitions. [2019-11-28 17:24:37,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:24:37,503 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 205 transitions. [2019-11-28 17:24:37,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 17:24:37,504 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:37,505 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:24:37,505 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:37,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:37,506 INFO L82 PathProgramCache]: Analyzing trace with hash 792163456, now seen corresponding path program 1 times [2019-11-28 17:24:37,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:37,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51986216] [2019-11-28 17:24:37,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:37,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:37,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:24:37,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51986216] [2019-11-28 17:24:37,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:37,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:24:37,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315668912] [2019-11-28 17:24:37,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:24:37,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:37,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:24:37,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:24:37,588 INFO L87 Difference]: Start difference. First operand 136 states and 205 transitions. Second operand 3 states. [2019-11-28 17:24:37,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:37,640 INFO L93 Difference]: Finished difference Result 283 states and 430 transitions. [2019-11-28 17:24:37,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:24:37,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 17:24:37,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:37,642 INFO L225 Difference]: With dead ends: 283 [2019-11-28 17:24:37,642 INFO L226 Difference]: Without dead ends: 153 [2019-11-28 17:24:37,643 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:24:37,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-28 17:24:37,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2019-11-28 17:24:37,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-28 17:24:37,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 219 transitions. [2019-11-28 17:24:37,658 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 219 transitions. Word has length 25 [2019-11-28 17:24:37,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:37,659 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 219 transitions. [2019-11-28 17:24:37,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:24:37,659 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 219 transitions. [2019-11-28 17:24:37,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 17:24:37,660 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:37,661 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:24:37,661 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:37,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:37,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1022954699, now seen corresponding path program 1 times [2019-11-28 17:24:37,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:37,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648503806] [2019-11-28 17:24:37,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:37,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:37,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:24:37,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648503806] [2019-11-28 17:24:37,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:37,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:24:37,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382408821] [2019-11-28 17:24:37,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:24:37,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:37,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:24:37,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:24:37,760 INFO L87 Difference]: Start difference. First operand 151 states and 219 transitions. Second operand 5 states. [2019-11-28 17:24:37,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:37,889 INFO L93 Difference]: Finished difference Result 763 states and 1120 transitions. [2019-11-28 17:24:37,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 17:24:37,890 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-28 17:24:37,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:37,894 INFO L225 Difference]: With dead ends: 763 [2019-11-28 17:24:37,894 INFO L226 Difference]: Without dead ends: 618 [2019-11-28 17:24:37,895 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-28 17:24:37,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-11-28 17:24:37,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 286. [2019-11-28 17:24:37,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-11-28 17:24:37,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 411 transitions. [2019-11-28 17:24:37,925 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 411 transitions. Word has length 25 [2019-11-28 17:24:37,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:37,926 INFO L462 AbstractCegarLoop]: Abstraction has 286 states and 411 transitions. [2019-11-28 17:24:37,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:24:37,927 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 411 transitions. [2019-11-28 17:24:37,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 17:24:37,928 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:37,928 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:24:37,929 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:37,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:37,929 INFO L82 PathProgramCache]: Analyzing trace with hash 819147605, now seen corresponding path program 1 times [2019-11-28 17:24:37,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:37,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546702951] [2019-11-28 17:24:37,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:37,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:37,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:24:37,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546702951] [2019-11-28 17:24:37,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:37,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:24:37,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106413779] [2019-11-28 17:24:37,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:24:38,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:38,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:24:38,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:24:38,001 INFO L87 Difference]: Start difference. First operand 286 states and 411 transitions. Second operand 5 states. [2019-11-28 17:24:38,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:38,193 INFO L93 Difference]: Finished difference Result 832 states and 1198 transitions. [2019-11-28 17:24:38,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 17:24:38,194 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 17:24:38,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:38,199 INFO L225 Difference]: With dead ends: 832 [2019-11-28 17:24:38,199 INFO L226 Difference]: Without dead ends: 830 [2019-11-28 17:24:38,200 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-28 17:24:38,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2019-11-28 17:24:38,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 286. [2019-11-28 17:24:38,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-11-28 17:24:38,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 409 transitions. [2019-11-28 17:24:38,224 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 409 transitions. Word has length 26 [2019-11-28 17:24:38,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:38,224 INFO L462 AbstractCegarLoop]: Abstraction has 286 states and 409 transitions. [2019-11-28 17:24:38,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:24:38,225 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 409 transitions. [2019-11-28 17:24:38,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 17:24:38,226 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:38,226 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:24:38,227 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:38,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:38,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1010263109, now seen corresponding path program 1 times [2019-11-28 17:24:38,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:38,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669662053] [2019-11-28 17:24:38,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:38,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:38,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:24:38,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669662053] [2019-11-28 17:24:38,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:38,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:24:38,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248660610] [2019-11-28 17:24:38,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:24:38,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:38,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:24:38,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:24:38,281 INFO L87 Difference]: Start difference. First operand 286 states and 409 transitions. Second operand 5 states. [2019-11-28 17:24:38,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:38,396 INFO L93 Difference]: Finished difference Result 766 states and 1076 transitions. [2019-11-28 17:24:38,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:24:38,397 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-11-28 17:24:38,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:38,400 INFO L225 Difference]: With dead ends: 766 [2019-11-28 17:24:38,401 INFO L226 Difference]: Without dead ends: 486 [2019-11-28 17:24:38,402 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:24:38,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2019-11-28 17:24:38,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 322. [2019-11-28 17:24:38,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-11-28 17:24:38,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 445 transitions. [2019-11-28 17:24:38,429 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 445 transitions. Word has length 32 [2019-11-28 17:24:38,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:38,430 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 445 transitions. [2019-11-28 17:24:38,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:24:38,430 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 445 transitions. [2019-11-28 17:24:38,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 17:24:38,431 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:38,432 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:24:38,432 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:38,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:38,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1403290119, now seen corresponding path program 1 times [2019-11-28 17:24:38,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:38,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416047518] [2019-11-28 17:24:38,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:38,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:38,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:24:38,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416047518] [2019-11-28 17:24:38,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:38,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:24:38,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904873814] [2019-11-28 17:24:38,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:24:38,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:38,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:24:38,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:24:38,495 INFO L87 Difference]: Start difference. First operand 322 states and 445 transitions. Second operand 5 states. [2019-11-28 17:24:38,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:38,715 INFO L93 Difference]: Finished difference Result 882 states and 1193 transitions. [2019-11-28 17:24:38,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 17:24:38,715 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-11-28 17:24:38,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:38,719 INFO L225 Difference]: With dead ends: 882 [2019-11-28 17:24:38,719 INFO L226 Difference]: Without dead ends: 566 [2019-11-28 17:24:38,720 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-28 17:24:38,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2019-11-28 17:24:38,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 346. [2019-11-28 17:24:38,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-11-28 17:24:38,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 469 transitions. [2019-11-28 17:24:38,747 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 469 transitions. Word has length 32 [2019-11-28 17:24:38,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:38,748 INFO L462 AbstractCegarLoop]: Abstraction has 346 states and 469 transitions. [2019-11-28 17:24:38,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:24:38,748 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 469 transitions. [2019-11-28 17:24:38,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 17:24:38,749 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:38,749 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:24:38,749 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:38,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:38,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1145124681, now seen corresponding path program 1 times [2019-11-28 17:24:38,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:38,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914098414] [2019-11-28 17:24:38,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:38,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:38,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:24:38,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914098414] [2019-11-28 17:24:38,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:38,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:24:38,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565324753] [2019-11-28 17:24:38,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:24:38,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:38,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:24:38,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:24:38,793 INFO L87 Difference]: Start difference. First operand 346 states and 469 transitions. Second operand 3 states. [2019-11-28 17:24:38,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:38,850 INFO L93 Difference]: Finished difference Result 794 states and 1070 transitions. [2019-11-28 17:24:38,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:24:38,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-28 17:24:38,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:38,853 INFO L225 Difference]: With dead ends: 794 [2019-11-28 17:24:38,853 INFO L226 Difference]: Without dead ends: 454 [2019-11-28 17:24:38,854 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:24:38,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-11-28 17:24:38,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 454. [2019-11-28 17:24:38,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2019-11-28 17:24:38,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 599 transitions. [2019-11-28 17:24:38,894 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 599 transitions. Word has length 32 [2019-11-28 17:24:38,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:38,894 INFO L462 AbstractCegarLoop]: Abstraction has 454 states and 599 transitions. [2019-11-28 17:24:38,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:24:38,895 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 599 transitions. [2019-11-28 17:24:38,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 17:24:38,896 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:38,896 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:24:38,896 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:38,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:38,896 INFO L82 PathProgramCache]: Analyzing trace with hash 2078796085, now seen corresponding path program 1 times [2019-11-28 17:24:38,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:38,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075453629] [2019-11-28 17:24:38,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:38,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:24:39,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:24:39,064 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 17:24:39,065 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 17:24:39,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:24:39 BoogieIcfgContainer [2019-11-28 17:24:39,201 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:24:39,201 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:24:39,202 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:24:39,202 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:24:39,202 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:24:36" (3/4) ... [2019-11-28 17:24:39,208 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 17:24:39,348 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 17:24:39,349 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:24:39,356 INFO L168 Benchmark]: Toolchain (without parser) took 4721.73 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 221.8 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -133.7 MB). Peak memory consumption was 88.0 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:39,359 INFO L168 Benchmark]: CDTParser took 0.77 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:24:39,360 INFO L168 Benchmark]: CACSL2BoogieTranslator took 663.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -158.2 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:39,360 INFO L168 Benchmark]: Boogie Procedure Inliner took 98.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:39,361 INFO L168 Benchmark]: Boogie Preprocessor took 60.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:39,361 INFO L168 Benchmark]: RCFGBuilder took 1151.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 78.5 MB). Peak memory consumption was 78.5 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:39,364 INFO L168 Benchmark]: TraceAbstraction took 2588.81 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 79.7 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -75.1 MB). Peak memory consumption was 4.6 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:39,366 INFO L168 Benchmark]: Witness Printer took 147.91 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:39,370 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.77 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 663.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -158.2 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 98.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 60.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1151.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 78.5 MB). Peak memory consumption was 78.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2588.81 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 79.7 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -75.1 MB). Peak memory consumption was 4.6 MB. Max. memory is 11.5 GB. * Witness Printer took 147.91 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 806]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L209] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L490] int pumpRunning = 0; [L491] int systemActive = 1; [L811] int cleanupTimeShifts = 4; [L908] int waterLevel = 1; [L909] int methaneLevelCritical = 0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L884] int retValue_acc ; [L885] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L766] int retValue_acc ; [L769] retValue_acc = 1 [L770] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L891] tmp = valid_product() [L893] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L413] int splverifierCounter ; [L414] int tmp ; [L415] int tmp___0 ; [L416] int tmp___1 ; [L417] int tmp___2 ; [L420] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L422] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L424] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L430] tmp = __VERIFIER_nondet_int() [L432] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L926] COND TRUE waterLevel < 2 [L927] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L440] tmp___0 = __VERIFIER_nondet_int() [L442] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L938] COND FALSE !(\read(methaneLevelCritical)) [L941] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L450] tmp___2 = __VERIFIER_nondet_int() [L452] COND TRUE \read(tmp___2) [L732] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L498] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L505] COND TRUE \read(systemActive) [L579] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L582] COND FALSE !(\read(pumpRunning)) [L553] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L556] COND FALSE !(\read(pumpRunning)) [L527] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L530] COND TRUE ! pumpRunning [L676] int retValue_acc ; [L677] int tmp ; [L678] int tmp___0 ; [L988] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L991] COND FALSE !(waterLevel < 2) [L995] retValue_acc = 0 [L996] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L682] tmp = isHighWaterSensorDry() [L684] COND FALSE !(\read(tmp)) [L687] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L689] retValue_acc = tmp___0 [L690] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L532] tmp = isHighWaterLevel() [L534] COND TRUE \read(tmp) [L607] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L777] int tmp ; [L778] int tmp___0 ; [L947] int retValue_acc ; [L950] retValue_acc = methaneLevelCritical [L951] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L782] tmp = isMethaneLevelCritical() [L784] COND TRUE \read(tmp) [L631] int retValue_acc ; [L634] retValue_acc = pumpRunning [L635] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L786] tmp___0 = isPumpRunning() [L788] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L806] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 191 locations, 3 error locations. Result: UNSAFE, OverallTime: 2.3s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1184 SDtfs, 1469 SDslu, 1535 SDs, 0 SdLazy, 215 SolverSat, 65 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=454occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 1266 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 260 NumberOfCodeBlocks, 260 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 218 ConstructedInterpolants, 0 QuantifiedInterpolants, 10538 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...