java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label42.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 00:44:15,517 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 00:44:15,519 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 00:44:15,531 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 00:44:15,532 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 00:44:15,533 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 00:44:15,534 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 00:44:15,536 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 00:44:15,538 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 00:44:15,539 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 00:44:15,540 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 00:44:15,541 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 00:44:15,541 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 00:44:15,542 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 00:44:15,543 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 00:44:15,544 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 00:44:15,545 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 00:44:15,546 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 00:44:15,548 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 00:44:15,550 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 00:44:15,552 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 00:44:15,553 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 00:44:15,554 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 00:44:15,555 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 00:44:15,557 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 00:44:15,557 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 00:44:15,558 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 00:44:15,559 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 00:44:15,559 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 00:44:15,560 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 00:44:15,560 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 00:44:15,561 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 00:44:15,562 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 00:44:15,562 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 00:44:15,564 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 00:44:15,564 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 00:44:15,564 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 00:44:15,565 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 00:44:15,565 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 00:44:15,566 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 00:44:15,566 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 00:44:15,567 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 00:44:15,581 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 00:44:15,582 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 00:44:15,583 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 00:44:15,583 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 00:44:15,583 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 00:44:15,584 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 00:44:15,584 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 00:44:15,584 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 00:44:15,584 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 00:44:15,585 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 00:44:15,585 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 00:44:15,585 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 00:44:15,585 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 00:44:15,585 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 00:44:15,586 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 00:44:15,586 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 00:44:15,586 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 00:44:15,586 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 00:44:15,586 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 00:44:15,587 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 00:44:15,587 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 00:44:15,587 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 00:44:15,587 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 00:44:15,587 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 00:44:15,588 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 00:44:15,588 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 00:44:15,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 00:44:15,588 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 00:44:15,588 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 00:44:15,617 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 00:44:15,629 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 00:44:15,633 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 00:44:15,635 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 00:44:15,635 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 00:44:15,636 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label42.c [2019-10-02 00:44:15,696 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94f965242/361bc5b1094e4823ac8e6d88ecb8b300/FLAGcfd99be22 [2019-10-02 00:44:16,283 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 00:44:16,286 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label42.c [2019-10-02 00:44:16,302 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94f965242/361bc5b1094e4823ac8e6d88ecb8b300/FLAGcfd99be22 [2019-10-02 00:44:16,544 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94f965242/361bc5b1094e4823ac8e6d88ecb8b300 [2019-10-02 00:44:16,555 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 00:44:16,556 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 00:44:16,558 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 00:44:16,558 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 00:44:16,561 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 00:44:16,562 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:44:16" (1/1) ... [2019-10-02 00:44:16,565 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4af936d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:44:16, skipping insertion in model container [2019-10-02 00:44:16,566 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:44:16" (1/1) ... [2019-10-02 00:44:16,573 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 00:44:16,629 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 00:44:17,142 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 00:44:17,148 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 00:44:17,281 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 00:44:17,298 INFO L192 MainTranslator]: Completed translation [2019-10-02 00:44:17,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:44:17 WrapperNode [2019-10-02 00:44:17,299 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 00:44:17,300 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 00:44:17,300 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 00:44:17,300 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 00:44:17,311 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:44:17" (1/1) ... [2019-10-02 00:44:17,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:44:17" (1/1) ... [2019-10-02 00:44:17,335 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:44:17" (1/1) ... [2019-10-02 00:44:17,336 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:44:17" (1/1) ... [2019-10-02 00:44:17,378 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:44:17" (1/1) ... [2019-10-02 00:44:17,397 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:44:17" (1/1) ... [2019-10-02 00:44:17,406 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:44:17" (1/1) ... [2019-10-02 00:44:17,412 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 00:44:17,412 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 00:44:17,412 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 00:44:17,413 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 00:44:17,414 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:44:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 00:44:17,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 00:44:17,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 00:44:17,468 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 00:44:17,468 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 00:44:17,469 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 00:44:17,469 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 00:44:17,469 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 00:44:17,469 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 00:44:17,469 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 00:44:17,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 00:44:17,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 00:44:18,631 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 00:44:18,631 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 00:44:18,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:44:18 BoogieIcfgContainer [2019-10-02 00:44:18,633 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 00:44:18,634 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 00:44:18,634 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 00:44:18,638 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 00:44:18,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:44:16" (1/3) ... [2019-10-02 00:44:18,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fd94ade and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:44:18, skipping insertion in model container [2019-10-02 00:44:18,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:44:17" (2/3) ... [2019-10-02 00:44:18,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fd94ade and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:44:18, skipping insertion in model container [2019-10-02 00:44:18,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:44:18" (3/3) ... [2019-10-02 00:44:18,642 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label42.c [2019-10-02 00:44:18,652 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 00:44:18,660 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 00:44:18,679 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 00:44:18,716 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 00:44:18,717 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 00:44:18,717 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 00:44:18,717 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 00:44:18,717 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 00:44:18,717 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 00:44:18,718 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 00:44:18,718 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 00:44:18,718 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 00:44:18,744 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states. [2019-10-02 00:44:18,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-02 00:44:18,757 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:44:18,759 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:44:18,761 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:44:18,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:44:18,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1328102103, now seen corresponding path program 1 times [2019-10-02 00:44:18,769 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:44:18,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:44:18,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:44:18,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:44:18,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:44:19,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:44:19,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:44:19,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:44:19,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 00:44:19,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 00:44:19,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 00:44:19,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 00:44:19,355 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 3 states. [2019-10-02 00:44:20,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:44:20,292 INFO L93 Difference]: Finished difference Result 547 states and 938 transitions. [2019-10-02 00:44:20,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 00:44:20,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-10-02 00:44:20,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:44:20,316 INFO L225 Difference]: With dead ends: 547 [2019-10-02 00:44:20,316 INFO L226 Difference]: Without dead ends: 278 [2019-10-02 00:44:20,322 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 00:44:20,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-10-02 00:44:20,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2019-10-02 00:44:20,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-10-02 00:44:20,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 394 transitions. [2019-10-02 00:44:20,406 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 394 transitions. Word has length 121 [2019-10-02 00:44:20,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:44:20,408 INFO L475 AbstractCegarLoop]: Abstraction has 278 states and 394 transitions. [2019-10-02 00:44:20,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 00:44:20,408 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 394 transitions. [2019-10-02 00:44:20,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-02 00:44:20,413 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:44:20,413 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:44:20,413 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:44:20,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:44:20,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1654189344, now seen corresponding path program 1 times [2019-10-02 00:44:20,414 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:44:20,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:44:20,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:44:20,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:44:20,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:44:20,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:44:20,541 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:44:20,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:44:20,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 00:44:20,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 00:44:20,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 00:44:20,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 00:44:20,544 INFO L87 Difference]: Start difference. First operand 278 states and 394 transitions. Second operand 6 states. [2019-10-02 00:44:21,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:44:21,337 INFO L93 Difference]: Finished difference Result 840 states and 1222 transitions. [2019-10-02 00:44:21,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 00:44:21,341 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2019-10-02 00:44:21,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:44:21,349 INFO L225 Difference]: With dead ends: 840 [2019-10-02 00:44:21,349 INFO L226 Difference]: Without dead ends: 568 [2019-10-02 00:44:21,351 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 00:44:21,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-10-02 00:44:21,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 556. [2019-10-02 00:44:21,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2019-10-02 00:44:21,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 785 transitions. [2019-10-02 00:44:21,399 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 785 transitions. Word has length 131 [2019-10-02 00:44:21,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:44:21,399 INFO L475 AbstractCegarLoop]: Abstraction has 556 states and 785 transitions. [2019-10-02 00:44:21,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 00:44:21,400 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 785 transitions. [2019-10-02 00:44:21,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-02 00:44:21,404 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:44:21,404 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:44:21,405 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:44:21,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:44:21,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1456847330, now seen corresponding path program 1 times [2019-10-02 00:44:21,405 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:44:21,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:44:21,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:44:21,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:44:21,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:44:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:44:21,734 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:44:21,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:44:21,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 00:44:21,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 00:44:21,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 00:44:21,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:44:21,736 INFO L87 Difference]: Start difference. First operand 556 states and 785 transitions. Second operand 5 states. [2019-10-02 00:44:22,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:44:22,393 INFO L93 Difference]: Finished difference Result 1205 states and 1730 transitions. [2019-10-02 00:44:22,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 00:44:22,393 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2019-10-02 00:44:22,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:44:22,398 INFO L225 Difference]: With dead ends: 1205 [2019-10-02 00:44:22,398 INFO L226 Difference]: Without dead ends: 554 [2019-10-02 00:44:22,400 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:44:22,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-10-02 00:44:22,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2019-10-02 00:44:22,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2019-10-02 00:44:22,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 712 transitions. [2019-10-02 00:44:22,429 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 712 transitions. Word has length 132 [2019-10-02 00:44:22,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:44:22,430 INFO L475 AbstractCegarLoop]: Abstraction has 554 states and 712 transitions. [2019-10-02 00:44:22,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 00:44:22,430 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 712 transitions. [2019-10-02 00:44:22,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-02 00:44:22,433 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:44:22,434 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:44:22,434 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:44:22,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:44:22,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1679080988, now seen corresponding path program 1 times [2019-10-02 00:44:22,435 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:44:22,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:44:22,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:44:22,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:44:22,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:44:22,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:44:22,758 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:44:22,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:44:22,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 00:44:22,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 00:44:22,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 00:44:22,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:44:22,759 INFO L87 Difference]: Start difference. First operand 554 states and 712 transitions. Second operand 5 states. [2019-10-02 00:44:23,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:44:23,301 INFO L93 Difference]: Finished difference Result 1184 states and 1552 transitions. [2019-10-02 00:44:23,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 00:44:23,301 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-10-02 00:44:23,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:44:23,305 INFO L225 Difference]: With dead ends: 1184 [2019-10-02 00:44:23,305 INFO L226 Difference]: Without dead ends: 554 [2019-10-02 00:44:23,307 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:44:23,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-10-02 00:44:23,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2019-10-02 00:44:23,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2019-10-02 00:44:23,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 708 transitions. [2019-10-02 00:44:23,329 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 708 transitions. Word has length 133 [2019-10-02 00:44:23,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:44:23,329 INFO L475 AbstractCegarLoop]: Abstraction has 554 states and 708 transitions. [2019-10-02 00:44:23,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 00:44:23,329 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 708 transitions. [2019-10-02 00:44:23,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-02 00:44:23,332 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:44:23,333 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:44:23,333 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:44:23,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:44:23,333 INFO L82 PathProgramCache]: Analyzing trace with hash 982548902, now seen corresponding path program 1 times [2019-10-02 00:44:23,334 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:44:23,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:44:23,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:44:23,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:44:23,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:44:23,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:44:23,442 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:44:23,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:44:23,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 00:44:23,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 00:44:23,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 00:44:23,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 00:44:23,445 INFO L87 Difference]: Start difference. First operand 554 states and 708 transitions. Second operand 3 states. [2019-10-02 00:44:23,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:44:23,907 INFO L93 Difference]: Finished difference Result 1509 states and 1954 transitions. [2019-10-02 00:44:23,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 00:44:23,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-10-02 00:44:23,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:44:23,914 INFO L225 Difference]: With dead ends: 1509 [2019-10-02 00:44:23,914 INFO L226 Difference]: Without dead ends: 961 [2019-10-02 00:44:23,915 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 00:44:23,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2019-10-02 00:44:23,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 959. [2019-10-02 00:44:23,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 959 states. [2019-10-02 00:44:23,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1180 transitions. [2019-10-02 00:44:23,945 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1180 transitions. Word has length 136 [2019-10-02 00:44:23,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:44:23,946 INFO L475 AbstractCegarLoop]: Abstraction has 959 states and 1180 transitions. [2019-10-02 00:44:23,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 00:44:23,946 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1180 transitions. [2019-10-02 00:44:23,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-02 00:44:23,950 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:44:23,950 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:44:23,951 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:44:23,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:44:23,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1610616599, now seen corresponding path program 1 times [2019-10-02 00:44:23,951 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:44:23,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:44:23,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:44:23,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:44:23,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:44:23,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:44:24,062 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 53 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:44:24,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:44:24,062 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:44:24,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:44:24,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:44:24,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 00:44:24,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:44:24,337 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 24 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 00:44:24,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:44:24,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-10-02 00:44:24,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 00:44:24,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 00:44:24,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 00:44:24,354 INFO L87 Difference]: Start difference. First operand 959 states and 1180 transitions. Second operand 8 states. [2019-10-02 00:44:26,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:44:26,161 INFO L93 Difference]: Finished difference Result 2965 states and 3999 transitions. [2019-10-02 00:44:26,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 00:44:26,161 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 167 [2019-10-02 00:44:26,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:44:26,175 INFO L225 Difference]: With dead ends: 2965 [2019-10-02 00:44:26,175 INFO L226 Difference]: Without dead ends: 2012 [2019-10-02 00:44:26,178 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2019-10-02 00:44:26,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2012 states. [2019-10-02 00:44:26,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2012 to 1275. [2019-10-02 00:44:26,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1275 states. [2019-10-02 00:44:26,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1568 transitions. [2019-10-02 00:44:26,241 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1568 transitions. Word has length 167 [2019-10-02 00:44:26,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:44:26,241 INFO L475 AbstractCegarLoop]: Abstraction has 1275 states and 1568 transitions. [2019-10-02 00:44:26,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 00:44:26,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1568 transitions. [2019-10-02 00:44:26,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-02 00:44:26,247 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:44:26,247 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 00:44:26,248 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:44:26,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:44:26,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1399651525, now seen corresponding path program 1 times [2019-10-02 00:44:26,248 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:44:26,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:44:26,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:44:26,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:44:26,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:44:26,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:44:26,392 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 66 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:44:26,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:44:26,392 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:44:26,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:44:26,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:44:26,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 00:44:26,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:44:26,554 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-02 00:44:26,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 00:44:26,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-10-02 00:44:26,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 00:44:26,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 00:44:26,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 00:44:26,560 INFO L87 Difference]: Start difference. First operand 1275 states and 1568 transitions. Second operand 7 states. [2019-10-02 00:44:27,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:44:27,962 INFO L93 Difference]: Finished difference Result 4250 states and 5489 transitions. [2019-10-02 00:44:27,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 00:44:27,962 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 187 [2019-10-02 00:44:27,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:44:27,963 INFO L225 Difference]: With dead ends: 4250 [2019-10-02 00:44:27,964 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 00:44:27,974 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-10-02 00:44:27,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 00:44:27,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 00:44:27,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 00:44:27,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 00:44:27,975 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 187 [2019-10-02 00:44:27,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:44:27,976 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 00:44:27,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 00:44:27,976 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 00:44:27,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 00:44:27,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 00:44:28,827 WARN L191 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 62 [2019-10-02 00:44:29,005 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 00:44:29,005 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a17~0 |old(~a17~0)|) (<= ~a21~0 |old(~a21~0)|) (= ~a16~0 |old(~a16~0)|) (= ~a20~0 |old(~a20~0)|)) [2019-10-02 00:44:29,005 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 00:44:29,005 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-10-02 00:44:29,005 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-10-02 00:44:29,006 INFO L443 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,006 INFO L443 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,006 INFO L443 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,006 INFO L443 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,006 INFO L443 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,006 INFO L443 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,006 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-10-02 00:44:29,006 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-10-02 00:44:29,007 INFO L443 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-10-02 00:44:29,007 INFO L443 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-10-02 00:44:29,007 INFO L443 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-10-02 00:44:29,007 INFO L443 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-10-02 00:44:29,007 INFO L443 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-10-02 00:44:29,007 INFO L443 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-10-02 00:44:29,007 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-10-02 00:44:29,007 INFO L443 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-10-02 00:44:29,008 INFO L443 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,008 INFO L443 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,008 INFO L443 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,008 INFO L443 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,008 INFO L443 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,009 INFO L443 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,011 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-10-02 00:44:29,011 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-10-02 00:44:29,011 INFO L443 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-10-02 00:44:29,011 INFO L443 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-10-02 00:44:29,011 INFO L443 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-10-02 00:44:29,011 INFO L443 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-10-02 00:44:29,011 INFO L443 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-10-02 00:44:29,012 INFO L443 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-10-02 00:44:29,012 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-10-02 00:44:29,012 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-10-02 00:44:29,012 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-10-02 00:44:29,012 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-10-02 00:44:29,013 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-10-02 00:44:29,013 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-10-02 00:44:29,013 INFO L443 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-10-02 00:44:29,013 INFO L443 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,014 INFO L443 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,014 INFO L443 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,014 INFO L443 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,014 INFO L443 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,014 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-10-02 00:44:29,014 INFO L443 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-10-02 00:44:29,014 INFO L443 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-10-02 00:44:29,014 INFO L443 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-10-02 00:44:29,015 INFO L443 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-10-02 00:44:29,015 INFO L443 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-10-02 00:44:29,015 INFO L443 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-10-02 00:44:29,015 INFO L443 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-10-02 00:44:29,015 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-10-02 00:44:29,015 INFO L443 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,015 INFO L443 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,015 INFO L443 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,015 INFO L443 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,016 INFO L443 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,016 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-10-02 00:44:29,016 INFO L443 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-10-02 00:44:29,016 INFO L443 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-10-02 00:44:29,016 INFO L443 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-10-02 00:44:29,016 INFO L443 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-10-02 00:44:29,016 INFO L443 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-10-02 00:44:29,016 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-10-02 00:44:29,017 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-10-02 00:44:29,017 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-10-02 00:44:29,017 INFO L443 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-10-02 00:44:29,017 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-10-02 00:44:29,017 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-10-02 00:44:29,017 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-10-02 00:44:29,017 INFO L443 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,017 INFO L443 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,018 INFO L443 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,018 INFO L443 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,018 INFO L443 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,018 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-10-02 00:44:29,018 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-10-02 00:44:29,018 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-10-02 00:44:29,018 INFO L443 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-10-02 00:44:29,018 INFO L443 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-10-02 00:44:29,020 INFO L443 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-10-02 00:44:29,020 INFO L443 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-10-02 00:44:29,021 INFO L443 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-10-02 00:44:29,021 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-10-02 00:44:29,021 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,021 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,021 INFO L443 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,021 INFO L443 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,021 INFO L443 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,021 INFO L443 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,022 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-10-02 00:44:29,022 INFO L443 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,022 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-10-02 00:44:29,022 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-10-02 00:44:29,022 INFO L443 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-10-02 00:44:29,022 INFO L443 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-10-02 00:44:29,022 INFO L443 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-10-02 00:44:29,022 INFO L443 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-10-02 00:44:29,023 INFO L443 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-10-02 00:44:29,023 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-10-02 00:44:29,023 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-10-02 00:44:29,023 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-10-02 00:44:29,023 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-10-02 00:44:29,023 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-10-02 00:44:29,023 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-10-02 00:44:29,023 INFO L443 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,023 INFO L443 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,023 INFO L443 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,024 INFO L443 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,024 INFO L443 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,024 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-10-02 00:44:29,024 INFO L443 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-10-02 00:44:29,024 INFO L443 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-10-02 00:44:29,024 INFO L443 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-10-02 00:44:29,024 INFO L443 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-10-02 00:44:29,024 INFO L443 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-10-02 00:44:29,024 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-10-02 00:44:29,024 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-10-02 00:44:29,024 INFO L443 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,024 INFO L443 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,025 INFO L443 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,025 INFO L443 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,025 INFO L443 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,025 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-10-02 00:44:29,025 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-10-02 00:44:29,025 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-10-02 00:44:29,025 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-10-02 00:44:29,025 INFO L443 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-10-02 00:44:29,025 INFO L443 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-10-02 00:44:29,025 INFO L443 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-10-02 00:44:29,025 INFO L443 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-10-02 00:44:29,025 INFO L443 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-10-02 00:44:29,025 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-10-02 00:44:29,026 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse2 (= ~a17~0 |old(~a17~0)|)) (.cse3 (<= ~a21~0 |old(~a21~0)|)) (.cse4 (= ~a16~0 |old(~a16~0)|)) (.cse5 (= ~a20~0 |old(~a20~0)|)) (.cse0 (= 13 |old(~a8~0)|))) (let ((.cse8 (not (= 1 |old(~a21~0)|))) (.cse7 (not (= 1 |old(~a20~0)|))) (.cse10 (not (= 4 |old(~a16~0)|))) (.cse9 (= 1 |old(~a7~0)|)) (.cse11 (= 13 ~a8~0)) (.cse12 (= ~a21~0 1)) (.cse13 (not .cse0)) (.cse14 (not (= 1 |old(~a17~0)|))) (.cse6 (and .cse2 .cse3 .cse4 .cse5)) (.cse1 (not (= 8 ~a12~0)))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 (not (= ~a8~0 13)))) (or .cse6 (or .cse7 .cse1)) (or .cse8 .cse9 .cse7 .cse10 .cse1 (and (not (= ~a7~0 1)) .cse11 .cse12) .cse13 .cse14) (or (not (<= |old(~a16~0)| 4)) .cse1 .cse6) (or .cse8 .cse7 .cse10 .cse1 (not .cse9) (and (= 1 ~a7~0) .cse11 .cse12) .cse13 .cse14) (or .cse6 (or (= 6 |old(~a16~0)|) .cse1 (not (<= |old(~a21~0)| 0))))))) [2019-10-02 00:44:29,026 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-10-02 00:44:29,026 INFO L443 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,026 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 521) no Hoare annotation was computed. [2019-10-02 00:44:29,026 INFO L443 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,027 INFO L443 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,027 INFO L443 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,027 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-10-02 00:44:29,027 INFO L443 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,027 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,027 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-10-02 00:44:29,027 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-10-02 00:44:29,027 INFO L443 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-10-02 00:44:29,027 INFO L443 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-10-02 00:44:29,027 INFO L443 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-10-02 00:44:29,027 INFO L443 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-10-02 00:44:29,027 INFO L443 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-10-02 00:44:29,028 INFO L443 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-10-02 00:44:29,028 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-10-02 00:44:29,028 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-10-02 00:44:29,028 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-10-02 00:44:29,028 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-10-02 00:44:29,028 INFO L443 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,028 INFO L443 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,028 INFO L443 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,028 INFO L443 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,028 INFO L443 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,028 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-10-02 00:44:29,028 INFO L443 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,029 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-10-02 00:44:29,029 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-10-02 00:44:29,029 INFO L443 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-10-02 00:44:29,029 INFO L443 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-10-02 00:44:29,029 INFO L443 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-10-02 00:44:29,029 INFO L443 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-10-02 00:44:29,029 INFO L443 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-10-02 00:44:29,029 INFO L443 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-10-02 00:44:29,029 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-10-02 00:44:29,029 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-10-02 00:44:29,029 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-10-02 00:44:29,029 INFO L443 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-10-02 00:44:29,029 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-10-02 00:44:29,030 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-10-02 00:44:29,030 INFO L443 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,030 INFO L443 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,030 INFO L443 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,030 INFO L443 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,030 INFO L443 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,030 INFO L443 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:44:29,030 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-10-02 00:44:29,030 INFO L443 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-10-02 00:44:29,030 INFO L443 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-10-02 00:44:29,030 INFO L443 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-10-02 00:44:29,030 INFO L443 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-10-02 00:44:29,031 INFO L443 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-10-02 00:44:29,031 INFO L443 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-10-02 00:44:29,031 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-10-02 00:44:29,031 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-10-02 00:44:29,031 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-10-02 00:44:29,031 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 00:44:29,031 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~a16~0 6)) (= ~a17~0 1) (= ~a12~0 8) (= ~a20~0 1) (not (= ~a8~0 13))) [2019-10-02 00:44:29,031 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 00:44:29,031 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 00:44:29,032 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (= 6 |old(~a16~0)|) (and (<= ~a21~0 |old(~a21~0)|) (= ~a16~0 |old(~a16~0)|) (= ~a17~0 1) (= ~a20~0 |old(~a20~0)|) (not (= ~a8~0 13))) (not (= 1 |old(~a20~0)|)) (= 13 |old(~a8~0)|) (not (= 8 ~a12~0)) (not (= 1 |old(~a17~0)|))) [2019-10-02 00:44:29,032 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2019-10-02 00:44:29,032 INFO L439 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (or (= 6 |old(~a16~0)|) (= ~a20~0 1) (not (= ~a8~0 13)) (= 13 |old(~a8~0)|) (not (= 8 ~a12~0)) (and (<= ~a21~0 0) (not (= ~a16~0 6))) (not (= 1 |old(~a17~0)|)) (<= ~a16~0 4) (not (= 1 |old(~a20~0)|))) [2019-10-02 00:44:29,032 INFO L443 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2019-10-02 00:44:29,032 INFO L443 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-10-02 00:44:29,032 INFO L439 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (or (= 6 |old(~a16~0)|) (= ~a20~0 1) (not (= ~a8~0 13)) (= 13 |old(~a8~0)|) (not (= 8 ~a12~0)) (and (<= ~a21~0 0) (not (= ~a16~0 6))) (not (= 1 |old(~a17~0)|)) (<= ~a16~0 4) (not (= 1 |old(~a20~0)|))) [2019-10-02 00:44:29,032 INFO L443 ceAbstractionStarter]: For program point L583-3(lines 577 594) no Hoare annotation was computed. [2019-10-02 00:44:29,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 12:44:29 BoogieIcfgContainer [2019-10-02 00:44:29,056 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 00:44:29,059 INFO L168 Benchmark]: Toolchain (without parser) took 12501.21 ms. Allocated memory was 134.2 MB in the beginning and 406.8 MB in the end (delta: 272.6 MB). Free memory was 88.5 MB in the beginning and 153.1 MB in the end (delta: -64.6 MB). Peak memory consumption was 208.0 MB. Max. memory is 7.1 GB. [2019-10-02 00:44:29,060 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 134.2 MB. Free memory was 108.4 MB in the beginning and 108.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 00:44:29,065 INFO L168 Benchmark]: CACSL2BoogieTranslator took 741.73 ms. Allocated memory was 134.2 MB in the beginning and 201.3 MB in the end (delta: 67.1 MB). Free memory was 88.2 MB in the beginning and 158.0 MB in the end (delta: -69.8 MB). Peak memory consumption was 28.9 MB. Max. memory is 7.1 GB. [2019-10-02 00:44:29,066 INFO L168 Benchmark]: Boogie Preprocessor took 112.30 ms. Allocated memory is still 201.3 MB. Free memory was 158.0 MB in the beginning and 153.0 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. [2019-10-02 00:44:29,067 INFO L168 Benchmark]: RCFGBuilder took 1220.80 ms. Allocated memory was 201.3 MB in the beginning and 228.1 MB in the end (delta: 26.7 MB). Free memory was 153.0 MB in the beginning and 166.9 MB in the end (delta: -13.9 MB). Peak memory consumption was 80.2 MB. Max. memory is 7.1 GB. [2019-10-02 00:44:29,074 INFO L168 Benchmark]: TraceAbstraction took 10421.76 ms. Allocated memory was 228.1 MB in the beginning and 406.8 MB in the end (delta: 178.8 MB). Free memory was 166.9 MB in the beginning and 153.1 MB in the end (delta: 13.8 MB). Peak memory consumption was 192.6 MB. Max. memory is 7.1 GB. [2019-10-02 00:44:29,083 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 134.2 MB. Free memory was 108.4 MB in the beginning and 108.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 741.73 ms. Allocated memory was 134.2 MB in the beginning and 201.3 MB in the end (delta: 67.1 MB). Free memory was 88.2 MB in the beginning and 158.0 MB in the end (delta: -69.8 MB). Peak memory consumption was 28.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 112.30 ms. Allocated memory is still 201.3 MB. Free memory was 158.0 MB in the beginning and 153.0 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1220.80 ms. Allocated memory was 201.3 MB in the beginning and 228.1 MB in the end (delta: 26.7 MB). Free memory was 153.0 MB in the beginning and 166.9 MB in the end (delta: -13.9 MB). Peak memory consumption was 80.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10421.76 ms. Allocated memory was 228.1 MB in the beginning and 406.8 MB in the end (delta: 178.8 MB). Free memory was 166.9 MB in the beginning and 153.1 MB in the end (delta: 13.8 MB). Peak memory consumption was 192.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 521]: 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: 583]: Loop Invariant Derived loop invariant: (((((((6 == \old(a16) || a20 == 1) || !(a8 == 13)) || 13 == \old(a8)) || !(8 == a12)) || (a21 <= 0 && !(a16 == 6))) || !(1 == \old(a17))) || a16 <= 4) || !(1 == \old(a20)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 207 locations, 1 error locations. SAFE Result, 10.3s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 6.7s AutomataDifference, 0.0s DeadEndRemovalTime, 1.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 246 SDtfs, 2382 SDslu, 313 SDs, 0 SdLazy, 4893 SolverSat, 736 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 442 GetRequests, 386 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1275occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 751 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 70 PreInvPairs, 136 NumberOfFragments, 317 HoareAnnotationTreeSize, 70 FomulaSimplifications, 4044 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1375 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1361 NumberOfCodeBlocks, 1361 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1352 ConstructedInterpolants, 0 QuantifiedInterpolants, 1020439 SizeOfPredicates, 4 NumberOfNonLiveVariables, 918 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 251/282 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...