./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem01_label19_true-unreach-call_false-termination.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/eca-rers2012/Problem01_label19_true-unreach-call_false-termination.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 1dbe756481135ac1d54a76a4eed07fd2745a9deb ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-30 19:41:02,575 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 19:41:02,577 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 19:41:02,594 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 19:41:02,595 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 19:41:02,597 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 19:41:02,598 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 19:41:02,602 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 19:41:02,604 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 19:41:02,607 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 19:41:02,610 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 19:41:02,611 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 19:41:02,612 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 19:41:02,613 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 19:41:02,614 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 19:41:02,614 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 19:41:02,618 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 19:41:02,623 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 19:41:02,629 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 19:41:02,630 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 19:41:02,631 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 19:41:02,638 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 19:41:02,640 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 19:41:02,641 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 19:41:02,641 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 19:41:02,642 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 19:41:02,644 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 19:41:02,645 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 19:41:02,645 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 19:41:02,647 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 19:41:02,647 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 19:41:02,648 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 19:41:02,648 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 19:41:02,648 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 19:41:02,650 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 19:41:02,650 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 19:41:02,651 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-30 19:41:02,667 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 19:41:02,667 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 19:41:02,668 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 19:41:02,669 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 19:41:02,669 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 19:41:02,669 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 19:41:02,670 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 19:41:02,670 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 19:41:02,670 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 19:41:02,670 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 19:41:02,670 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 19:41:02,670 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 19:41:02,671 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 19:41:02,671 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 19:41:02,671 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 19:41:02,671 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 19:41:02,671 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 19:41:02,671 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 19:41:02,673 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 19:41:02,673 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 19:41:02,674 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 19:41:02,674 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 19:41:02,674 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 19:41:02,674 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 19:41:02,675 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 19:41:02,675 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 19:41:02,675 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 19:41:02,675 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 19:41:02,675 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 -> 1dbe756481135ac1d54a76a4eed07fd2745a9deb [2018-12-30 19:41:02,722 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 19:41:02,744 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 19:41:02,751 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 19:41:02,753 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 19:41:02,754 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 19:41:02,756 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem01_label19_true-unreach-call_false-termination.c [2018-12-30 19:41:02,827 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e96fb6946/3af4cb3e0f2c4a0f89cb5b3fe10e0b00/FLAG76a85f613 [2018-12-30 19:41:03,404 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 19:41:03,405 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem01_label19_true-unreach-call_false-termination.c [2018-12-30 19:41:03,427 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e96fb6946/3af4cb3e0f2c4a0f89cb5b3fe10e0b00/FLAG76a85f613 [2018-12-30 19:41:03,645 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e96fb6946/3af4cb3e0f2c4a0f89cb5b3fe10e0b00 [2018-12-30 19:41:03,649 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 19:41:03,651 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 19:41:03,652 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 19:41:03,652 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 19:41:03,656 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 19:41:03,657 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 07:41:03" (1/1) ... [2018-12-30 19:41:03,661 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bbc90c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:03, skipping insertion in model container [2018-12-30 19:41:03,661 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 07:41:03" (1/1) ... [2018-12-30 19:41:03,669 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 19:41:03,738 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 19:41:04,225 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 19:41:04,238 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 19:41:04,430 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 19:41:04,448 INFO L195 MainTranslator]: Completed translation [2018-12-30 19:41:04,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:04 WrapperNode [2018-12-30 19:41:04,449 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 19:41:04,450 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 19:41:04,450 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 19:41:04,450 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 19:41:04,458 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:04" (1/1) ... [2018-12-30 19:41:04,477 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:04" (1/1) ... [2018-12-30 19:41:04,635 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 19:41:04,636 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 19:41:04,636 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 19:41:04,636 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 19:41:04,647 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:04" (1/1) ... [2018-12-30 19:41:04,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:04" (1/1) ... [2018-12-30 19:41:04,652 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:04" (1/1) ... [2018-12-30 19:41:04,653 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:04" (1/1) ... [2018-12-30 19:41:04,677 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:04" (1/1) ... [2018-12-30 19:41:04,691 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:04" (1/1) ... [2018-12-30 19:41:04,700 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:04" (1/1) ... [2018-12-30 19:41:04,721 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 19:41:04,721 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 19:41:04,722 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 19:41:04,722 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 19:41:04,725 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:04" (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-30 19:41:04,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 19:41:04,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 19:41:08,093 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 19:41:08,094 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-30 19:41:08,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 07:41:08 BoogieIcfgContainer [2018-12-30 19:41:08,097 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 19:41:08,099 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 19:41:08,099 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 19:41:08,103 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 19:41:08,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 07:41:03" (1/3) ... [2018-12-30 19:41:08,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b570ce0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 07:41:08, skipping insertion in model container [2018-12-30 19:41:08,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:04" (2/3) ... [2018-12-30 19:41:08,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b570ce0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 07:41:08, skipping insertion in model container [2018-12-30 19:41:08,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 07:41:08" (3/3) ... [2018-12-30 19:41:08,111 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label19_true-unreach-call_false-termination.c [2018-12-30 19:41:08,125 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 19:41:08,138 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 19:41:08,161 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 19:41:08,216 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 19:41:08,217 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 19:41:08,217 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 19:41:08,217 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 19:41:08,217 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 19:41:08,218 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 19:41:08,219 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 19:41:08,219 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 19:41:08,219 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 19:41:08,260 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2018-12-30 19:41:08,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-30 19:41:08,275 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:41:08,277 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 19:41:08,283 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:41:08,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:41:08,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1118209127, now seen corresponding path program 1 times [2018-12-30 19:41:08,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:41:08,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:41:08,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:08,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:08,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:08,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:41:08,904 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-12-30 19:41:08,937 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-30 19:41:08,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:41:08,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 19:41:08,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 19:41:08,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 19:41:08,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:41:08,966 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2018-12-30 19:41:11,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:41:11,685 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2018-12-30 19:41:11,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 19:41:11,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2018-12-30 19:41:11,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:41:11,710 INFO L225 Difference]: With dead ends: 662 [2018-12-30 19:41:11,710 INFO L226 Difference]: Without dead ends: 397 [2018-12-30 19:41:11,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:41:11,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-12-30 19:41:11,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2018-12-30 19:41:11,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-12-30 19:41:11,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 559 transitions. [2018-12-30 19:41:11,837 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 559 transitions. Word has length 86 [2018-12-30 19:41:11,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:41:11,837 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 559 transitions. [2018-12-30 19:41:11,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 19:41:11,840 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 559 transitions. [2018-12-30 19:41:11,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-30 19:41:11,847 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:41:11,848 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:41:11,848 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:41:11,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:41:11,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1535713217, now seen corresponding path program 1 times [2018-12-30 19:41:11,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:41:11,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:41:11,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:11,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:11,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:11,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:41:12,030 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 19:41:12,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:41:12,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 19:41:12,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 19:41:12,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 19:41:12,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:41:12,034 INFO L87 Difference]: Start difference. First operand 397 states and 559 transitions. Second operand 4 states. [2018-12-30 19:41:13,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:41:13,185 INFO L93 Difference]: Finished difference Result 1185 states and 1672 transitions. [2018-12-30 19:41:13,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:41:13,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-30 19:41:13,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:41:13,193 INFO L225 Difference]: With dead ends: 1185 [2018-12-30 19:41:13,193 INFO L226 Difference]: Without dead ends: 790 [2018-12-30 19:41:13,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:41:13,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2018-12-30 19:41:13,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2018-12-30 19:41:13,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2018-12-30 19:41:13,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1066 transitions. [2018-12-30 19:41:13,235 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1066 transitions. Word has length 91 [2018-12-30 19:41:13,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:41:13,235 INFO L480 AbstractCegarLoop]: Abstraction has 790 states and 1066 transitions. [2018-12-30 19:41:13,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 19:41:13,236 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1066 transitions. [2018-12-30 19:41:13,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-30 19:41:13,248 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:41:13,248 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:41:13,248 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:41:13,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:41:13,249 INFO L82 PathProgramCache]: Analyzing trace with hash -391670679, now seen corresponding path program 1 times [2018-12-30 19:41:13,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:41:13,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:41:13,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:13,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:13,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:13,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:41:13,377 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-30 19:41:13,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:41:13,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 19:41:13,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 19:41:13,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 19:41:13,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:41:13,378 INFO L87 Difference]: Start difference. First operand 790 states and 1066 transitions. Second operand 3 states. [2018-12-30 19:41:14,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:41:14,400 INFO L93 Difference]: Finished difference Result 1971 states and 2686 transitions. [2018-12-30 19:41:14,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:41:14,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2018-12-30 19:41:14,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:41:14,407 INFO L225 Difference]: With dead ends: 1971 [2018-12-30 19:41:14,407 INFO L226 Difference]: Without dead ends: 1183 [2018-12-30 19:41:14,409 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-30 19:41:14,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2018-12-30 19:41:14,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 921. [2018-12-30 19:41:14,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2018-12-30 19:41:14,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1246 transitions. [2018-12-30 19:41:14,452 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1246 transitions. Word has length 112 [2018-12-30 19:41:14,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:41:14,452 INFO L480 AbstractCegarLoop]: Abstraction has 921 states and 1246 transitions. [2018-12-30 19:41:14,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 19:41:14,452 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1246 transitions. [2018-12-30 19:41:14,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-30 19:41:14,461 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:41:14,461 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:41:14,462 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:41:14,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:41:14,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1405764788, now seen corresponding path program 1 times [2018-12-30 19:41:14,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:41:14,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:41:14,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:14,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:14,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:14,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:41:14,671 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-12-30 19:41:14,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:41:14,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 19:41:14,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 19:41:14,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 19:41:14,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:41:14,674 INFO L87 Difference]: Start difference. First operand 921 states and 1246 transitions. Second operand 3 states. [2018-12-30 19:41:16,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:41:16,260 INFO L93 Difference]: Finished difference Result 2233 states and 2997 transitions. [2018-12-30 19:41:16,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:41:16,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2018-12-30 19:41:16,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:41:16,269 INFO L225 Difference]: With dead ends: 2233 [2018-12-30 19:41:16,269 INFO L226 Difference]: Without dead ends: 1314 [2018-12-30 19:41:16,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:41:16,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2018-12-30 19:41:16,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1052. [2018-12-30 19:41:16,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2018-12-30 19:41:16,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1358 transitions. [2018-12-30 19:41:16,305 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1358 transitions. Word has length 148 [2018-12-30 19:41:16,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:41:16,306 INFO L480 AbstractCegarLoop]: Abstraction has 1052 states and 1358 transitions. [2018-12-30 19:41:16,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 19:41:16,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1358 transitions. [2018-12-30 19:41:16,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-30 19:41:16,311 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:41:16,312 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:41:16,312 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:41:16,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:41:16,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1778218692, now seen corresponding path program 1 times [2018-12-30 19:41:16,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:41:16,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:41:16,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:16,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:16,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:16,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:41:16,467 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-12-30 19:41:16,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:41:16,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 19:41:16,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 19:41:16,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 19:41:16,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:41:16,470 INFO L87 Difference]: Start difference. First operand 1052 states and 1358 transitions. Second operand 3 states. [2018-12-30 19:41:17,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:41:17,092 INFO L93 Difference]: Finished difference Result 2888 states and 3704 transitions. [2018-12-30 19:41:17,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:41:17,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2018-12-30 19:41:17,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:41:17,102 INFO L225 Difference]: With dead ends: 2888 [2018-12-30 19:41:17,102 INFO L226 Difference]: Without dead ends: 1838 [2018-12-30 19:41:17,104 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-30 19:41:17,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2018-12-30 19:41:17,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1576. [2018-12-30 19:41:17,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2018-12-30 19:41:17,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1990 transitions. [2018-12-30 19:41:17,137 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1990 transitions. Word has length 167 [2018-12-30 19:41:17,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:41:17,137 INFO L480 AbstractCegarLoop]: Abstraction has 1576 states and 1990 transitions. [2018-12-30 19:41:17,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 19:41:17,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1990 transitions. [2018-12-30 19:41:17,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-30 19:41:17,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:41:17,144 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:41:17,145 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:41:17,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:41:17,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1346782237, now seen corresponding path program 1 times [2018-12-30 19:41:17,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:41:17,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:41:17,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:17,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:17,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:17,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:41:17,289 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-12-30 19:41:17,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:41:17,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 19:41:17,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 19:41:17,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 19:41:17,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:41:17,290 INFO L87 Difference]: Start difference. First operand 1576 states and 1990 transitions. Second operand 3 states. [2018-12-30 19:41:17,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:41:17,771 INFO L93 Difference]: Finished difference Result 3412 states and 4294 transitions. [2018-12-30 19:41:17,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:41:17,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2018-12-30 19:41:17,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:41:17,780 INFO L225 Difference]: With dead ends: 3412 [2018-12-30 19:41:17,780 INFO L226 Difference]: Without dead ends: 1838 [2018-12-30 19:41:17,783 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-30 19:41:17,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2018-12-30 19:41:17,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2018-12-30 19:41:17,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2018-12-30 19:41:17,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2270 transitions. [2018-12-30 19:41:17,816 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2270 transitions. Word has length 170 [2018-12-30 19:41:17,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:41:17,817 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 2270 transitions. [2018-12-30 19:41:17,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 19:41:17,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2270 transitions. [2018-12-30 19:41:17,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-30 19:41:17,821 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:41:17,821 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:41:17,822 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:41:17,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:41:17,822 INFO L82 PathProgramCache]: Analyzing trace with hash 566709275, now seen corresponding path program 1 times [2018-12-30 19:41:17,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:41:17,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:41:17,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:17,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:17,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:41:18,298 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2018-12-30 19:41:18,418 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-12-30 19:41:18,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:41:18,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-30 19:41:18,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-30 19:41:18,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-30 19:41:18,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-30 19:41:18,421 INFO L87 Difference]: Start difference. First operand 1838 states and 2270 transitions. Second operand 8 states. [2018-12-30 19:41:19,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:41:19,717 INFO L93 Difference]: Finished difference Result 3841 states and 4711 transitions. [2018-12-30 19:41:19,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-30 19:41:19,719 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 174 [2018-12-30 19:41:19,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:41:19,727 INFO L225 Difference]: With dead ends: 3841 [2018-12-30 19:41:19,727 INFO L226 Difference]: Without dead ends: 2005 [2018-12-30 19:41:19,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-30 19:41:19,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2018-12-30 19:41:19,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 1838. [2018-12-30 19:41:19,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2018-12-30 19:41:19,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2258 transitions. [2018-12-30 19:41:19,763 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2258 transitions. Word has length 174 [2018-12-30 19:41:19,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:41:19,763 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 2258 transitions. [2018-12-30 19:41:19,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-30 19:41:19,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2258 transitions. [2018-12-30 19:41:19,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-12-30 19:41:19,769 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:41:19,769 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:41:19,769 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:41:19,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:41:19,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1728189589, now seen corresponding path program 1 times [2018-12-30 19:41:19,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:41:19,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:41:19,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:19,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:19,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:19,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:41:20,308 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 8 [2018-12-30 19:41:20,334 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-12-30 19:41:20,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:41:20,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 19:41:20,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 19:41:20,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 19:41:20,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:41:20,336 INFO L87 Difference]: Start difference. First operand 1838 states and 2258 transitions. Second operand 4 states. [2018-12-30 19:41:21,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:41:21,569 INFO L93 Difference]: Finished difference Result 3936 states and 4836 transitions. [2018-12-30 19:41:21,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 19:41:21,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 207 [2018-12-30 19:41:21,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:41:21,578 INFO L225 Difference]: With dead ends: 3936 [2018-12-30 19:41:21,578 INFO L226 Difference]: Without dead ends: 2100 [2018-12-30 19:41:21,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:41:21,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2018-12-30 19:41:21,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1969. [2018-12-30 19:41:21,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2018-12-30 19:41:21,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2323 transitions. [2018-12-30 19:41:21,615 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2323 transitions. Word has length 207 [2018-12-30 19:41:21,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:41:21,616 INFO L480 AbstractCegarLoop]: Abstraction has 1969 states and 2323 transitions. [2018-12-30 19:41:21,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 19:41:21,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2323 transitions. [2018-12-30 19:41:21,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-12-30 19:41:21,621 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:41:21,622 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-12-30 19:41:21,622 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:41:21,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:41:21,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1488900895, now seen corresponding path program 1 times [2018-12-30 19:41:21,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:41:21,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:41:21,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:21,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:21,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:21,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:41:21,790 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-12-30 19:41:21,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:41:21,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 19:41:21,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 19:41:21,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 19:41:21,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:41:21,791 INFO L87 Difference]: Start difference. First operand 1969 states and 2323 transitions. Second operand 4 states. [2018-12-30 19:41:24,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:41:24,375 INFO L93 Difference]: Finished difference Result 4460 states and 5222 transitions. [2018-12-30 19:41:24,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 19:41:24,376 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 233 [2018-12-30 19:41:24,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:41:24,387 INFO L225 Difference]: With dead ends: 4460 [2018-12-30 19:41:24,387 INFO L226 Difference]: Without dead ends: 2493 [2018-12-30 19:41:24,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:41:24,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2493 states. [2018-12-30 19:41:24,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2493 to 1969. [2018-12-30 19:41:24,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2018-12-30 19:41:24,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2311 transitions. [2018-12-30 19:41:24,433 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2311 transitions. Word has length 233 [2018-12-30 19:41:24,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:41:24,434 INFO L480 AbstractCegarLoop]: Abstraction has 1969 states and 2311 transitions. [2018-12-30 19:41:24,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 19:41:24,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2311 transitions. [2018-12-30 19:41:24,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-12-30 19:41:24,441 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:41:24,441 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-12-30 19:41:24,441 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:41:24,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:41:24,442 INFO L82 PathProgramCache]: Analyzing trace with hash -408615606, now seen corresponding path program 1 times [2018-12-30 19:41:24,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:41:24,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:41:24,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:24,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:24,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:24,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:41:24,934 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-12-30 19:41:25,181 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-12-30 19:41:25,442 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-12-30 19:41:25,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:41:25,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-30 19:41:25,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-30 19:41:25,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-30 19:41:25,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-30 19:41:25,444 INFO L87 Difference]: Start difference. First operand 1969 states and 2311 transitions. Second operand 6 states. [2018-12-30 19:41:27,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:41:27,061 INFO L93 Difference]: Finished difference Result 4105 states and 4795 transitions. [2018-12-30 19:41:27,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 19:41:27,062 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 254 [2018-12-30 19:41:27,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:41:27,070 INFO L225 Difference]: With dead ends: 4105 [2018-12-30 19:41:27,070 INFO L226 Difference]: Without dead ends: 2138 [2018-12-30 19:41:27,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-30 19:41:27,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2018-12-30 19:41:27,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 1838. [2018-12-30 19:41:27,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2018-12-30 19:41:27,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2102 transitions. [2018-12-30 19:41:27,109 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2102 transitions. Word has length 254 [2018-12-30 19:41:27,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:41:27,109 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 2102 transitions. [2018-12-30 19:41:27,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-30 19:41:27,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2102 transitions. [2018-12-30 19:41:27,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-12-30 19:41:27,117 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:41:27,117 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:41:27,118 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:41:27,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:41:27,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1287995233, now seen corresponding path program 1 times [2018-12-30 19:41:27,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:41:27,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:41:27,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:27,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:27,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:27,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:41:27,567 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-30 19:41:27,988 WARN L181 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 13 [2018-12-30 19:41:28,493 WARN L181 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2018-12-30 19:41:29,367 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 351 proven. 8 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-12-30 19:41:29,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 19:41:29,368 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 19:41:29,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:29,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:41:29,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 19:41:29,623 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2018-12-30 19:41:29,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 19:41:29,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2018-12-30 19:41:29,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-30 19:41:29,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-30 19:41:29,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2018-12-30 19:41:29,657 INFO L87 Difference]: Start difference. First operand 1838 states and 2102 transitions. Second operand 14 states. [2018-12-30 19:41:32,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:41:32,811 INFO L93 Difference]: Finished difference Result 3982 states and 4525 transitions. [2018-12-30 19:41:32,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-30 19:41:32,813 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 276 [2018-12-30 19:41:32,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:41:32,814 INFO L225 Difference]: With dead ends: 3982 [2018-12-30 19:41:32,814 INFO L226 Difference]: Without dead ends: 0 [2018-12-30 19:41:32,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 277 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=175, Invalid=245, Unknown=0, NotChecked=0, Total=420 [2018-12-30 19:41:32,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-30 19:41:32,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-30 19:41:32,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-30 19:41:32,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-30 19:41:32,818 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 276 [2018-12-30 19:41:32,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:41:32,819 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-30 19:41:32,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-30 19:41:32,819 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-30 19:41:32,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-30 19:41:32,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-30 19:41:32,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:41:32,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:41:32,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:41:32,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:41:32,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:41:32,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:41:32,975 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 102 [2018-12-30 19:41:32,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:41:33,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:41:33,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:41:33,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:41:33,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:41:33,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:41:33,128 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 101 [2018-12-30 19:41:34,003 WARN L181 SmtUtils]: Spent 872.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 53 [2018-12-30 19:41:34,495 WARN L181 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 53 [2018-12-30 19:41:34,498 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-12-30 19:41:34,498 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-12-30 19:41:34,498 INFO L448 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,498 INFO L448 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,498 INFO L448 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,498 INFO L448 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,498 INFO L448 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,498 INFO L448 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,498 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-12-30 19:41:34,499 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-12-30 19:41:34,499 INFO L448 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-12-30 19:41:34,499 INFO L448 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-12-30 19:41:34,499 INFO L448 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-12-30 19:41:34,499 INFO L448 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-12-30 19:41:34,499 INFO L448 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-12-30 19:41:34,499 INFO L448 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-12-30 19:41:34,499 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-12-30 19:41:34,499 INFO L448 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-12-30 19:41:34,499 INFO L448 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,499 INFO L448 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,499 INFO L448 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,500 INFO L448 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,500 INFO L448 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,500 INFO L448 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,500 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-12-30 19:41:34,500 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-12-30 19:41:34,500 INFO L448 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-12-30 19:41:34,500 INFO L448 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-12-30 19:41:34,500 INFO L448 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-12-30 19:41:34,500 INFO L448 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-12-30 19:41:34,500 INFO L448 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-12-30 19:41:34,500 INFO L448 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-12-30 19:41:34,504 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-12-30 19:41:34,504 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-12-30 19:41:34,504 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-12-30 19:41:34,504 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-12-30 19:41:34,504 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-12-30 19:41:34,504 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-12-30 19:41:34,504 INFO L448 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-12-30 19:41:34,504 INFO L448 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,505 INFO L448 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,505 INFO L448 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,505 INFO L448 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,505 INFO L448 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,505 INFO L448 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-12-30 19:41:34,505 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-12-30 19:41:34,505 INFO L448 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-12-30 19:41:34,505 INFO L448 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-12-30 19:41:34,505 INFO L448 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-12-30 19:41:34,505 INFO L448 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-12-30 19:41:34,505 INFO L448 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-12-30 19:41:34,506 INFO L448 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-12-30 19:41:34,506 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-12-30 19:41:34,506 INFO L444 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse4 (= ~a7~0 1)) (.cse11 (= ~a16~0 6))) (let ((.cse0 (= ~a16~0 4)) (.cse6 (not .cse11)) (.cse5 (<= ~a21~0 0)) (.cse7 (= ~a8~0 13)) (.cse8 (<= ~a17~0 0)) (.cse2 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse9 (not .cse4)) (.cse3 (= ~a12~0 8)) (.cse1 (= ~a21~0 1))) (or (and (and .cse0 .cse1 (not .cse2)) .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse2 .cse3) (and (and .cse1 (= ~a16~0 5)) .cse3) (and .cse4 .cse5 .cse0 .cse7 .cse3 .cse8) (and .cse3 (and .cse9 .cse6 .cse2 .cse1)) (and .cse4 .cse5 .cse7 .cse3 .cse8 .cse10 .cse11 (or (= ULTIMATE.start_calculate_output_~input 2) (= ULTIMATE.start_calculate_output_~input 4) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input) (= ULTIMATE.start_calculate_output_~input 6))) (and (or (and .cse2 .cse1 .cse10) (and .cse9 .cse1 .cse10 .cse11)) .cse3) (and .cse9 (= ~a8~0 15) .cse3 .cse1 .cse11)))) [2018-12-30 19:41:34,506 INFO L448 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,507 INFO L448 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,507 INFO L448 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,507 INFO L448 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,507 INFO L448 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,507 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-12-30 19:41:34,507 INFO L448 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-12-30 19:41:34,507 INFO L448 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-12-30 19:41:34,507 INFO L448 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-12-30 19:41:34,507 INFO L448 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-12-30 19:41:34,507 INFO L448 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-12-30 19:41:34,507 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-12-30 19:41:34,507 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-12-30 19:41:34,508 INFO L448 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-12-30 19:41:34,513 INFO L448 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-12-30 19:41:34,513 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-12-30 19:41:34,513 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-12-30 19:41:34,513 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-12-30 19:41:34,513 INFO L451 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2018-12-30 19:41:34,513 INFO L448 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,513 INFO L448 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,513 INFO L448 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,516 INFO L448 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,516 INFO L448 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,516 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-12-30 19:41:34,516 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-12-30 19:41:34,516 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-12-30 19:41:34,516 INFO L448 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-12-30 19:41:34,516 INFO L448 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-12-30 19:41:34,516 INFO L448 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-12-30 19:41:34,516 INFO L448 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-12-30 19:41:34,517 INFO L448 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-12-30 19:41:34,519 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-12-30 19:41:34,519 INFO L448 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,519 INFO L448 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,519 INFO L448 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,519 INFO L448 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,519 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-12-30 19:41:34,520 INFO L448 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,520 INFO L448 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-12-30 19:41:34,520 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-12-30 19:41:34,520 INFO L448 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-12-30 19:41:34,520 INFO L448 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-12-30 19:41:34,520 INFO L448 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-12-30 19:41:34,520 INFO L448 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-12-30 19:41:34,520 INFO L448 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-12-30 19:41:34,520 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-30 19:41:34,520 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-12-30 19:41:34,520 INFO L448 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-12-30 19:41:34,520 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-12-30 19:41:34,520 INFO L448 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-12-30 19:41:34,520 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-12-30 19:41:34,520 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-12-30 19:41:34,520 INFO L448 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,521 INFO L444 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse4 (= ~a7~0 1)) (.cse11 (= ~a16~0 6))) (let ((.cse0 (= ~a16~0 4)) (.cse6 (not .cse11)) (.cse5 (<= ~a21~0 0)) (.cse7 (= ~a8~0 13)) (.cse8 (<= ~a17~0 0)) (.cse9 (not .cse4)) (.cse3 (= ~a12~0 8)) (.cse2 (= ~a17~0 1)) (.cse1 (= ~a21~0 1)) (.cse10 (= ~a20~0 1))) (or (and (and .cse0 .cse1 (not .cse2)) .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse2 .cse3) (and (and .cse1 (= ~a16~0 5)) .cse3) (and .cse4 .cse5 .cse0 .cse7 .cse3 .cse8) (and .cse3 (and .cse9 .cse6 .cse2 .cse1)) (and .cse4 .cse5 .cse7 .cse3 .cse8 .cse10 .cse11 (or (= ULTIMATE.start_calculate_output_~input 2) (= ULTIMATE.start_calculate_output_~input 4) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input) (= ULTIMATE.start_calculate_output_~input 6))) (and (and .cse9 .cse1 .cse10 .cse11) .cse3) (and .cse9 (= ~a8~0 15) .cse3 .cse1 .cse11) (and .cse3 (and .cse2 .cse1 .cse10))))) [2018-12-30 19:41:34,521 INFO L448 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,521 INFO L448 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,523 INFO L448 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,523 INFO L448 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,523 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-12-30 19:41:34,523 INFO L448 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-12-30 19:41:34,523 INFO L448 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-12-30 19:41:34,523 INFO L448 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-12-30 19:41:34,523 INFO L448 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-12-30 19:41:34,523 INFO L448 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-12-30 19:41:34,523 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-12-30 19:41:34,523 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-12-30 19:41:34,524 INFO L448 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,524 INFO L448 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,524 INFO L448 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,524 INFO L448 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,524 INFO L448 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,524 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-12-30 19:41:34,524 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-30 19:41:34,524 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-12-30 19:41:34,524 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-12-30 19:41:34,524 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-12-30 19:41:34,524 INFO L448 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-12-30 19:41:34,525 INFO L448 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-12-30 19:41:34,525 INFO L448 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-12-30 19:41:34,525 INFO L448 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-12-30 19:41:34,525 INFO L448 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-12-30 19:41:34,525 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-12-30 19:41:34,525 INFO L448 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-12-30 19:41:34,525 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-12-30 19:41:34,525 INFO L448 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,525 INFO L448 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,525 INFO L448 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,525 INFO L448 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,525 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-12-30 19:41:34,526 INFO L448 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,526 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,526 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-12-30 19:41:34,526 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-12-30 19:41:34,526 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-30 19:41:34,526 INFO L448 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-12-30 19:41:34,526 INFO L448 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-12-30 19:41:34,526 INFO L448 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-12-30 19:41:34,526 INFO L448 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-12-30 19:41:34,526 INFO L448 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-12-30 19:41:34,526 INFO L448 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-12-30 19:41:34,526 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-12-30 19:41:34,526 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-12-30 19:41:34,528 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 434) no Hoare annotation was computed. [2018-12-30 19:41:34,528 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-12-30 19:41:34,529 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-12-30 19:41:34,529 INFO L448 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,529 INFO L448 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,529 INFO L448 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,529 INFO L448 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,529 INFO L448 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,529 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-12-30 19:41:34,529 INFO L448 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,529 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-12-30 19:41:34,529 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-12-30 19:41:34,529 INFO L448 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-12-30 19:41:34,530 INFO L448 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-12-30 19:41:34,530 INFO L448 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-12-30 19:41:34,530 INFO L448 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-12-30 19:41:34,530 INFO L448 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-12-30 19:41:34,530 INFO L448 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-12-30 19:41:34,530 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-12-30 19:41:34,530 INFO L448 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-12-30 19:41:34,530 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-12-30 19:41:34,530 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-30 19:41:34,530 INFO L448 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-12-30 19:41:34,530 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-12-30 19:41:34,530 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-12-30 19:41:34,531 INFO L448 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,531 INFO L448 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,531 INFO L448 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,531 INFO L448 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,531 INFO L448 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,531 INFO L448 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:41:34,531 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-12-30 19:41:34,531 INFO L448 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-12-30 19:41:34,531 INFO L448 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-12-30 19:41:34,531 INFO L448 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-12-30 19:41:34,531 INFO L448 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-12-30 19:41:34,531 INFO L448 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-12-30 19:41:34,532 INFO L448 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-12-30 19:41:34,533 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-12-30 19:41:34,533 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-12-30 19:41:34,533 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-12-30 19:41:34,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 07:41:34 BoogieIcfgContainer [2018-12-30 19:41:34,573 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 19:41:34,574 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 19:41:34,574 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 19:41:34,574 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 19:41:34,575 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 07:41:08" (3/4) ... [2018-12-30 19:41:34,586 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-30 19:41:34,609 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-30 19:41:34,610 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-30 19:41:34,829 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 19:41:34,833 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 19:41:34,835 INFO L168 Benchmark]: Toolchain (without parser) took 31184.71 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 488.1 MB). Free memory was 951.4 MB in the beginning and 1.4 GB in the end (delta: -451.5 MB). Peak memory consumption was 36.6 MB. Max. memory is 11.5 GB. [2018-12-30 19:41:34,835 INFO L168 Benchmark]: CDTParser took 0.26 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-30 19:41:34,836 INFO L168 Benchmark]: CACSL2BoogieTranslator took 797.23 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 913.8 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2018-12-30 19:41:34,836 INFO L168 Benchmark]: Boogie Procedure Inliner took 185.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 913.8 MB in the beginning and 1.1 GB in the end (delta: -222.8 MB). Peak memory consumption was 17.3 MB. Max. memory is 11.5 GB. [2018-12-30 19:41:34,836 INFO L168 Benchmark]: Boogie Preprocessor took 85.52 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-30 19:41:34,838 INFO L168 Benchmark]: RCFGBuilder took 3375.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 105.0 MB). Peak memory consumption was 105.0 MB. Max. memory is 11.5 GB. [2018-12-30 19:41:34,839 INFO L168 Benchmark]: TraceAbstraction took 26474.66 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 338.2 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -391.2 MB). Peak memory consumption was 459.2 MB. Max. memory is 11.5 GB. [2018-12-30 19:41:34,839 INFO L168 Benchmark]: Witness Printer took 259.34 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2018-12-30 19:41:34,843 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.26 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 797.23 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 913.8 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 185.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 913.8 MB in the beginning and 1.1 GB in the end (delta: -222.8 MB). Peak memory consumption was 17.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 85.52 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. * RCFGBuilder took 3375.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 105.0 MB). Peak memory consumption was 105.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26474.66 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 338.2 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -391.2 MB). Peak memory consumption was 459.2 MB. Max. memory is 11.5 GB. * Witness Printer took 259.34 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 434]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((((a16 == 4 && a21 == 1) && !(a17 == 1)) && a12 == 8) || (((((a7 == 1 && a21 <= 0) && !(a16 == 6)) && a8 == 13) && a17 == 1) && a12 == 8)) || ((a21 == 1 && a16 == 5) && a12 == 8)) || (((((a7 == 1 && a21 <= 0) && a16 == 4) && a8 == 13) && a12 == 8) && a17 <= 0)) || (a12 == 8 && ((!(a7 == 1) && !(a16 == 6)) && a17 == 1) && a21 == 1)) || (((((((a7 == 1 && a21 <= 0) && a8 == 13) && a12 == 8) && a17 <= 0) && a20 == 1) && a16 == 6) && ((((input == 2 || input == 4) || 1 == input) || 5 == input) || input == 6))) || ((((a17 == 1 && a21 == 1) && a20 == 1) || (((!(a7 == 1) && a21 == 1) && a20 == 1) && a16 == 6)) && a12 == 8)) || ((((!(a7 == 1) && a8 == 15) && a12 == 8) && a21 == 1) && a16 == 6) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((a16 == 4 && a21 == 1) && !(a17 == 1)) && a12 == 8) || (((((a7 == 1 && a21 <= 0) && !(a16 == 6)) && a8 == 13) && a17 == 1) && a12 == 8)) || ((a21 == 1 && a16 == 5) && a12 == 8)) || (((((a7 == 1 && a21 <= 0) && a16 == 4) && a8 == 13) && a12 == 8) && a17 <= 0)) || (a12 == 8 && ((!(a7 == 1) && !(a16 == 6)) && a17 == 1) && a21 == 1)) || (((((((a7 == 1 && a21 <= 0) && a8 == 13) && a12 == 8) && a17 <= 0) && a20 == 1) && a16 == 6) && ((((input == 2 || input == 4) || 1 == input) || 5 == input) || input == 6))) || ((((!(a7 == 1) && a21 == 1) && a20 == 1) && a16 == 6) && a12 == 8)) || ((((!(a7 == 1) && a8 == 15) && a12 == 8) && a21 == 1) && a16 == 6)) || (a12 == 8 && (a17 == 1 && a21 == 1) && a20 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. SAFE Result, 26.3s OverallTime, 11 OverallIterations, 7 TraceHistogramMax, 17.6s AutomataDifference, 0.0s DeadEndRemovalTime, 1.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 783 SDtfs, 2689 SDslu, 148 SDs, 0 SdLazy, 7212 SolverSat, 970 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 338 GetRequests, 290 SyntacticMatches, 7 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1969occurred in iteration=8, 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, 11 MinimizatonAttempts, 1908 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 40 NumberOfFragments, 342 HoareAnnotationTreeSize, 3 FomulaSimplifications, 14482 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1983 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 2194 NumberOfCodeBlocks, 2194 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2182 ConstructedInterpolants, 0 QuantifiedInterpolants, 1565408 SizeOfPredicates, 1 NumberOfNonLiveVariables, 507 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 2711/2719 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...