./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec4_product47_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/product-lines/minepump_spec4_product47_false-unreach-call_false-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 982cd7c832ad69be85d11abb6d88a1915810e691 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 14:48:59,457 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 14:48:59,459 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 14:48:59,471 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 14:48:59,471 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 14:48:59,472 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 14:48:59,473 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 14:48:59,475 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 14:48:59,477 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 14:48:59,477 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 14:48:59,478 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 14:48:59,479 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 14:48:59,479 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 14:48:59,480 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 14:48:59,482 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 14:48:59,482 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 14:48:59,483 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 14:48:59,485 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 14:48:59,487 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 14:48:59,488 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 14:48:59,489 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 14:48:59,491 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 14:48:59,493 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 14:48:59,493 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 14:48:59,494 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 14:48:59,495 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 14:48:59,495 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 14:48:59,496 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 14:48:59,497 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 14:48:59,498 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 14:48:59,498 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 14:48:59,499 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 14:48:59,499 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 14:48:59,500 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 14:48:59,501 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 14:48:59,501 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 14:48:59,502 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 14:48:59,518 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 14:48:59,518 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 14:48:59,520 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 14:48:59,520 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 14:48:59,520 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 14:48:59,521 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 14:48:59,521 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 14:48:59,521 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 14:48:59,521 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 14:48:59,521 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 14:48:59,522 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 14:48:59,523 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 14:48:59,523 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 14:48:59,523 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 14:48:59,523 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 14:48:59,523 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 14:48:59,523 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 14:48:59,524 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 14:48:59,524 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 14:48:59,524 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 14:48:59,524 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 14:48:59,524 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:48:59,525 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 14:48:59,526 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 14:48:59,526 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 14:48:59,526 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 14:48:59,526 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 14:48:59,527 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 14:48:59,527 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 982cd7c832ad69be85d11abb6d88a1915810e691 [2019-01-12 14:48:59,563 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 14:48:59,575 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 14:48:59,579 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 14:48:59,580 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 14:48:59,581 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 14:48:59,582 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec4_product47_false-unreach-call_false-termination.cil.c [2019-01-12 14:48:59,636 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bc4b575d/5d7c037b85b04abfb381ad7e8ff8ef00/FLAG8e2c13238 [2019-01-12 14:49:00,139 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 14:49:00,140 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec4_product47_false-unreach-call_false-termination.cil.c [2019-01-12 14:49:00,162 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bc4b575d/5d7c037b85b04abfb381ad7e8ff8ef00/FLAG8e2c13238 [2019-01-12 14:49:00,440 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bc4b575d/5d7c037b85b04abfb381ad7e8ff8ef00 [2019-01-12 14:49:00,445 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 14:49:00,448 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 14:49:00,453 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 14:49:00,453 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 14:49:00,457 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 14:49:00,458 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:49:00" (1/1) ... [2019-01-12 14:49:00,461 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@364f1727 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:49:00, skipping insertion in model container [2019-01-12 14:49:00,462 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:49:00" (1/1) ... [2019-01-12 14:49:00,471 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 14:49:00,535 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 14:49:00,876 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:49:00,890 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 14:49:00,995 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:49:01,038 INFO L195 MainTranslator]: Completed translation [2019-01-12 14:49:01,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:49:01 WrapperNode [2019-01-12 14:49:01,039 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 14:49:01,041 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 14:49:01,041 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 14:49:01,041 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 14:49:01,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:49:01" (1/1) ... [2019-01-12 14:49:01,146 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:49:01" (1/1) ... [2019-01-12 14:49:01,195 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 14:49:01,196 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 14:49:01,196 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 14:49:01,196 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 14:49:01,207 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:49:01" (1/1) ... [2019-01-12 14:49:01,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:49:01" (1/1) ... [2019-01-12 14:49:01,212 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:49:01" (1/1) ... [2019-01-12 14:49:01,213 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:49:01" (1/1) ... [2019-01-12 14:49:01,226 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:49:01" (1/1) ... [2019-01-12 14:49:01,237 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:49:01" (1/1) ... [2019-01-12 14:49:01,242 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:49:01" (1/1) ... [2019-01-12 14:49:01,254 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 14:49:01,254 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 14:49:01,254 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 14:49:01,255 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 14:49:01,255 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:49:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:49:01,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 14:49:01,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-12 14:49:01,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 14:49:01,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 14:49:02,844 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 14:49:02,845 INFO L286 CfgBuilder]: Removed 196 assue(true) statements. [2019-01-12 14:49:02,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:49:02 BoogieIcfgContainer [2019-01-12 14:49:02,846 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 14:49:02,848 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 14:49:02,848 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 14:49:02,851 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 14:49:02,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 02:49:00" (1/3) ... [2019-01-12 14:49:02,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24a6644 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:49:02, skipping insertion in model container [2019-01-12 14:49:02,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:49:01" (2/3) ... [2019-01-12 14:49:02,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24a6644 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:49:02, skipping insertion in model container [2019-01-12 14:49:02,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:49:02" (3/3) ... [2019-01-12 14:49:02,856 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product47_false-unreach-call_false-termination.cil.c [2019-01-12 14:49:02,864 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 14:49:02,871 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-12 14:49:02,885 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-12 14:49:02,914 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 14:49:02,915 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 14:49:02,915 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 14:49:02,915 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 14:49:02,915 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 14:49:02,916 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 14:49:02,916 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 14:49:02,916 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 14:49:02,916 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 14:49:02,935 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2019-01-12 14:49:02,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 14:49:02,944 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:49:02,945 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:49:02,947 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:49:02,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:49:02,953 INFO L82 PathProgramCache]: Analyzing trace with hash -330245923, now seen corresponding path program 1 times [2019-01-12 14:49:02,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:49:02,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:49:03,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:03,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:49:03,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:49:03,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:49:03,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:49:03,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:49:03,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 14:49:03,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 14:49:03,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 14:49:03,228 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 2 states. [2019-01-12 14:49:03,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:49:03,265 INFO L93 Difference]: Finished difference Result 256 states and 383 transitions. [2019-01-12 14:49:03,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 14:49:03,267 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-01-12 14:49:03,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:49:03,280 INFO L225 Difference]: With dead ends: 256 [2019-01-12 14:49:03,280 INFO L226 Difference]: Without dead ends: 127 [2019-01-12 14:49:03,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 14:49:03,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-01-12 14:49:03,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-01-12 14:49:03,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-12 14:49:03,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 183 transitions. [2019-01-12 14:49:03,328 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 183 transitions. Word has length 16 [2019-01-12 14:49:03,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:49:03,329 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 183 transitions. [2019-01-12 14:49:03,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 14:49:03,329 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 183 transitions. [2019-01-12 14:49:03,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 14:49:03,331 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:49:03,331 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:49:03,332 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:49:03,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:49:03,333 INFO L82 PathProgramCache]: Analyzing trace with hash 450073546, now seen corresponding path program 1 times [2019-01-12 14:49:03,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:49:03,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:49:03,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:03,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:49:03,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:03,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:49:03,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:49:03,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:49:03,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:49:03,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:49:03,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:49:03,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:49:03,509 INFO L87 Difference]: Start difference. First operand 127 states and 183 transitions. Second operand 3 states. [2019-01-12 14:49:03,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:49:03,536 INFO L93 Difference]: Finished difference Result 127 states and 183 transitions. [2019-01-12 14:49:03,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:49:03,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-12 14:49:03,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:49:03,539 INFO L225 Difference]: With dead ends: 127 [2019-01-12 14:49:03,539 INFO L226 Difference]: Without dead ends: 53 [2019-01-12 14:49:03,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:49:03,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-12 14:49:03,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-12 14:49:03,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-12 14:49:03,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 76 transitions. [2019-01-12 14:49:03,549 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 76 transitions. Word has length 17 [2019-01-12 14:49:03,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:49:03,550 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 76 transitions. [2019-01-12 14:49:03,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:49:03,550 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 76 transitions. [2019-01-12 14:49:03,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 14:49:03,551 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:49:03,551 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:49:03,551 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:49:03,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:49:03,553 INFO L82 PathProgramCache]: Analyzing trace with hash 445162074, now seen corresponding path program 1 times [2019-01-12 14:49:03,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:49:03,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:49:03,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:03,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:49:03,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:03,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:49:03,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:49:03,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:49:03,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:49:03,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 14:49:03,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 14:49:03,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:49:03,766 INFO L87 Difference]: Start difference. First operand 53 states and 76 transitions. Second operand 6 states. [2019-01-12 14:49:03,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:49:03,970 INFO L93 Difference]: Finished difference Result 170 states and 250 transitions. [2019-01-12 14:49:03,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:49:03,972 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-01-12 14:49:03,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:49:03,974 INFO L225 Difference]: With dead ends: 170 [2019-01-12 14:49:03,974 INFO L226 Difference]: Without dead ends: 123 [2019-01-12 14:49:03,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:49:03,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-12 14:49:03,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 72. [2019-01-12 14:49:03,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-12 14:49:03,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 105 transitions. [2019-01-12 14:49:04,001 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 105 transitions. Word has length 22 [2019-01-12 14:49:04,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:49:04,001 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 105 transitions. [2019-01-12 14:49:04,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 14:49:04,002 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 105 transitions. [2019-01-12 14:49:04,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-12 14:49:04,003 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:49:04,003 INFO L402 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] [2019-01-12 14:49:04,003 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:49:04,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:49:04,004 INFO L82 PathProgramCache]: Analyzing trace with hash 96758808, now seen corresponding path program 1 times [2019-01-12 14:49:04,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:49:04,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:49:04,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:04,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:49:04,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:04,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:49:04,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:49:04,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:49:04,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:49:04,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:49:04,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:49:04,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:49:04,150 INFO L87 Difference]: Start difference. First operand 72 states and 105 transitions. Second operand 3 states. [2019-01-12 14:49:04,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:49:04,276 INFO L93 Difference]: Finished difference Result 159 states and 234 transitions. [2019-01-12 14:49:04,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:49:04,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-12 14:49:04,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:49:04,280 INFO L225 Difference]: With dead ends: 159 [2019-01-12 14:49:04,280 INFO L226 Difference]: Without dead ends: 93 [2019-01-12 14:49:04,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:49:04,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-12 14:49:04,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2019-01-12 14:49:04,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-12 14:49:04,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 129 transitions. [2019-01-12 14:49:04,296 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 129 transitions. Word has length 24 [2019-01-12 14:49:04,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:49:04,296 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 129 transitions. [2019-01-12 14:49:04,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:49:04,296 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 129 transitions. [2019-01-12 14:49:04,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-12 14:49:04,298 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:49:04,298 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:49:04,298 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:49:04,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:49:04,299 INFO L82 PathProgramCache]: Analyzing trace with hash -732744145, now seen corresponding path program 1 times [2019-01-12 14:49:04,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:49:04,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:49:04,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:04,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:49:04,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:04,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:49:04,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:49:04,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:49:04,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:49:04,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:49:04,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:49:04,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:49:04,445 INFO L87 Difference]: Start difference. First operand 91 states and 129 transitions. Second operand 5 states. [2019-01-12 14:49:05,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:49:05,127 INFO L93 Difference]: Finished difference Result 325 states and 468 transitions. [2019-01-12 14:49:05,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:49:05,128 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-01-12 14:49:05,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:49:05,133 INFO L225 Difference]: With dead ends: 325 [2019-01-12 14:49:05,133 INFO L226 Difference]: Without dead ends: 240 [2019-01-12 14:49:05,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:49:05,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-01-12 14:49:05,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 153. [2019-01-12 14:49:05,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-01-12 14:49:05,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 212 transitions. [2019-01-12 14:49:05,182 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 212 transitions. Word has length 25 [2019-01-12 14:49:05,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:49:05,185 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 212 transitions. [2019-01-12 14:49:05,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:49:05,185 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 212 transitions. [2019-01-12 14:49:05,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-12 14:49:05,189 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:49:05,189 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:49:05,189 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:49:05,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:49:05,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1602914161, now seen corresponding path program 1 times [2019-01-12 14:49:05,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:49:05,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:49:05,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:05,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:49:05,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:05,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:49:05,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:49:05,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:49:05,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:49:05,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:49:05,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:49:05,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:49:05,556 INFO L87 Difference]: Start difference. First operand 153 states and 212 transitions. Second operand 5 states. [2019-01-12 14:49:06,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:49:06,425 INFO L93 Difference]: Finished difference Result 321 states and 453 transitions. [2019-01-12 14:49:06,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:49:06,426 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-01-12 14:49:06,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:49:06,428 INFO L225 Difference]: With dead ends: 321 [2019-01-12 14:49:06,429 INFO L226 Difference]: Without dead ends: 319 [2019-01-12 14:49:06,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:49:06,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-01-12 14:49:06,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 153. [2019-01-12 14:49:06,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-01-12 14:49:06,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 210 transitions. [2019-01-12 14:49:06,460 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 210 transitions. Word has length 26 [2019-01-12 14:49:06,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:49:06,461 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 210 transitions. [2019-01-12 14:49:06,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:49:06,461 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 210 transitions. [2019-01-12 14:49:06,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-12 14:49:06,463 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:49:06,464 INFO L402 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] [2019-01-12 14:49:06,464 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:49:06,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:49:06,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1235666169, now seen corresponding path program 1 times [2019-01-12 14:49:06,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:49:06,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:49:06,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:06,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:49:06,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:49:06,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:49:06,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:49:06,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:49:06,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 14:49:06,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 14:49:06,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 14:49:06,629 INFO L87 Difference]: Start difference. First operand 153 states and 210 transitions. Second operand 4 states. [2019-01-12 14:49:07,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:49:07,169 INFO L93 Difference]: Finished difference Result 459 states and 638 transitions. [2019-01-12 14:49:07,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 14:49:07,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-01-12 14:49:07,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:49:07,173 INFO L225 Difference]: With dead ends: 459 [2019-01-12 14:49:07,173 INFO L226 Difference]: Without dead ends: 374 [2019-01-12 14:49:07,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:49:07,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-01-12 14:49:07,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 157. [2019-01-12 14:49:07,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-01-12 14:49:07,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 214 transitions. [2019-01-12 14:49:07,202 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 214 transitions. Word has length 34 [2019-01-12 14:49:07,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:49:07,202 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 214 transitions. [2019-01-12 14:49:07,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 14:49:07,203 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 214 transitions. [2019-01-12 14:49:07,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-12 14:49:07,206 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:49:07,206 INFO L402 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] [2019-01-12 14:49:07,206 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:49:07,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:49:07,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1822472183, now seen corresponding path program 1 times [2019-01-12 14:49:07,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:49:07,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:49:07,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:07,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:49:07,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:07,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:49:07,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:49:07,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:49:07,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:49:07,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:49:07,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:49:07,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:49:07,485 INFO L87 Difference]: Start difference. First operand 157 states and 214 transitions. Second operand 5 states. [2019-01-12 14:49:08,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:49:08,060 INFO L93 Difference]: Finished difference Result 388 states and 543 transitions. [2019-01-12 14:49:08,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:49:08,061 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-01-12 14:49:08,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:49:08,064 INFO L225 Difference]: With dead ends: 388 [2019-01-12 14:49:08,064 INFO L226 Difference]: Without dead ends: 299 [2019-01-12 14:49:08,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:49:08,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-01-12 14:49:08,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 222. [2019-01-12 14:49:08,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-01-12 14:49:08,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 301 transitions. [2019-01-12 14:49:08,100 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 301 transitions. Word has length 34 [2019-01-12 14:49:08,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:49:08,102 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 301 transitions. [2019-01-12 14:49:08,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:49:08,102 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 301 transitions. [2019-01-12 14:49:08,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-12 14:49:08,103 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:49:08,103 INFO L402 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] [2019-01-12 14:49:08,105 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:49:08,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:49:08,105 INFO L82 PathProgramCache]: Analyzing trace with hash 44197509, now seen corresponding path program 1 times [2019-01-12 14:49:08,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:49:08,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:49:08,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:08,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:49:08,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:08,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:49:08,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:49:08,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:49:08,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:49:08,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:49:08,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:49:08,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:49:08,217 INFO L87 Difference]: Start difference. First operand 222 states and 301 transitions. Second operand 5 states. [2019-01-12 14:49:08,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:49:08,751 INFO L93 Difference]: Finished difference Result 660 states and 894 transitions. [2019-01-12 14:49:08,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:49:08,752 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-01-12 14:49:08,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:49:08,755 INFO L225 Difference]: With dead ends: 660 [2019-01-12 14:49:08,755 INFO L226 Difference]: Without dead ends: 444 [2019-01-12 14:49:08,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 14:49:08,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2019-01-12 14:49:08,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 231. [2019-01-12 14:49:08,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-01-12 14:49:08,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 310 transitions. [2019-01-12 14:49:08,792 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 310 transitions. Word has length 34 [2019-01-12 14:49:08,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:49:08,792 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 310 transitions. [2019-01-12 14:49:08,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:49:08,793 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 310 transitions. [2019-01-12 14:49:08,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-12 14:49:08,797 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:49:08,797 INFO L402 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] [2019-01-12 14:49:08,798 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:49:08,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:49:08,798 INFO L82 PathProgramCache]: Analyzing trace with hash -542608505, now seen corresponding path program 1 times [2019-01-12 14:49:08,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:49:08,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:49:08,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:08,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:49:08,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:08,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:49:09,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:49:09,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:49:09,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 14:49:09,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 14:49:09,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 14:49:09,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:49:09,005 INFO L87 Difference]: Start difference. First operand 231 states and 310 transitions. Second operand 6 states. [2019-01-12 14:49:09,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:49:09,400 INFO L93 Difference]: Finished difference Result 523 states and 704 transitions. [2019-01-12 14:49:09,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:49:09,402 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-01-12 14:49:09,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:49:09,406 INFO L225 Difference]: With dead ends: 523 [2019-01-12 14:49:09,407 INFO L226 Difference]: Without dead ends: 298 [2019-01-12 14:49:09,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:49:09,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-01-12 14:49:09,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 197. [2019-01-12 14:49:09,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-01-12 14:49:09,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 260 transitions. [2019-01-12 14:49:09,441 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 260 transitions. Word has length 34 [2019-01-12 14:49:09,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:49:09,441 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 260 transitions. [2019-01-12 14:49:09,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 14:49:09,442 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 260 transitions. [2019-01-12 14:49:09,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-12 14:49:09,443 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:49:09,444 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-12 14:49:09,446 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:49:09,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:49:09,446 INFO L82 PathProgramCache]: Analyzing trace with hash 134497996, now seen corresponding path program 1 times [2019-01-12 14:49:09,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:49:09,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:49:09,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:09,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:49:09,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:09,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:49:09,700 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:49:09,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:49:09,701 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:49:09,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:49:09,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:49:09,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:49:09,899 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:49:09,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:49:09,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-12 14:49:09,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 14:49:09,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 14:49:09,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:49:09,944 INFO L87 Difference]: Start difference. First operand 197 states and 260 transitions. Second operand 6 states. [2019-01-12 14:49:11,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:49:11,576 INFO L93 Difference]: Finished difference Result 589 states and 795 transitions. [2019-01-12 14:49:11,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:49:11,577 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-01-12 14:49:11,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:49:11,579 INFO L225 Difference]: With dead ends: 589 [2019-01-12 14:49:11,580 INFO L226 Difference]: Without dead ends: 440 [2019-01-12 14:49:11,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-12 14:49:11,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2019-01-12 14:49:11,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 268. [2019-01-12 14:49:11,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-01-12 14:49:11,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 357 transitions. [2019-01-12 14:49:11,631 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 357 transitions. Word has length 53 [2019-01-12 14:49:11,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:49:11,632 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 357 transitions. [2019-01-12 14:49:11,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 14:49:11,632 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 357 transitions. [2019-01-12 14:49:11,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-12 14:49:11,635 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:49:11,635 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-12 14:49:11,635 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:49:11,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:49:11,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1809371945, now seen corresponding path program 2 times [2019-01-12 14:49:11,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:49:11,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:49:11,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:11,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:49:11,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:12,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:49:12,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:49:12,468 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 14:49:12,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 02:49:12 BoogieIcfgContainer [2019-01-12 14:49:12,651 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 14:49:12,651 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 14:49:12,651 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 14:49:12,652 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 14:49:12,652 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:49:02" (3/4) ... [2019-01-12 14:49:12,656 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 14:49:12,858 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 14:49:12,859 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 14:49:12,860 INFO L168 Benchmark]: Toolchain (without parser) took 12412.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 210.8 MB). Free memory was 944.6 MB in the beginning and 820.0 MB in the end (delta: 124.6 MB). Peak memory consumption was 335.4 MB. Max. memory is 11.5 GB. [2019-01-12 14:49:12,863 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:49:12,864 INFO L168 Benchmark]: CACSL2BoogieTranslator took 586.72 ms. Allocated memory is still 1.0 GB. Free memory was 944.6 MB in the beginning and 916.5 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. [2019-01-12 14:49:12,864 INFO L168 Benchmark]: Boogie Procedure Inliner took 154.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 916.5 MB in the beginning and 1.1 GB in the end (delta: -213.5 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2019-01-12 14:49:12,865 INFO L168 Benchmark]: Boogie Preprocessor took 58.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-12 14:49:12,865 INFO L168 Benchmark]: RCFGBuilder took 1591.98 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: 64.2 MB). Peak memory consumption was 64.2 MB. Max. memory is 11.5 GB. [2019-01-12 14:49:12,865 INFO L168 Benchmark]: TraceAbstraction took 9803.21 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.1 MB). Free memory was 1.1 GB in the beginning and 850.6 MB in the end (delta: 208.6 MB). Peak memory consumption was 275.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:49:12,868 INFO L168 Benchmark]: Witness Printer took 207.48 ms. Allocated memory is still 1.2 GB. Free memory was 850.6 MB in the beginning and 820.0 MB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. [2019-01-12 14:49:12,871 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 586.72 ms. Allocated memory is still 1.0 GB. Free memory was 944.6 MB in the beginning and 916.5 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 154.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 916.5 MB in the beginning and 1.1 GB in the end (delta: -213.5 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1591.98 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: 64.2 MB). Peak memory consumption was 64.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9803.21 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.1 MB). Free memory was 1.1 GB in the beginning and 850.6 MB in the end (delta: 208.6 MB). Peak memory consumption was 275.7 MB. Max. memory is 11.5 GB. * Witness Printer took 207.48 ms. Allocated memory is still 1.2 GB. Free memory was 850.6 MB in the beginning and 820.0 MB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 828]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L40] int cleanupTimeShifts = 4; [L219] int pumpRunning = 0; [L220] int systemActive = 1; [L599] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L868] int waterLevel = 1; [L869] int methaneLevelCritical = 0; [L121] int retValue_acc ; [L122] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L859] int retValue_acc ; [L862] retValue_acc = 1 [L863] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L128] tmp = valid_product() [L130] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L146] int splverifierCounter ; [L147] int tmp ; [L148] int tmp___0 ; [L149] int tmp___1 ; [L150] int tmp___2 ; [L153] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L155] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L157] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L163] tmp = __VERIFIER_nondet_int() [L165] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L886] COND TRUE waterLevel < 2 [L887] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L173] tmp___0 = __VERIFIER_nondet_int() [L175] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L183] tmp___2 = __VERIFIER_nondet_int() [L185] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L227] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L234] COND TRUE \read(systemActive) [L282] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L285] COND FALSE !(\read(pumpRunning)) [L256] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L259] COND TRUE ! pumpRunning [L396] int retValue_acc ; [L397] int tmp ; [L398] int tmp___0 ; [L948] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L951] COND FALSE !(waterLevel < 2) [L955] retValue_acc = 0 [L956] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L402] tmp = isHighWaterSensorDry() [L404] COND FALSE !(\read(tmp)) [L407] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L409] retValue_acc = tmp___0 [L410] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L261] tmp = isHighWaterLevel() [L263] COND TRUE \read(tmp) [L315] int tmp ; [L340] int retValue_acc ; [L907] int retValue_acc ; [L910] retValue_acc = methaneLevelCritical [L911] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L344] retValue_acc = isMethaneLevelCritical() [L346] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L319] tmp = isMethaneAlarm() [L321] COND FALSE !(\read(tmp)) [L310] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L799] int tmp ; [L800] int tmp___0 ; [L939] int retValue_acc ; [L942] retValue_acc = waterLevel [L943] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L804] tmp = getWaterLevel() [L806] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L155] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L157] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L163] tmp = __VERIFIER_nondet_int() [L165] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L173] tmp___0 = __VERIFIER_nondet_int() [L175] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L183] tmp___2 = __VERIFIER_nondet_int() [L185] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L227] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L874] COND TRUE waterLevel > 0 [L875] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L234] COND TRUE \read(systemActive) [L282] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L285] COND TRUE \read(pumpRunning) [L340] int retValue_acc ; [L907] int retValue_acc ; [L910] retValue_acc = methaneLevelCritical [L911] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L344] retValue_acc = isMethaneLevelCritical() [L346] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L287] tmp = isMethaneAlarm() [L289] COND FALSE !(\read(tmp)) [L256] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L259] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L799] int tmp ; [L800] int tmp___0 ; [L939] int retValue_acc ; [L942] retValue_acc = waterLevel [L943] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L804] tmp = getWaterLevel() [L806] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L155] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L157] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L163] tmp = __VERIFIER_nondet_int() [L165] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L173] tmp___0 = __VERIFIER_nondet_int() [L175] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L183] tmp___2 = __VERIFIER_nondet_int() [L185] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L227] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L874] COND TRUE waterLevel > 0 [L875] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L234] COND TRUE \read(systemActive) [L282] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L285] COND TRUE \read(pumpRunning) [L340] int retValue_acc ; [L907] int retValue_acc ; [L910] retValue_acc = methaneLevelCritical [L911] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L344] retValue_acc = isMethaneLevelCritical() [L346] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L287] tmp = isMethaneAlarm() [L289] COND FALSE !(\read(tmp)) [L256] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L259] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L799] int tmp ; [L800] int tmp___0 ; [L939] int retValue_acc ; [L942] retValue_acc = waterLevel [L943] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L804] tmp = getWaterLevel() [L806] COND TRUE tmp == 0 [L351] int retValue_acc ; [L354] retValue_acc = pumpRunning [L355] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L808] tmp___0 = isPumpRunning() [L810] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L828] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 131 locations, 3 error locations. UNSAFE Result, 9.7s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 5.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1371 SDtfs, 1873 SDslu, 2130 SDs, 0 SdLazy, 283 SolverSat, 65 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=268occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 1086 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 444 NumberOfCodeBlocks, 444 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 360 ConstructedInterpolants, 0 QuantifiedInterpolants, 23957 SizeOfPredicates, 4 NumberOfNonLiveVariables, 409 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 22/28 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...