./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec1_product38_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa 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_spec1_product38_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 a0c13a298b8ef5fea6639223509104e0f4da0801 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-2e94e6a [2018-12-31 09:41:11,539 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 09:41:11,540 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 09:41:11,555 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 09:41:11,555 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 09:41:11,556 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 09:41:11,557 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 09:41:11,559 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 09:41:11,561 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 09:41:11,561 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 09:41:11,562 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 09:41:11,562 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 09:41:11,563 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 09:41:11,564 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 09:41:11,565 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 09:41:11,566 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 09:41:11,567 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 09:41:11,569 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 09:41:11,571 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 09:41:11,572 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 09:41:11,573 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 09:41:11,574 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 09:41:11,577 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 09:41:11,577 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 09:41:11,577 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 09:41:11,578 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 09:41:11,579 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 09:41:11,580 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 09:41:11,581 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 09:41:11,582 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 09:41:11,582 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 09:41:11,583 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 09:41:11,583 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 09:41:11,583 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 09:41:11,586 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 09:41:11,587 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 09:41:11,587 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 09:41:11,603 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 09:41:11,604 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 09:41:11,605 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 09:41:11,605 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 09:41:11,605 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 09:41:11,606 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 09:41:11,606 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 09:41:11,606 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 09:41:11,606 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 09:41:11,606 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 09:41:11,606 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 09:41:11,606 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 09:41:11,610 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 09:41:11,610 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 09:41:11,610 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 09:41:11,611 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 09:41:11,611 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 09:41:11,611 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 09:41:11,611 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 09:41:11,611 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 09:41:11,612 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 09:41:11,614 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:41:11,614 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 09:41:11,614 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 09:41:11,614 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 09:41:11,614 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 09:41:11,615 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 09:41:11,615 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 09:41:11,616 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 -> a0c13a298b8ef5fea6639223509104e0f4da0801 [2018-12-31 09:41:11,681 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 09:41:11,699 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 09:41:11,703 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 09:41:11,705 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 09:41:11,705 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 09:41:11,706 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec1_product38_false-unreach-call_false-termination.cil.c [2018-12-31 09:41:11,770 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab6083da5/cf6e22213a8b486883850974e84445f4/FLAG3ccc5da48 [2018-12-31 09:41:12,338 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 09:41:12,339 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec1_product38_false-unreach-call_false-termination.cil.c [2018-12-31 09:41:12,353 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab6083da5/cf6e22213a8b486883850974e84445f4/FLAG3ccc5da48 [2018-12-31 09:41:12,638 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab6083da5/cf6e22213a8b486883850974e84445f4 [2018-12-31 09:41:12,642 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 09:41:12,644 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 09:41:12,645 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 09:41:12,645 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 09:41:12,650 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 09:41:12,651 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:41:12" (1/1) ... [2018-12-31 09:41:12,654 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74fb2347 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:12, skipping insertion in model container [2018-12-31 09:41:12,654 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:41:12" (1/1) ... [2018-12-31 09:41:12,663 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 09:41:12,734 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 09:41:13,166 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:41:13,180 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 09:41:13,346 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:41:13,399 INFO L195 MainTranslator]: Completed translation [2018-12-31 09:41:13,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:13 WrapperNode [2018-12-31 09:41:13,400 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 09:41:13,401 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 09:41:13,401 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 09:41:13,402 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 09:41:13,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:13" (1/1) ... [2018-12-31 09:41:13,448 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:13" (1/1) ... [2018-12-31 09:41:13,513 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 09:41:13,513 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 09:41:13,513 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 09:41:13,514 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 09:41:13,528 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:13" (1/1) ... [2018-12-31 09:41:13,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:13" (1/1) ... [2018-12-31 09:41:13,541 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:13" (1/1) ... [2018-12-31 09:41:13,542 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:13" (1/1) ... [2018-12-31 09:41:13,553 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:13" (1/1) ... [2018-12-31 09:41:13,563 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:13" (1/1) ... [2018-12-31 09:41:13,566 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:13" (1/1) ... [2018-12-31 09:41:13,571 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 09:41:13,572 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 09:41:13,572 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 09:41:13,572 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 09:41:13,574 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:13" (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 [2018-12-31 09:41:13,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 09:41:13,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-31 09:41:13,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 09:41:13,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 09:41:15,098 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 09:41:15,098 INFO L280 CfgBuilder]: Removed 158 assue(true) statements. [2018-12-31 09:41:15,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:41:15 BoogieIcfgContainer [2018-12-31 09:41:15,099 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 09:41:15,100 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 09:41:15,100 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 09:41:15,104 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 09:41:15,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 09:41:12" (1/3) ... [2018-12-31 09:41:15,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@329fb515 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:41:15, skipping insertion in model container [2018-12-31 09:41:15,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:13" (2/3) ... [2018-12-31 09:41:15,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@329fb515 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:41:15, skipping insertion in model container [2018-12-31 09:41:15,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:41:15" (3/3) ... [2018-12-31 09:41:15,108 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product38_false-unreach-call_false-termination.cil.c [2018-12-31 09:41:15,119 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 09:41:15,128 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 09:41:15,146 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 09:41:15,179 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 09:41:15,180 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 09:41:15,180 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 09:41:15,181 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 09:41:15,181 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 09:41:15,181 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 09:41:15,181 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 09:41:15,181 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 09:41:15,182 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 09:41:15,200 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2018-12-31 09:41:15,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 09:41:15,209 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:15,210 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:41:15,213 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:15,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:15,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1529342393, now seen corresponding path program 1 times [2018-12-31 09:41:15,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:15,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:15,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:15,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:15,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:15,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:15,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:41:15,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:15,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:41:15,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 09:41:15,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 09:41:15,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 09:41:15,493 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 2 states. [2018-12-31 09:41:15,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:15,540 INFO L93 Difference]: Finished difference Result 216 states and 329 transitions. [2018-12-31 09:41:15,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 09:41:15,542 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-12-31 09:41:15,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:15,558 INFO L225 Difference]: With dead ends: 216 [2018-12-31 09:41:15,558 INFO L226 Difference]: Without dead ends: 107 [2018-12-31 09:41:15,563 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 [2018-12-31 09:41:15,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-31 09:41:15,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-31 09:41:15,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-31 09:41:15,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 156 transitions. [2018-12-31 09:41:15,626 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 156 transitions. Word has length 16 [2018-12-31 09:41:15,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:15,627 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 156 transitions. [2018-12-31 09:41:15,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 09:41:15,628 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 156 transitions. [2018-12-31 09:41:15,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-31 09:41:15,631 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:15,632 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:41:15,632 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:15,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:15,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1945506518, now seen corresponding path program 1 times [2018-12-31 09:41:15,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:15,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:15,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:15,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:15,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:15,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:15,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:41:15,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:15,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:41:15,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:41:15,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:41:15,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:41:15,823 INFO L87 Difference]: Start difference. First operand 107 states and 156 transitions. Second operand 3 states. [2018-12-31 09:41:15,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:15,840 INFO L93 Difference]: Finished difference Result 107 states and 156 transitions. [2018-12-31 09:41:15,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:41:15,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-31 09:41:15,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:15,842 INFO L225 Difference]: With dead ends: 107 [2018-12-31 09:41:15,842 INFO L226 Difference]: Without dead ends: 45 [2018-12-31 09:41:15,844 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 [2018-12-31 09:41:15,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-31 09:41:15,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-31 09:41:15,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-31 09:41:15,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 65 transitions. [2018-12-31 09:41:15,852 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 65 transitions. Word has length 17 [2018-12-31 09:41:15,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:15,853 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 65 transitions. [2018-12-31 09:41:15,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:41:15,853 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 65 transitions. [2018-12-31 09:41:15,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-31 09:41:15,854 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:15,854 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] [2018-12-31 09:41:15,854 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:15,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:15,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1939738244, now seen corresponding path program 1 times [2018-12-31 09:41:15,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:15,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:15,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:15,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:15,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:15,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:16,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:41:16,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:16,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:41:16,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:41:16,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:41:16,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:41:16,034 INFO L87 Difference]: Start difference. First operand 45 states and 65 transitions. Second operand 5 states. [2018-12-31 09:41:16,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:16,167 INFO L93 Difference]: Finished difference Result 84 states and 124 transitions. [2018-12-31 09:41:16,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 09:41:16,173 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-12-31 09:41:16,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:16,175 INFO L225 Difference]: With dead ends: 84 [2018-12-31 09:41:16,175 INFO L226 Difference]: Without dead ends: 45 [2018-12-31 09:41:16,176 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 [2018-12-31 09:41:16,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-31 09:41:16,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-31 09:41:16,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-31 09:41:16,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 64 transitions. [2018-12-31 09:41:16,190 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 64 transitions. Word has length 22 [2018-12-31 09:41:16,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:16,191 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 64 transitions. [2018-12-31 09:41:16,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:41:16,191 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 64 transitions. [2018-12-31 09:41:16,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-31 09:41:16,198 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:16,198 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] [2018-12-31 09:41:16,198 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:16,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:16,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1547834963, now seen corresponding path program 1 times [2018-12-31 09:41:16,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:16,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:16,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:16,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:16,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:16,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:16,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:41:16,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:16,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:41:16,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:41:16,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:41:16,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:41:16,355 INFO L87 Difference]: Start difference. First operand 45 states and 64 transitions. Second operand 3 states. [2018-12-31 09:41:16,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:16,569 INFO L93 Difference]: Finished difference Result 105 states and 152 transitions. [2018-12-31 09:41:16,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:41:16,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-31 09:41:16,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:16,571 INFO L225 Difference]: With dead ends: 105 [2018-12-31 09:41:16,571 INFO L226 Difference]: Without dead ends: 66 [2018-12-31 09:41:16,573 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 [2018-12-31 09:41:16,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-31 09:41:16,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-12-31 09:41:16,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-31 09:41:16,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 90 transitions. [2018-12-31 09:41:16,584 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 90 transitions. Word has length 24 [2018-12-31 09:41:16,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:16,584 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 90 transitions. [2018-12-31 09:41:16,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:41:16,585 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 90 transitions. [2018-12-31 09:41:16,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-31 09:41:16,586 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:16,587 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] [2018-12-31 09:41:16,587 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:16,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:16,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1827782978, now seen corresponding path program 1 times [2018-12-31 09:41:16,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:16,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:16,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:16,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:16,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:16,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:16,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:41:16,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:16,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:41:16,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:41:16,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:41:16,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:41:16,790 INFO L87 Difference]: Start difference. First operand 64 states and 90 transitions. Second operand 5 states. [2018-12-31 09:41:16,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:16,973 INFO L93 Difference]: Finished difference Result 171 states and 239 transitions. [2018-12-31 09:41:16,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:41:16,974 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-12-31 09:41:16,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:16,976 INFO L225 Difference]: With dead ends: 171 [2018-12-31 09:41:16,976 INFO L226 Difference]: Without dead ends: 113 [2018-12-31 09:41:16,977 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 [2018-12-31 09:41:16,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-31 09:41:16,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 70. [2018-12-31 09:41:16,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-31 09:41:16,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 96 transitions. [2018-12-31 09:41:16,993 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 96 transitions. Word has length 30 [2018-12-31 09:41:16,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:16,994 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 96 transitions. [2018-12-31 09:41:16,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:41:16,994 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 96 transitions. [2018-12-31 09:41:16,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-31 09:41:16,995 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:16,995 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] [2018-12-31 09:41:16,997 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:16,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:16,997 INFO L82 PathProgramCache]: Analyzing trace with hash 834728065, now seen corresponding path program 1 times [2018-12-31 09:41:16,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:16,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:16,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:16,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:16,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:17,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:41:17,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:17,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:41:17,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:41:17,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:41:17,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:41:17,107 INFO L87 Difference]: Start difference. First operand 70 states and 96 transitions. Second operand 5 states. [2018-12-31 09:41:17,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:17,820 INFO L93 Difference]: Finished difference Result 344 states and 483 transitions. [2018-12-31 09:41:17,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 09:41:17,821 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-12-31 09:41:17,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:17,825 INFO L225 Difference]: With dead ends: 344 [2018-12-31 09:41:17,826 INFO L226 Difference]: Without dead ends: 280 [2018-12-31 09:41:17,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:41:17,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-12-31 09:41:17,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 128. [2018-12-31 09:41:17,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-12-31 09:41:17,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 175 transitions. [2018-12-31 09:41:17,873 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 175 transitions. Word has length 30 [2018-12-31 09:41:17,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:17,873 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 175 transitions. [2018-12-31 09:41:17,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:41:17,874 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 175 transitions. [2018-12-31 09:41:17,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-31 09:41:17,878 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:17,878 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] [2018-12-31 09:41:17,878 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:17,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:17,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1506496567, now seen corresponding path program 1 times [2018-12-31 09:41:17,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:17,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:17,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:17,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:17,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:17,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:18,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:41:18,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:18,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:41:18,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:41:18,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:41:18,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:41:18,186 INFO L87 Difference]: Start difference. First operand 128 states and 175 transitions. Second operand 5 states. [2018-12-31 09:41:18,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:18,598 INFO L93 Difference]: Finished difference Result 366 states and 502 transitions. [2018-12-31 09:41:18,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 09:41:18,599 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-12-31 09:41:18,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:18,602 INFO L225 Difference]: With dead ends: 366 [2018-12-31 09:41:18,603 INFO L226 Difference]: Without dead ends: 364 [2018-12-31 09:41:18,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:41:18,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-12-31 09:41:18,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 128. [2018-12-31 09:41:18,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-12-31 09:41:18,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 174 transitions. [2018-12-31 09:41:18,632 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 174 transitions. Word has length 31 [2018-12-31 09:41:18,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:18,632 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 174 transitions. [2018-12-31 09:41:18,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:41:18,633 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 174 transitions. [2018-12-31 09:41:18,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-31 09:41:18,635 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:18,635 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] [2018-12-31 09:41:18,635 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:18,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:18,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1549041486, now seen corresponding path program 1 times [2018-12-31 09:41:18,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:18,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:18,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:18,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:18,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:18,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:18,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:41:18,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:18,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:41:18,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 09:41:18,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 09:41:18,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 09:41:18,807 INFO L87 Difference]: Start difference. First operand 128 states and 174 transitions. Second operand 4 states. [2018-12-31 09:41:19,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:19,235 INFO L93 Difference]: Finished difference Result 308 states and 416 transitions. [2018-12-31 09:41:19,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 09:41:19,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-12-31 09:41:19,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:19,238 INFO L225 Difference]: With dead ends: 308 [2018-12-31 09:41:19,238 INFO L226 Difference]: Without dead ends: 186 [2018-12-31 09:41:19,239 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 [2018-12-31 09:41:19,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-12-31 09:41:19,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 136. [2018-12-31 09:41:19,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-31 09:41:19,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 182 transitions. [2018-12-31 09:41:19,264 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 182 transitions. Word has length 31 [2018-12-31 09:41:19,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:19,264 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 182 transitions. [2018-12-31 09:41:19,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 09:41:19,264 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 182 transitions. [2018-12-31 09:41:19,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-31 09:41:19,267 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:19,267 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] [2018-12-31 09:41:19,267 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:19,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:19,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1290876048, now seen corresponding path program 1 times [2018-12-31 09:41:19,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:19,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:19,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:19,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:19,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:19,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:19,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:41:19,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:19,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:41:19,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:41:19,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:41:19,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:41:19,353 INFO L87 Difference]: Start difference. First operand 136 states and 182 transitions. Second operand 3 states. [2018-12-31 09:41:19,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:19,513 INFO L93 Difference]: Finished difference Result 316 states and 422 transitions. [2018-12-31 09:41:19,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:41:19,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-31 09:41:19,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:19,516 INFO L225 Difference]: With dead ends: 316 [2018-12-31 09:41:19,516 INFO L226 Difference]: Without dead ends: 186 [2018-12-31 09:41:19,517 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 [2018-12-31 09:41:19,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-12-31 09:41:19,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2018-12-31 09:41:19,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-12-31 09:41:19,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 242 transitions. [2018-12-31 09:41:19,549 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 242 transitions. Word has length 31 [2018-12-31 09:41:19,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:19,550 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 242 transitions. [2018-12-31 09:41:19,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:41:19,550 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 242 transitions. [2018-12-31 09:41:19,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-31 09:41:19,553 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:19,553 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] [2018-12-31 09:41:19,554 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:19,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:19,554 INFO L82 PathProgramCache]: Analyzing trace with hash 891331378, now seen corresponding path program 1 times [2018-12-31 09:41:19,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:19,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:19,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:19,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:19,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:20,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:41:20,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:41:20,366 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 09:41:20,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 09:41:20 BoogieIcfgContainer [2018-12-31 09:41:20,490 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 09:41:20,490 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 09:41:20,490 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 09:41:20,490 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 09:41:20,491 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:41:15" (3/4) ... [2018-12-31 09:41:20,494 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 09:41:20,624 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 09:41:20,624 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 09:41:20,626 INFO L168 Benchmark]: Toolchain (without parser) took 7982.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 212.3 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -117.0 MB). Peak memory consumption was 95.3 MB. Max. memory is 11.5 GB. [2018-12-31 09:41:20,627 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. [2018-12-31 09:41:20,628 INFO L168 Benchmark]: CACSL2BoogieTranslator took 755.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -173.7 MB). Peak memory consumption was 36.5 MB. Max. memory is 11.5 GB. [2018-12-31 09:41:20,628 INFO L168 Benchmark]: Boogie Procedure Inliner took 111.63 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-31 09:41:20,629 INFO L168 Benchmark]: Boogie Preprocessor took 58.28 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. [2018-12-31 09:41:20,629 INFO L168 Benchmark]: RCFGBuilder took 1527.77 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: 65.5 MB). Peak memory consumption was 65.5 MB. Max. memory is 11.5 GB. [2018-12-31 09:41:20,631 INFO L168 Benchmark]: TraceAbstraction took 5389.40 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -31.2 MB). Peak memory consumption was 42.2 MB. Max. memory is 11.5 GB. [2018-12-31 09:41:20,633 INFO L168 Benchmark]: Witness Printer took 134.15 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: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-12-31 09:41:20,642 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 755.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -173.7 MB). Peak memory consumption was 36.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 111.63 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.28 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 1527.77 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: 65.5 MB). Peak memory consumption was 65.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5389.40 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -31.2 MB). Peak memory consumption was 42.2 MB. Max. memory is 11.5 GB. * Witness Printer took 134.15 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: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 837]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L40] int cleanupTimeShifts = 4; [L377] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L580] int pumpRunning = 0; [L581] int systemActive = 1; [L843] int waterLevel = 1; [L844] int methaneLevelCritical = 0; [L121] int retValue_acc ; [L122] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L170] int retValue_acc ; [L173] retValue_acc = 1 [L174] 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] [L767] int splverifierCounter ; [L768] int tmp ; [L769] int tmp___0 ; [L770] int tmp___1 ; [L771] int tmp___2 ; [L774] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L776] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L778] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L784] tmp = __VERIFIER_nondet_int() [L786] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L861] COND TRUE waterLevel < 2 [L862] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L794] tmp___0 = __VERIFIER_nondet_int() [L796] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L873] COND FALSE !(\read(methaneLevelCritical)) [L876] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L804] tmp___2 = __VERIFIER_nondet_int() [L806] COND TRUE \read(tmp___2) [L761] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L587] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L594] COND TRUE \read(systemActive) [L642] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L645] COND FALSE !(\read(pumpRunning)) [L616] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L619] COND TRUE ! pumpRunning [L739] int retValue_acc ; [L740] int tmp ; [L741] int tmp___0 ; [L923] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L926] COND FALSE !(waterLevel < 2) [L930] retValue_acc = 0 [L931] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L745] tmp = isHighWaterSensorDry() [L747] COND FALSE !(\read(tmp)) [L750] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L752] retValue_acc = tmp___0 [L753] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L621] tmp = isHighWaterLevel() [L623] COND TRUE \read(tmp) [L670] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L183] int tmp ; [L184] int tmp___0 ; [L882] int retValue_acc ; [L885] retValue_acc = methaneLevelCritical [L886] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L188] tmp = isMethaneLevelCritical() [L190] COND TRUE \read(tmp) [L694] int retValue_acc ; [L697] retValue_acc = pumpRunning [L698] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L192] tmp___0 = isPumpRunning() [L194] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L837] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 111 locations, 3 error locations. UNSAFE Result, 5.3s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 2.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 785 SDtfs, 952 SDslu, 964 SDs, 0 SdLazy, 149 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186occurred in iteration=9, 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.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 483 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 264 NumberOfCodeBlocks, 264 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 223 ConstructedInterpolants, 0 QuantifiedInterpolants, 11571 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...