./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec4_product41.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec4_product41.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 59866f864e0ec5bf7736536ea91554085144fb1d ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-30f4e4a [2019-11-28 00:22:47,528 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:22:47,531 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:22:47,549 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:22:47,550 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:22:47,552 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:22:47,554 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:22:47,564 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:22:47,569 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:22:47,572 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:22:47,574 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:22:47,576 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:22:47,576 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:22:47,579 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:22:47,580 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:22:47,581 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:22:47,583 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:22:47,586 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:22:47,588 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:22:47,592 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:22:47,597 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:22:47,600 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:22:47,601 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:22:47,603 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:22:47,606 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:22:47,606 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:22:47,606 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:22:47,608 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:22:47,609 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:22:47,610 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:22:47,610 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:22:47,611 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:22:47,612 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:22:47,613 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:22:47,614 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:22:47,615 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:22:47,616 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:22:47,616 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:22:47,616 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:22:47,617 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:22:47,619 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:22:47,619 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:22:47,636 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:22:47,636 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:22:47,637 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:22:47,637 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:22:47,638 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:22:47,638 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:22:47,638 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:22:47,638 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:22:47,639 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:22:47,639 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:22:47,639 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:22:47,639 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:22:47,639 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:22:47,640 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:22:47,640 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:22:47,640 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:22:47,640 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:22:47,641 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:22:47,641 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:22:47,641 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:22:47,641 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:22:47,641 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:22:47,642 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:22:47,642 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:22:47,642 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:22:47,642 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:22:47,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:22:47,643 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:22:47,643 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 59866f864e0ec5bf7736536ea91554085144fb1d [2019-11-28 00:22:47,968 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:22:47,987 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:22:47,990 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:22:47,991 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:22:47,992 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:22:47,992 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec4_product41.cil.c [2019-11-28 00:22:48,064 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f193c0eeb/f650b7b19ba544888dbcb0d114adae4a/FLAG6aea1957d [2019-11-28 00:22:48,617 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:22:48,618 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product41.cil.c [2019-11-28 00:22:48,633 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f193c0eeb/f650b7b19ba544888dbcb0d114adae4a/FLAG6aea1957d [2019-11-28 00:22:48,934 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f193c0eeb/f650b7b19ba544888dbcb0d114adae4a [2019-11-28 00:22:48,938 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:22:48,940 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:22:48,941 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:22:48,941 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:22:48,944 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:22:48,945 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:22:48" (1/1) ... [2019-11-28 00:22:48,949 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14462867 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:48, skipping insertion in model container [2019-11-28 00:22:48,949 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:22:48" (1/1) ... [2019-11-28 00:22:48,957 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:22:49,017 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:22:49,400 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:22:49,414 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:22:49,542 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:22:49,572 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:22:49,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:49 WrapperNode [2019-11-28 00:22:49,573 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:22:49,574 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:22:49,574 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:22:49,574 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:22:49,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:49" (1/1) ... [2019-11-28 00:22:49,603 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:49" (1/1) ... [2019-11-28 00:22:49,643 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:22:49,644 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:22:49,644 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:22:49,644 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:22:49,654 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:49" (1/1) ... [2019-11-28 00:22:49,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:49" (1/1) ... [2019-11-28 00:22:49,659 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:49" (1/1) ... [2019-11-28 00:22:49,659 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:49" (1/1) ... [2019-11-28 00:22:49,670 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:49" (1/1) ... [2019-11-28 00:22:49,678 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:49" (1/1) ... [2019-11-28 00:22:49,681 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:49" (1/1) ... [2019-11-28 00:22:49,685 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:22:49,686 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:22:49,686 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:22:49,686 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:22:49,687 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:22:49,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 00:22:49,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 00:22:49,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:22:49,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:22:50,584 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:22:50,584 INFO L297 CfgBuilder]: Removed 114 assume(true) statements. [2019-11-28 00:22:50,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:22:50 BoogieIcfgContainer [2019-11-28 00:22:50,586 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:22:50,587 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:22:50,587 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:22:50,590 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:22:50,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:22:48" (1/3) ... [2019-11-28 00:22:50,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@208d16ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:22:50, skipping insertion in model container [2019-11-28 00:22:50,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:49" (2/3) ... [2019-11-28 00:22:50,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@208d16ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:22:50, skipping insertion in model container [2019-11-28 00:22:50,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:22:50" (3/3) ... [2019-11-28 00:22:50,594 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product41.cil.c [2019-11-28 00:22:50,603 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:22:50,611 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 00:22:50,623 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 00:22:50,654 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:22:50,654 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:22:50,654 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:22:50,654 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:22:50,655 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:22:50,655 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:22:50,655 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:22:50,656 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:22:50,674 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2019-11-28 00:22:50,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 00:22:50,683 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:50,685 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:22:50,685 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:50,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:50,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1847621448, now seen corresponding path program 1 times [2019-11-28 00:22:50,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:50,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068169377] [2019-11-28 00:22:50,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:50,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:51,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:22:51,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068169377] [2019-11-28 00:22:51,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:51,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:22:51,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508994621] [2019-11-28 00:22:51,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 00:22:51,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:51,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 00:22:51,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 00:22:51,040 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 2 states. [2019-11-28 00:22:51,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:51,088 INFO L93 Difference]: Finished difference Result 168 states and 251 transitions. [2019-11-28 00:22:51,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 00:22:51,091 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-28 00:22:51,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:51,112 INFO L225 Difference]: With dead ends: 168 [2019-11-28 00:22:51,112 INFO L226 Difference]: Without dead ends: 83 [2019-11-28 00:22:51,119 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 00:22:51,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-28 00:22:51,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-11-28 00:22:51,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-28 00:22:51,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 117 transitions. [2019-11-28 00:22:51,188 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 117 transitions. Word has length 16 [2019-11-28 00:22:51,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:51,189 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 117 transitions. [2019-11-28 00:22:51,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 00:22:51,190 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 117 transitions. [2019-11-28 00:22:51,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 00:22:51,192 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:51,193 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:22:51,193 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:51,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:51,194 INFO L82 PathProgramCache]: Analyzing trace with hash 800864551, now seen corresponding path program 1 times [2019-11-28 00:22:51,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:51,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621492993] [2019-11-28 00:22:51,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:51,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:51,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:22:51,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621492993] [2019-11-28 00:22:51,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:51,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:22:51,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906709000] [2019-11-28 00:22:51,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:22:51,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:51,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:22:51,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:22:51,327 INFO L87 Difference]: Start difference. First operand 83 states and 117 transitions. Second operand 3 states. [2019-11-28 00:22:51,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:51,351 INFO L93 Difference]: Finished difference Result 83 states and 117 transitions. [2019-11-28 00:22:51,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:22:51,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 00:22:51,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:51,357 INFO L225 Difference]: With dead ends: 83 [2019-11-28 00:22:51,357 INFO L226 Difference]: Without dead ends: 37 [2019-11-28 00:22:51,358 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:22:51,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-28 00:22:51,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-11-28 00:22:51,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-28 00:22:51,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 52 transitions. [2019-11-28 00:22:51,371 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 52 transitions. Word has length 17 [2019-11-28 00:22:51,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:51,371 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 52 transitions. [2019-11-28 00:22:51,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:22:51,372 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 52 transitions. [2019-11-28 00:22:51,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 00:22:51,373 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:51,373 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:22:51,373 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:51,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:51,374 INFO L82 PathProgramCache]: Analyzing trace with hash -2126819203, now seen corresponding path program 1 times [2019-11-28 00:22:51,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:51,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616801565] [2019-11-28 00:22:51,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:51,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:51,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:22:51,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616801565] [2019-11-28 00:22:51,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:51,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:22:51,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292848196] [2019-11-28 00:22:51,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:22:51,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:51,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:22:51,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:22:51,549 INFO L87 Difference]: Start difference. First operand 37 states and 52 transitions. Second operand 6 states. [2019-11-28 00:22:51,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:51,727 INFO L93 Difference]: Finished difference Result 68 states and 98 transitions. [2019-11-28 00:22:51,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:22:51,729 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-11-28 00:22:51,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:51,730 INFO L225 Difference]: With dead ends: 68 [2019-11-28 00:22:51,733 INFO L226 Difference]: Without dead ends: 37 [2019-11-28 00:22:51,734 INFO L630 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-11-28 00:22:51,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-28 00:22:51,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-11-28 00:22:51,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-28 00:22:51,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2019-11-28 00:22:51,747 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 22 [2019-11-28 00:22:51,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:51,747 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2019-11-28 00:22:51,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:22:51,748 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2019-11-28 00:22:51,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 00:22:51,750 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:51,751 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:22:51,751 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:51,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:51,752 INFO L82 PathProgramCache]: Analyzing trace with hash -306622024, now seen corresponding path program 1 times [2019-11-28 00:22:51,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:51,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350091891] [2019-11-28 00:22:51,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:51,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:51,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:22:51,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350091891] [2019-11-28 00:22:51,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:51,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:22:51,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407700473] [2019-11-28 00:22:51,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:22:51,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:51,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:22:51,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:22:51,877 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 3 states. [2019-11-28 00:22:51,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:51,911 INFO L93 Difference]: Finished difference Result 89 states and 126 transitions. [2019-11-28 00:22:51,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:22:51,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 00:22:51,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:51,915 INFO L225 Difference]: With dead ends: 89 [2019-11-28 00:22:51,915 INFO L226 Difference]: Without dead ends: 58 [2019-11-28 00:22:51,915 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:22:51,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-28 00:22:51,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2019-11-28 00:22:51,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-28 00:22:51,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 78 transitions. [2019-11-28 00:22:51,927 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 78 transitions. Word has length 23 [2019-11-28 00:22:51,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:51,928 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 78 transitions. [2019-11-28 00:22:51,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:22:51,928 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 78 transitions. [2019-11-28 00:22:51,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 00:22:51,929 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:51,929 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:22:51,929 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:51,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:51,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1880803796, now seen corresponding path program 1 times [2019-11-28 00:22:51,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:51,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342419509] [2019-11-28 00:22:51,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:51,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:52,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:22:52,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342419509] [2019-11-28 00:22:52,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:52,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 00:22:52,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992816269] [2019-11-28 00:22:52,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 00:22:52,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:52,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 00:22:52,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:22:52,109 INFO L87 Difference]: Start difference. First operand 56 states and 78 transitions. Second operand 8 states. [2019-11-28 00:22:52,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:52,516 INFO L93 Difference]: Finished difference Result 347 states and 506 transitions. [2019-11-28 00:22:52,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 00:22:52,517 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-11-28 00:22:52,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:52,520 INFO L225 Difference]: With dead ends: 347 [2019-11-28 00:22:52,520 INFO L226 Difference]: Without dead ends: 297 [2019-11-28 00:22:52,522 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-11-28 00:22:52,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-11-28 00:22:52,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 140. [2019-11-28 00:22:52,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-11-28 00:22:52,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 193 transitions. [2019-11-28 00:22:52,559 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 193 transitions. Word has length 29 [2019-11-28 00:22:52,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:52,560 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 193 transitions. [2019-11-28 00:22:52,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 00:22:52,560 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 193 transitions. [2019-11-28 00:22:52,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-28 00:22:52,565 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:52,566 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-28 00:22:52,566 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:52,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:52,567 INFO L82 PathProgramCache]: Analyzing trace with hash -130752981, now seen corresponding path program 1 times [2019-11-28 00:22:52,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:52,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517564833] [2019-11-28 00:22:52,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:52,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:52,699 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 00:22:52,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517564833] [2019-11-28 00:22:52,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:52,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:22:52,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315549335] [2019-11-28 00:22:52,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:22:52,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:52,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:22:52,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:22:52,704 INFO L87 Difference]: Start difference. First operand 140 states and 193 transitions. Second operand 5 states. [2019-11-28 00:22:52,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:52,786 INFO L93 Difference]: Finished difference Result 388 states and 531 transitions. [2019-11-28 00:22:52,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:22:52,787 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-11-28 00:22:52,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:52,790 INFO L225 Difference]: With dead ends: 388 [2019-11-28 00:22:52,790 INFO L226 Difference]: Without dead ends: 254 [2019-11-28 00:22:52,794 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:22:52,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-11-28 00:22:52,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 149. [2019-11-28 00:22:52,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-28 00:22:52,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 202 transitions. [2019-11-28 00:22:52,833 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 202 transitions. Word has length 47 [2019-11-28 00:22:52,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:52,834 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 202 transitions. [2019-11-28 00:22:52,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:22:52,835 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 202 transitions. [2019-11-28 00:22:52,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-28 00:22:52,843 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:52,844 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-28 00:22:52,848 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:52,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:52,849 INFO L82 PathProgramCache]: Analyzing trace with hash -640226071, now seen corresponding path program 1 times [2019-11-28 00:22:52,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:52,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158671236] [2019-11-28 00:22:52,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:52,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:52,918 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 00:22:52,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158671236] [2019-11-28 00:22:52,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:52,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:22:52,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140950826] [2019-11-28 00:22:52,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:22:52,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:52,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:22:52,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:22:52,929 INFO L87 Difference]: Start difference. First operand 149 states and 202 transitions. Second operand 4 states. [2019-11-28 00:22:52,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:52,970 INFO L93 Difference]: Finished difference Result 311 states and 422 transitions. [2019-11-28 00:22:52,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:22:52,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-11-28 00:22:52,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:52,974 INFO L225 Difference]: With dead ends: 311 [2019-11-28 00:22:52,975 INFO L226 Difference]: Without dead ends: 168 [2019-11-28 00:22:52,976 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:22:52,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-28 00:22:52,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 123. [2019-11-28 00:22:52,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-11-28 00:22:52,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 164 transitions. [2019-11-28 00:22:52,999 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 164 transitions. Word has length 47 [2019-11-28 00:22:52,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:53,000 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 164 transitions. [2019-11-28 00:22:53,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:22:53,000 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 164 transitions. [2019-11-28 00:22:53,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-28 00:22:53,003 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:53,004 INFO L410 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] [2019-11-28 00:22:53,004 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:53,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:53,005 INFO L82 PathProgramCache]: Analyzing trace with hash -445753367, now seen corresponding path program 1 times [2019-11-28 00:22:53,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:53,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180372061] [2019-11-28 00:22:53,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:53,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:53,134 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:22:53,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180372061] [2019-11-28 00:22:53,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648145425] [2019-11-28 00:22:53,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:22:53,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:53,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 00:22:53,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:22:53,343 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:22:53,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:22:53,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-11-28 00:22:53,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937113409] [2019-11-28 00:22:53,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 00:22:53,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:53,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 00:22:53,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:22:53,348 INFO L87 Difference]: Start difference. First operand 123 states and 164 transitions. Second operand 8 states. [2019-11-28 00:22:53,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:53,598 INFO L93 Difference]: Finished difference Result 424 states and 586 transitions. [2019-11-28 00:22:53,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 00:22:53,598 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2019-11-28 00:22:53,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:53,602 INFO L225 Difference]: With dead ends: 424 [2019-11-28 00:22:53,602 INFO L226 Difference]: Without dead ends: 330 [2019-11-28 00:22:53,603 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-11-28 00:22:53,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-11-28 00:22:53,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 162. [2019-11-28 00:22:53,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-11-28 00:22:53,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 215 transitions. [2019-11-28 00:22:53,629 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 215 transitions. Word has length 48 [2019-11-28 00:22:53,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:53,629 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 215 transitions. [2019-11-28 00:22:53,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 00:22:53,630 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 215 transitions. [2019-11-28 00:22:53,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-28 00:22:53,632 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:53,632 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-28 00:22:53,836 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:22:53,836 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:53,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:53,837 INFO L82 PathProgramCache]: Analyzing trace with hash -2129580319, now seen corresponding path program 2 times [2019-11-28 00:22:53,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:53,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351240090] [2019-11-28 00:22:53,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:53,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:22:53,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:22:54,060 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 00:22:54,061 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 00:22:54,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:22:54 BoogieIcfgContainer [2019-11-28 00:22:54,202 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:22:54,202 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:22:54,202 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:22:54,203 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:22:54,203 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:22:50" (3/4) ... [2019-11-28 00:22:54,206 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 00:22:54,366 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:22:54,367 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:22:54,370 INFO L168 Benchmark]: Toolchain (without parser) took 5429.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 215.0 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -161.6 MB). Peak memory consumption was 53.4 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:54,371 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:22:54,373 INFO L168 Benchmark]: CACSL2BoogieTranslator took 632.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -163.5 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:54,374 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.19 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: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:54,374 INFO L168 Benchmark]: Boogie Preprocessor took 41.22 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:22:54,375 INFO L168 Benchmark]: RCFGBuilder took 900.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.1 MB). Peak memory consumption was 64.1 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:54,375 INFO L168 Benchmark]: TraceAbstraction took 3615.17 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 78.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -93.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:22:54,376 INFO L168 Benchmark]: Witness Printer took 164.81 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: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:54,380 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 632.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -163.5 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 70.19 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: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.22 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 900.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.1 MB). Peak memory consumption was 64.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3615.17 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 78.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -93.6 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 164.81 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: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 211]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L47] int waterLevel = 1; [L48] int methaneLevelCritical = 0; [L385] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L652] int pumpRunning = 0; [L653] int systemActive = 1; [L822] int cleanupTimeShifts = 4; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L895] int retValue_acc ; [L896] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L198] int retValue_acc ; [L201] retValue_acc = 1 [L202] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L902] tmp = valid_product() [L904] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L585] int splverifierCounter ; [L586] int tmp ; [L587] int tmp___0 ; [L588] int tmp___1 ; [L589] int tmp___2 ; [L592] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L594] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L596] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L602] tmp = __VERIFIER_nondet_int() [L604] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L65] COND TRUE waterLevel < 2 [L66] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L612] tmp___0 = __VERIFIER_nondet_int() [L614] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L622] tmp___2 = __VERIFIER_nondet_int() [L624] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L659] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L666] COND TRUE \read(systemActive) [L688] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L691] COND TRUE ! pumpRunning [L803] int retValue_acc ; [L804] int tmp ; [L805] int tmp___0 ; [L127] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L130] COND FALSE !(waterLevel < 2) [L134] retValue_acc = 0 [L135] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L809] tmp = isHighWaterSensorDry() [L811] COND FALSE !(\read(tmp)) [L814] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L816] retValue_acc = tmp___0 [L817] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L693] tmp = isHighWaterLevel() [L695] COND TRUE \read(tmp) [L722] int tmp ; [L747] int retValue_acc ; [L86] int retValue_acc ; [L89] retValue_acc = methaneLevelCritical [L90] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L751] retValue_acc = isMethaneLevelCritical() [L753] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L726] tmp = isMethaneAlarm() [L728] COND FALSE !(\read(tmp)) [L716] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L144] int tmp ; [L145] int tmp___0 ; [L118] int retValue_acc ; [L121] retValue_acc = waterLevel [L122] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L149] tmp = getWaterLevel() [L151] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L594] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L596] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L602] tmp = __VERIFIER_nondet_int() [L604] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L612] tmp___0 = __VERIFIER_nondet_int() [L614] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L622] tmp___2 = __VERIFIER_nondet_int() [L624] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L659] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L53] COND TRUE waterLevel > 0 [L54] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L666] COND TRUE \read(systemActive) [L688] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L691] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L144] int tmp ; [L145] int tmp___0 ; [L118] int retValue_acc ; [L121] retValue_acc = waterLevel [L122] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L149] tmp = getWaterLevel() [L151] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L594] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L596] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L602] tmp = __VERIFIER_nondet_int() [L604] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L612] tmp___0 = __VERIFIER_nondet_int() [L614] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L622] tmp___2 = __VERIFIER_nondet_int() [L624] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L659] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L53] COND TRUE waterLevel > 0 [L54] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L666] COND TRUE \read(systemActive) [L688] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L691] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L144] int tmp ; [L145] int tmp___0 ; [L118] int retValue_acc ; [L121] retValue_acc = waterLevel [L122] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L149] tmp = getWaterLevel() [L151] COND TRUE tmp == 0 [L758] int retValue_acc ; [L761] retValue_acc = pumpRunning [L762] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L153] tmp___0 = isPumpRunning() [L155] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L211] __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, 87 locations, 3 error locations. Result: UNSAFE, OverallTime: 3.4s, OverallIterations: 9, TraceHistogramMax: 3, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 598 SDtfs, 1073 SDslu, 1006 SDs, 0 SdLazy, 182 SolverSat, 51 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 477 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 360 NumberOfCodeBlocks, 360 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 288 ConstructedInterpolants, 0 QuantifiedInterpolants, 19899 SizeOfPredicates, 4 NumberOfNonLiveVariables, 391 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 50/56 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...