java -Xmx8000000000 -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 ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label23_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 18:40:11,745 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 18:40:11,748 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 18:40:11,765 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 18:40:11,766 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 18:40:11,767 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 18:40:11,769 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 18:40:11,771 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 18:40:11,774 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 18:40:11,775 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 18:40:11,777 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 18:40:11,778 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 18:40:11,778 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 18:40:11,780 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 18:40:11,783 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 18:40:11,790 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 18:40:11,791 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 18:40:11,792 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 18:40:11,797 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 18:40:11,800 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 18:40:11,802 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 18:40:11,805 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 18:40:11,811 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 18:40:11,811 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 18:40:11,811 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 18:40:11,812 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 18:40:11,814 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 18:40:11,814 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 18:40:11,818 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 18:40:11,819 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 18:40:11,819 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 18:40:11,819 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 18:40:11,821 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 18:40:11,821 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 18:40:11,822 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 18:40:11,824 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 18:40:11,824 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-07 18:40:11,851 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 18:40:11,851 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 18:40:11,852 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 18:40:11,852 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 18:40:11,852 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 18:40:11,853 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 18:40:11,856 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 18:40:11,856 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 18:40:11,856 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 18:40:11,856 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 18:40:11,857 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 18:40:11,857 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 18:40:11,857 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 18:40:11,858 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 18:40:11,858 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 18:40:11,858 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 18:40:11,859 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 18:40:11,859 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 18:40:11,859 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 18:40:11,859 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 18:40:11,859 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 18:40:11,860 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 18:40:11,860 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 18:40:11,860 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 18:40:11,860 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 18:40:11,860 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 18:40:11,860 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 18:40:11,861 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 18:40:11,861 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 18:40:11,861 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 18:40:11,861 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 18:40:11,861 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 18:40:11,861 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 18:40:11,862 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 18:40:11,862 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 18:40:11,915 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 18:40:11,928 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 18:40:11,932 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 18:40:11,934 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 18:40:11,934 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 18:40:11,935 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label23_true-unreach-call_false-termination.c [2018-11-07 18:40:12,002 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af3bb0bd7/8396d63e1eff4ccdbf1b07e1525ff4bc/FLAG52ed425bd [2018-11-07 18:40:12,595 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 18:40:12,596 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label23_true-unreach-call_false-termination.c [2018-11-07 18:40:12,614 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af3bb0bd7/8396d63e1eff4ccdbf1b07e1525ff4bc/FLAG52ed425bd [2018-11-07 18:40:12,628 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af3bb0bd7/8396d63e1eff4ccdbf1b07e1525ff4bc [2018-11-07 18:40:12,640 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 18:40:12,641 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 18:40:12,643 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 18:40:12,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 18:40:12,647 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 18:40:12,648 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:40:12" (1/1) ... [2018-11-07 18:40:12,651 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7047ba1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:12, skipping insertion in model container [2018-11-07 18:40:12,651 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:40:12" (1/1) ... [2018-11-07 18:40:12,662 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 18:40:12,722 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 18:40:13,185 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 18:40:13,190 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 18:40:13,302 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 18:40:13,327 INFO L193 MainTranslator]: Completed translation [2018-11-07 18:40:13,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:13 WrapperNode [2018-11-07 18:40:13,328 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 18:40:13,329 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 18:40:13,329 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 18:40:13,329 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 18:40:13,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:13" (1/1) ... [2018-11-07 18:40:13,362 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:13" (1/1) ... [2018-11-07 18:40:13,456 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 18:40:13,456 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 18:40:13,456 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 18:40:13,456 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 18:40:13,465 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:13" (1/1) ... [2018-11-07 18:40:13,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:13" (1/1) ... [2018-11-07 18:40:13,470 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:13" (1/1) ... [2018-11-07 18:40:13,471 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:13" (1/1) ... [2018-11-07 18:40:13,512 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:13" (1/1) ... [2018-11-07 18:40:13,528 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:13" (1/1) ... [2018-11-07 18:40:13,540 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:13" (1/1) ... [2018-11-07 18:40:13,551 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 18:40:13,552 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 18:40:13,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 18:40:13,552 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 18:40:13,553 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 18:40:13,628 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 18:40:13,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 18:40:13,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 18:40:13,628 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 18:40:13,628 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 18:40:13,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 18:40:13,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 18:40:13,629 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 18:40:13,629 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 18:40:16,521 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 18:40:16,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:40:16 BoogieIcfgContainer [2018-11-07 18:40:16,522 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 18:40:16,523 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 18:40:16,524 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 18:40:16,527 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 18:40:16,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:40:12" (1/3) ... [2018-11-07 18:40:16,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bf62265 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:40:16, skipping insertion in model container [2018-11-07 18:40:16,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:13" (2/3) ... [2018-11-07 18:40:16,529 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bf62265 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:40:16, skipping insertion in model container [2018-11-07 18:40:16,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:40:16" (3/3) ... [2018-11-07 18:40:16,531 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label23_true-unreach-call_false-termination.c [2018-11-07 18:40:16,541 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 18:40:16,552 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 18:40:16,570 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 18:40:16,610 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 18:40:16,610 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 18:40:16,610 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 18:40:16,610 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 18:40:16,611 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 18:40:16,611 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 18:40:16,611 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 18:40:16,611 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 18:40:16,641 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-11-07 18:40:16,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-07 18:40:16,653 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:40:16,654 INFO L375 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] [2018-11-07 18:40:16,657 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:40:16,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:40:16,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1921053824, now seen corresponding path program 1 times [2018-11-07 18:40:16,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:40:16,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:16,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:40:16,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:16,719 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:40:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:40:17,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:40:17,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:40:17,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 18:40:17,386 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:40:17,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 18:40:17,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 18:40:17,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 18:40:17,415 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-11-07 18:40:19,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:40:19,279 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-11-07 18:40:19,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 18:40:19,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-11-07 18:40:19,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:40:19,301 INFO L225 Difference]: With dead ends: 550 [2018-11-07 18:40:19,301 INFO L226 Difference]: Without dead ends: 340 [2018-11-07 18:40:19,307 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 18:40:19,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-11-07 18:40:19,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-11-07 18:40:19,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-07 18:40:19,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 562 transitions. [2018-11-07 18:40:19,392 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 562 transitions. Word has length 102 [2018-11-07 18:40:19,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:40:19,393 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 562 transitions. [2018-11-07 18:40:19,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 18:40:19,394 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 562 transitions. [2018-11-07 18:40:19,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-07 18:40:19,399 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:40:19,400 INFO L375 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] [2018-11-07 18:40:19,400 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:40:19,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:40:19,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1248804383, now seen corresponding path program 1 times [2018-11-07 18:40:19,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:40:19,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:19,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:40:19,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:19,403 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:40:19,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:40:19,611 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:40:19,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:40:19,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 18:40:19,612 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:40:19,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 18:40:19,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 18:40:19,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 18:40:19,615 INFO L87 Difference]: Start difference. First operand 340 states and 562 transitions. Second operand 6 states. [2018-11-07 18:40:21,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:40:21,246 INFO L93 Difference]: Finished difference Result 888 states and 1491 transitions. [2018-11-07 18:40:21,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 18:40:21,247 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2018-11-07 18:40:21,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:40:21,254 INFO L225 Difference]: With dead ends: 888 [2018-11-07 18:40:21,254 INFO L226 Difference]: Without dead ends: 554 [2018-11-07 18:40:21,257 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 18:40:21,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-11-07 18:40:21,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 539. [2018-11-07 18:40:21,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-11-07 18:40:21,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 827 transitions. [2018-11-07 18:40:21,307 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 827 transitions. Word has length 113 [2018-11-07 18:40:21,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:40:21,309 INFO L480 AbstractCegarLoop]: Abstraction has 539 states and 827 transitions. [2018-11-07 18:40:21,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 18:40:21,309 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 827 transitions. [2018-11-07 18:40:21,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-07 18:40:21,314 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:40:21,314 INFO L375 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] [2018-11-07 18:40:21,314 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:40:21,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:40:21,317 INFO L82 PathProgramCache]: Analyzing trace with hash -2079561357, now seen corresponding path program 1 times [2018-11-07 18:40:21,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:40:21,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:21,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:40:21,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:21,318 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:40:21,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:40:21,600 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:40:21,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:40:21,601 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:40:21,602 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 115 with the following transitions: [2018-11-07 18:40:21,605 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [453], [455], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 18:40:21,672 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:40:21,673 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:40:23,080 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 18:40:23,081 INFO L272 AbstractInterpreter]: Visited 106 different actions 170 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-07 18:40:23,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:40:23,138 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 18:40:23,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:40:23,138 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-11-07 18:40:23,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:40:23,155 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 18:40:23,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:40:23,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 18:40:23,463 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:40:23,464 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 18:40:23,840 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:40:23,878 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:40:23,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 9 [2018-11-07 18:40:23,879 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:40:23,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 18:40:23,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 18:40:23,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-07 18:40:23,881 INFO L87 Difference]: Start difference. First operand 539 states and 827 transitions. Second operand 3 states. [2018-11-07 18:40:25,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:40:25,500 INFO L93 Difference]: Finished difference Result 1530 states and 2434 transitions. [2018-11-07 18:40:25,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 18:40:25,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2018-11-07 18:40:25,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:40:25,510 INFO L225 Difference]: With dead ends: 1530 [2018-11-07 18:40:25,511 INFO L226 Difference]: Without dead ends: 997 [2018-11-07 18:40:25,513 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 228 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-07 18:40:25,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2018-11-07 18:40:25,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 997. [2018-11-07 18:40:25,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2018-11-07 18:40:25,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1433 transitions. [2018-11-07 18:40:25,559 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1433 transitions. Word has length 114 [2018-11-07 18:40:25,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:40:25,560 INFO L480 AbstractCegarLoop]: Abstraction has 997 states and 1433 transitions. [2018-11-07 18:40:25,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 18:40:25,560 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1433 transitions. [2018-11-07 18:40:25,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-07 18:40:25,564 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:40:25,564 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-07 18:40:25,565 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:40:25,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:40:25,565 INFO L82 PathProgramCache]: Analyzing trace with hash 896515303, now seen corresponding path program 1 times [2018-11-07 18:40:25,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:40:25,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:25,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:40:25,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:25,567 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:40:25,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:40:25,849 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 18:40:25,912 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:40:25,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:40:25,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 18:40:25,913 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:40:25,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 18:40:25,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 18:40:25,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 18:40:25,914 INFO L87 Difference]: Start difference. First operand 997 states and 1433 transitions. Second operand 3 states. [2018-11-07 18:40:27,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:40:27,858 INFO L93 Difference]: Finished difference Result 2438 states and 3658 transitions. [2018-11-07 18:40:27,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 18:40:27,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2018-11-07 18:40:27,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:40:27,870 INFO L225 Difference]: With dead ends: 2438 [2018-11-07 18:40:27,870 INFO L226 Difference]: Without dead ends: 1447 [2018-11-07 18:40:27,875 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 18:40:27,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2018-11-07 18:40:27,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1447. [2018-11-07 18:40:27,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1447 states. [2018-11-07 18:40:27,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 2086 transitions. [2018-11-07 18:40:27,920 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 2086 transitions. Word has length 120 [2018-11-07 18:40:27,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:40:27,921 INFO L480 AbstractCegarLoop]: Abstraction has 1447 states and 2086 transitions. [2018-11-07 18:40:27,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 18:40:27,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 2086 transitions. [2018-11-07 18:40:27,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-07 18:40:27,926 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:40:27,926 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:40:27,926 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:40:27,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:40:27,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1267173673, now seen corresponding path program 1 times [2018-11-07 18:40:27,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:40:27,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:27,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:40:27,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:27,928 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:40:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:40:28,113 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:40:28,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:40:28,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 18:40:28,114 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:40:28,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 18:40:28,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 18:40:28,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 18:40:28,115 INFO L87 Difference]: Start difference. First operand 1447 states and 2086 transitions. Second operand 6 states. [2018-11-07 18:40:29,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:40:29,339 INFO L93 Difference]: Finished difference Result 3031 states and 4481 transitions. [2018-11-07 18:40:29,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 18:40:29,340 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2018-11-07 18:40:29,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:40:29,350 INFO L225 Difference]: With dead ends: 3031 [2018-11-07 18:40:29,351 INFO L226 Difference]: Without dead ends: 1590 [2018-11-07 18:40:29,357 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 18:40:29,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2018-11-07 18:40:29,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1540. [2018-11-07 18:40:29,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1540 states. [2018-11-07 18:40:29,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 1540 states and 1980 transitions. [2018-11-07 18:40:29,415 INFO L78 Accepts]: Start accepts. Automaton has 1540 states and 1980 transitions. Word has length 128 [2018-11-07 18:40:29,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:40:29,416 INFO L480 AbstractCegarLoop]: Abstraction has 1540 states and 1980 transitions. [2018-11-07 18:40:29,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 18:40:29,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 1980 transitions. [2018-11-07 18:40:29,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-07 18:40:29,421 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:40:29,421 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:40:29,422 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:40:29,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:40:29,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1675141633, now seen corresponding path program 1 times [2018-11-07 18:40:29,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:40:29,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:29,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:40:29,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:29,423 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:40:29,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:40:29,624 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:40:29,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:40:29,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 18:40:29,625 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:40:29,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 18:40:29,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 18:40:29,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 18:40:29,627 INFO L87 Difference]: Start difference. First operand 1540 states and 1980 transitions. Second operand 3 states. [2018-11-07 18:40:30,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:40:30,570 INFO L93 Difference]: Finished difference Result 4456 states and 5895 transitions. [2018-11-07 18:40:30,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 18:40:30,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2018-11-07 18:40:30,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:40:30,588 INFO L225 Difference]: With dead ends: 4456 [2018-11-07 18:40:30,588 INFO L226 Difference]: Without dead ends: 2922 [2018-11-07 18:40:30,596 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-11-07 18:40:30,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2018-11-07 18:40:30,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 2914. [2018-11-07 18:40:30,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2914 states. [2018-11-07 18:40:30,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2914 states and 3698 transitions. [2018-11-07 18:40:30,714 INFO L78 Accepts]: Start accepts. Automaton has 2914 states and 3698 transitions. Word has length 129 [2018-11-07 18:40:30,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:40:30,715 INFO L480 AbstractCegarLoop]: Abstraction has 2914 states and 3698 transitions. [2018-11-07 18:40:30,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 18:40:30,716 INFO L276 IsEmpty]: Start isEmpty. Operand 2914 states and 3698 transitions. [2018-11-07 18:40:30,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-07 18:40:30,726 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:40:30,726 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-11-07 18:40:30,727 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:40:30,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:40:30,727 INFO L82 PathProgramCache]: Analyzing trace with hash 208675339, now seen corresponding path program 1 times [2018-11-07 18:40:30,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:40:30,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:30,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:40:30,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:30,728 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:40:30,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:40:30,939 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:40:30,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:40:30,940 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:40:30,940 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 167 with the following transitions: [2018-11-07 18:40:30,941 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [225], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [453], [455], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 18:40:30,947 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:40:30,948 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:40:31,680 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:40:31,681 INFO L272 AbstractInterpreter]: Visited 105 different actions 170 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-07 18:40:31,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:40:31,716 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:40:32,721 INFO L227 lantSequenceWeakener]: Weakened 6 states. On average, predicates are now at 82.5% of their original sizes. [2018-11-07 18:40:32,721 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:40:33,998 INFO L415 sIntCurrentIteration]: We unified 165 AI predicates to 165 [2018-11-07 18:40:33,998 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:40:33,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:40:33,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [7] total 17 [2018-11-07 18:40:33,999 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:40:34,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 18:40:34,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 18:40:34,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-11-07 18:40:34,001 INFO L87 Difference]: Start difference. First operand 2914 states and 3698 transitions. Second operand 12 states. [2018-11-07 18:40:51,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:40:51,252 INFO L93 Difference]: Finished difference Result 6510 states and 8436 transitions. [2018-11-07 18:40:51,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 18:40:51,252 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 166 [2018-11-07 18:40:51,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:40:51,269 INFO L225 Difference]: With dead ends: 6510 [2018-11-07 18:40:51,269 INFO L226 Difference]: Without dead ends: 3602 [2018-11-07 18:40:51,279 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 174 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2018-11-07 18:40:51,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3602 states. [2018-11-07 18:40:51,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3602 to 3599. [2018-11-07 18:40:51,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3599 states. [2018-11-07 18:40:51,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3599 states to 3599 states and 4469 transitions. [2018-11-07 18:40:51,368 INFO L78 Accepts]: Start accepts. Automaton has 3599 states and 4469 transitions. Word has length 166 [2018-11-07 18:40:51,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:40:51,369 INFO L480 AbstractCegarLoop]: Abstraction has 3599 states and 4469 transitions. [2018-11-07 18:40:51,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 18:40:51,369 INFO L276 IsEmpty]: Start isEmpty. Operand 3599 states and 4469 transitions. [2018-11-07 18:40:51,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-11-07 18:40:51,382 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:40:51,382 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 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, 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] [2018-11-07 18:40:51,383 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:40:51,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:40:51,383 INFO L82 PathProgramCache]: Analyzing trace with hash 2117677329, now seen corresponding path program 1 times [2018-11-07 18:40:51,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:40:51,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:51,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:40:51,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:51,385 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:40:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:40:51,632 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 96 proven. 19 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 18:40:51,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:40:51,632 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:40:51,633 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 196 with the following transitions: [2018-11-07 18:40:51,633 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [49], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [225], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [453], [455], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 18:40:51,637 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:40:51,638 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:40:52,602 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:40:52,603 INFO L272 AbstractInterpreter]: Visited 107 different actions 393 times. Merged at 8 different actions 32 times. Never widened. Found 7 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 18:40:52,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:40:52,640 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:40:53,116 INFO L227 lantSequenceWeakener]: Weakened 192 states. On average, predicates are now at 80.16% of their original sizes. [2018-11-07 18:40:53,116 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:40:53,565 INFO L415 sIntCurrentIteration]: We unified 194 AI predicates to 194 [2018-11-07 18:40:53,566 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:40:53,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:40:53,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 15 [2018-11-07 18:40:53,566 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:40:53,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 18:40:53,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 18:40:53,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-07 18:40:53,567 INFO L87 Difference]: Start difference. First operand 3599 states and 4469 transitions. Second operand 10 states. [2018-11-07 18:41:01,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:41:01,079 INFO L93 Difference]: Finished difference Result 7343 states and 9386 transitions. [2018-11-07 18:41:01,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 18:41:01,079 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 195 [2018-11-07 18:41:01,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:41:01,098 INFO L225 Difference]: With dead ends: 7343 [2018-11-07 18:41:01,098 INFO L226 Difference]: Without dead ends: 4435 [2018-11-07 18:41:01,109 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 201 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-11-07 18:41:01,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4435 states. [2018-11-07 18:41:01,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4435 to 4428. [2018-11-07 18:41:01,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4428 states. [2018-11-07 18:41:01,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4428 states to 4428 states and 5567 transitions. [2018-11-07 18:41:01,216 INFO L78 Accepts]: Start accepts. Automaton has 4428 states and 5567 transitions. Word has length 195 [2018-11-07 18:41:01,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:41:01,216 INFO L480 AbstractCegarLoop]: Abstraction has 4428 states and 5567 transitions. [2018-11-07 18:41:01,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 18:41:01,217 INFO L276 IsEmpty]: Start isEmpty. Operand 4428 states and 5567 transitions. [2018-11-07 18:41:01,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-11-07 18:41:01,232 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:41:01,233 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 18:41:01,233 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:41:01,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:41:01,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1122503782, now seen corresponding path program 1 times [2018-11-07 18:41:01,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:41:01,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:41:01,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:41:01,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:41:01,235 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:41:01,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:41:01,669 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 125 proven. 37 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 18:41:01,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:41:01,669 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:41:01,669 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 220 with the following transitions: [2018-11-07 18:41:01,670 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [49], [50], [53], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [225], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [453], [455], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 18:41:01,673 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:41:01,674 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:41:02,683 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 18:41:02,683 INFO L272 AbstractInterpreter]: Visited 109 different actions 404 times. Merged at 8 different actions 36 times. Widened at 1 different actions 1 times. Found 7 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 18:41:02,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:41:02,693 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 18:41:02,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:41:02,693 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 [2018-11-07 18:41:02,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:41:02,703 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 18:41:02,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:41:02,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 18:41:02,949 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 100 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-07 18:41:02,950 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 18:41:03,173 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 125 proven. 37 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 18:41:03,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 18:41:03,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-11-07 18:41:03,195 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 18:41:03,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 18:41:03,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 18:41:03,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-07 18:41:03,196 INFO L87 Difference]: Start difference. First operand 4428 states and 5567 transitions. Second operand 9 states. [2018-11-07 18:41:06,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:41:06,433 INFO L93 Difference]: Finished difference Result 11487 states and 15128 transitions. [2018-11-07 18:41:06,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 18:41:06,433 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 219 [2018-11-07 18:41:06,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:41:06,476 INFO L225 Difference]: With dead ends: 11487 [2018-11-07 18:41:06,476 INFO L226 Difference]: Without dead ends: 7039 [2018-11-07 18:41:06,500 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 438 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2018-11-07 18:41:06,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7039 states. [2018-11-07 18:41:06,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7039 to 6980. [2018-11-07 18:41:06,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6980 states. [2018-11-07 18:41:06,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6980 states to 6980 states and 8974 transitions. [2018-11-07 18:41:06,728 INFO L78 Accepts]: Start accepts. Automaton has 6980 states and 8974 transitions. Word has length 219 [2018-11-07 18:41:06,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:41:06,729 INFO L480 AbstractCegarLoop]: Abstraction has 6980 states and 8974 transitions. [2018-11-07 18:41:06,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 18:41:06,729 INFO L276 IsEmpty]: Start isEmpty. Operand 6980 states and 8974 transitions. [2018-11-07 18:41:06,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-11-07 18:41:06,766 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:41:06,766 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-11-07 18:41:06,766 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:41:06,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:41:06,767 INFO L82 PathProgramCache]: Analyzing trace with hash 889346168, now seen corresponding path program 1 times [2018-11-07 18:41:06,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:41:06,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:41:06,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:41:06,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:41:06,768 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:41:06,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:41:07,094 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 130 proven. 42 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 18:41:07,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:41:07,094 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:41:07,094 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 225 with the following transitions: [2018-11-07 18:41:07,094 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [49], [50], [54], [58], [62], [66], [70], [73], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [225], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [453], [455], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 18:41:07,098 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:41:07,098 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:41:07,793 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 18:41:07,793 INFO L272 AbstractInterpreter]: Visited 109 different actions 404 times. Merged at 8 different actions 36 times. Widened at 1 different actions 1 times. Found 7 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 18:41:07,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:41:07,804 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 18:41:07,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:41:07,804 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 18:41:07,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:41:07,814 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 18:41:07,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:41:07,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 18:41:08,026 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 172 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 18:41:08,027 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 18:41:08,441 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 172 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 18:41:08,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 18:41:08,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2018-11-07 18:41:08,462 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 18:41:08,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 18:41:08,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 18:41:08,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-07 18:41:08,463 INFO L87 Difference]: Start difference. First operand 6980 states and 8974 transitions. Second operand 9 states. [2018-11-07 18:41:11,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:41:11,896 INFO L93 Difference]: Finished difference Result 19733 states and 26683 transitions. [2018-11-07 18:41:11,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 18:41:11,896 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 224 [2018-11-07 18:41:11,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:41:11,897 INFO L225 Difference]: With dead ends: 19733 [2018-11-07 18:41:11,897 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 18:41:11,975 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 460 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=223, Invalid=707, Unknown=0, NotChecked=0, Total=930 [2018-11-07 18:41:11,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 18:41:11,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 18:41:11,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 18:41:11,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 18:41:11,976 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 224 [2018-11-07 18:41:11,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:41:11,976 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 18:41:11,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 18:41:11,977 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 18:41:11,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 18:41:11,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 18:41:12,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:12,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:12,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:12,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:12,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:12,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:12,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:12,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:12,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:12,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:12,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:12,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:12,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:12,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:12,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:12,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:12,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:12,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:12,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:12,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:12,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:12,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:12,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:12,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:12,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:12,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,374 WARN L179 SmtUtils]: Spent 893.00 ms on a formula simplification. DAG size of input: 387 DAG size of output: 230 [2018-11-07 18:41:13,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:13,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:14,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:14,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:41:14,078 WARN L179 SmtUtils]: Spent 701.00 ms on a formula simplification. DAG size of input: 384 DAG size of output: 239 [2018-11-07 18:41:15,089 WARN L179 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2018-11-07 18:41:15,731 WARN L179 SmtUtils]: Spent 638.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 86 [2018-11-07 18:41:19,716 WARN L179 SmtUtils]: Spent 3.95 s on a formula simplification. DAG size of input: 363 DAG size of output: 149 [2018-11-07 18:41:20,917 WARN L179 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 257 DAG size of output: 98 [2018-11-07 18:41:21,970 WARN L179 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 266 DAG size of output: 98 [2018-11-07 18:41:21,973 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 18:41:21,974 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (<= ~a17~0 |old(~a17~0)|) (= |old(~a8~0)| ~a8~0) (= |old(~a16~0)| ~a16~0) (= ~a21~0 |old(~a21~0)|)) [2018-11-07 18:41:21,974 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 18:41:21,974 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-11-07 18:41:21,974 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-11-07 18:41:21,974 INFO L425 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,974 INFO L425 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,975 INFO L425 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,975 INFO L425 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,975 INFO L425 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,975 INFO L425 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,975 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-11-07 18:41:21,975 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-11-07 18:41:21,975 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-11-07 18:41:21,975 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-11-07 18:41:21,975 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-11-07 18:41:21,976 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-11-07 18:41:21,976 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-11-07 18:41:21,976 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-11-07 18:41:21,976 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-11-07 18:41:21,976 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-11-07 18:41:21,976 INFO L425 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,976 INFO L425 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,976 INFO L425 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,976 INFO L425 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,976 INFO L425 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,977 INFO L425 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,977 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-11-07 18:41:21,977 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-11-07 18:41:21,977 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-07 18:41:21,977 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-11-07 18:41:21,977 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-11-07 18:41:21,977 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-11-07 18:41:21,977 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-11-07 18:41:21,977 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-11-07 18:41:21,978 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-11-07 18:41:21,978 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-11-07 18:41:21,978 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-11-07 18:41:21,978 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-11-07 18:41:21,978 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-11-07 18:41:21,978 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-11-07 18:41:21,978 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-11-07 18:41:21,978 INFO L425 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,979 INFO L425 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,979 INFO L425 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,979 INFO L425 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,979 INFO L425 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,979 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-11-07 18:41:21,979 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-11-07 18:41:21,979 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-11-07 18:41:21,979 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-11-07 18:41:21,979 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-11-07 18:41:21,980 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-11-07 18:41:21,980 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-11-07 18:41:21,980 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-11-07 18:41:21,980 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-11-07 18:41:21,980 INFO L425 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,980 INFO L425 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,980 INFO L425 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,980 INFO L425 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,981 INFO L425 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,981 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-11-07 18:41:21,981 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-11-07 18:41:21,981 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-11-07 18:41:21,981 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-11-07 18:41:21,981 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-11-07 18:41:21,981 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-07 18:41:21,981 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-11-07 18:41:21,981 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-11-07 18:41:21,982 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-11-07 18:41:21,982 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-11-07 18:41:21,982 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-11-07 18:41:21,982 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-11-07 18:41:21,982 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-11-07 18:41:21,982 INFO L425 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,982 INFO L425 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,982 INFO L425 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,982 INFO L425 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,983 INFO L425 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,983 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-11-07 18:41:21,983 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-11-07 18:41:21,983 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-11-07 18:41:21,983 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-11-07 18:41:21,983 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-11-07 18:41:21,983 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-11-07 18:41:21,983 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-11-07 18:41:21,984 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-11-07 18:41:21,984 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-11-07 18:41:21,984 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,984 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,984 INFO L425 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,984 INFO L425 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,984 INFO L425 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,984 INFO L425 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,984 INFO L425 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,984 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-11-07 18:41:21,985 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-11-07 18:41:21,985 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-11-07 18:41:21,985 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-11-07 18:41:21,985 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-11-07 18:41:21,985 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-11-07 18:41:21,985 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-11-07 18:41:21,985 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-11-07 18:41:21,985 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-11-07 18:41:21,985 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-11-07 18:41:21,986 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-11-07 18:41:21,986 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-11-07 18:41:21,986 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-11-07 18:41:21,986 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-11-07 18:41:21,986 INFO L425 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,986 INFO L425 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,986 INFO L425 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,986 INFO L425 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,986 INFO L425 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,986 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-11-07 18:41:21,987 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-11-07 18:41:21,987 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-11-07 18:41:21,987 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-11-07 18:41:21,987 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-11-07 18:41:21,987 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-11-07 18:41:21,987 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-11-07 18:41:21,987 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 461) no Hoare annotation was computed. [2018-11-07 18:41:21,988 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-11-07 18:41:21,988 INFO L425 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,988 INFO L425 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,988 INFO L425 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,988 INFO L425 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,988 INFO L425 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,988 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-11-07 18:41:21,988 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-11-07 18:41:21,988 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-11-07 18:41:21,988 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-11-07 18:41:21,989 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-11-07 18:41:21,989 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-11-07 18:41:21,989 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-11-07 18:41:21,989 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-11-07 18:41:21,989 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-11-07 18:41:21,989 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-11-07 18:41:21,990 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse4 (= 15 |old(~a8~0)|)) (.cse24 (= ~a7~0 0)) (.cse22 (= |old(~a8~0)| ~a8~0)) (.cse23 (= |old(~a16~0)| ~a16~0))) (let ((.cse20 (< 0 |old(~a17~0)|)) (.cse17 (and (<= ~a17~0 |old(~a17~0)|) .cse22 .cse23 (= ~a21~0 |old(~a21~0)|))) (.cse9 (< 1 |old(~a17~0)|)) (.cse7 (and (<= 0 ~a17~0) .cse24 (<= 0 ~a20~0) (<= ~a20~0 1))) (.cse10 (< 1 |old(~a20~0)|)) (.cse11 (< |old(~a20~0)| 0)) (.cse12 (< 6 |old(~a16~0)|)) (.cse15 (< |old(~a17~0)| 0)) (.cse3 (not (= |old(~a16~0)| 5))) (.cse19 (< 13 |old(~a8~0)|)) (.cse18 (= 4 |old(~a16~0)|)) (.cse1 (not (= 1 ~a20~0))) (.cse5 (< 6 |calculate_output_#in~input|)) (.cse21 (= ~a20~0 1)) (.cse6 (not (= 0 |old(~a7~0)|))) (.cse0 (not (= 1 |old(~a21~0)|))) (.cse2 (= 1 |old(~a20~0)|)) (.cse14 (< |old(~a16~0)| 4)) (.cse8 (not (= 8 ~a12~0))) (.cse13 (not .cse4)) (.cse16 (< |calculate_output_#in~input| 1))) (and (or .cse0 .cse1 .cse2) (or .cse1 .cse3 .cse2 .cse4) (or .cse5 .cse6 .cse0 .cse7 .cse8 .cse9 .cse2 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse17 .cse18) (or .cse19 .cse20 .cse17) (or (= 6 |old(~a16~0)|) .cse19 .cse17) (or .cse17 .cse0 .cse20) (or .cse0 .cse17 .cse4) (or .cse0 .cse2 .cse17) (or .cse5 .cse6 .cse0 .cse8 .cse9 .cse7 .cse10 .cse11 .cse12 .cse18 .cse13 .cse14 .cse15 .cse16) (or (and (= ~a17~0 1) .cse21) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= ~z~0 26)) .cse3 .cse16 .cse6 .cse5 (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= |old(~a8~0)| 15)) (not (= 6 ~f~0))) (or (and .cse22 .cse23) .cse3 .cse4) (or .cse19 (not .cse18) .cse2 .cse1) (or .cse5 (and .cse24 (= ~a17~0 0) .cse21) (or .cse6 .cse0 (not .cse2) (< 5 |old(~a16~0)|) (not (= 0 |old(~a17~0)|)) .cse14 .cse8) .cse13 .cse16)))) [2018-11-07 18:41:21,990 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-11-07 18:41:21,990 INFO L425 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,990 INFO L425 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,990 INFO L425 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,990 INFO L425 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,990 INFO L425 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,990 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-11-07 18:41:21,990 INFO L425 ceAbstractionStarter]: For program point L391-1(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,991 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-11-07 18:41:21,991 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-11-07 18:41:21,991 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-11-07 18:41:21,991 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-11-07 18:41:21,991 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-11-07 18:41:21,991 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-11-07 18:41:21,991 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-11-07 18:41:21,991 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-11-07 18:41:21,991 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-11-07 18:41:21,991 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-11-07 18:41:21,992 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-11-07 18:41:21,992 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-11-07 18:41:21,992 INFO L425 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,992 INFO L425 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,992 INFO L425 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,992 INFO L425 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,992 INFO L425 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,992 INFO L425 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,992 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-11-07 18:41:21,992 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-11-07 18:41:21,993 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-11-07 18:41:21,993 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-07 18:41:21,993 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-11-07 18:41:21,993 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-11-07 18:41:21,993 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-07 18:41:21,993 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-11-07 18:41:21,993 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-11-07 18:41:21,993 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-11-07 18:41:21,993 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-11-07 18:41:21,993 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-11-07 18:41:21,994 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-11-07 18:41:21,994 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-11-07 18:41:21,994 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-11-07 18:41:21,994 INFO L425 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,994 INFO L425 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,994 INFO L425 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,994 INFO L425 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,994 INFO L425 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,994 INFO L425 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:41:21,994 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-11-07 18:41:21,995 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-11-07 18:41:21,995 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-11-07 18:41:21,995 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-11-07 18:41:21,995 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-11-07 18:41:21,995 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-11-07 18:41:21,995 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-11-07 18:41:21,995 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-11-07 18:41:21,995 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-11-07 18:41:21,995 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-11-07 18:41:21,995 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 18:41:21,996 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~a8~0 15) (= ~z~0 26) (= ~a17~0 1) (= ~c~0 3) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~a7~0 0) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~b~0 2) (= ~a~0 1) (= 1 ~a21~0) (= ~a12~0 8) (= ~a20~0 1) (= ~a16~0 5)) [2018-11-07 18:41:21,996 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 18:41:21,996 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 18:41:21,996 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (and (= |old(~a8~0)| ~a8~0) (= 1 ~a21~0) (= ~a17~0 1) (= ~a7~0 0) (= ~a20~0 1) (= ~a16~0 5)) (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= |old(~a16~0)| 5)) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= |old(~a7~0)| 0)) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= ~x~0 24)) (not (= |old(~a17~0)| 1)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= |old(~a8~0)| 15)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-11-07 18:41:21,996 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-11-07 18:41:21,997 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse1 (not (= ~a8~0 15))) (.cse0 (<= ~a8~0 13)) (.cse3 (<= ~a17~0 0)) (.cse2 (= 1 ~a21~0))) (or (and .cse0 (not (= ~a16~0 6))) (and (= |old(~a16~0)| ~a16~0) .cse1) (not (= 3 ~c~0)) (and .cse1 .cse2) (not (= 1 |old(~a21~0)|)) (and .cse0 .cse3) (not (= 4 ~d~0)) (and (not (= 1 ~a20~0)) .cse2) (not (= 2 ~b~0)) (not (= ~y~0 25)) (not (= ~x~0 24)) (and .cse2 .cse3) (not (= ~a12~0 8)) (not (= ~e~0 5)) (and .cse2 (not (= ~a16~0 4))) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (not (= 0 |old(~a7~0)|)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= 15 |old(~a8~0)|)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= 6 ~f~0)))) [2018-11-07 18:41:21,997 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-11-07 18:41:21,997 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-11-07 18:41:21,997 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-11-07 18:41:21,997 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse1 (not (= ~a8~0 15))) (.cse0 (<= ~a8~0 13)) (.cse3 (<= ~a17~0 0)) (.cse2 (= 1 ~a21~0))) (or (and .cse0 (not (= ~a16~0 6))) (and (= |old(~a16~0)| ~a16~0) .cse1) (not (= 3 ~c~0)) (and .cse1 .cse2) (not (= 1 |old(~a21~0)|)) (and .cse0 .cse3) (not (= 4 ~d~0)) (and (not (= 1 ~a20~0)) .cse2) (not (= 2 ~b~0)) (not (= ~y~0 25)) (not (= ~x~0 24)) (and .cse2 .cse3) (not (= ~a12~0 8)) (not (= ~e~0 5)) (and .cse2 (not (= ~a16~0 4))) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (not (= 0 |old(~a7~0)|)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= 15 |old(~a8~0)|)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= 6 ~f~0)))) [2018-11-07 18:41:21,997 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-11-07 18:41:22,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:41:22 BoogieIcfgContainer [2018-11-07 18:41:22,020 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 18:41:22,020 INFO L168 Benchmark]: Toolchain (without parser) took 69380.08 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 3.3 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-11-07 18:41:22,022 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 18:41:22,022 INFO L168 Benchmark]: CACSL2BoogieTranslator took 685.63 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: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. [2018-11-07 18:41:22,023 INFO L168 Benchmark]: Boogie Procedure Inliner took 127.06 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 722.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -822.0 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB. [2018-11-07 18:41:22,025 INFO L168 Benchmark]: Boogie Preprocessor took 95.39 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2018-11-07 18:41:22,026 INFO L168 Benchmark]: RCFGBuilder took 2970.59 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 103.9 MB). Peak memory consumption was 103.9 MB. Max. memory is 7.1 GB. [2018-11-07 18:41:22,027 INFO L168 Benchmark]: TraceAbstraction took 65496.23 ms. Allocated memory was 2.2 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 2.1 GB in the beginning and 3.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2018-11-07 18:41:22,033 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.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 685.63 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: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 127.06 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 722.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -822.0 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 95.39 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2970.59 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 103.9 MB). Peak memory consumption was 103.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 65496.23 ms. Allocated memory was 2.2 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 2.1 GB in the beginning and 3.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 461]: 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: (((((((((((((((((((((((((a8 <= 13 && !(a16 == 6)) || (\old(a16) == a16 && !(a8 == 15))) || !(3 == c)) || (!(a8 == 15) && 1 == a21)) || !(1 == \old(a21))) || (a8 <= 13 && a17 <= 0)) || !(4 == d)) || (!(1 == a20) && 1 == a21)) || !(2 == b)) || !(y == 25)) || !(x == 24)) || (1 == a21 && a17 <= 0)) || !(a12 == 8)) || !(e == 5)) || (1 == a21 && !(a16 == 4))) || !(21 == u)) || !(22 == v)) || !(z == 26)) || !(\old(a16) == 5)) || !(0 == \old(a7))) || !(\old(a20) == 1)) || !(23 == w)) || !(15 == \old(a8))) || !(a == 1)) || !(\old(a17) == 1)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 65.4s OverallTime, 10 OverallIterations, 5 TraceHistogramMax, 40.9s AutomataDifference, 0.0s DeadEndRemovalTime, 9.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 1864 SDtfs, 6424 SDslu, 1574 SDs, 0 SdLazy, 11193 SolverSat, 1853 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.1s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 1589 GetRequests, 1479 SyntacticMatches, 9 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6980occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 5.0s AbstIntTime, 5 AbstIntIterations, 2 AbstIntStrong, 0.9977599894524315 AbsIntWeakeningRatio, 0.19498607242339833 AbsIntAvgWeakeningVarsNumRemoved, 34.58217270194986 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 10 MinimizatonAttempts, 142 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 353 PreInvPairs, 715 NumberOfFragments, 891 HoareAnnotationTreeSize, 353 FomulaSimplifications, 21703 FormulaSimplificationTreeSizeReduction, 2.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 16357 FormulaSimplificationTreeSizeReductionInter, 7.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 2067 NumberOfCodeBlocks, 2067 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2608 ConstructedInterpolants, 0 QuantifiedInterpolants, 1038605 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1582 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 16 InterpolantComputations, 7 PerfectInterpolantSequences, 1369/1522 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...