./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/product-lines/minepump_spec4_product51_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9160621a-942b-477b-b604-78646ae4f900/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9160621a-942b-477b-b604-78646ae4f900/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9160621a-942b-477b-b604-78646ae4f900/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9160621a-942b-477b-b604-78646ae4f900/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/product-lines/minepump_spec4_product51_true-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_9160621a-942b-477b-b604-78646ae4f900/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9160621a-942b-477b-b604-78646ae4f900/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 82fb1dfaeb04705f6833d1531288fda63f898d4b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 00:56:30,356 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 00:56:30,358 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 00:56:30,370 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 00:56:30,371 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 00:56:30,371 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 00:56:30,372 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 00:56:30,374 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 00:56:30,375 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 00:56:30,376 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 00:56:30,377 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 00:56:30,377 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 00:56:30,377 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 00:56:30,379 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 00:56:30,380 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 00:56:30,380 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 00:56:30,381 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 00:56:30,382 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 00:56:30,384 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 00:56:30,385 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 00:56:30,385 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 00:56:30,387 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 00:56:30,388 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 00:56:30,389 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 00:56:30,389 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 00:56:30,389 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 00:56:30,391 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 00:56:30,391 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 00:56:30,392 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 00:56:30,393 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 00:56:30,393 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 00:56:30,393 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 00:56:30,394 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 00:56:30,394 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 00:56:30,395 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 00:56:30,396 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 00:56:30,396 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9160621a-942b-477b-b604-78646ae4f900/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-27 00:56:30,407 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 00:56:30,407 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 00:56:30,408 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 00:56:30,408 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 00:56:30,408 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 00:56:30,409 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 00:56:30,409 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 00:56:30,409 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 00:56:30,409 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 00:56:30,409 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 00:56:30,409 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 00:56:30,410 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 00:56:30,411 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 00:56:30,411 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 00:56:30,411 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 00:56:30,411 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 00:56:30,411 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 00:56:30,412 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 00:56:30,412 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 00:56:30,412 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 00:56:30,412 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 00:56:30,412 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 00:56:30,412 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 00:56:30,412 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 00:56:30,413 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 00:56:30,413 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 00:56:30,413 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 00:56:30,413 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 00:56:30,413 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 00:56:30,413 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 00:56:30,413 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 00:56:30,414 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 00:56:30,414 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 00:56:30,414 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 00:56:30,414 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_9160621a-942b-477b-b604-78646ae4f900/bin-2019/utaipan 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 -> Taipan 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 -> 82fb1dfaeb04705f6833d1531288fda63f898d4b [2018-10-27 00:56:30,441 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 00:56:30,450 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 00:56:30,453 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 00:56:30,454 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 00:56:30,454 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 00:56:30,455 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9160621a-942b-477b-b604-78646ae4f900/bin-2019/utaipan/../../sv-benchmarks/c/product-lines/minepump_spec4_product51_true-unreach-call_false-termination.cil.c [2018-10-27 00:56:30,501 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9160621a-942b-477b-b604-78646ae4f900/bin-2019/utaipan/data/e0db695cf/6607d0fd3f6b42dfb3654f3257209b5f/FLAGbef16d913 [2018-10-27 00:56:30,923 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 00:56:30,924 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9160621a-942b-477b-b604-78646ae4f900/sv-benchmarks/c/product-lines/minepump_spec4_product51_true-unreach-call_false-termination.cil.c [2018-10-27 00:56:30,934 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9160621a-942b-477b-b604-78646ae4f900/bin-2019/utaipan/data/e0db695cf/6607d0fd3f6b42dfb3654f3257209b5f/FLAGbef16d913 [2018-10-27 00:56:30,946 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9160621a-942b-477b-b604-78646ae4f900/bin-2019/utaipan/data/e0db695cf/6607d0fd3f6b42dfb3654f3257209b5f [2018-10-27 00:56:30,949 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 00:56:30,950 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 00:56:30,951 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 00:56:30,951 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 00:56:30,954 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 00:56:30,955 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:56:30" (1/1) ... [2018-10-27 00:56:30,958 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b9212c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:56:30, skipping insertion in model container [2018-10-27 00:56:30,958 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:56:30" (1/1) ... [2018-10-27 00:56:30,967 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 00:56:31,009 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 00:56:31,259 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 00:56:31,274 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 00:56:31,334 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 00:56:31,361 INFO L193 MainTranslator]: Completed translation [2018-10-27 00:56:31,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:56:31 WrapperNode [2018-10-27 00:56:31,361 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 00:56:31,362 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 00:56:31,362 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 00:56:31,362 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 00:56:31,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:56:31" (1/1) ... [2018-10-27 00:56:31,384 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:56:31" (1/1) ... [2018-10-27 00:56:31,491 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 00:56:31,491 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 00:56:31,491 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 00:56:31,491 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 00:56:31,497 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:56:31" (1/1) ... [2018-10-27 00:56:31,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:56:31" (1/1) ... [2018-10-27 00:56:31,502 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:56:31" (1/1) ... [2018-10-27 00:56:31,502 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:56:31" (1/1) ... [2018-10-27 00:56:31,511 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:56:31" (1/1) ... [2018-10-27 00:56:31,519 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:56:31" (1/1) ... [2018-10-27 00:56:31,532 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:56:31" (1/1) ... [2018-10-27 00:56:31,535 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 00:56:31,539 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 00:56:31,539 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 00:56:31,539 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 00:56:31,540 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:56:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9160621a-942b-477b-b604-78646ae4f900/bin-2019/utaipan/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 [2018-10-27 00:56:31,584 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2018-10-27 00:56:31,584 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2018-10-27 00:56:31,584 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification4_spec__1 [2018-10-27 00:56:31,584 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification4_spec__1 [2018-10-27 00:56:31,584 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 00:56:31,584 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 00:56:31,584 INFO L130 BoogieDeclarations]: Found specification of procedure stopSystem [2018-10-27 00:56:31,585 INFO L138 BoogieDeclarations]: Found implementation of procedure stopSystem [2018-10-27 00:56:31,585 INFO L130 BoogieDeclarations]: Found specification of procedure isLowWaterLevel [2018-10-27 00:56:31,585 INFO L138 BoogieDeclarations]: Found implementation of procedure isLowWaterLevel [2018-10-27 00:56:31,585 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2018-10-27 00:56:31,585 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2018-10-27 00:56:31,585 INFO L130 BoogieDeclarations]: Found specification of procedure isHighWaterSensorDry [2018-10-27 00:56:31,585 INFO L138 BoogieDeclarations]: Found implementation of procedure isHighWaterSensorDry [2018-10-27 00:56:31,585 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment [2018-10-27 00:56:31,586 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment [2018-10-27 00:56:31,586 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2018-10-27 00:56:31,587 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2018-10-27 00:56:31,587 INFO L130 BoogieDeclarations]: Found specification of procedure test [2018-10-27 00:56:31,588 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2018-10-27 00:56:31,588 INFO L130 BoogieDeclarations]: Found specification of procedure isLowWaterSensorDry [2018-10-27 00:56:31,588 INFO L138 BoogieDeclarations]: Found implementation of procedure isLowWaterSensorDry [2018-10-27 00:56:31,588 INFO L130 BoogieDeclarations]: Found specification of procedure activatePump [2018-10-27 00:56:31,588 INFO L138 BoogieDeclarations]: Found implementation of procedure activatePump [2018-10-27 00:56:31,588 INFO L130 BoogieDeclarations]: Found specification of procedure getWaterLevel [2018-10-27 00:56:31,588 INFO L138 BoogieDeclarations]: Found implementation of procedure getWaterLevel [2018-10-27 00:56:31,588 INFO L130 BoogieDeclarations]: Found specification of procedure isHighWaterLevel [2018-10-27 00:56:31,588 INFO L138 BoogieDeclarations]: Found implementation of procedure isHighWaterLevel [2018-10-27 00:56:31,589 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2018-10-27 00:56:31,589 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2018-10-27 00:56:31,589 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2018-10-27 00:56:31,589 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2018-10-27 00:56:31,589 INFO L130 BoogieDeclarations]: Found specification of procedure lowerWaterLevel [2018-10-27 00:56:31,589 INFO L138 BoogieDeclarations]: Found implementation of procedure lowerWaterLevel [2018-10-27 00:56:31,589 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2018-10-27 00:56:31,589 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2018-10-27 00:56:31,589 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2018-10-27 00:56:31,590 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2018-10-27 00:56:31,590 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2018-10-27 00:56:31,590 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2018-10-27 00:56:31,590 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2018-10-27 00:56:31,590 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2018-10-27 00:56:31,590 INFO L130 BoogieDeclarations]: Found specification of procedure isPumpRunning [2018-10-27 00:56:31,590 INFO L138 BoogieDeclarations]: Found implementation of procedure isPumpRunning [2018-10-27 00:56:31,590 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2018-10-27 00:56:31,591 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2018-10-27 00:56:31,591 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2018-10-27 00:56:31,591 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2018-10-27 00:56:31,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 00:56:31,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 00:56:31,591 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2018-10-27 00:56:31,591 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2018-10-27 00:56:31,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 00:56:31,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 00:56:31,592 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2018-10-27 00:56:31,592 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2018-10-27 00:56:32,592 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 00:56:32,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:56:32 BoogieIcfgContainer [2018-10-27 00:56:32,593 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 00:56:32,594 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 00:56:32,594 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 00:56:32,597 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 00:56:32,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 12:56:30" (1/3) ... [2018-10-27 00:56:32,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1de1d036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:56:32, skipping insertion in model container [2018-10-27 00:56:32,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:56:31" (2/3) ... [2018-10-27 00:56:32,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1de1d036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:56:32, skipping insertion in model container [2018-10-27 00:56:32,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:56:32" (3/3) ... [2018-10-27 00:56:32,600 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product51_true-unreach-call_false-termination.cil.c [2018-10-27 00:56:32,610 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 00:56:32,617 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 00:56:32,635 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 00:56:32,696 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 00:56:32,696 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 00:56:32,696 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 00:56:32,696 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 00:56:32,696 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 00:56:32,697 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 00:56:32,697 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 00:56:32,698 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 00:56:32,736 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2018-10-27 00:56:32,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-27 00:56:32,754 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:56:32,755 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:56:32,757 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:56:32,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:56:32,764 INFO L82 PathProgramCache]: Analyzing trace with hash 2101538177, now seen corresponding path program 1 times [2018-10-27 00:56:32,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:56:32,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:56:32,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:56:32,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:56:32,835 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:56:32,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:56:33,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:56:33,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:56:33,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 00:56:33,053 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:56:33,058 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-27 00:56:33,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 00:56:33,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 00:56:33,070 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 2 states. [2018-10-27 00:56:33,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:56:33,102 INFO L93 Difference]: Finished difference Result 272 states and 337 transitions. [2018-10-27 00:56:33,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 00:56:33,103 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 46 [2018-10-27 00:56:33,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:56:33,114 INFO L225 Difference]: With dead ends: 272 [2018-10-27 00:56:33,114 INFO L226 Difference]: Without dead ends: 136 [2018-10-27 00:56:33,118 INFO L605 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 [2018-10-27 00:56:33,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-10-27 00:56:33,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-10-27 00:56:33,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-10-27 00:56:33,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 160 transitions. [2018-10-27 00:56:33,165 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 160 transitions. Word has length 46 [2018-10-27 00:56:33,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:56:33,166 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 160 transitions. [2018-10-27 00:56:33,166 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-27 00:56:33,166 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 160 transitions. [2018-10-27 00:56:33,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-27 00:56:33,169 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:56:33,169 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:56:33,169 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:56:33,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:56:33,171 INFO L82 PathProgramCache]: Analyzing trace with hash -69632568, now seen corresponding path program 1 times [2018-10-27 00:56:33,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:56:33,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:56:33,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:56:33,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:56:33,172 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:56:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:56:33,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:56:33,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:56:33,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:56:33,357 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:56:33,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:56:33,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:56:33,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:56:33,359 INFO L87 Difference]: Start difference. First operand 136 states and 160 transitions. Second operand 3 states. [2018-10-27 00:56:33,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:56:33,399 INFO L93 Difference]: Finished difference Result 213 states and 249 transitions. [2018-10-27 00:56:33,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:56:33,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-10-27 00:56:33,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:56:33,401 INFO L225 Difference]: With dead ends: 213 [2018-10-27 00:56:33,401 INFO L226 Difference]: Without dead ends: 126 [2018-10-27 00:56:33,403 INFO L605 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 [2018-10-27 00:56:33,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-27 00:56:33,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-10-27 00:56:33,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-10-27 00:56:33,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 147 transitions. [2018-10-27 00:56:33,428 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 147 transitions. Word has length 48 [2018-10-27 00:56:33,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:56:33,429 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 147 transitions. [2018-10-27 00:56:33,429 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:56:33,429 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 147 transitions. [2018-10-27 00:56:33,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-27 00:56:33,430 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:56:33,430 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:56:33,431 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:56:33,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:56:33,431 INFO L82 PathProgramCache]: Analyzing trace with hash 248821180, now seen corresponding path program 1 times [2018-10-27 00:56:33,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:56:33,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:56:33,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:56:33,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:56:33,432 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:56:33,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:56:33,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:56:33,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:56:33,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-27 00:56:33,643 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:56:33,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 00:56:33,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 00:56:33,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-27 00:56:33,644 INFO L87 Difference]: Start difference. First operand 126 states and 147 transitions. Second operand 7 states. [2018-10-27 00:56:34,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:56:34,798 INFO L93 Difference]: Finished difference Result 381 states and 460 transitions. [2018-10-27 00:56:34,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 00:56:34,799 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-10-27 00:56:34,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:56:34,804 INFO L225 Difference]: With dead ends: 381 [2018-10-27 00:56:34,806 INFO L226 Difference]: Without dead ends: 279 [2018-10-27 00:56:34,807 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-27 00:56:34,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-10-27 00:56:34,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 271. [2018-10-27 00:56:34,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-10-27 00:56:34,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 327 transitions. [2018-10-27 00:56:34,865 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 327 transitions. Word has length 52 [2018-10-27 00:56:34,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:56:34,865 INFO L481 AbstractCegarLoop]: Abstraction has 271 states and 327 transitions. [2018-10-27 00:56:34,865 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 00:56:34,865 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 327 transitions. [2018-10-27 00:56:34,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-27 00:56:34,870 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:56:34,870 INFO L375 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, 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] [2018-10-27 00:56:34,870 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:56:34,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:56:34,871 INFO L82 PathProgramCache]: Analyzing trace with hash 458994956, now seen corresponding path program 1 times [2018-10-27 00:56:34,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:56:34,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:56:34,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:56:34,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:56:34,873 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:56:34,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:56:35,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:56:35,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:56:35,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-27 00:56:35,078 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:56:35,078 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 00:56:35,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 00:56:35,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-10-27 00:56:35,079 INFO L87 Difference]: Start difference. First operand 271 states and 327 transitions. Second operand 10 states. [2018-10-27 00:56:36,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:56:36,012 INFO L93 Difference]: Finished difference Result 964 states and 1256 transitions. [2018-10-27 00:56:36,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-27 00:56:36,013 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2018-10-27 00:56:36,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:56:36,019 INFO L225 Difference]: With dead ends: 964 [2018-10-27 00:56:36,019 INFO L226 Difference]: Without dead ends: 717 [2018-10-27 00:56:36,021 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2018-10-27 00:56:36,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-10-27 00:56:36,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 705. [2018-10-27 00:56:36,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2018-10-27 00:56:36,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 885 transitions. [2018-10-27 00:56:36,088 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 885 transitions. Word has length 58 [2018-10-27 00:56:36,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:56:36,088 INFO L481 AbstractCegarLoop]: Abstraction has 705 states and 885 transitions. [2018-10-27 00:56:36,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 00:56:36,088 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 885 transitions. [2018-10-27 00:56:36,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-27 00:56:36,092 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:56:36,093 INFO L375 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, 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] [2018-10-27 00:56:36,093 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:56:36,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:56:36,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1679211182, now seen corresponding path program 1 times [2018-10-27 00:56:36,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:56:36,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:56:36,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:56:36,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:56:36,094 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:56:36,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:56:36,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:56:36,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:56:36,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 00:56:36,267 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:56:36,267 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 00:56:36,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 00:56:36,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 00:56:36,268 INFO L87 Difference]: Start difference. First operand 705 states and 885 transitions. Second operand 4 states. [2018-10-27 00:56:36,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:56:36,648 INFO L93 Difference]: Finished difference Result 1779 states and 2436 transitions. [2018-10-27 00:56:36,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 00:56:36,648 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-10-27 00:56:36,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:56:36,656 INFO L225 Difference]: With dead ends: 1779 [2018-10-27 00:56:36,657 INFO L226 Difference]: Without dead ends: 1098 [2018-10-27 00:56:36,659 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 00:56:36,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2018-10-27 00:56:36,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 954. [2018-10-27 00:56:36,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 954 states. [2018-10-27 00:56:36,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1205 transitions. [2018-10-27 00:56:36,727 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1205 transitions. Word has length 62 [2018-10-27 00:56:36,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:56:36,728 INFO L481 AbstractCegarLoop]: Abstraction has 954 states and 1205 transitions. [2018-10-27 00:56:36,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 00:56:36,728 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1205 transitions. [2018-10-27 00:56:36,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-27 00:56:36,731 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:56:36,731 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:56:36,731 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:56:36,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:56:36,731 INFO L82 PathProgramCache]: Analyzing trace with hash 848011065, now seen corresponding path program 1 times [2018-10-27 00:56:36,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:56:36,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:56:36,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:56:36,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:56:36,733 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:56:36,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:56:37,343 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-27 00:56:37,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:56:37,343 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 00:56:37,344 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 91 with the following transitions: [2018-10-27 00:56:37,346 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [5], [8], [10], [13], [19], [21], [22], [26], [29], [42], [44], [45], [46], [47], [59], [90], [94], [100], [104], [108], [111], [116], [122], [124], [127], [129], [132], [145], [146], [149], [150], [201], [208], [211], [222], [244], [248], [249], [252], [253], [254], [255], [256], [258], [259], [260], [261], [262], [263], [264], [265], [266], [272], [282], [283], [286], [287], [288], [289], [302], [303], [304], [305], [306] [2018-10-27 00:56:37,401 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 00:56:37,402 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 00:56:48,432 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 00:56:48,433 INFO L272 AbstractInterpreter]: Visited 60 different actions 124 times. Merged at 14 different actions 21 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 133 variables. [2018-10-27 00:56:48,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:56:48,450 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 00:56:59,493 INFO L227 lantSequenceWeakener]: Weakened 81 states. On average, predicates are now at 97.6% of their original sizes. [2018-10-27 00:56:59,495 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 00:57:00,684 INFO L415 sIntCurrentIteration]: We unified 89 AI predicates to 89 [2018-10-27 00:57:00,684 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 00:57:00,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 00:57:00,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [29] imperfect sequences [7] total 34 [2018-10-27 00:57:00,685 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:57:00,685 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-27 00:57:00,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-27 00:57:00,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2018-10-27 00:57:00,686 INFO L87 Difference]: Start difference. First operand 954 states and 1205 transitions. Second operand 29 states. [2018-10-27 00:57:32,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:57:32,165 INFO L93 Difference]: Finished difference Result 2033 states and 2613 transitions. [2018-10-27 00:57:32,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-27 00:57:32,166 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 90 [2018-10-27 00:57:32,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:57:32,172 INFO L225 Difference]: With dead ends: 2033 [2018-10-27 00:57:32,172 INFO L226 Difference]: Without dead ends: 1288 [2018-10-27 00:57:32,176 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 112 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 808 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=367, Invalid=2285, Unknown=0, NotChecked=0, Total=2652 [2018-10-27 00:57:32,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2018-10-27 00:57:32,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 1228. [2018-10-27 00:57:32,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1228 states. [2018-10-27 00:57:32,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 1527 transitions. [2018-10-27 00:57:32,259 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 1527 transitions. Word has length 90 [2018-10-27 00:57:32,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:57:32,260 INFO L481 AbstractCegarLoop]: Abstraction has 1228 states and 1527 transitions. [2018-10-27 00:57:32,260 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-27 00:57:32,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 1527 transitions. [2018-10-27 00:57:32,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-27 00:57:32,264 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:57:32,264 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:57:32,265 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:57:32,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:57:32,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1149456578, now seen corresponding path program 1 times [2018-10-27 00:57:32,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:57:32,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:57:32,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:57:32,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:57:32,266 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:57:32,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:57:32,526 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 00:57:32,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:57:32,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 00:57:32,526 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:57:32,527 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 00:57:32,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 00:57:32,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 00:57:32,527 INFO L87 Difference]: Start difference. First operand 1228 states and 1527 transitions. Second operand 5 states. [2018-10-27 00:57:32,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:57:32,620 INFO L93 Difference]: Finished difference Result 2069 states and 2654 transitions. [2018-10-27 00:57:32,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 00:57:32,622 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 118 [2018-10-27 00:57:32,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:57:32,629 INFO L225 Difference]: With dead ends: 2069 [2018-10-27 00:57:32,629 INFO L226 Difference]: Without dead ends: 1260 [2018-10-27 00:57:32,632 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 00:57:32,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2018-10-27 00:57:32,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 1242. [2018-10-27 00:57:32,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1242 states. [2018-10-27 00:57:32,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1242 states and 1539 transitions. [2018-10-27 00:57:32,712 INFO L78 Accepts]: Start accepts. Automaton has 1242 states and 1539 transitions. Word has length 118 [2018-10-27 00:57:32,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:57:32,712 INFO L481 AbstractCegarLoop]: Abstraction has 1242 states and 1539 transitions. [2018-10-27 00:57:32,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 00:57:32,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 1539 transitions. [2018-10-27 00:57:32,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-27 00:57:32,718 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:57:32,719 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:57:32,719 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:57:32,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:57:32,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1095063680, now seen corresponding path program 1 times [2018-10-27 00:57:32,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:57:32,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:57:32,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:57:32,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:57:32,722 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:57:32,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:57:32,996 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-27 00:57:32,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:57:32,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 00:57:32,997 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:57:32,997 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 00:57:32,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 00:57:32,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 00:57:32,997 INFO L87 Difference]: Start difference. First operand 1242 states and 1539 transitions. Second operand 5 states. [2018-10-27 00:57:33,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:57:33,979 INFO L93 Difference]: Finished difference Result 2572 states and 3336 transitions. [2018-10-27 00:57:33,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 00:57:33,980 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 118 [2018-10-27 00:57:33,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:57:33,987 INFO L225 Difference]: With dead ends: 2572 [2018-10-27 00:57:33,987 INFO L226 Difference]: Without dead ends: 1869 [2018-10-27 00:57:33,990 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-27 00:57:33,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1869 states. [2018-10-27 00:57:34,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1869 to 1697. [2018-10-27 00:57:34,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1697 states. [2018-10-27 00:57:34,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1697 states to 1697 states and 2107 transitions. [2018-10-27 00:57:34,108 INFO L78 Accepts]: Start accepts. Automaton has 1697 states and 2107 transitions. Word has length 118 [2018-10-27 00:57:34,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:57:34,108 INFO L481 AbstractCegarLoop]: Abstraction has 1697 states and 2107 transitions. [2018-10-27 00:57:34,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 00:57:34,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1697 states and 2107 transitions. [2018-10-27 00:57:34,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-27 00:57:34,114 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:57:34,115 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:57:34,115 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:57:34,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:57:34,115 INFO L82 PathProgramCache]: Analyzing trace with hash 638116196, now seen corresponding path program 1 times [2018-10-27 00:57:34,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:57:34,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:57:34,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:57:34,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:57:34,116 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:57:34,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:57:34,581 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 00:57:34,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:57:34,581 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 00:57:34,582 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 131 with the following transitions: [2018-10-27 00:57:34,583 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [5], [8], [10], [13], [19], [21], [22], [26], [29], [46], [47], [48], [50], [53], [57], [58], [59], [62], [63], [64], [67], [69], [70], [73], [75], [78], [85], [88], [90], [94], [100], [104], [108], [114], [116], [122], [124], [127], [143], [144], [145], [146], [147], [148], [149], [150], [151], [153], [156], [160], [161], [198], [201], [205], [211], [214], [218], [222], [223], [226], [228], [231], [241], [249], [252], [253], [254], [255], [256], [258], [259], [260], [261], [262], [263], [264], [265], [266], [270], [271], [272], [274], [275], [276], [277], [280], [281], [288], [289], [292], [293], [298], [299], [300], [301], [302], [303], [304], [305], [306], [308], [309], [310], [311] [2018-10-27 00:57:34,588 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 00:57:34,598 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 00:57:39,314 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 00:57:39,314 INFO L272 AbstractInterpreter]: Visited 58 different actions 58 times. Never merged. Never widened. Never found a fixpoint. Largest state had 132 variables. [2018-10-27 00:57:39,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:57:39,326 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 00:57:43,596 INFO L227 lantSequenceWeakener]: Weakened 70 states. On average, predicates are now at 97.23% of their original sizes. [2018-10-27 00:57:43,596 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 00:57:43,944 INFO L415 sIntCurrentIteration]: We unified 129 AI predicates to 129 [2018-10-27 00:57:43,944 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 00:57:43,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 00:57:43,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [6] total 26 [2018-10-27 00:57:43,944 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:57:43,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-27 00:57:43,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-27 00:57:43,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-10-27 00:57:43,945 INFO L87 Difference]: Start difference. First operand 1697 states and 2107 transitions. Second operand 22 states. [2018-10-27 00:58:06,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:58:06,669 INFO L93 Difference]: Finished difference Result 3124 states and 3883 transitions. [2018-10-27 00:58:06,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-27 00:58:06,669 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 130 [2018-10-27 00:58:06,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:58:06,673 INFO L225 Difference]: With dead ends: 3124 [2018-10-27 00:58:06,673 INFO L226 Difference]: Without dead ends: 1451 [2018-10-27 00:58:06,678 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 138 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=157, Invalid=773, Unknown=0, NotChecked=0, Total=930 [2018-10-27 00:58:06,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2018-10-27 00:58:06,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1436. [2018-10-27 00:58:06,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1436 states. [2018-10-27 00:58:06,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 1770 transitions. [2018-10-27 00:58:06,767 INFO L78 Accepts]: Start accepts. Automaton has 1436 states and 1770 transitions. Word has length 130 [2018-10-27 00:58:06,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:58:06,767 INFO L481 AbstractCegarLoop]: Abstraction has 1436 states and 1770 transitions. [2018-10-27 00:58:06,767 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-27 00:58:06,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 1770 transitions. [2018-10-27 00:58:06,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-27 00:58:06,772 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:58:06,772 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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] [2018-10-27 00:58:06,772 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:58:06,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:58:06,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1444349319, now seen corresponding path program 1 times [2018-10-27 00:58:06,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:58:06,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:58:06,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:58:06,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:58:06,774 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:58:06,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:58:06,988 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-27 00:58:06,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:58:06,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 00:58:06,989 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:58:06,989 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 00:58:06,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 00:58:06,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-27 00:58:06,990 INFO L87 Difference]: Start difference. First operand 1436 states and 1770 transitions. Second operand 6 states. [2018-10-27 00:58:07,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:58:07,447 INFO L93 Difference]: Finished difference Result 2457 states and 3079 transitions. [2018-10-27 00:58:07,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 00:58:07,448 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2018-10-27 00:58:07,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:58:07,455 INFO L225 Difference]: With dead ends: 2457 [2018-10-27 00:58:07,455 INFO L226 Difference]: Without dead ends: 1481 [2018-10-27 00:58:07,457 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-27 00:58:07,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2018-10-27 00:58:07,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1481. [2018-10-27 00:58:07,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2018-10-27 00:58:07,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 1823 transitions. [2018-10-27 00:58:07,544 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 1823 transitions. Word has length 134 [2018-10-27 00:58:07,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:58:07,545 INFO L481 AbstractCegarLoop]: Abstraction has 1481 states and 1823 transitions. [2018-10-27 00:58:07,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 00:58:07,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 1823 transitions. [2018-10-27 00:58:07,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-27 00:58:07,549 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:58:07,550 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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] [2018-10-27 00:58:07,550 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:58:07,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:58:07,550 INFO L82 PathProgramCache]: Analyzing trace with hash 934876229, now seen corresponding path program 1 times [2018-10-27 00:58:07,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:58:07,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:58:07,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:58:07,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:58:07,551 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:58:07,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:58:07,962 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-27 00:58:07,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:58:07,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 00:58:07,963 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:58:07,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 00:58:07,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 00:58:07,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-27 00:58:07,963 INFO L87 Difference]: Start difference. First operand 1481 states and 1823 transitions. Second operand 6 states. [2018-10-27 00:58:09,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:58:09,335 INFO L93 Difference]: Finished difference Result 1502 states and 1849 transitions. [2018-10-27 00:58:09,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 00:58:09,336 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2018-10-27 00:58:09,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:58:09,341 INFO L225 Difference]: With dead ends: 1502 [2018-10-27 00:58:09,341 INFO L226 Difference]: Without dead ends: 1499 [2018-10-27 00:58:09,343 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-27 00:58:09,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states. [2018-10-27 00:58:09,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1481. [2018-10-27 00:58:09,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2018-10-27 00:58:09,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 1818 transitions. [2018-10-27 00:58:09,425 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 1818 transitions. Word has length 134 [2018-10-27 00:58:09,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:58:09,426 INFO L481 AbstractCegarLoop]: Abstraction has 1481 states and 1818 transitions. [2018-10-27 00:58:09,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 00:58:09,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 1818 transitions. [2018-10-27 00:58:09,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-27 00:58:09,431 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:58:09,431 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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] [2018-10-27 00:58:09,431 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:58:09,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:58:09,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1431645511, now seen corresponding path program 1 times [2018-10-27 00:58:09,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:58:09,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:58:09,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:58:09,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:58:09,434 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:58:09,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:58:09,784 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-27 00:58:09,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:58:09,785 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 00:58:09,785 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 139 with the following transitions: [2018-10-27 00:58:09,785 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [5], [8], [10], [13], [19], [21], [22], [26], [29], [46], [47], [48], [50], [53], [57], [58], [59], [64], [68], [69], [70], [73], [75], [81], [85], [88], [89], [90], [94], [100], [104], [108], [111], [114], [116], [122], [124], [127], [143], [144], [145], [146], [147], [148], [149], [150], [151], [153], [158], [160], [161], [198], [201], [205], [211], [214], [218], [222], [223], [226], [228], [231], [238], [241], [244], [248], [249], [252], [253], [254], [255], [256], [258], [259], [260], [261], [262], [263], [264], [265], [266], [270], [271], [272], [274], [275], [278], [279], [280], [281], [282], [283], [288], [289], [292], [293], [298], [299], [300], [301], [302], [303], [304], [305], [306], [308], [309], [310], [311], [314], [315] [2018-10-27 00:58:09,790 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 00:58:09,790 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 00:58:43,927 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 00:58:43,927 INFO L272 AbstractInterpreter]: Visited 97 different actions 330 times. Merged at 17 different actions 31 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 132 variables. [2018-10-27 00:58:43,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:58:43,938 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 00:59:02,896 INFO L227 lantSequenceWeakener]: Weakened 116 states. On average, predicates are now at 97.39% of their original sizes. [2018-10-27 00:59:02,897 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 00:59:04,128 INFO L415 sIntCurrentIteration]: We unified 137 AI predicates to 137 [2018-10-27 00:59:04,128 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 00:59:04,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 00:59:04,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [42] imperfect sequences [10] total 50 [2018-10-27 00:59:04,128 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:59:04,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-27 00:59:04,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-27 00:59:04,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1520, Unknown=0, NotChecked=0, Total=1722 [2018-10-27 00:59:04,129 INFO L87 Difference]: Start difference. First operand 1481 states and 1818 transitions. Second operand 42 states. [2018-10-27 00:59:51,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:59:51,519 INFO L93 Difference]: Finished difference Result 2906 states and 3676 transitions. [2018-10-27 00:59:51,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-27 00:59:51,519 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 138 [2018-10-27 00:59:51,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:59:51,526 INFO L225 Difference]: With dead ends: 2906 [2018-10-27 00:59:51,526 INFO L226 Difference]: Without dead ends: 2023 [2018-10-27 00:59:51,529 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 163 GetRequests, 88 SyntacticMatches, 9 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1515 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=519, Invalid=4037, Unknown=0, NotChecked=0, Total=4556 [2018-10-27 00:59:51,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2023 states. [2018-10-27 00:59:51,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2023 to 1921. [2018-10-27 00:59:51,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1921 states. [2018-10-27 00:59:51,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1921 states to 1921 states and 2345 transitions. [2018-10-27 00:59:51,663 INFO L78 Accepts]: Start accepts. Automaton has 1921 states and 2345 transitions. Word has length 138 [2018-10-27 00:59:51,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:59:51,664 INFO L481 AbstractCegarLoop]: Abstraction has 1921 states and 2345 transitions. [2018-10-27 00:59:51,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-27 00:59:51,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1921 states and 2345 transitions. [2018-10-27 00:59:51,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-27 00:59:51,668 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:59:51,668 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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] [2018-10-27 00:59:51,669 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:59:51,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:59:51,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1706405125, now seen corresponding path program 1 times [2018-10-27 00:59:51,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:59:51,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:59:51,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:59:51,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:59:51,670 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:59:51,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:59:51,803 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-27 00:59:51,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:59:51,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-27 00:59:51,804 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:59:51,804 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 00:59:51,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 00:59:51,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-27 00:59:51,805 INFO L87 Difference]: Start difference. First operand 1921 states and 2345 transitions. Second operand 9 states. [2018-10-27 00:59:52,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:59:52,093 INFO L93 Difference]: Finished difference Result 3414 states and 4250 transitions. [2018-10-27 00:59:52,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 00:59:52,097 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 138 [2018-10-27 00:59:52,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:59:52,101 INFO L225 Difference]: With dead ends: 3414 [2018-10-27 00:59:52,102 INFO L226 Difference]: Without dead ends: 1893 [2018-10-27 00:59:52,106 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-27 00:59:52,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1893 states. [2018-10-27 00:59:52,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1893 to 1893. [2018-10-27 00:59:52,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1893 states. [2018-10-27 00:59:52,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 2309 transitions. [2018-10-27 00:59:52,240 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 2309 transitions. Word has length 138 [2018-10-27 00:59:52,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:59:52,240 INFO L481 AbstractCegarLoop]: Abstraction has 1893 states and 2309 transitions. [2018-10-27 00:59:52,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 00:59:52,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 2309 transitions. [2018-10-27 00:59:52,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-27 00:59:52,245 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:59:52,245 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 1] [2018-10-27 00:59:52,245 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:59:52,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:59:52,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1159951994, now seen corresponding path program 1 times [2018-10-27 00:59:52,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:59:52,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:59:52,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:59:52,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:59:52,247 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:59:52,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:59:52,378 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-27 00:59:52,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:59:52,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 00:59:52,379 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:59:52,379 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 00:59:52,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 00:59:52,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 00:59:52,380 INFO L87 Difference]: Start difference. First operand 1893 states and 2309 transitions. Second operand 4 states. [2018-10-27 00:59:52,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:59:52,526 INFO L93 Difference]: Finished difference Result 2132 states and 2608 transitions. [2018-10-27 00:59:52,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 00:59:52,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2018-10-27 00:59:52,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:59:52,534 INFO L225 Difference]: With dead ends: 2132 [2018-10-27 00:59:52,535 INFO L226 Difference]: Without dead ends: 694 [2018-10-27 00:59:52,539 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 00:59:52,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2018-10-27 00:59:52,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 672. [2018-10-27 00:59:52,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 672 states. [2018-10-27 00:59:52,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 780 transitions. [2018-10-27 00:59:52,603 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 780 transitions. Word has length 144 [2018-10-27 00:59:52,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:59:52,603 INFO L481 AbstractCegarLoop]: Abstraction has 672 states and 780 transitions. [2018-10-27 00:59:52,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 00:59:52,604 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 780 transitions. [2018-10-27 00:59:52,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-27 00:59:52,605 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:59:52,605 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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] [2018-10-27 00:59:52,606 INFO L424 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:59:52,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:59:52,608 INFO L82 PathProgramCache]: Analyzing trace with hash -932970672, now seen corresponding path program 1 times [2018-10-27 00:59:52,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:59:52,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:59:52,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:59:52,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:59:52,609 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:59:52,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:59:52,873 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-10-27 00:59:52,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:59:52,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 00:59:52,874 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:59:52,874 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 00:59:52,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 00:59:52,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-27 00:59:52,874 INFO L87 Difference]: Start difference. First operand 672 states and 780 transitions. Second operand 6 states. [2018-10-27 00:59:52,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:59:52,919 INFO L93 Difference]: Finished difference Result 1274 states and 1506 transitions. [2018-10-27 00:59:52,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 00:59:52,920 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 186 [2018-10-27 00:59:52,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:59:52,922 INFO L225 Difference]: With dead ends: 1274 [2018-10-27 00:59:52,922 INFO L226 Difference]: Without dead ends: 682 [2018-10-27 00:59:52,924 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-27 00:59:52,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2018-10-27 00:59:52,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 682. [2018-10-27 00:59:52,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2018-10-27 00:59:52,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 791 transitions. [2018-10-27 00:59:52,980 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 791 transitions. Word has length 186 [2018-10-27 00:59:52,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:59:52,981 INFO L481 AbstractCegarLoop]: Abstraction has 682 states and 791 transitions. [2018-10-27 00:59:52,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 00:59:52,981 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 791 transitions. [2018-10-27 00:59:52,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-27 00:59:52,985 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:59:52,985 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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] [2018-10-27 00:59:52,985 INFO L424 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:59:52,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:59:52,986 INFO L82 PathProgramCache]: Analyzing trace with hash -910338418, now seen corresponding path program 1 times [2018-10-27 00:59:52,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:59:52,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:59:52,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:59:52,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:59:52,989 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:59:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:59:53,095 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-10-27 00:59:53,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:59:53,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-27 00:59:53,095 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:59:53,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 00:59:53,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 00:59:53,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-27 00:59:53,096 INFO L87 Difference]: Start difference. First operand 682 states and 791 transitions. Second operand 8 states. [2018-10-27 00:59:53,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:59:53,194 INFO L93 Difference]: Finished difference Result 865 states and 995 transitions. [2018-10-27 00:59:53,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 00:59:53,202 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 186 [2018-10-27 00:59:53,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:59:53,203 INFO L225 Difference]: With dead ends: 865 [2018-10-27 00:59:53,203 INFO L226 Difference]: Without dead ends: 0 [2018-10-27 00:59:53,205 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-27 00:59:53,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-27 00:59:53,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-27 00:59:53,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-27 00:59:53,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 00:59:53,206 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 186 [2018-10-27 00:59:53,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:59:53,208 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 00:59:53,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 00:59:53,209 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-27 00:59:53,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-27 00:59:53,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-27 00:59:53,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:59:53,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:59:53,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:59:53,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:59:53,915 WARN L179 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 334 DAG size of output: 302 [2018-10-27 00:59:54,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:59:54,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:59:54,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:59:54,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:59:54,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:59:54,749 WARN L179 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 349 DAG size of output: 312 [2018-10-27 00:59:55,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:59:55,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:59:55,433 WARN L179 SmtUtils]: Spent 669.00 ms on a formula simplification. DAG size of input: 359 DAG size of output: 315 [2018-10-27 00:59:55,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:59:55,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:59:55,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:59:55,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:59:55,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:59:55,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:59:56,102 WARN L179 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 347 DAG size of output: 296 [2018-10-27 00:59:56,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:59:56,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:59:56,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:59:56,456 WARN L179 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 332 DAG size of output: 301 [2018-10-27 00:59:56,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:59:56,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:59:56,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:59:56,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:59:56,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:59:56,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:59:56,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:59:59,258 WARN L179 SmtUtils]: Spent 2.61 s on a formula simplification. DAG size of input: 161 DAG size of output: 43 [2018-10-27 00:59:59,511 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 39 [2018-10-27 00:59:59,846 WARN L179 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 1 [2018-10-27 00:59:59,985 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 13 [2018-10-27 01:00:00,092 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 31 [2018-10-27 01:00:00,289 WARN L179 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 42 [2018-10-27 01:00:01,042 WARN L179 SmtUtils]: Spent 750.00 ms on a formula simplification. DAG size of input: 363 DAG size of output: 66 [2018-10-27 01:00:01,152 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 1 [2018-10-27 01:00:01,321 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 36 [2018-10-27 01:00:01,444 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 37 [2018-10-27 01:00:02,174 WARN L179 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 61 [2018-10-27 01:00:02,439 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 41 [2018-10-27 01:00:02,607 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 1 [2018-10-27 01:00:03,497 WARN L179 SmtUtils]: Spent 888.00 ms on a formula simplification. DAG size of input: 370 DAG size of output: 77 [2018-10-27 01:00:04,564 WARN L179 SmtUtils]: Spent 962.00 ms on a formula simplification. DAG size of input: 377 DAG size of output: 70 [2018-10-27 01:00:04,789 WARN L179 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 46 [2018-10-27 01:00:04,949 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 44 [2018-10-27 01:00:05,228 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 35 [2018-10-27 01:00:05,588 WARN L179 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 62 [2018-10-27 01:00:06,010 WARN L179 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 25 [2018-10-27 01:00:06,213 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 40 [2018-10-27 01:00:06,438 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 35 [2018-10-27 01:00:07,044 WARN L179 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 356 DAG size of output: 31 [2018-10-27 01:00:07,853 WARN L179 SmtUtils]: Spent 806.00 ms on a formula simplification. DAG size of input: 362 DAG size of output: 56 [2018-10-27 01:00:08,062 WARN L179 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 51 [2018-10-27 01:00:08,410 WARN L179 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 43 [2018-10-27 01:00:08,823 WARN L179 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 259 DAG size of output: 29 [2018-10-27 01:00:09,181 WARN L179 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 62 [2018-10-27 01:00:09,245 INFO L428 ceAbstractionStarter]: At program point select_helpersFINAL(lines 299 305) the Hoare annotation is: true [2018-10-27 01:00:09,245 INFO L425 ceAbstractionStarter]: For program point select_helpersEXIT(lines 299 305) no Hoare annotation was computed. [2018-10-27 01:00:09,245 INFO L425 ceAbstractionStarter]: For program point valid_productEXIT(lines 306 314) no Hoare annotation was computed. [2018-10-27 01:00:09,246 INFO L428 ceAbstractionStarter]: At program point valid_productENTRY(lines 306 314) the Hoare annotation is: true [2018-10-27 01:00:09,246 INFO L425 ceAbstractionStarter]: For program point valid_productFINAL(lines 306 314) no Hoare annotation was computed. [2018-10-27 01:00:09,246 INFO L421 ceAbstractionStarter]: At program point L161(line 161) the Hoare annotation is: (let ((.cse0 (* 2 ~pumpRunning~0))) (and (or (< (+ ~systemActive~0 ~waterLevel~0) 3) (< 3 (+ ~pumpRunning~0 ~waterLevel~0)) (< .cse0 2) (< 2 (+ ~pumpRunning~0 ~systemActive~0))) (or (< (+ ~pumpRunning~0 1) ~systemActive~0) (< (* 2 ~systemActive~0) 2) (not (= ~waterLevel~0 1)) (< 0 .cse0)) (or (not (= 0 ~pumpRunning~0)) (not (= ~systemActive~0 0))))) [2018-10-27 01:00:09,246 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 165) no Hoare annotation was computed. [2018-10-27 01:00:09,246 INFO L428 ceAbstractionStarter]: At program point __utac_acc__Specification4_spec__1ENTRY(lines 147 171) the Hoare annotation is: true [2018-10-27 01:00:09,246 INFO L421 ceAbstractionStarter]: At program point L157(line 157) the Hoare annotation is: (let ((.cse1 (* 2 ~pumpRunning~0))) (let ((.cse0 (not (= ~systemActive~0 0))) (.cse2 (not (= ~waterLevel~0 1))) (.cse3 (< 0 .cse1))) (and (or .cse0 (< .cse1 0) .cse2 .cse3) (or (not (= 0 ~pumpRunning~0)) .cse0 (< ~waterLevel~0 2)) (or (< (+ ~systemActive~0 ~waterLevel~0) 3) (< 3 (+ ~pumpRunning~0 ~waterLevel~0)) (< .cse1 2) (< 2 (+ ~pumpRunning~0 ~systemActive~0))) (or (< (+ ~pumpRunning~0 1) ~systemActive~0) (< (* 2 ~systemActive~0) 2) .cse2 .cse3)))) [2018-10-27 01:00:09,246 INFO L425 ceAbstractionStarter]: For program point L157-1(line 157) no Hoare annotation was computed. [2018-10-27 01:00:09,246 INFO L425 ceAbstractionStarter]: For program point L155(lines 155 168) no Hoare annotation was computed. [2018-10-27 01:00:09,246 INFO L425 ceAbstractionStarter]: For program point L155-1(lines 147 171) no Hoare annotation was computed. [2018-10-27 01:00:09,246 INFO L428 ceAbstractionStarter]: At program point L153(line 153) the Hoare annotation is: true [2018-10-27 01:00:09,246 INFO L425 ceAbstractionStarter]: For program point L153-1(line 153) no Hoare annotation was computed. [2018-10-27 01:00:09,247 INFO L425 ceAbstractionStarter]: For program point __utac_acc__Specification4_spec__1EXIT(lines 147 171) no Hoare annotation was computed. [2018-10-27 01:00:09,247 INFO L425 ceAbstractionStarter]: For program point L130-1(lines 130 137) no Hoare annotation was computed. [2018-10-27 01:00:09,247 INFO L425 ceAbstractionStarter]: For program point L128(line 128) no Hoare annotation was computed. [2018-10-27 01:00:09,247 INFO L421 ceAbstractionStarter]: At program point L127(line 127) the Hoare annotation is: (or (and (<= ~systemActive~0 ~waterLevel~0) (<= ~waterLevel~0 (+ ~pumpRunning~0 1)) (<= 1 (+ ~pumpRunning~0 ~waterLevel~0)) (<= ~waterLevel~0 ~systemActive~0) (= ~pumpRunning~0 0)) (< (+ |old(~pumpRunning~0)| 1) |old(~systemActive~0)|) (< (* 2 |old(~systemActive~0)|) 2) (not (= |old(~waterLevel~0)| 1)) (< 0 (* 2 |old(~pumpRunning~0)|))) [2018-10-27 01:00:09,247 INFO L421 ceAbstractionStarter]: At program point L126(line 126) the Hoare annotation is: (or (and (<= ~systemActive~0 ~waterLevel~0) (<= ~waterLevel~0 (+ ~pumpRunning~0 1)) (<= 1 (+ ~pumpRunning~0 ~waterLevel~0)) (<= ~waterLevel~0 ~systemActive~0) (= ~pumpRunning~0 0)) (< (+ |old(~pumpRunning~0)| 1) |old(~systemActive~0)|) (< (* 2 |old(~systemActive~0)|) 2) (not (= |old(~waterLevel~0)| 1)) (< 0 (* 2 |old(~pumpRunning~0)|))) [2018-10-27 01:00:09,247 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 120 142) the Hoare annotation is: (or (and (<= ~systemActive~0 ~waterLevel~0) (<= ~waterLevel~0 (+ ~pumpRunning~0 1)) (<= 1 (+ ~pumpRunning~0 ~waterLevel~0)) (<= ~waterLevel~0 ~systemActive~0) (= ~pumpRunning~0 0)) (< (+ |old(~pumpRunning~0)| 1) |old(~systemActive~0)|) (< (* 2 |old(~systemActive~0)|) 2) (not (= |old(~waterLevel~0)| 1)) (< 0 (* 2 |old(~pumpRunning~0)|))) [2018-10-27 01:00:09,247 INFO L421 ceAbstractionStarter]: At program point L126-1(line 126) the Hoare annotation is: (or (and (<= ~systemActive~0 ~waterLevel~0) (<= ~waterLevel~0 (+ ~pumpRunning~0 1)) (<= 1 (+ ~pumpRunning~0 ~waterLevel~0)) (<= ~waterLevel~0 ~systemActive~0) (= ~pumpRunning~0 0)) (< (+ |old(~pumpRunning~0)| 1) |old(~systemActive~0)|) (< (* 2 |old(~systemActive~0)|) 2) (not (= |old(~waterLevel~0)| 1)) (< 0 (* 2 |old(~pumpRunning~0)|))) [2018-10-27 01:00:09,247 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 120 142) no Hoare annotation was computed. [2018-10-27 01:00:09,247 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 120 142) no Hoare annotation was computed. [2018-10-27 01:00:09,247 INFO L421 ceAbstractionStarter]: At program point L132(line 132) the Hoare annotation is: (or (< (+ |old(~pumpRunning~0)| 1) |old(~systemActive~0)|) (< (* 2 |old(~systemActive~0)|) 2) (and (<= ~systemActive~0 main_~tmp~0) (<= main_~tmp~0 (+ ~pumpRunning~0 1)) (<= 1 (+ ~pumpRunning~0 ~waterLevel~0)) (<= ~waterLevel~0 ~systemActive~0) (= ~pumpRunning~0 0)) (not (= |old(~waterLevel~0)| 1)) (< 0 (* 2 |old(~pumpRunning~0)|))) [2018-10-27 01:00:09,248 INFO L421 ceAbstractionStarter]: At program point L132-1(line 132) the Hoare annotation is: (or (< (+ |old(~pumpRunning~0)| 1) |old(~systemActive~0)|) (< (* 2 |old(~systemActive~0)|) 2) (and (<= ~systemActive~0 main_~tmp~0) (<= main_~tmp~0 (+ ~pumpRunning~0 1)) (<= 1 (+ ~pumpRunning~0 ~waterLevel~0)) (<= ~waterLevel~0 ~systemActive~0) (= ~pumpRunning~0 0)) (not (= |old(~waterLevel~0)| 1)) (< 0 (* 2 |old(~pumpRunning~0)|))) [2018-10-27 01:00:09,248 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 137) no Hoare annotation was computed. [2018-10-27 01:00:09,248 INFO L425 ceAbstractionStarter]: For program point stopSystemEXIT(lines 515 529) no Hoare annotation was computed. [2018-10-27 01:00:09,248 INFO L421 ceAbstractionStarter]: At program point L521(line 521) the Hoare annotation is: (let ((.cse0 (= |old(~pumpRunning~0)| ~pumpRunning~0))) (and (or (and (not (= ~systemActive~0 0)) .cse0) (or (= |old(~systemActive~0)| 0) (< ~waterLevel~0 2))) (not (= 0 |old(~pumpRunning~0)|)) (or (and (= ~systemActive~0 1) .cse0) (not (= |old(~systemActive~0)| 1))))) [2018-10-27 01:00:09,248 INFO L425 ceAbstractionStarter]: For program point L519(lines 519 525) no Hoare annotation was computed. [2018-10-27 01:00:09,248 INFO L421 ceAbstractionStarter]: At program point stopSystemENTRY(lines 515 529) the Hoare annotation is: (let ((.cse2 (= ~systemActive~0 0)) (.cse3 (= |old(~pumpRunning~0)| ~pumpRunning~0))) (let ((.cse0 (and (not .cse2) .cse3)) (.cse1 (= |old(~systemActive~0)| 0)) (.cse4 (not (= 0 |old(~pumpRunning~0)|)))) (and (or .cse0 (or .cse1 (< ~waterLevel~0 2))) (or (and .cse2 .cse3) (not .cse1) .cse4) (or .cse0 .cse1 .cse4) (or (and (= ~systemActive~0 1) .cse3) (not (= |old(~systemActive~0)| 1)))))) [2018-10-27 01:00:09,248 INFO L425 ceAbstractionStarter]: For program point stopSystemFINAL(lines 515 529) no Hoare annotation was computed. [2018-10-27 01:00:09,248 INFO L425 ceAbstractionStarter]: For program point isPumpRunningEXIT(lines 432 440) no Hoare annotation was computed. [2018-10-27 01:00:09,248 INFO L428 ceAbstractionStarter]: At program point isPumpRunningENTRY(lines 432 440) the Hoare annotation is: true [2018-10-27 01:00:09,248 INFO L425 ceAbstractionStarter]: For program point isPumpRunningFINAL(lines 432 440) no Hoare annotation was computed. [2018-10-27 01:00:09,248 INFO L428 ceAbstractionStarter]: At program point isLowWaterLevelENTRY(lines 496 514) the Hoare annotation is: true [2018-10-27 01:00:09,248 INFO L425 ceAbstractionStarter]: For program point L505(lines 505 509) no Hoare annotation was computed. [2018-10-27 01:00:09,248 INFO L428 ceAbstractionStarter]: At program point L503(line 503) the Hoare annotation is: true [2018-10-27 01:00:09,249 INFO L425 ceAbstractionStarter]: For program point L505-2(lines 505 509) no Hoare annotation was computed. [2018-10-27 01:00:09,249 INFO L425 ceAbstractionStarter]: For program point L503-1(line 503) no Hoare annotation was computed. [2018-10-27 01:00:09,249 INFO L425 ceAbstractionStarter]: For program point isLowWaterLevelEXIT(lines 496 514) no Hoare annotation was computed. [2018-10-27 01:00:09,249 INFO L425 ceAbstractionStarter]: For program point isLowWaterLevelFINAL(lines 496 514) no Hoare annotation was computed. [2018-10-27 01:00:09,249 INFO L425 ceAbstractionStarter]: For program point select_featuresEXIT(lines 292 298) no Hoare annotation was computed. [2018-10-27 01:00:09,249 INFO L428 ceAbstractionStarter]: At program point select_featuresFINAL(lines 292 298) the Hoare annotation is: true [2018-10-27 01:00:09,249 INFO L421 ceAbstractionStarter]: At program point runTestENTRY(lines 107 116) the Hoare annotation is: (or (and (<= ~systemActive~0 ~waterLevel~0) (<= ~waterLevel~0 (+ ~pumpRunning~0 1)) (<= 1 (+ ~pumpRunning~0 ~waterLevel~0)) (<= ~waterLevel~0 ~systemActive~0) (= ~pumpRunning~0 0)) (< (+ |old(~pumpRunning~0)| 1) |old(~systemActive~0)|) (< (* 2 |old(~systemActive~0)|) 2) (not (= |old(~waterLevel~0)| 1)) (< 0 (* 2 |old(~pumpRunning~0)|))) [2018-10-27 01:00:09,249 INFO L425 ceAbstractionStarter]: For program point runTestEXIT(lines 107 116) no Hoare annotation was computed. [2018-10-27 01:00:09,249 INFO L425 ceAbstractionStarter]: For program point runTestFINAL(lines 107 116) no Hoare annotation was computed. [2018-10-27 01:00:09,249 INFO L421 ceAbstractionStarter]: At program point deactivatePumpENTRY(lines 413 420) the Hoare annotation is: (let ((.cse0 (= |old(~pumpRunning~0)| ~pumpRunning~0))) (and (or .cse0 (not (= ~systemActive~0 1))) (or .cse0 (or (= ~systemActive~0 0) (< ~waterLevel~0 2))))) [2018-10-27 01:00:09,249 INFO L425 ceAbstractionStarter]: For program point deactivatePumpEXIT(lines 413 420) no Hoare annotation was computed. [2018-10-27 01:00:09,249 INFO L425 ceAbstractionStarter]: For program point deactivatePumpFINAL(lines 413 420) no Hoare annotation was computed. [2018-10-27 01:00:09,249 INFO L425 ceAbstractionStarter]: For program point isHighWaterSensorDryEXIT(lines 257 270) no Hoare annotation was computed. [2018-10-27 01:00:09,250 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 267) no Hoare annotation was computed. [2018-10-27 01:00:09,250 INFO L428 ceAbstractionStarter]: At program point isHighWaterSensorDryENTRY(lines 257 270) the Hoare annotation is: true [2018-10-27 01:00:09,250 INFO L425 ceAbstractionStarter]: For program point isHighWaterSensorDryFINAL(lines 257 270) no Hoare annotation was computed. [2018-10-27 01:00:09,250 INFO L425 ceAbstractionStarter]: For program point L386-1(line 386) no Hoare annotation was computed. [2018-10-27 01:00:09,255 INFO L425 ceAbstractionStarter]: For program point L384(lines 384 401) no Hoare annotation was computed. [2018-10-27 01:00:09,255 INFO L425 ceAbstractionStarter]: For program point processEnvironmentEXIT(lines 380 404) no Hoare annotation was computed. [2018-10-27 01:00:09,256 INFO L421 ceAbstractionStarter]: At program point processEnvironmentENTRY(lines 380 404) the Hoare annotation is: (let ((.cse0 (= |old(~pumpRunning~0)| ~pumpRunning~0)) (.cse2 (< (* 2 ~systemActive~0) 2)) (.cse1 (< 0 (* 2 |old(~pumpRunning~0)|)))) (and (or .cse0 (or (or (< (+ ~systemActive~0 ~waterLevel~0) 3) (< ~waterLevel~0 (+ ~systemActive~0 1))) .cse1 (< (+ |old(~pumpRunning~0)| 2) ~waterLevel~0))) (or .cse0 .cse2 (< ~waterLevel~0 ~systemActive~0) (< |old(~pumpRunning~0)| ~waterLevel~0) (< 2 (+ |old(~pumpRunning~0)| ~systemActive~0))) (or (= ~pumpRunning~0 0) (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0) .cse2 (not (= ~waterLevel~0 1)) .cse1))) [2018-10-27 01:00:09,256 INFO L421 ceAbstractionStarter]: At program point L399(line 399) the Hoare annotation is: (let ((.cse1 (< (* 2 ~systemActive~0) 2)) (.cse0 (< 0 (* 2 |old(~pumpRunning~0)|)))) (and (or (= |old(~pumpRunning~0)| ~pumpRunning~0) (or (or (< (+ ~systemActive~0 ~waterLevel~0) 3) (< ~waterLevel~0 (+ ~systemActive~0 1))) .cse0 (< (+ |old(~pumpRunning~0)| 2) ~waterLevel~0))) (or .cse1 (< ~waterLevel~0 ~systemActive~0) (< |old(~pumpRunning~0)| ~waterLevel~0) (< 2 (+ |old(~pumpRunning~0)| ~systemActive~0))) (or (= ~pumpRunning~0 0) (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0) .cse1 (not (= ~waterLevel~0 1)) .cse0))) [2018-10-27 01:00:09,256 INFO L425 ceAbstractionStarter]: For program point L399-1(lines 380 404) no Hoare annotation was computed. [2018-10-27 01:00:09,256 INFO L421 ceAbstractionStarter]: At program point L394(line 394) the Hoare annotation is: (let ((.cse0 (< (* 2 ~systemActive~0) 2)) (.cse1 (< 0 (* 2 |old(~pumpRunning~0)|)))) (and (or .cse0 (< ~waterLevel~0 ~systemActive~0) (< |old(~pumpRunning~0)| ~waterLevel~0) (< 2 (+ |old(~pumpRunning~0)| ~systemActive~0))) (or (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0) .cse0 (not (= ~waterLevel~0 1)) .cse1) (or (or (< (+ ~systemActive~0 ~waterLevel~0) 3) (< ~waterLevel~0 (+ ~systemActive~0 1))) .cse1 (< (+ |old(~pumpRunning~0)| 2) ~waterLevel~0)))) [2018-10-27 01:00:09,256 INFO L421 ceAbstractionStarter]: At program point L390(line 390) the Hoare annotation is: (let ((.cse0 (< (* 2 ~systemActive~0) 2)) (.cse1 (< 0 (* 2 |old(~pumpRunning~0)|)))) (and (or .cse0 (< ~waterLevel~0 ~systemActive~0) (< |old(~pumpRunning~0)| ~waterLevel~0) (and (= processEnvironment_~tmp~3 1) (= |old(~pumpRunning~0)| ~pumpRunning~0)) (< 2 (+ |old(~pumpRunning~0)| ~systemActive~0))) (or (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0) .cse0 (not (= ~waterLevel~0 1)) .cse1) (or (or (< (+ ~systemActive~0 ~waterLevel~0) 3) (< ~waterLevel~0 (+ ~systemActive~0 1))) .cse1 (< (+ |old(~pumpRunning~0)| 2) ~waterLevel~0)))) [2018-10-27 01:00:09,256 INFO L425 ceAbstractionStarter]: For program point L388(lines 388 396) no Hoare annotation was computed. [2018-10-27 01:00:09,256 INFO L421 ceAbstractionStarter]: At program point L386(line 386) the Hoare annotation is: (let ((.cse1 (< 0 (* 2 |old(~pumpRunning~0)|))) (.cse0 (< (* 2 ~systemActive~0) 2))) (and (or (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0) .cse0 (not (= ~waterLevel~0 1)) .cse1) (or (or (< (+ ~systemActive~0 ~waterLevel~0) 3) (< ~waterLevel~0 (+ ~systemActive~0 1))) .cse1 (< (+ |old(~pumpRunning~0)| 2) ~waterLevel~0)) (or (= |old(~pumpRunning~0)| ~pumpRunning~0) .cse0 (< ~waterLevel~0 ~systemActive~0) (< |old(~pumpRunning~0)| ~waterLevel~0) (< 2 (+ |old(~pumpRunning~0)| ~systemActive~0))))) [2018-10-27 01:00:09,256 INFO L425 ceAbstractionStarter]: For program point processEnvironment__wrappee__baseEXIT(lines 346 352) no Hoare annotation was computed. [2018-10-27 01:00:09,257 INFO L428 ceAbstractionStarter]: At program point processEnvironment__wrappee__baseFINAL(lines 346 352) the Hoare annotation is: true [2018-10-27 01:00:09,257 INFO L421 ceAbstractionStarter]: At program point testENTRY(lines 531 596) the Hoare annotation is: (or (and (<= ~systemActive~0 ~waterLevel~0) (<= ~waterLevel~0 (+ ~pumpRunning~0 1)) (<= 1 (+ ~pumpRunning~0 ~waterLevel~0)) (<= ~waterLevel~0 ~systemActive~0) (= ~pumpRunning~0 0)) (< (+ |old(~pumpRunning~0)| 1) |old(~systemActive~0)|) (< (* 2 |old(~systemActive~0)|) 2) (not (= |old(~waterLevel~0)| 1)) (< 0 (* 2 |old(~pumpRunning~0)|))) [2018-10-27 01:00:09,257 INFO L425 ceAbstractionStarter]: For program point L543(lines 543 547) no Hoare annotation was computed. [2018-10-27 01:00:09,257 INFO L425 ceAbstractionStarter]: For program point L541-1(lines 541 588) no Hoare annotation was computed. [2018-10-27 01:00:09,257 INFO L425 ceAbstractionStarter]: For program point testFINAL(lines 531 596) no Hoare annotation was computed. [2018-10-27 01:00:09,257 INFO L421 ceAbstractionStarter]: At program point L589(lines 540 590) the Hoare annotation is: (or (< (+ |old(~pumpRunning~0)| 1) |old(~systemActive~0)|) (< (* 2 |old(~systemActive~0)|) 2) (not (= |old(~waterLevel~0)| 1)) (< 0 (* 2 |old(~pumpRunning~0)|))) [2018-10-27 01:00:09,257 INFO L421 ceAbstractionStarter]: At program point L579(line 579) the Hoare annotation is: (let ((.cse0 (= test_~splverifierCounter~0 0))) (or (and (= 0 ~pumpRunning~0) .cse0) (and (<= 2 ~waterLevel~0) (not (= ~systemActive~0 0)) .cse0) (< (+ |old(~pumpRunning~0)| 1) |old(~systemActive~0)|) (< (* 2 |old(~systemActive~0)|) 2) (and (= ~systemActive~0 1) .cse0) (not (= |old(~waterLevel~0)| 1)) (< 0 (* 2 |old(~pumpRunning~0)|)))) [2018-10-27 01:00:09,257 INFO L425 ceAbstractionStarter]: For program point L577(lines 577 583) no Hoare annotation was computed. [2018-10-27 01:00:09,257 INFO L421 ceAbstractionStarter]: At program point L577-1(lines 571 584) the Hoare annotation is: (let ((.cse1 (+ ~systemActive~0 2147483646)) (.cse7 (+ ~pumpRunning~0 1))) (let ((.cse5 (<= .cse7 ~waterLevel~0)) (.cse6 (= ~systemActive~0 1)) (.cse3 (<= 0 (* 2 ~pumpRunning~0))) (.cse4 (<= test_~tmp___2~0 .cse1)) (.cse0 (= test_~splverifierCounter~0 0))) (or (and (= ~systemActive~0 0) (= 0 ~pumpRunning~0) .cse0) (let ((.cse2 (+ ~pumpRunning~0 ~waterLevel~0))) (and (and (<= test_~tmp___0~3 .cse1) (<= 0 (+ ~systemActive~0 test_~tmp___0~3 2147483647))) (or (and (<= (+ ~pumpRunning~0 ~systemActive~0) 1) (<= 2 (* 2 ~systemActive~0)) (<= .cse2 2) .cse3 (<= 0 (+ ~pumpRunning~0 test_~tmp___2~0 2147483648)) .cse4) (and .cse5 .cse6 (<= .cse2 3) (<= ~waterLevel~0 .cse7) (<= 0 (+ ~systemActive~0 test_~tmp___2~0 2147483647)) .cse4)) (<= 2 .cse2) .cse0)) (< (+ |old(~pumpRunning~0)| 1) |old(~systemActive~0)|) (< (* 2 |old(~systemActive~0)|) 2) (and (and (<= ~systemActive~0 (+ test_~tmp___0~3 2147483649)) (<= (+ test_~tmp___0~3 test_~splverifierCounter~0) 2147483647)) (and .cse5 .cse6 (<= ~waterLevel~0 (+ test_~splverifierCounter~0 2)) .cse3 .cse4 (<= 0 (+ test_~splverifierCounter~0 test_~tmp___2~0 2147483648)) .cse0) (<= test_~splverifierCounter~0 (+ test_~tmp~6 2147483648)) (<= (+ test_~tmp~6 test_~splverifierCounter~0) 2147483647)) (not (= |old(~waterLevel~0)| 1)) (< 0 (* 2 |old(~pumpRunning~0)|))))) [2018-10-27 01:00:09,257 INFO L425 ceAbstractionStarter]: For program point L542(lines 541 588) no Hoare annotation was computed. [2018-10-27 01:00:09,258 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 584) no Hoare annotation was computed. [2018-10-27 01:00:09,258 INFO L421 ceAbstractionStarter]: At program point L563(line 563) the Hoare annotation is: (let ((.cse3 (<= (+ ~pumpRunning~0 1) ~waterLevel~0)) (.cse4 (<= (+ ~systemActive~0 test_~tmp___0~3) 2147483648)) (.cse5 (<= ~systemActive~0 (+ test_~tmp___0~3 2147483649)))) (let ((.cse0 (and .cse3 (<= ~systemActive~0 ~waterLevel~0) (<= 2 (* 2 ~systemActive~0)) .cse4 (<= 0 (* 2 ~pumpRunning~0)) .cse5)) (.cse1 (<= (+ ~systemActive~0 ~waterLevel~0) 3)) (.cse2 (= test_~splverifierCounter~0 0))) (or (and (and (<= 0 (+ ~systemActive~0 test_~tmp___2~0 2147483647)) (<= test_~tmp___2~0 (+ ~systemActive~0 2147483646))) .cse0 .cse1 (<= 2 (+ ~pumpRunning~0 ~waterLevel~0)) .cse2) (and (and (<= test_~splverifierCounter~0 (+ test_~tmp~6 2147483648)) (<= (+ test_~tmp~6 test_~splverifierCounter~0) 2147483647)) (and .cse3 (= ~systemActive~0 1) (<= ~waterLevel~0 (+ test_~splverifierCounter~0 2)) .cse4 (<= 1 (+ ~pumpRunning~0 ~systemActive~0)) .cse5 .cse2)) (and .cse0 .cse1 (= ~pumpRunning~0 1) .cse2) (and (= ~systemActive~0 0) (= 0 ~pumpRunning~0) .cse2) (< (+ |old(~pumpRunning~0)| 1) |old(~systemActive~0)|) (< (* 2 |old(~systemActive~0)|) 2) (not (= |old(~waterLevel~0)| 1)) (< 0 (* 2 |old(~pumpRunning~0)|))))) [2018-10-27 01:00:09,258 INFO L425 ceAbstractionStarter]: For program point L561(lines 561 567) no Hoare annotation was computed. [2018-10-27 01:00:09,258 INFO L425 ceAbstractionStarter]: For program point L561-1(lines 561 567) no Hoare annotation was computed. [2018-10-27 01:00:09,258 INFO L421 ceAbstractionStarter]: At program point L586(lines 541 588) the Hoare annotation is: (let ((.cse0 (+ ~systemActive~0 ~waterLevel~0)) (.cse1 (= test_~splverifierCounter~0 0)) (.cse2 (= ~systemActive~0 0))) (or (and (<= .cse0 2) (<= 1 (+ ~pumpRunning~0 ~waterLevel~0)) (<= ~waterLevel~0 ~systemActive~0) (= ~pumpRunning~0 0) .cse1) (and .cse2 (= 0 ~pumpRunning~0) .cse1) (and (let ((.cse3 (+ ~systemActive~0 2147483646))) (and (and (<= test_~tmp___0~3 .cse3) (<= 0 (+ ~systemActive~0 test_~tmp___0~3 2147483647))) (and (<= (+ ~pumpRunning~0 1) ~waterLevel~0) (<= 1 (+ ~pumpRunning~0 ~systemActive~0)) (<= .cse0 3) (<= 0 (+ ~systemActive~0 test_~tmp___2~0 2147483647)) (<= test_~tmp___2~0 .cse3)) (= ~pumpRunning~0 1) .cse1)) (not .cse2)) (< (+ |old(~pumpRunning~0)| 1) |old(~systemActive~0)|) (< (* 2 |old(~systemActive~0)|) 2) (not (= |old(~waterLevel~0)| 1)) (< 0 (* 2 |old(~pumpRunning~0)|)))) [2018-10-27 01:00:09,258 INFO L421 ceAbstractionStarter]: At program point L553(line 553) the Hoare annotation is: (let ((.cse2 (+ ~systemActive~0 ~waterLevel~0)) (.cse3 (= test_~splverifierCounter~0 0))) (or (let ((.cse0 (+ ~systemActive~0 2147483646)) (.cse1 (* 2 test_~tmp~6))) (and (and (<= test_~tmp___0~3 .cse0) (<= 0 (+ ~systemActive~0 test_~tmp___0~3 2147483647))) (and (<= (+ ~pumpRunning~0 1) ~waterLevel~0) (<= 0 (+ ~systemActive~0 test_~tmp___2~0 2147483647)) (<= test_~tmp___2~0 .cse0)) (<= 0 (+ .cse1 4294967296)) (<= 2 (+ ~pumpRunning~0 ~systemActive~0)) (<= .cse2 3) (= ~pumpRunning~0 1) (<= .cse1 4294967294) .cse3)) (and (<= .cse2 2) (<= 1 (+ ~pumpRunning~0 ~waterLevel~0)) (<= ~waterLevel~0 ~systemActive~0) (<= test_~splverifierCounter~0 (+ test_~tmp~6 2147483648)) (<= test_~tmp~6 (+ test_~splverifierCounter~0 2147483647)) (= ~pumpRunning~0 0) .cse3) (and (= ~systemActive~0 0) (= 0 ~pumpRunning~0) .cse3) (< (+ |old(~pumpRunning~0)| 1) |old(~systemActive~0)|) (< (* 2 |old(~systemActive~0)|) 2) (not (= |old(~waterLevel~0)| 1)) (< 0 (* 2 |old(~pumpRunning~0)|)))) [2018-10-27 01:00:09,258 INFO L425 ceAbstractionStarter]: For program point L551(lines 551 557) no Hoare annotation was computed. [2018-10-27 01:00:09,258 INFO L425 ceAbstractionStarter]: For program point L551-1(lines 551 557) no Hoare annotation was computed. [2018-10-27 01:00:09,258 INFO L425 ceAbstractionStarter]: For program point testEXIT(lines 531 596) no Hoare annotation was computed. [2018-10-27 01:00:09,259 INFO L425 ceAbstractionStarter]: For program point isLowWaterSensorDryFINAL(lines 271 279) no Hoare annotation was computed. [2018-10-27 01:00:09,259 INFO L428 ceAbstractionStarter]: At program point isLowWaterSensorDryENTRY(lines 271 279) the Hoare annotation is: true [2018-10-27 01:00:09,259 INFO L425 ceAbstractionStarter]: For program point isLowWaterSensorDryEXIT(lines 271 279) no Hoare annotation was computed. [2018-10-27 01:00:09,259 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-27 01:00:09,259 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~waterLevel~0 |old(~waterLevel~0)|) (= |old(~pumpRunning~0)| ~pumpRunning~0)) [2018-10-27 01:00:09,259 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-27 01:00:09,259 INFO L425 ceAbstractionStarter]: For program point activatePumpFINAL(lines 405 412) no Hoare annotation was computed. [2018-10-27 01:00:09,259 INFO L425 ceAbstractionStarter]: For program point activatePumpEXIT(lines 405 412) no Hoare annotation was computed. [2018-10-27 01:00:09,259 INFO L421 ceAbstractionStarter]: At program point activatePumpENTRY(lines 405 412) the Hoare annotation is: (or (= 0 ~pumpRunning~0) (< (+ ~systemActive~0 ~waterLevel~0) 3) (< ~waterLevel~0 (+ ~systemActive~0 1)) (< 0 (* 2 |old(~pumpRunning~0)|)) (< (+ |old(~pumpRunning~0)| 2) ~waterLevel~0)) [2018-10-27 01:00:09,259 INFO L428 ceAbstractionStarter]: At program point getWaterLevelENTRY(lines 248 256) the Hoare annotation is: true [2018-10-27 01:00:09,259 INFO L425 ceAbstractionStarter]: For program point getWaterLevelFINAL(lines 248 256) no Hoare annotation was computed. [2018-10-27 01:00:09,259 INFO L425 ceAbstractionStarter]: For program point getWaterLevelEXIT(lines 248 256) no Hoare annotation was computed. [2018-10-27 01:00:09,259 INFO L425 ceAbstractionStarter]: For program point isHighWaterLevelEXIT(lines 477 495) no Hoare annotation was computed. [2018-10-27 01:00:09,259 INFO L425 ceAbstractionStarter]: For program point L486(lines 486 490) no Hoare annotation was computed. [2018-10-27 01:00:09,259 INFO L428 ceAbstractionStarter]: At program point isHighWaterLevelENTRY(lines 477 495) the Hoare annotation is: true [2018-10-27 01:00:09,260 INFO L425 ceAbstractionStarter]: For program point isHighWaterLevelFINAL(lines 477 495) no Hoare annotation was computed. [2018-10-27 01:00:09,260 INFO L428 ceAbstractionStarter]: At program point L484(line 484) the Hoare annotation is: true [2018-10-27 01:00:09,260 INFO L425 ceAbstractionStarter]: For program point L486-2(lines 486 490) no Hoare annotation was computed. [2018-10-27 01:00:09,260 INFO L425 ceAbstractionStarter]: For program point L484-1(line 484) no Hoare annotation was computed. [2018-10-27 01:00:09,260 INFO L425 ceAbstractionStarter]: For program point L208-1(lines 204 215) no Hoare annotation was computed. [2018-10-27 01:00:09,260 INFO L428 ceAbstractionStarter]: At program point changeMethaneLevelENTRY(lines 204 215) the Hoare annotation is: true [2018-10-27 01:00:09,260 INFO L425 ceAbstractionStarter]: For program point changeMethaneLevelEXIT(lines 204 215) no Hoare annotation was computed. [2018-10-27 01:00:09,260 INFO L425 ceAbstractionStarter]: For program point cleanupEXIT(lines 42 71) no Hoare annotation was computed. [2018-10-27 01:00:09,260 INFO L425 ceAbstractionStarter]: For program point L56(lines 56 60) no Hoare annotation was computed. [2018-10-27 01:00:09,260 INFO L428 ceAbstractionStarter]: At program point L56-1(lines 56 60) the Hoare annotation is: true [2018-10-27 01:00:09,260 INFO L425 ceAbstractionStarter]: For program point L52-1(lines 52 66) no Hoare annotation was computed. [2018-10-27 01:00:09,260 INFO L428 ceAbstractionStarter]: At program point L52-3(lines 52 66) the Hoare annotation is: true [2018-10-27 01:00:09,260 INFO L428 ceAbstractionStarter]: At program point L48(line 48) the Hoare annotation is: true [2018-10-27 01:00:09,260 INFO L425 ceAbstractionStarter]: For program point L48-1(line 48) no Hoare annotation was computed. [2018-10-27 01:00:09,260 INFO L428 ceAbstractionStarter]: At program point L67(lines 42 71) the Hoare annotation is: true [2018-10-27 01:00:09,260 INFO L425 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2018-10-27 01:00:09,261 INFO L428 ceAbstractionStarter]: At program point cleanupENTRY(lines 42 71) the Hoare annotation is: true [2018-10-27 01:00:09,261 INFO L425 ceAbstractionStarter]: For program point L53(line 53) no Hoare annotation was computed. [2018-10-27 01:00:09,261 INFO L421 ceAbstractionStarter]: At program point timeShiftENTRY(lines 322 345) the Hoare annotation is: (let ((.cse3 (= |old(~pumpRunning~0)| ~pumpRunning~0)) (.cse5 (* 2 |old(~pumpRunning~0)|))) (let ((.cse1 (+ ~pumpRunning~0 ~waterLevel~0)) (.cse2 (< 0 .cse5)) (.cse0 (and (= ~waterLevel~0 |old(~waterLevel~0)|) .cse3)) (.cse4 (< (+ ~systemActive~0 |old(~waterLevel~0)|) 3))) (and (or .cse0 (not (= 0 |old(~pumpRunning~0)|)) (not (= ~systemActive~0 0))) (or (and (<= 1 .cse1) (<= ~waterLevel~0 ~systemActive~0) (= ~pumpRunning~0 0)) (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0) (< (* 2 ~systemActive~0) 2) (not (= |old(~waterLevel~0)| 1)) .cse2) (or (and (<= (+ ~systemActive~0 ~waterLevel~0) 3) (<= 2 .cse1) .cse3) (or (or .cse4 (< |old(~waterLevel~0)| (+ ~systemActive~0 1))) .cse2 (< (+ |old(~pumpRunning~0)| 2) |old(~waterLevel~0)|))) (or .cse0 (or (< 3 (+ |old(~pumpRunning~0)| |old(~waterLevel~0)|)) .cse4 (< .cse5 2) (< 2 (+ |old(~pumpRunning~0)| ~systemActive~0))))))) [2018-10-27 01:00:09,261 INFO L421 ceAbstractionStarter]: At program point L335(line 335) the Hoare annotation is: (let ((.cse3 (* 2 |old(~pumpRunning~0)|)) (.cse4 (+ ~pumpRunning~0 ~waterLevel~0))) (let ((.cse1 (+ ~systemActive~0 ~waterLevel~0)) (.cse0 (<= 2 .cse4)) (.cse2 (< (+ ~systemActive~0 |old(~waterLevel~0)|) 3)) (.cse5 (< 0 .cse3))) (and (or (and .cse0 (<= .cse1 2) (<= ~pumpRunning~0 ~systemActive~0)) (or (< 3 (+ |old(~pumpRunning~0)| |old(~waterLevel~0)|)) .cse2 (< .cse3 2) (< 2 (+ |old(~pumpRunning~0)| ~systemActive~0)))) (or (and (<= 1 .cse4) (<= ~waterLevel~0 ~systemActive~0) (= ~pumpRunning~0 0)) (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0) (< (* 2 ~systemActive~0) 2) (not (= |old(~waterLevel~0)| 1)) .cse5) (or (and (<= .cse1 3) .cse0 (= |old(~pumpRunning~0)| ~pumpRunning~0)) (or (or .cse2 (< |old(~waterLevel~0)| (+ ~systemActive~0 1))) .cse5 (< (+ |old(~pumpRunning~0)| 2) |old(~waterLevel~0)|))) (or (not (= 0 |old(~pumpRunning~0)|)) (not (= ~systemActive~0 0)))))) [2018-10-27 01:00:09,261 INFO L421 ceAbstractionStarter]: At program point L333(lines 333 339) the Hoare annotation is: (let ((.cse5 (* 2 |old(~pumpRunning~0)|))) (let ((.cse0 (= ~waterLevel~0 |old(~waterLevel~0)|)) (.cse3 (< 0 .cse5)) (.cse1 (<= 1 (+ ~pumpRunning~0 ~waterLevel~0))) (.cse2 (= ~pumpRunning~0 0)) (.cse4 (< (+ ~systemActive~0 |old(~waterLevel~0)|) 3))) (and (or (and .cse0 (= |old(~pumpRunning~0)| ~pumpRunning~0)) (not (= 0 |old(~pumpRunning~0)|)) (not (= ~systemActive~0 0))) (or (and .cse1 (<= ~waterLevel~0 ~systemActive~0) .cse2) (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0) (< (* 2 ~systemActive~0) 2) (not (= |old(~waterLevel~0)| 1)) .cse3) (or (and .cse0 (= ~pumpRunning~0 1)) (or (or .cse4 (< |old(~waterLevel~0)| (+ ~systemActive~0 1))) .cse3 (< (+ |old(~pumpRunning~0)| 2) |old(~waterLevel~0)|))) (or (and .cse1 (<= (+ ~systemActive~0 ~waterLevel~0) 2) .cse2) (or (< 3 (+ |old(~pumpRunning~0)| |old(~waterLevel~0)|)) .cse4 (< .cse5 2) (< 2 (+ |old(~pumpRunning~0)| ~systemActive~0))))))) [2018-10-27 01:00:09,261 INFO L425 ceAbstractionStarter]: For program point timeShiftEXIT(lines 322 345) no Hoare annotation was computed. [2018-10-27 01:00:09,261 INFO L421 ceAbstractionStarter]: At program point L328(line 328) the Hoare annotation is: (let ((.cse2 (* 2 |old(~pumpRunning~0)|))) (let ((.cse0 (< 0 .cse2)) (.cse1 (< (+ ~systemActive~0 |old(~waterLevel~0)|) 3))) (and (or (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0) (< (* 2 ~systemActive~0) 2) (not (= |old(~waterLevel~0)| 1)) .cse0) (or (or .cse1 (< |old(~waterLevel~0)| (+ ~systemActive~0 1))) .cse0 (< (+ |old(~pumpRunning~0)| 2) |old(~waterLevel~0)|)) (or (not (= 0 |old(~pumpRunning~0)|)) (not (= ~systemActive~0 0))) (or (and (= ~waterLevel~0 |old(~waterLevel~0)|) (= |old(~pumpRunning~0)| ~pumpRunning~0)) (or (< 3 (+ |old(~pumpRunning~0)| |old(~waterLevel~0)|)) .cse1 (< .cse2 2) (< 2 (+ |old(~pumpRunning~0)| ~systemActive~0))))))) [2018-10-27 01:00:09,262 INFO L425 ceAbstractionStarter]: For program point timeShiftFINAL(lines 322 345) no Hoare annotation was computed. [2018-10-27 01:00:09,262 INFO L425 ceAbstractionStarter]: For program point L326(lines 325 344) no Hoare annotation was computed. [2018-10-27 01:00:09,262 INFO L421 ceAbstractionStarter]: At program point lowerWaterLevelENTRY(lines 180 191) the Hoare annotation is: (or (= ~waterLevel~0 |old(~waterLevel~0)|) (or (< 3 (+ ~pumpRunning~0 |old(~waterLevel~0)|)) (< (+ ~systemActive~0 |old(~waterLevel~0)|) 3) (< (* 2 ~pumpRunning~0) 2) (< 2 (+ ~pumpRunning~0 ~systemActive~0)))) [2018-10-27 01:00:09,264 INFO L425 ceAbstractionStarter]: For program point lowerWaterLevelEXIT(lines 180 191) no Hoare annotation was computed. [2018-10-27 01:00:09,264 INFO L425 ceAbstractionStarter]: For program point L184-1(lines 180 191) no Hoare annotation was computed. [2018-10-27 01:00:09,264 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-27 01:00:09,264 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= 1 (+ ~pumpRunning~0 ~waterLevel~0)) (<= ~waterLevel~0 ~systemActive~0) (<= ~systemActive~0 ~waterLevel~0) (<= ~waterLevel~0 (+ ~pumpRunning~0 1)) (= ~pumpRunning~0 0)) [2018-10-27 01:00:09,264 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-27 01:00:09,264 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-27 01:00:09,264 INFO L425 ceAbstractionStarter]: For program point setupEXIT(lines 99 105) no Hoare annotation was computed. [2018-10-27 01:00:09,264 INFO L428 ceAbstractionStarter]: At program point setupFINAL(lines 99 105) the Hoare annotation is: true [2018-10-27 01:00:09,264 INFO L421 ceAbstractionStarter]: At program point processEnvironment__wrappee__highWaterSensorENTRY(lines 354 378) the Hoare annotation is: (let ((.cse0 (< 0 (* 2 |old(~pumpRunning~0)|)))) (and (or (= |old(~pumpRunning~0)| ~pumpRunning~0) (or (or (< (+ ~systemActive~0 ~waterLevel~0) 3) (< ~waterLevel~0 (+ ~systemActive~0 1))) .cse0 (< (+ |old(~pumpRunning~0)| 2) ~waterLevel~0))) (or (= ~pumpRunning~0 0) (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0) (< (* 2 ~systemActive~0) 2) (not (= ~waterLevel~0 1)) .cse0))) [2018-10-27 01:00:09,264 INFO L425 ceAbstractionStarter]: For program point processEnvironment__wrappee__highWaterSensorEXIT(lines 354 378) no Hoare annotation was computed. [2018-10-27 01:00:09,265 INFO L421 ceAbstractionStarter]: At program point L373(line 373) the Hoare annotation is: (let ((.cse0 (< 0 (* 2 |old(~pumpRunning~0)|)))) (and (or (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0) (< (* 2 ~systemActive~0) 2) (not (= ~waterLevel~0 1)) .cse0) (or (or (< (+ ~systemActive~0 ~waterLevel~0) 3) (< ~waterLevel~0 (+ ~systemActive~0 1))) .cse0 (< (+ |old(~pumpRunning~0)| 2) ~waterLevel~0)))) [2018-10-27 01:00:09,265 INFO L425 ceAbstractionStarter]: For program point L373-1(lines 354 378) no Hoare annotation was computed. [2018-10-27 01:00:09,265 INFO L421 ceAbstractionStarter]: At program point L368(line 368) the Hoare annotation is: (let ((.cse0 (< 0 (* 2 |old(~pumpRunning~0)|)))) (and (or (or (< (+ ~systemActive~0 ~waterLevel~0) 3) (< ~waterLevel~0 (+ ~systemActive~0 1))) .cse0 (< (+ |old(~pumpRunning~0)| 2) ~waterLevel~0)) (or (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0) (< (* 2 ~systemActive~0) 2) (and (= 0 processEnvironment__wrappee__highWaterSensor_~tmp~2) (= ~pumpRunning~0 0)) (not (= ~waterLevel~0 1)) .cse0))) [2018-10-27 01:00:09,265 INFO L421 ceAbstractionStarter]: At program point L364(line 364) the Hoare annotation is: (let ((.cse0 (< 0 (* 2 |old(~pumpRunning~0)|)))) (and (or (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0) (< (* 2 ~systemActive~0) 2) (not (= ~waterLevel~0 1)) .cse0) (or (or (or (< (+ ~systemActive~0 ~waterLevel~0) 3) (< ~waterLevel~0 (+ ~systemActive~0 1))) .cse0 (< (+ |old(~pumpRunning~0)| 2) ~waterLevel~0)) (and (<= (+ processEnvironment__wrappee__highWaterSensor_~tmp~2 ~systemActive~0) 2) (= 0 ~pumpRunning~0) (<= 2 (* 2 processEnvironment__wrappee__highWaterSensor_~tmp~2)))))) [2018-10-27 01:00:09,265 INFO L425 ceAbstractionStarter]: For program point L362(lines 362 370) no Hoare annotation was computed. [2018-10-27 01:00:09,265 INFO L421 ceAbstractionStarter]: At program point L360(line 360) the Hoare annotation is: (let ((.cse0 (< 0 (* 2 |old(~pumpRunning~0)|)))) (and (or (= |old(~pumpRunning~0)| ~pumpRunning~0) (or (or (< (+ ~systemActive~0 ~waterLevel~0) 3) (< ~waterLevel~0 (+ ~systemActive~0 1))) .cse0 (< (+ |old(~pumpRunning~0)| 2) ~waterLevel~0))) (or (= ~pumpRunning~0 0) (< (+ |old(~pumpRunning~0)| 1) ~systemActive~0) (< (* 2 ~systemActive~0) 2) (not (= ~waterLevel~0 1)) .cse0))) [2018-10-27 01:00:09,265 INFO L425 ceAbstractionStarter]: For program point L360-1(line 360) no Hoare annotation was computed. [2018-10-27 01:00:09,265 INFO L425 ceAbstractionStarter]: For program point L358(lines 358 375) no Hoare annotation was computed. [2018-10-27 01:00:09,265 INFO L425 ceAbstractionStarter]: For program point waterRiseEXIT(lines 192 203) no Hoare annotation was computed. [2018-10-27 01:00:09,265 INFO L421 ceAbstractionStarter]: At program point waterRiseENTRY(lines 192 203) the Hoare annotation is: (let ((.cse1 (< (* 2 ~systemActive~0) 2)) (.cse0 (+ ~pumpRunning~0 ~waterLevel~0))) (and (or (< (+ ~pumpRunning~0 |old(~waterLevel~0)|) 3) (and (<= 3 .cse0) (<= (+ ~systemActive~0 ~waterLevel~0) 3)) .cse1 (< 2 (+ ~pumpRunning~0 ~systemActive~0)) (< 3 (+ ~systemActive~0 |old(~waterLevel~0)|))) (or (= ~waterLevel~0 |old(~waterLevel~0)|) (not (= 0 ~pumpRunning~0)) (not (= ~systemActive~0 0))) (or (or (< (+ ~pumpRunning~0 1) ~systemActive~0) .cse1 (not (= |old(~waterLevel~0)| 1)) (< 0 (* 2 ~pumpRunning~0))) (and (<= 1 .cse0) (<= ~waterLevel~0 ~systemActive~0))))) [2018-10-27 01:00:09,265 INFO L425 ceAbstractionStarter]: For program point L196-1(lines 192 203) no Hoare annotation was computed. [2018-10-27 01:00:09,265 INFO L425 ceAbstractionStarter]: For program point __automaton_failFINAL(lines 598 605) no Hoare annotation was computed. [2018-10-27 01:00:09,266 INFO L428 ceAbstractionStarter]: At program point __automaton_failENTRY(lines 598 605) the Hoare annotation is: true [2018-10-27 01:00:09,266 INFO L425 ceAbstractionStarter]: For program point __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION(line 602) no Hoare annotation was computed. [2018-10-27 01:00:09,266 INFO L425 ceAbstractionStarter]: For program point __automaton_failEXIT(lines 598 605) no Hoare annotation was computed. [2018-10-27 01:00:09,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 01:00:09 BoogieIcfgContainer [2018-10-27 01:00:09,299 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 01:00:09,300 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 01:00:09,300 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 01:00:09,300 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 01:00:09,300 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:56:32" (3/4) ... [2018-10-27 01:00:09,306 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-27 01:00:09,311 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure select_helpers [2018-10-27 01:00:09,311 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure valid_product [2018-10-27 01:00:09,311 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __utac_acc__Specification4_spec__1 [2018-10-27 01:00:09,311 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-27 01:00:09,311 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure stopSystem [2018-10-27 01:00:09,311 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure isPumpRunning [2018-10-27 01:00:09,311 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure isLowWaterLevel [2018-10-27 01:00:09,311 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure select_features [2018-10-27 01:00:09,311 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure runTest [2018-10-27 01:00:09,311 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure deactivatePump [2018-10-27 01:00:09,311 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure isHighWaterSensorDry [2018-10-27 01:00:09,311 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment [2018-10-27 01:00:09,311 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2018-10-27 01:00:09,312 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure test [2018-10-27 01:00:09,312 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure isLowWaterSensorDry [2018-10-27 01:00:09,312 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-27 01:00:09,312 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure activatePump [2018-10-27 01:00:09,312 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure getWaterLevel [2018-10-27 01:00:09,312 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure isHighWaterLevel [2018-10-27 01:00:09,312 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2018-10-27 01:00:09,312 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2018-10-27 01:00:09,312 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2018-10-27 01:00:09,312 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure lowerWaterLevel [2018-10-27 01:00:09,313 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure setup [2018-10-27 01:00:09,313 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2018-10-27 01:00:09,313 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2018-10-27 01:00:09,313 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __automaton_fail [2018-10-27 01:00:09,334 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 139 nodes and edges [2018-10-27 01:00:09,336 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 54 nodes and edges [2018-10-27 01:00:09,337 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2018-10-27 01:00:09,370 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((systemActive + waterLevel <= 2 && 1 <= pumpRunning + waterLevel) && waterLevel <= systemActive) && pumpRunning == 0) && splverifierCounter == 0) || ((systemActive == 0 && 0 == pumpRunning) && splverifierCounter == 0)) || (((((tmp___0 <= systemActive + 2147483646 && 0 <= systemActive + tmp___0 + 2147483647) && (((pumpRunning + 1 <= waterLevel && 1 <= pumpRunning + systemActive) && systemActive + waterLevel <= 3) && 0 <= systemActive + tmp___2 + 2147483647) && tmp___2 <= systemActive + 2147483646) && pumpRunning == 1) && splverifierCounter == 0) && !(systemActive == 0))) || \old(pumpRunning) + 1 < \old(systemActive)) || 2 * \old(systemActive) < 2) || !(\old(waterLevel) == 1)) || 0 < 2 * \old(pumpRunning) [2018-10-27 01:00:09,371 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(pumpRunning) + 1 < \old(systemActive) || 2 * \old(systemActive) < 2) || !(\old(waterLevel) == 1)) || 0 < 2 * \old(pumpRunning) [2018-10-27 01:00:09,426 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9160621a-942b-477b-b604-78646ae4f900/bin-2019/utaipan/witness.graphml [2018-10-27 01:00:09,426 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 01:00:09,427 INFO L168 Benchmark]: Toolchain (without parser) took 218478.03 ms. Allocated memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: 4.0 GB). Free memory was 954.5 MB in the beginning and 1.9 GB in the end (delta: -945.3 MB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. [2018-10-27 01:00:09,427 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 980.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 01:00:09,428 INFO L168 Benchmark]: CACSL2BoogieTranslator took 410.97 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 930.3 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-10-27 01:00:09,428 INFO L168 Benchmark]: Boogie Procedure Inliner took 128.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 927.6 MB in the beginning and 1.2 GB in the end (delta: -226.7 MB). Peak memory consumption was 16.4 MB. Max. memory is 11.5 GB. [2018-10-27 01:00:09,428 INFO L168 Benchmark]: Boogie Preprocessor took 47.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-10-27 01:00:09,428 INFO L168 Benchmark]: RCFGBuilder took 1054.23 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: 88.2 MB). Peak memory consumption was 88.2 MB. Max. memory is 11.5 GB. [2018-10-27 01:00:09,429 INFO L168 Benchmark]: TraceAbstraction took 216706.01 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.8 GB). Free memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: -841.8 MB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. [2018-10-27 01:00:09,429 INFO L168 Benchmark]: Witness Printer took 126.46 ms. Allocated memory is still 5.0 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 2.1 kB). Peak memory consumption was 2.1 kB. Max. memory is 11.5 GB. [2018-10-27 01:00:09,435 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 980.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 410.97 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 930.3 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 128.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 927.6 MB in the beginning and 1.2 GB in the end (delta: -226.7 MB). Peak memory consumption was 16.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1054.23 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: 88.2 MB). Peak memory consumption was 88.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 216706.01 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.8 GB). Free memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: -841.8 MB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. * Witness Printer took 126.46 ms. Allocated memory is still 5.0 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 2.1 kB). Peak memory consumption was 2.1 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 602]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 540]: Loop Invariant Derived loop invariant: ((\old(pumpRunning) + 1 < \old(systemActive) || 2 * \old(systemActive) < 2) || !(\old(waterLevel) == 1)) || 0 < 2 * \old(pumpRunning) - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 541]: Loop Invariant Derived loop invariant: (((((((((systemActive + waterLevel <= 2 && 1 <= pumpRunning + waterLevel) && waterLevel <= systemActive) && pumpRunning == 0) && splverifierCounter == 0) || ((systemActive == 0 && 0 == pumpRunning) && splverifierCounter == 0)) || (((((tmp___0 <= systemActive + 2147483646 && 0 <= systemActive + tmp___0 + 2147483647) && (((pumpRunning + 1 <= waterLevel && 1 <= pumpRunning + systemActive) && systemActive + waterLevel <= 3) && 0 <= systemActive + tmp___2 + 2147483647) && tmp___2 <= systemActive + 2147483646) && pumpRunning == 1) && splverifierCounter == 0) && !(systemActive == 0))) || \old(pumpRunning) + 1 < \old(systemActive)) || 2 * \old(systemActive) < 2) || !(\old(waterLevel) == 1)) || 0 < 2 * \old(pumpRunning) - StatisticsResult: Ultimate Automizer benchmark data CFG has 28 procedures, 149 locations, 1 error locations. SAFE Result, 216.5s OverallTime, 16 OverallIterations, 3 TraceHistogramMax, 107.7s AutomataDifference, 0.0s DeadEndRemovalTime, 16.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2822 SDtfs, 3062 SDslu, 12495 SDs, 0 SdLazy, 5542 SolverSat, 914 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 69.4s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 531 GetRequests, 304 SyntacticMatches, 11 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2539 ImplicationChecksByTransitivity, 7.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1921occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 50.0s AbstIntTime, 3 AbstIntIterations, 3 AbstIntStrong, 0.9932218013726067 AbsIntWeakeningRatio, 0.9943661971830986 AbsIntAvgWeakeningVarsNumRemoved, 6165.552112676056 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 571 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 61 LocationsWithAnnotation, 4687 PreInvPairs, 4771 NumberOfFragments, 2570 HoareAnnotationTreeSize, 4687 FomulaSimplifications, 73015 FormulaSimplificationTreeSizeReduction, 3.4s HoareSimplificationTime, 61 FomulaSimplificationsInter, 110110 FormulaSimplificationTreeSizeReductionInter, 12.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1782 NumberOfCodeBlocks, 1782 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1766 ConstructedInterpolants, 0 QuantifiedInterpolants, 287588 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 13 PerfectInterpolantSequences, 428/438 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...