./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/systemc/transmitter.01_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/systemc/transmitter.01_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 18c351eab8f6ce363bd7076ce800527c30b2b6c5 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 15:24:18,613 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 15:24:18,615 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 15:24:18,628 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 15:24:18,629 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 15:24:18,630 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 15:24:18,631 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 15:24:18,633 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 15:24:18,635 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 15:24:18,636 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 15:24:18,637 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 15:24:18,637 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 15:24:18,638 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 15:24:18,640 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 15:24:18,641 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 15:24:18,642 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 15:24:18,643 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 15:24:18,645 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 15:24:18,648 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 15:24:18,649 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 15:24:18,651 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 15:24:18,652 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 15:24:18,655 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 15:24:18,655 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 15:24:18,655 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 15:24:18,656 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 15:24:18,658 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 15:24:18,659 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 15:24:18,660 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 15:24:18,661 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 15:24:18,661 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 15:24:18,662 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 15:24:18,662 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 15:24:18,662 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 15:24:18,664 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 15:24:18,665 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 15:24:18,665 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 15:24:18,681 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 15:24:18,682 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 15:24:18,683 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 15:24:18,683 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 15:24:18,683 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 15:24:18,683 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 15:24:18,684 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 15:24:18,684 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 15:24:18,685 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 15:24:18,685 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 15:24:18,685 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 15:24:18,685 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 15:24:18,685 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 15:24:18,685 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 15:24:18,686 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 15:24:18,686 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 15:24:18,686 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 15:24:18,686 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 15:24:18,686 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 15:24:18,687 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 15:24:18,688 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 15:24:18,688 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 15:24:18,688 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 15:24:18,689 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 15:24:18,689 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 15:24:18,689 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 15:24:18,689 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 15:24:18,689 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 15:24:18,689 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 -> 18c351eab8f6ce363bd7076ce800527c30b2b6c5 [2019-01-12 15:24:18,734 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 15:24:18,751 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 15:24:18,756 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 15:24:18,758 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 15:24:18,759 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 15:24:18,759 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/systemc/transmitter.01_false-unreach-call_false-termination.cil.c [2019-01-12 15:24:18,828 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05384276c/da344d6566fa4ff2a2e44f6ccc17b090/FLAG9d55aa0f8 [2019-01-12 15:24:19,367 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 15:24:19,369 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/systemc/transmitter.01_false-unreach-call_false-termination.cil.c [2019-01-12 15:24:19,381 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05384276c/da344d6566fa4ff2a2e44f6ccc17b090/FLAG9d55aa0f8 [2019-01-12 15:24:19,710 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05384276c/da344d6566fa4ff2a2e44f6ccc17b090 [2019-01-12 15:24:19,714 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 15:24:19,715 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 15:24:19,716 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 15:24:19,717 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 15:24:19,721 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 15:24:19,722 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:24:19" (1/1) ... [2019-01-12 15:24:19,725 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@398d0f6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:24:19, skipping insertion in model container [2019-01-12 15:24:19,726 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:24:19" (1/1) ... [2019-01-12 15:24:19,734 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 15:24:19,778 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 15:24:19,980 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:24:19,994 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 15:24:20,081 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:24:20,116 INFO L195 MainTranslator]: Completed translation [2019-01-12 15:24:20,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:24:20 WrapperNode [2019-01-12 15:24:20,117 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 15:24:20,118 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 15:24:20,118 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 15:24:20,118 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 15:24:20,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:24:20" (1/1) ... [2019-01-12 15:24:20,138 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:24:20" (1/1) ... [2019-01-12 15:24:20,192 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 15:24:20,193 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 15:24:20,193 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 15:24:20,193 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 15:24:20,205 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:24:20" (1/1) ... [2019-01-12 15:24:20,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:24:20" (1/1) ... [2019-01-12 15:24:20,321 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:24:20" (1/1) ... [2019-01-12 15:24:20,321 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:24:20" (1/1) ... [2019-01-12 15:24:20,330 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:24:20" (1/1) ... [2019-01-12 15:24:20,351 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:24:20" (1/1) ... [2019-01-12 15:24:20,355 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:24:20" (1/1) ... [2019-01-12 15:24:20,363 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 15:24:20,366 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 15:24:20,369 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 15:24:20,369 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 15:24:20,370 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:24:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 15:24:20,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 15:24:20,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 15:24:21,446 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 15:24:21,446 INFO L286 CfgBuilder]: Removed 73 assue(true) statements. [2019-01-12 15:24:21,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:24:21 BoogieIcfgContainer [2019-01-12 15:24:21,447 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 15:24:21,449 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 15:24:21,449 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 15:24:21,452 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 15:24:21,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 03:24:19" (1/3) ... [2019-01-12 15:24:21,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ec55f19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:24:21, skipping insertion in model container [2019-01-12 15:24:21,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:24:20" (2/3) ... [2019-01-12 15:24:21,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ec55f19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:24:21, skipping insertion in model container [2019-01-12 15:24:21,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:24:21" (3/3) ... [2019-01-12 15:24:21,457 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.01_false-unreach-call_false-termination.cil.c [2019-01-12 15:24:21,468 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 15:24:21,480 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 15:24:21,495 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 15:24:21,533 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 15:24:21,535 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 15:24:21,535 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 15:24:21,535 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 15:24:21,535 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 15:24:21,536 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 15:24:21,536 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 15:24:21,536 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 15:24:21,536 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 15:24:21,560 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states. [2019-01-12 15:24:21,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-12 15:24:21,570 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:24:21,571 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:24:21,574 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:24:21,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:24:21,581 INFO L82 PathProgramCache]: Analyzing trace with hash 827300887, now seen corresponding path program 1 times [2019-01-12 15:24:21,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:24:21,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:24:21,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:21,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:24:21,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:21,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:24:21,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:24:21,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:24:21,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:24:21,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:24:21,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:24:21,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:24:21,780 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 3 states. [2019-01-12 15:24:21,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:24:21,855 INFO L93 Difference]: Finished difference Result 239 states and 373 transitions. [2019-01-12 15:24:21,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:24:21,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-01-12 15:24:21,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:24:21,871 INFO L225 Difference]: With dead ends: 239 [2019-01-12 15:24:21,872 INFO L226 Difference]: Without dead ends: 118 [2019-01-12 15:24:21,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:24:21,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-01-12 15:24:21,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-01-12 15:24:21,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-01-12 15:24:21,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 174 transitions. [2019-01-12 15:24:21,925 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 174 transitions. Word has length 37 [2019-01-12 15:24:21,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:24:21,926 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 174 transitions. [2019-01-12 15:24:21,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:24:21,926 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 174 transitions. [2019-01-12 15:24:21,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-12 15:24:21,928 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:24:21,928 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:24:21,928 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:24:21,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:24:21,929 INFO L82 PathProgramCache]: Analyzing trace with hash 899687445, now seen corresponding path program 1 times [2019-01-12 15:24:21,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:24:21,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:24:21,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:21,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:24:21,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:21,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:24:21,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:24:21,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:24:21,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 15:24:21,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:24:21,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:24:21,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:24:21,993 INFO L87 Difference]: Start difference. First operand 118 states and 174 transitions. Second operand 3 states. [2019-01-12 15:24:22,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:24:22,167 INFO L93 Difference]: Finished difference Result 308 states and 454 transitions. [2019-01-12 15:24:22,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:24:22,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-01-12 15:24:22,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:24:22,173 INFO L225 Difference]: With dead ends: 308 [2019-01-12 15:24:22,173 INFO L226 Difference]: Without dead ends: 196 [2019-01-12 15:24:22,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:24:22,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-01-12 15:24:22,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 194. [2019-01-12 15:24:22,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-01-12 15:24:22,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 280 transitions. [2019-01-12 15:24:22,219 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 280 transitions. Word has length 37 [2019-01-12 15:24:22,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:24:22,219 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 280 transitions. [2019-01-12 15:24:22,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:24:22,220 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 280 transitions. [2019-01-12 15:24:22,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-12 15:24:22,222 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:24:22,222 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:24:22,222 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:24:22,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:24:22,223 INFO L82 PathProgramCache]: Analyzing trace with hash -413900843, now seen corresponding path program 1 times [2019-01-12 15:24:22,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:24:22,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:24:22,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:22,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:24:22,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:22,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:24:22,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:24:22,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:24:22,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 15:24:22,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:24:22,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:24:22,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:24:22,315 INFO L87 Difference]: Start difference. First operand 194 states and 280 transitions. Second operand 3 states. [2019-01-12 15:24:22,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:24:22,403 INFO L93 Difference]: Finished difference Result 381 states and 551 transitions. [2019-01-12 15:24:22,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:24:22,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-01-12 15:24:22,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:24:22,408 INFO L225 Difference]: With dead ends: 381 [2019-01-12 15:24:22,410 INFO L226 Difference]: Without dead ends: 194 [2019-01-12 15:24:22,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:24:22,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-01-12 15:24:22,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2019-01-12 15:24:22,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-01-12 15:24:22,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 272 transitions. [2019-01-12 15:24:22,455 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 272 transitions. Word has length 37 [2019-01-12 15:24:22,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:24:22,455 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 272 transitions. [2019-01-12 15:24:22,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:24:22,456 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 272 transitions. [2019-01-12 15:24:22,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-12 15:24:22,460 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:24:22,460 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:24:22,461 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:24:22,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:24:22,461 INFO L82 PathProgramCache]: Analyzing trace with hash -733369323, now seen corresponding path program 1 times [2019-01-12 15:24:22,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:24:22,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:24:22,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:22,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:24:22,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:22,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:24:22,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:24:22,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:24:22,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 15:24:22,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:24:22,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:24:22,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:24:22,538 INFO L87 Difference]: Start difference. First operand 194 states and 272 transitions. Second operand 3 states. [2019-01-12 15:24:22,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:24:22,634 INFO L93 Difference]: Finished difference Result 380 states and 534 transitions. [2019-01-12 15:24:22,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:24:22,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-01-12 15:24:22,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:24:22,638 INFO L225 Difference]: With dead ends: 380 [2019-01-12 15:24:22,638 INFO L226 Difference]: Without dead ends: 194 [2019-01-12 15:24:22,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:24:22,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-01-12 15:24:22,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2019-01-12 15:24:22,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-01-12 15:24:22,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 260 transitions. [2019-01-12 15:24:22,675 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 260 transitions. Word has length 37 [2019-01-12 15:24:22,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:24:22,675 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 260 transitions. [2019-01-12 15:24:22,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:24:22,676 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 260 transitions. [2019-01-12 15:24:22,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-12 15:24:22,680 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:24:22,680 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:24:22,680 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:24:22,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:24:22,681 INFO L82 PathProgramCache]: Analyzing trace with hash -2103987404, now seen corresponding path program 1 times [2019-01-12 15:24:22,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:24:22,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:24:22,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:22,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:24:22,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:24:22,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:24:22,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:24:22,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:24:22,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:24:22,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:24:22,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:24:22,785 INFO L87 Difference]: Start difference. First operand 194 states and 260 transitions. Second operand 3 states. [2019-01-12 15:24:22,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:24:22,946 INFO L93 Difference]: Finished difference Result 525 states and 700 transitions. [2019-01-12 15:24:22,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:24:22,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-01-12 15:24:22,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:24:22,952 INFO L225 Difference]: With dead ends: 525 [2019-01-12 15:24:22,952 INFO L226 Difference]: Without dead ends: 356 [2019-01-12 15:24:22,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:24:22,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-01-12 15:24:22,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 334. [2019-01-12 15:24:22,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-01-12 15:24:22,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 435 transitions. [2019-01-12 15:24:22,980 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 435 transitions. Word has length 37 [2019-01-12 15:24:22,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:24:22,982 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 435 transitions. [2019-01-12 15:24:22,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:24:22,982 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 435 transitions. [2019-01-12 15:24:22,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-12 15:24:22,983 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:24:22,984 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:24:22,985 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:24:22,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:24:22,985 INFO L82 PathProgramCache]: Analyzing trace with hash -303434219, now seen corresponding path program 1 times [2019-01-12 15:24:22,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:24:22,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:24:22,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:22,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:24:22,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:23,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:24:23,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:24:23,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:24:23,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 15:24:23,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:24:23,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:24:23,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:24:23,062 INFO L87 Difference]: Start difference. First operand 334 states and 435 transitions. Second operand 3 states. [2019-01-12 15:24:23,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:24:23,244 INFO L93 Difference]: Finished difference Result 910 states and 1192 transitions. [2019-01-12 15:24:23,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:24:23,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-01-12 15:24:23,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:24:23,249 INFO L225 Difference]: With dead ends: 910 [2019-01-12 15:24:23,249 INFO L226 Difference]: Without dead ends: 606 [2019-01-12 15:24:23,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:24:23,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-01-12 15:24:23,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 598. [2019-01-12 15:24:23,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-01-12 15:24:23,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 772 transitions. [2019-01-12 15:24:23,295 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 772 transitions. Word has length 38 [2019-01-12 15:24:23,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:24:23,296 INFO L480 AbstractCegarLoop]: Abstraction has 598 states and 772 transitions. [2019-01-12 15:24:23,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:24:23,296 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 772 transitions. [2019-01-12 15:24:23,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-12 15:24:23,298 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:24:23,299 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:24:23,299 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:24:23,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:24:23,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1237930563, now seen corresponding path program 1 times [2019-01-12 15:24:23,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:24:23,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:24:23,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:23,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:24:23,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:23,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:24:23,390 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:24:23,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:24:23,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:24:23,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:24:23,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:24:23,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:24:23,393 INFO L87 Difference]: Start difference. First operand 598 states and 772 transitions. Second operand 3 states. [2019-01-12 15:24:23,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:24:23,739 INFO L93 Difference]: Finished difference Result 1152 states and 1499 transitions. [2019-01-12 15:24:23,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:24:23,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-01-12 15:24:23,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:24:23,746 INFO L225 Difference]: With dead ends: 1152 [2019-01-12 15:24:23,746 INFO L226 Difference]: Without dead ends: 864 [2019-01-12 15:24:23,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:24:23,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2019-01-12 15:24:23,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 864. [2019-01-12 15:24:23,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2019-01-12 15:24:23,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1109 transitions. [2019-01-12 15:24:23,807 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1109 transitions. Word has length 51 [2019-01-12 15:24:23,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:24:23,807 INFO L480 AbstractCegarLoop]: Abstraction has 864 states and 1109 transitions. [2019-01-12 15:24:23,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:24:23,808 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1109 transitions. [2019-01-12 15:24:23,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-12 15:24:23,809 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:24:23,810 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:24:23,810 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:24:23,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:24:23,810 INFO L82 PathProgramCache]: Analyzing trace with hash -690734764, now seen corresponding path program 1 times [2019-01-12 15:24:23,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:24:23,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:24:23,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:23,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:24:23,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:23,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:24:23,946 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-12 15:24:23,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:24:23,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:24:23,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:24:23,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:24:23,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:24:23,948 INFO L87 Difference]: Start difference. First operand 864 states and 1109 transitions. Second operand 5 states. [2019-01-12 15:24:24,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:24:24,916 INFO L93 Difference]: Finished difference Result 2777 states and 3544 transitions. [2019-01-12 15:24:24,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 15:24:24,917 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-01-12 15:24:24,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:24:24,928 INFO L225 Difference]: With dead ends: 2777 [2019-01-12 15:24:24,928 INFO L226 Difference]: Without dead ends: 1948 [2019-01-12 15:24:24,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 15:24:24,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1948 states. [2019-01-12 15:24:25,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1948 to 909. [2019-01-12 15:24:25,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-01-12 15:24:25,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1143 transitions. [2019-01-12 15:24:25,027 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1143 transitions. Word has length 68 [2019-01-12 15:24:25,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:24:25,028 INFO L480 AbstractCegarLoop]: Abstraction has 909 states and 1143 transitions. [2019-01-12 15:24:25,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:24:25,028 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1143 transitions. [2019-01-12 15:24:25,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-12 15:24:25,029 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:24:25,029 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:24:25,031 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:24:25,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:24:25,032 INFO L82 PathProgramCache]: Analyzing trace with hash 696050646, now seen corresponding path program 1 times [2019-01-12 15:24:25,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:24:25,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:24:25,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:25,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:24:25,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:24:25,636 WARN L181 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2019-01-12 15:24:25,645 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-12 15:24:25,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:24:25,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:24:25,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:24:25,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:24:25,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:24:25,647 INFO L87 Difference]: Start difference. First operand 909 states and 1143 transitions. Second operand 5 states. [2019-01-12 15:24:25,897 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-12 15:24:26,100 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-12 15:24:26,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:24:26,788 INFO L93 Difference]: Finished difference Result 2232 states and 2821 transitions. [2019-01-12 15:24:26,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 15:24:26,789 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-01-12 15:24:26,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:24:26,796 INFO L225 Difference]: With dead ends: 2232 [2019-01-12 15:24:26,796 INFO L226 Difference]: Without dead ends: 1361 [2019-01-12 15:24:26,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 15:24:26,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2019-01-12 15:24:26,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 921. [2019-01-12 15:24:26,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2019-01-12 15:24:26,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1133 transitions. [2019-01-12 15:24:26,891 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1133 transitions. Word has length 68 [2019-01-12 15:24:26,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:24:26,891 INFO L480 AbstractCegarLoop]: Abstraction has 921 states and 1133 transitions. [2019-01-12 15:24:26,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:24:26,891 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1133 transitions. [2019-01-12 15:24:26,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-12 15:24:26,892 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:24:26,893 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:24:26,893 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:24:26,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:24:26,893 INFO L82 PathProgramCache]: Analyzing trace with hash 680531928, now seen corresponding path program 1 times [2019-01-12 15:24:26,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:24:26,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:24:26,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:26,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:24:26,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:24:26,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 15:24:26,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 15:24:26,981 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 15:24:27,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 03:24:27 BoogieIcfgContainer [2019-01-12 15:24:27,089 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 15:24:27,089 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 15:24:27,089 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 15:24:27,089 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 15:24:27,091 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:24:21" (3/4) ... [2019-01-12 15:24:27,095 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 15:24:27,250 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 15:24:27,250 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 15:24:27,252 INFO L168 Benchmark]: Toolchain (without parser) took 7537.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -124.1 MB). Peak memory consumption was 44.7 MB. Max. memory is 11.5 GB. [2019-01-12 15:24:27,254 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:24:27,255 INFO L168 Benchmark]: CACSL2BoogieTranslator took 400.96 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 935.2 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2019-01-12 15:24:27,255 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.61 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:24:27,256 INFO L168 Benchmark]: Boogie Preprocessor took 172.79 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 81.8 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -126.8 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2019-01-12 15:24:27,256 INFO L168 Benchmark]: RCFGBuilder took 1081.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 33.8 MB). Peak memory consumption was 33.8 MB. Max. memory is 11.5 GB. [2019-01-12 15:24:27,257 INFO L168 Benchmark]: TraceAbstraction took 5639.86 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 87.0 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -57.0 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. [2019-01-12 15:24:27,259 INFO L168 Benchmark]: Witness Printer took 161.04 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.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. [2019-01-12 15:24:27,264 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 400.96 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 935.2 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.61 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 172.79 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 81.8 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -126.8 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1081.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 33.8 MB). Peak memory consumption was 33.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5639.86 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 87.0 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -57.0 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. * Witness Printer took 161.04 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.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 11]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L15] int m_pc = 0; [L16] int t1_pc = 0; [L17] int m_st ; [L18] int t1_st ; [L19] int m_i ; [L20] int t1_i ; [L21] int M_E = 2; [L22] int T1_E = 2; [L23] int E_1 = 2; VAL [E_1=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0] [L439] int __retres1 ; [L354] m_i = 1 [L355] t1_i = 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L380] int kernel_st ; [L381] int tmp ; [L382] int tmp___0 ; [L386] kernel_st = 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L151] COND TRUE m_i == 1 [L152] m_st = 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L156] COND TRUE t1_i == 1 [L157] t1_st = 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L240] COND FALSE !(M_E == 0) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L245] COND FALSE !(T1_E == 0) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L250] COND FALSE !(E_1 == 0) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L283] int tmp ; [L284] int tmp___0 ; [L102] int __retres1 ; VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L105] COND FALSE !(m_pc == 1) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L115] __retres1 = 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L117] return (__retres1); VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L288] tmp = is_master_triggered() [L290] COND FALSE !(\read(tmp)) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L121] int __retres1 ; VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L124] COND FALSE !(t1_pc == 1) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L134] __retres1 = 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L136] return (__retres1); VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L296] tmp___0 = is_transmit1_triggered() [L298] COND FALSE !(\read(tmp___0)) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L263] COND FALSE !(M_E == 1) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L268] COND FALSE !(T1_E == 1) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L273] COND FALSE !(E_1 == 1) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L394] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L397] kernel_st = 1 [L187] int tmp ; VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L191] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L166] int __retres1 ; VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L169] COND TRUE m_st == 0 [L170] __retres1 = 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L182] return (__retres1); VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L194] tmp = exists_runnable_thread() [L196] COND TRUE \read(tmp) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L201] COND TRUE m_st == 0 [L202] int tmp_ndt_1; [L203] tmp_ndt_1 = __VERIFIER_nondet_int() [L204] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L215] COND TRUE t1_st == 0 [L216] int tmp_ndt_2; [L217] tmp_ndt_2 = __VERIFIER_nondet_int() [L218] COND TRUE \read(tmp_ndt_2) [L220] t1_st = 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L72] COND TRUE t1_pc == 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L83] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L85] t1_pc = 1 [L86] t1_st = 2 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L191] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L166] int __retres1 ; VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L169] COND TRUE m_st == 0 [L170] __retres1 = 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L182] return (__retres1); VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L194] tmp = exists_runnable_thread() [L196] COND TRUE \read(tmp) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L201] COND TRUE m_st == 0 [L202] int tmp_ndt_1; [L203] tmp_ndt_1 = __VERIFIER_nondet_int() [L204] COND TRUE \read(tmp_ndt_1) [L206] m_st = 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L31] COND TRUE m_pc == 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L42] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L45] E_1 = 1 [L283] int tmp ; [L284] int tmp___0 ; [L102] int __retres1 ; VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L105] COND FALSE !(m_pc == 1) VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L115] __retres1 = 0 VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L117] return (__retres1); VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L288] tmp = is_master_triggered() [L290] COND FALSE !(\read(tmp)) VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L121] int __retres1 ; VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L124] COND TRUE t1_pc == 1 VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L125] COND TRUE E_1 == 1 [L126] __retres1 = 1 VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L136] return (__retres1); VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L296] tmp___0 = is_transmit1_triggered() [L298] COND TRUE \read(tmp___0) [L299] t1_st = 0 VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L47] E_1 = 2 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L50] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L52] m_pc = 1 [L53] m_st = 2 VAL [E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L215] COND TRUE t1_st == 0 [L216] int tmp_ndt_2; [L217] tmp_ndt_2 = __VERIFIER_nondet_int() [L218] COND TRUE \read(tmp_ndt_2) [L220] t1_st = 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L72] COND FALSE !(t1_pc == 0) VAL [E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L75] COND TRUE t1_pc == 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L11] __VERIFIER_error() VAL [E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 122 locations, 1 error locations. UNSAFE Result, 5.5s OverallTime, 10 OverallIterations, 2 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1554 SDtfs, 1693 SDslu, 1435 SDs, 0 SdLazy, 165 SolverSat, 70 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=921occurred 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.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 1511 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 478 NumberOfCodeBlocks, 478 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 401 ConstructedInterpolants, 0 QuantifiedInterpolants, 28171 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 33/33 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...