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/Problem02_label10_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 17:11:52,013 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 17:11:52,016 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 17:11:52,031 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 17:11:52,031 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 17:11:52,033 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 17:11:52,034 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 17:11:52,039 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 17:11:52,041 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 17:11:52,042 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 17:11:52,051 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 17:11:52,051 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 17:11:52,052 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 17:11:52,057 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 17:11:52,058 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 17:11:52,059 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 17:11:52,060 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 17:11:52,062 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 17:11:52,064 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 17:11:52,065 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 17:11:52,066 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 17:11:52,068 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 17:11:52,073 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 17:11:52,074 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 17:11:52,074 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 17:11:52,076 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 17:11:52,077 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 17:11:52,081 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 17:11:52,083 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 17:11:52,084 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 17:11:52,084 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 17:11:52,085 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 17:11:52,085 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 17:11:52,085 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 17:11:52,088 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 17:11:52,089 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 17:11:52,090 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-12 17:11:52,120 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 17:11:52,120 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 17:11:52,121 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 17:11:52,121 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 17:11:52,121 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 17:11:52,121 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 17:11:52,122 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 17:11:52,122 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 17:11:52,122 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 17:11:52,122 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 17:11:52,122 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 17:11:52,123 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 17:11:52,123 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 17:11:52,125 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 17:11:52,125 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 17:11:52,125 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 17:11:52,126 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 17:11:52,126 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 17:11:52,126 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 17:11:52,126 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 17:11:52,126 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 17:11:52,128 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 17:11:52,128 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 17:11:52,128 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 17:11:52,129 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 17:11:52,129 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 17:11:52,129 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 17:11:52,129 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 17:11:52,129 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 17:11:52,130 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 17:11:52,130 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 17:11:52,130 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 17:11:52,130 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 17:11:52,130 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 17:11:52,131 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 17:11:52,192 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 17:11:52,209 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 17:11:52,213 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 17:11:52,215 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 17:11:52,215 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 17:11:52,216 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label10_true-unreach-call_false-termination.c [2018-11-12 17:11:52,288 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78301719f/d82c32d5c5be4b2fbf9a014d7bbc26c9/FLAGeef3c7960 [2018-11-12 17:11:52,776 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 17:11:52,777 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label10_true-unreach-call_false-termination.c [2018-11-12 17:11:52,794 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78301719f/d82c32d5c5be4b2fbf9a014d7bbc26c9/FLAGeef3c7960 [2018-11-12 17:11:52,811 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78301719f/d82c32d5c5be4b2fbf9a014d7bbc26c9 [2018-11-12 17:11:52,824 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 17:11:52,826 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 17:11:52,827 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 17:11:52,827 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 17:11:52,833 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 17:11:52,834 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:11:52" (1/1) ... [2018-11-12 17:11:52,837 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@102ece and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:52, skipping insertion in model container [2018-11-12 17:11:52,838 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:11:52" (1/1) ... [2018-11-12 17:11:52,849 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 17:11:52,929 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 17:11:53,423 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 17:11:53,428 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 17:11:53,567 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 17:11:53,588 INFO L193 MainTranslator]: Completed translation [2018-11-12 17:11:53,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:53 WrapperNode [2018-11-12 17:11:53,589 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 17:11:53,590 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 17:11:53,590 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 17:11:53,591 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 17:11:53,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:53" (1/1) ... [2018-11-12 17:11:53,717 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:53" (1/1) ... [2018-11-12 17:11:53,737 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 17:11:53,737 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 17:11:53,737 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 17:11:53,738 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 17:11:53,746 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:53" (1/1) ... [2018-11-12 17:11:53,747 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:53" (1/1) ... [2018-11-12 17:11:53,750 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:53" (1/1) ... [2018-11-12 17:11:53,751 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:53" (1/1) ... [2018-11-12 17:11:53,801 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:53" (1/1) ... [2018-11-12 17:11:53,829 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:53" (1/1) ... [2018-11-12 17:11:53,843 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:53" (1/1) ... [2018-11-12 17:11:53,853 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 17:11:53,853 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 17:11:53,853 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 17:11:53,854 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 17:11:53,855 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:53" (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-12 17:11:53,933 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-12 17:11:53,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 17:11:53,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 17:11:53,934 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-12 17:11:53,934 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-12 17:11:53,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 17:11:53,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 17:11:53,937 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 17:11:53,937 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 17:11:57,511 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 17:11:57,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:11:57 BoogieIcfgContainer [2018-11-12 17:11:57,512 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 17:11:57,513 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 17:11:57,513 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 17:11:57,516 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 17:11:57,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:11:52" (1/3) ... [2018-11-12 17:11:57,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c94086 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:11:57, skipping insertion in model container [2018-11-12 17:11:57,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:53" (2/3) ... [2018-11-12 17:11:57,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c94086 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:11:57, skipping insertion in model container [2018-11-12 17:11:57,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:11:57" (3/3) ... [2018-11-12 17:11:57,520 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label10_true-unreach-call_false-termination.c [2018-11-12 17:11:57,530 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 17:11:57,541 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 17:11:57,559 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 17:11:57,598 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 17:11:57,598 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 17:11:57,598 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 17:11:57,598 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 17:11:57,599 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 17:11:57,599 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 17:11:57,599 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 17:11:57,599 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 17:11:57,628 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-11-12 17:11:57,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-12 17:11:57,644 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:11:57,645 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 17:11:57,647 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:11:57,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:11:57,653 INFO L82 PathProgramCache]: Analyzing trace with hash -773755248, now seen corresponding path program 1 times [2018-11-12 17:11:57,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:11:57,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:11:57,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:11:57,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:11:57,703 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:11:57,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:11:58,512 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-12 17:11:58,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:11:58,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-12 17:11:58,516 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:11:58,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 17:11:58,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 17:11:58,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 17:11:58,544 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 4 states. [2018-11-12 17:12:00,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:12:00,874 INFO L93 Difference]: Finished difference Result 774 states and 1357 transitions. [2018-11-12 17:12:00,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 17:12:00,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2018-11-12 17:12:00,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:12:00,899 INFO L225 Difference]: With dead ends: 774 [2018-11-12 17:12:00,899 INFO L226 Difference]: Without dead ends: 531 [2018-11-12 17:12:00,908 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 17:12:00,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-11-12 17:12:00,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 529. [2018-11-12 17:12:00,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-11-12 17:12:01,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 922 transitions. [2018-11-12 17:12:01,005 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 922 transitions. Word has length 142 [2018-11-12 17:12:01,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:12:01,006 INFO L480 AbstractCegarLoop]: Abstraction has 529 states and 922 transitions. [2018-11-12 17:12:01,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 17:12:01,007 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 922 transitions. [2018-11-12 17:12:01,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-12 17:12:01,021 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:12:01,021 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 17:12:01,024 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:12:01,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:12:01,026 INFO L82 PathProgramCache]: Analyzing trace with hash -309014567, now seen corresponding path program 1 times [2018-11-12 17:12:01,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:12:01,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:01,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:12:01,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:01,028 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:12:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:12:01,260 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:12:01,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:12:01,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 17:12:01,261 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:12:01,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 17:12:01,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 17:12:01,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 17:12:01,264 INFO L87 Difference]: Start difference. First operand 529 states and 922 transitions. Second operand 6 states. [2018-11-12 17:12:03,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:12:03,450 INFO L93 Difference]: Finished difference Result 1284 states and 2274 transitions. [2018-11-12 17:12:03,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 17:12:03,452 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 164 [2018-11-12 17:12:03,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:12:03,467 INFO L225 Difference]: With dead ends: 1284 [2018-11-12 17:12:03,467 INFO L226 Difference]: Without dead ends: 761 [2018-11-12 17:12:03,478 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-12 17:12:03,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2018-11-12 17:12:03,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 742. [2018-11-12 17:12:03,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 742 states. [2018-11-12 17:12:03,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1199 transitions. [2018-11-12 17:12:03,549 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1199 transitions. Word has length 164 [2018-11-12 17:12:03,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:12:03,550 INFO L480 AbstractCegarLoop]: Abstraction has 742 states and 1199 transitions. [2018-11-12 17:12:03,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 17:12:03,550 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1199 transitions. [2018-11-12 17:12:03,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-12 17:12:03,559 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:12:03,559 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 17:12:03,559 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:12:03,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:12:03,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1423050670, now seen corresponding path program 1 times [2018-11-12 17:12:03,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:12:03,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:03,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:12:03,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:03,562 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:12:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:12:04,117 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-12 17:12:04,353 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-12 17:12:04,448 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-12 17:12:04,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:12:04,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 17:12:04,449 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:12:04,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 17:12:04,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 17:12:04,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:12:04,451 INFO L87 Difference]: Start difference. First operand 742 states and 1199 transitions. Second operand 5 states. [2018-11-12 17:12:06,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:12:06,477 INFO L93 Difference]: Finished difference Result 1625 states and 2665 transitions. [2018-11-12 17:12:06,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 17:12:06,479 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 169 [2018-11-12 17:12:06,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:12:06,485 INFO L225 Difference]: With dead ends: 1625 [2018-11-12 17:12:06,485 INFO L226 Difference]: Without dead ends: 741 [2018-11-12 17:12:06,489 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:12:06,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-11-12 17:12:06,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 741. [2018-11-12 17:12:06,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-11-12 17:12:06,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1181 transitions. [2018-11-12 17:12:06,517 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1181 transitions. Word has length 169 [2018-11-12 17:12:06,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:12:06,517 INFO L480 AbstractCegarLoop]: Abstraction has 741 states and 1181 transitions. [2018-11-12 17:12:06,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 17:12:06,518 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1181 transitions. [2018-11-12 17:12:06,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-12 17:12:06,522 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:12:06,523 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 17:12:06,523 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:12:06,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:12:06,523 INFO L82 PathProgramCache]: Analyzing trace with hash 192175635, now seen corresponding path program 1 times [2018-11-12 17:12:06,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:12:06,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:06,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:12:06,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:06,525 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:12:06,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:12:06,774 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:12:06,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:12:06,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 17:12:06,775 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:12:06,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 17:12:06,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 17:12:06,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 17:12:06,776 INFO L87 Difference]: Start difference. First operand 741 states and 1181 transitions. Second operand 6 states. [2018-11-12 17:12:08,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:12:08,421 INFO L93 Difference]: Finished difference Result 2329 states and 3898 transitions. [2018-11-12 17:12:08,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 17:12:08,428 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 197 [2018-11-12 17:12:08,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:12:08,441 INFO L225 Difference]: With dead ends: 2329 [2018-11-12 17:12:08,441 INFO L226 Difference]: Without dead ends: 1594 [2018-11-12 17:12:08,446 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-12 17:12:08,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1594 states. [2018-11-12 17:12:08,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1594 to 1552. [2018-11-12 17:12:08,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1552 states. [2018-11-12 17:12:08,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 2380 transitions. [2018-11-12 17:12:08,499 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 2380 transitions. Word has length 197 [2018-11-12 17:12:08,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:12:08,500 INFO L480 AbstractCegarLoop]: Abstraction has 1552 states and 2380 transitions. [2018-11-12 17:12:08,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 17:12:08,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 2380 transitions. [2018-11-12 17:12:08,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-12 17:12:08,507 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:12:08,508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 17:12:08,508 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:12:08,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:12:08,508 INFO L82 PathProgramCache]: Analyzing trace with hash 36195093, now seen corresponding path program 1 times [2018-11-12 17:12:08,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:12:08,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:08,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:12:08,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:08,510 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:12:08,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:12:08,734 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-12 17:12:08,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:12:08,735 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:12:08,736 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 198 with the following transitions: [2018-11-12 17:12:08,738 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [202], [207], [209], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [807], [809], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:12:08,797 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:12:08,797 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:12:09,653 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:12:09,655 INFO L272 AbstractInterpreter]: Visited 142 different actions 142 times. Never merged. Never widened. Performed 1957 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1957 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 38 variables. [2018-11-12 17:12:09,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:12:09,700 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:12:10,577 INFO L227 lantSequenceWeakener]: Weakened 179 states. On average, predicates are now at 81.4% of their original sizes. [2018-11-12 17:12:10,577 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:12:12,005 INFO L415 sIntCurrentIteration]: We unified 196 AI predicates to 196 [2018-11-12 17:12:12,006 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:12:12,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:12:12,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [4] total 16 [2018-11-12 17:12:12,007 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:12:12,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-12 17:12:12,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-12 17:12:12,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-11-12 17:12:12,008 INFO L87 Difference]: Start difference. First operand 1552 states and 2380 transitions. Second operand 14 states. [2018-11-12 17:12:28,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:12:28,267 INFO L93 Difference]: Finished difference Result 3398 states and 5219 transitions. [2018-11-12 17:12:28,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-12 17:12:28,267 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 197 [2018-11-12 17:12:28,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:12:28,277 INFO L225 Difference]: With dead ends: 3398 [2018-11-12 17:12:28,277 INFO L226 Difference]: Without dead ends: 1852 [2018-11-12 17:12:28,282 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 209 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=193, Invalid=509, Unknown=0, NotChecked=0, Total=702 [2018-11-12 17:12:28,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1852 states. [2018-11-12 17:12:28,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1852 to 1699. [2018-11-12 17:12:28,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1699 states. [2018-11-12 17:12:28,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2539 transitions. [2018-11-12 17:12:28,332 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2539 transitions. Word has length 197 [2018-11-12 17:12:28,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:12:28,333 INFO L480 AbstractCegarLoop]: Abstraction has 1699 states and 2539 transitions. [2018-11-12 17:12:28,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-12 17:12:28,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2539 transitions. [2018-11-12 17:12:28,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-11-12 17:12:28,341 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:12:28,341 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-11-12 17:12:28,341 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:12:28,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:12:28,342 INFO L82 PathProgramCache]: Analyzing trace with hash 981314004, now seen corresponding path program 1 times [2018-11-12 17:12:28,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:12:28,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:28,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:12:28,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:28,343 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:12:28,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:12:28,542 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 65 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:12:28,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:12:28,543 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:12:28,543 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 208 with the following transitions: [2018-11-12 17:12:28,544 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [202], [207], [209], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [807], [809], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:12:28,550 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:12:28,550 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:12:29,378 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:12:29,378 INFO L272 AbstractInterpreter]: Visited 146 different actions 286 times. Merged at 5 different actions 5 times. Never widened. Performed 4236 root evaluator evaluations with a maximum evaluation depth of 4. Performed 4236 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-11-12 17:12:29,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:12:29,419 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:12:30,414 INFO L227 lantSequenceWeakener]: Weakened 84 states. On average, predicates are now at 82.37% of their original sizes. [2018-11-12 17:12:30,414 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:12:32,576 INFO L415 sIntCurrentIteration]: We unified 206 AI predicates to 206 [2018-11-12 17:12:32,577 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:12:32,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:12:32,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-11-12 17:12:32,577 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:12:32,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-12 17:12:32,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-12 17:12:32,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2018-11-12 17:12:32,579 INFO L87 Difference]: Start difference. First operand 1699 states and 2539 transitions. Second operand 18 states. [2018-11-12 17:12:48,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:12:48,591 INFO L93 Difference]: Finished difference Result 4141 states and 6092 transitions. [2018-11-12 17:12:48,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-12 17:12:48,591 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 207 [2018-11-12 17:12:48,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:12:48,603 INFO L225 Difference]: With dead ends: 4141 [2018-11-12 17:12:48,603 INFO L226 Difference]: Without dead ends: 2448 [2018-11-12 17:12:48,609 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 219 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=208, Invalid=722, Unknown=0, NotChecked=0, Total=930 [2018-11-12 17:12:48,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2448 states. [2018-11-12 17:12:48,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2448 to 2293. [2018-11-12 17:12:48,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2293 states. [2018-11-12 17:12:48,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2293 states to 2293 states and 3211 transitions. [2018-11-12 17:12:48,675 INFO L78 Accepts]: Start accepts. Automaton has 2293 states and 3211 transitions. Word has length 207 [2018-11-12 17:12:48,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:12:48,676 INFO L480 AbstractCegarLoop]: Abstraction has 2293 states and 3211 transitions. [2018-11-12 17:12:48,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-12 17:12:48,676 INFO L276 IsEmpty]: Start isEmpty. Operand 2293 states and 3211 transitions. [2018-11-12 17:12:48,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-12 17:12:48,685 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:12:48,685 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 17:12:48,685 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:12:48,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:12:48,686 INFO L82 PathProgramCache]: Analyzing trace with hash 2105417946, now seen corresponding path program 1 times [2018-11-12 17:12:48,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:12:48,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:48,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:12:48,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:48,687 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:12:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:12:49,487 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 73 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:12:49,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:12:49,488 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:12:49,488 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 212 with the following transitions: [2018-11-12 17:12:49,489 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [202], [205], [209], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [807], [809], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:12:49,501 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:12:49,501 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:12:49,997 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:12:49,997 INFO L272 AbstractInterpreter]: Visited 146 different actions 288 times. Merged at 5 different actions 7 times. Never widened. Performed 4103 root evaluator evaluations with a maximum evaluation depth of 4. Performed 4103 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-11-12 17:12:50,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:12:50,035 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:12:50,462 INFO L227 lantSequenceWeakener]: Weakened 120 states. On average, predicates are now at 81.47% of their original sizes. [2018-11-12 17:12:50,462 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:12:50,799 INFO L415 sIntCurrentIteration]: We unified 210 AI predicates to 210 [2018-11-12 17:12:50,800 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:12:50,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:12:50,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-11-12 17:12:50,800 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:12:50,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-12 17:12:50,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-12 17:12:50,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-11-12 17:12:50,801 INFO L87 Difference]: Start difference. First operand 2293 states and 3211 transitions. Second operand 18 states. [2018-11-12 17:13:01,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:13:01,148 INFO L93 Difference]: Finished difference Result 5189 states and 7662 transitions. [2018-11-12 17:13:01,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-12 17:13:01,148 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 211 [2018-11-12 17:13:01,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:13:01,162 INFO L225 Difference]: With dead ends: 5189 [2018-11-12 17:13:01,162 INFO L226 Difference]: Without dead ends: 3199 [2018-11-12 17:13:01,170 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 225 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=192, Invalid=864, Unknown=0, NotChecked=0, Total=1056 [2018-11-12 17:13:01,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3199 states. [2018-11-12 17:13:01,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3199 to 3186. [2018-11-12 17:13:01,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3186 states. [2018-11-12 17:13:01,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3186 states to 3186 states and 4318 transitions. [2018-11-12 17:13:01,250 INFO L78 Accepts]: Start accepts. Automaton has 3186 states and 4318 transitions. Word has length 211 [2018-11-12 17:13:01,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:13:01,250 INFO L480 AbstractCegarLoop]: Abstraction has 3186 states and 4318 transitions. [2018-11-12 17:13:01,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-12 17:13:01,251 INFO L276 IsEmpty]: Start isEmpty. Operand 3186 states and 4318 transitions. [2018-11-12 17:13:01,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-11-12 17:13:01,262 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:13:01,262 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 17:13:01,263 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:13:01,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:13:01,263 INFO L82 PathProgramCache]: Analyzing trace with hash 406363975, now seen corresponding path program 1 times [2018-11-12 17:13:01,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:13:01,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:01,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:13:01,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:01,264 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:13:01,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:13:01,494 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 69 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 17:13:01,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:13:01,495 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:13:01,495 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 217 with the following transitions: [2018-11-12 17:13:01,495 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [202], [205], [209], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [807], [809], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:13:01,498 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:13:01,499 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:13:02,094 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:13:02,095 INFO L272 AbstractInterpreter]: Visited 147 different actions 434 times. Merged at 7 different actions 15 times. Never widened. Performed 6420 root evaluator evaluations with a maximum evaluation depth of 5. Performed 6420 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-11-12 17:13:02,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:13:02,132 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:13:02,855 INFO L227 lantSequenceWeakener]: Weakened 211 states. On average, predicates are now at 81.18% of their original sizes. [2018-11-12 17:13:02,855 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:13:02,949 INFO L415 sIntCurrentIteration]: We unified 215 AI predicates to 215 [2018-11-12 17:13:02,950 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:13:02,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:13:02,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2018-11-12 17:13:02,950 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:13:02,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 17:13:02,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 17:13:02,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-12 17:13:02,951 INFO L87 Difference]: Start difference. First operand 3186 states and 4318 transitions. Second operand 11 states. [2018-11-12 17:13:10,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:13:10,337 INFO L93 Difference]: Finished difference Result 8761 states and 12353 transitions. [2018-11-12 17:13:10,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-12 17:13:10,337 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 216 [2018-11-12 17:13:10,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:13:10,361 INFO L225 Difference]: With dead ends: 8761 [2018-11-12 17:13:10,361 INFO L226 Difference]: Without dead ends: 5878 [2018-11-12 17:13:10,373 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 228 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2018-11-12 17:13:10,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5878 states. [2018-11-12 17:13:10,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5878 to 5307. [2018-11-12 17:13:10,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5307 states. [2018-11-12 17:13:10,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5307 states to 5307 states and 6809 transitions. [2018-11-12 17:13:10,525 INFO L78 Accepts]: Start accepts. Automaton has 5307 states and 6809 transitions. Word has length 216 [2018-11-12 17:13:10,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:13:10,525 INFO L480 AbstractCegarLoop]: Abstraction has 5307 states and 6809 transitions. [2018-11-12 17:13:10,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 17:13:10,526 INFO L276 IsEmpty]: Start isEmpty. Operand 5307 states and 6809 transitions. [2018-11-12 17:13:10,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-11-12 17:13:10,852 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:13:10,853 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 17:13:10,854 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:13:10,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:13:10,854 INFO L82 PathProgramCache]: Analyzing trace with hash -640796914, now seen corresponding path program 1 times [2018-11-12 17:13:10,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:13:10,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:10,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:13:10,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:10,856 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:13:10,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:13:11,332 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 85 proven. 26 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-12 17:13:11,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:13:11,333 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:13:11,333 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 231 with the following transitions: [2018-11-12 17:13:11,333 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [202], [205], [209], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [807], [809], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:13:11,335 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:13:11,336 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:13:12,070 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:13:12,070 INFO L272 AbstractInterpreter]: Visited 148 different actions 591 times. Merged at 8 different actions 32 times. Never widened. Performed 8727 root evaluator evaluations with a maximum evaluation depth of 5. Performed 8727 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 8 fixpoints after 2 different actions. Largest state had 38 variables. [2018-11-12 17:13:12,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:13:12,079 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:13:12,348 INFO L227 lantSequenceWeakener]: Weakened 225 states. On average, predicates are now at 81.17% of their original sizes. [2018-11-12 17:13:12,348 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:13:12,468 INFO L415 sIntCurrentIteration]: We unified 229 AI predicates to 229 [2018-11-12 17:13:12,468 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:13:12,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:13:12,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2018-11-12 17:13:12,469 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:13:12,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 17:13:12,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 17:13:12,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-12 17:13:12,471 INFO L87 Difference]: Start difference. First operand 5307 states and 6809 transitions. Second operand 11 states. [2018-11-12 17:13:20,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:13:20,853 INFO L93 Difference]: Finished difference Result 12225 states and 16345 transitions. [2018-11-12 17:13:20,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-12 17:13:20,854 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 230 [2018-11-12 17:13:20,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:13:20,882 INFO L225 Difference]: With dead ends: 12225 [2018-11-12 17:13:20,882 INFO L226 Difference]: Without dead ends: 7221 [2018-11-12 17:13:20,896 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 242 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2018-11-12 17:13:20,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7221 states. [2018-11-12 17:13:21,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7221 to 6876. [2018-11-12 17:13:21,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6876 states. [2018-11-12 17:13:21,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6876 states to 6876 states and 8735 transitions. [2018-11-12 17:13:21,069 INFO L78 Accepts]: Start accepts. Automaton has 6876 states and 8735 transitions. Word has length 230 [2018-11-12 17:13:21,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:13:21,069 INFO L480 AbstractCegarLoop]: Abstraction has 6876 states and 8735 transitions. [2018-11-12 17:13:21,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 17:13:21,069 INFO L276 IsEmpty]: Start isEmpty. Operand 6876 states and 8735 transitions. [2018-11-12 17:13:21,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-11-12 17:13:21,092 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:13:21,092 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 17:13:21,092 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:13:21,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:13:21,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1882991460, now seen corresponding path program 1 times [2018-11-12 17:13:21,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:13:21,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:21,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:13:21,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:21,094 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:13:21,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:13:21,367 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 104 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:13:21,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:13:21,367 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:13:21,367 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 235 with the following transitions: [2018-11-12 17:13:21,368 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [202], [207], [209], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [807], [809], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:13:21,370 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:13:21,370 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:13:22,199 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:13:22,200 INFO L272 AbstractInterpreter]: Visited 150 different actions 592 times. Merged at 8 different actions 31 times. Widened at 1 different actions 1 times. Performed 8183 root evaluator evaluations with a maximum evaluation depth of 6. Performed 8183 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 6 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-12 17:13:22,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:13:22,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:13:22,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:13:22,211 INFO L192 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-12 17:13:22,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:13:22,222 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:13:22,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:13:22,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:13:22,797 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 119 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-12 17:13:22,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:13:23,775 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 119 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-12 17:13:23,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:13:23,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 5] total 17 [2018-11-12 17:13:23,796 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:13:23,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-12 17:13:23,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-12 17:13:23,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2018-11-12 17:13:23,798 INFO L87 Difference]: Start difference. First operand 6876 states and 8735 transitions. Second operand 15 states. [2018-11-12 17:13:27,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:13:27,522 INFO L93 Difference]: Finished difference Result 14586 states and 19173 transitions. [2018-11-12 17:13:27,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-12 17:13:27,523 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 234 [2018-11-12 17:13:27,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:13:27,523 INFO L225 Difference]: With dead ends: 14586 [2018-11-12 17:13:27,523 INFO L226 Difference]: Without dead ends: 0 [2018-11-12 17:13:27,558 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 475 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=235, Invalid=577, Unknown=0, NotChecked=0, Total=812 [2018-11-12 17:13:27,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-12 17:13:27,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-12 17:13:27,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-12 17:13:27,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-12 17:13:27,559 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 234 [2018-11-12 17:13:27,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:13:27,559 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-12 17:13:27,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-12 17:13:27,559 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-12 17:13:27,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-12 17:13:27,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-12 17:13:27,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:28,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:28,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:28,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:28,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:28,152 WARN L179 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 242 DAG size of output: 185 [2018-11-12 17:13:28,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:28,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:28,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:28,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:28,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:28,516 WARN L179 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 299 DAG size of output: 207 [2018-11-12 17:13:29,237 WARN L179 SmtUtils]: Spent 718.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2018-11-12 17:13:29,528 WARN L179 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 77 [2018-11-12 17:13:31,296 WARN L179 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 349 DAG size of output: 82 [2018-11-12 17:13:31,817 WARN L179 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 86 [2018-11-12 17:13:33,700 WARN L179 SmtUtils]: Spent 1.88 s on a formula simplification. DAG size of input: 224 DAG size of output: 86 [2018-11-12 17:13:33,703 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-12 17:13:33,703 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a28~0)| ~a28~0) (= ~a17~0 |old(~a17~0)|) (= |old(~a25~0)| ~a25~0)) [2018-11-12 17:13:33,703 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-12 17:13:33,703 INFO L425 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,703 INFO L425 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,703 INFO L425 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,704 INFO L425 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,704 INFO L425 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,704 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-11-12 17:13:33,704 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-11-12 17:13:33,704 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-11-12 17:13:33,704 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-11-12 17:13:33,704 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-11-12 17:13:33,704 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-11-12 17:13:33,705 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-11-12 17:13:33,705 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-11-12 17:13:33,705 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-11-12 17:13:33,705 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-11-12 17:13:33,705 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-11-12 17:13:33,705 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-11-12 17:13:33,705 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-11-12 17:13:33,705 INFO L425 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,706 INFO L425 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,706 INFO L425 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,706 INFO L425 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,706 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-11-12 17:13:33,706 INFO L425 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,706 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-11-12 17:13:33,706 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-11-12 17:13:33,706 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-11-12 17:13:33,707 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-11-12 17:13:33,707 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-11-12 17:13:33,707 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-11-12 17:13:33,707 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-11-12 17:13:33,707 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-11-12 17:13:33,707 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-11-12 17:13:33,707 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-11-12 17:13:33,707 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-11-12 17:13:33,707 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-11-12 17:13:33,708 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-11-12 17:13:33,708 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-11-12 17:13:33,708 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-11-12 17:13:33,708 INFO L425 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,708 INFO L425 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,708 INFO L425 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,708 INFO L425 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,708 INFO L425 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,709 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-11-12 17:13:33,709 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-11-12 17:13:33,709 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-11-12 17:13:33,709 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-11-12 17:13:33,709 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-11-12 17:13:33,709 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-11-12 17:13:33,709 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-11-12 17:13:33,709 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-11-12 17:13:33,709 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-11-12 17:13:33,710 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-11-12 17:13:33,710 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-11-12 17:13:33,710 INFO L425 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,710 INFO L425 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,710 INFO L425 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,710 INFO L425 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,710 INFO L425 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,710 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-11-12 17:13:33,711 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-11-12 17:13:33,711 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-11-12 17:13:33,711 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-11-12 17:13:33,711 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-11-12 17:13:33,711 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-11-12 17:13:33,711 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-11-12 17:13:33,711 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-11-12 17:13:33,711 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-11-12 17:13:33,711 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 577) no Hoare annotation was computed. [2018-11-12 17:13:33,712 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-11-12 17:13:33,712 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-11-12 17:13:33,712 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-11-12 17:13:33,712 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-11-12 17:13:33,712 INFO L425 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,712 INFO L425 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,712 INFO L425 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,712 INFO L425 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,713 INFO L425 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,713 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-11-12 17:13:33,713 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-11-12 17:13:33,713 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-11-12 17:13:33,713 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-11-12 17:13:33,713 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-11-12 17:13:33,713 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-11-12 17:13:33,713 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-11-12 17:13:33,713 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-11-12 17:13:33,714 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-11-12 17:13:33,714 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-11-12 17:13:33,714 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-11-12 17:13:33,714 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-11-12 17:13:33,714 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-11-12 17:13:33,714 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-11-12 17:13:33,714 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-11-12 17:13:33,714 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-11-12 17:13:33,714 INFO L425 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,714 INFO L425 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,715 INFO L425 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,715 INFO L425 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,715 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-12 17:13:33,715 INFO L425 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,715 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-11-12 17:13:33,715 INFO L425 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,715 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-11-12 17:13:33,715 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-11-12 17:13:33,715 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-11-12 17:13:33,716 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,716 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,716 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-11-12 17:13:33,716 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-11-12 17:13:33,716 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-11-12 17:13:33,716 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-11-12 17:13:33,716 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-11-12 17:13:33,716 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-11-12 17:13:33,716 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-11-12 17:13:33,716 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-11-12 17:13:33,717 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-11-12 17:13:33,717 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-11-12 17:13:33,717 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-11-12 17:13:33,717 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,717 INFO L425 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,717 INFO L425 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,717 INFO L425 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,717 INFO L425 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,717 INFO L425 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,718 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-11-12 17:13:33,718 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-11-12 17:13:33,718 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-11-12 17:13:33,718 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-11-12 17:13:33,718 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-11-12 17:13:33,718 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-11-12 17:13:33,718 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-11-12 17:13:33,718 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-11-12 17:13:33,718 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-11-12 17:13:33,718 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-11-12 17:13:33,719 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-11-12 17:13:33,719 INFO L425 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,719 INFO L425 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,719 INFO L425 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,719 INFO L425 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,719 INFO L425 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,719 INFO L425 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,719 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-11-12 17:13:33,719 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-11-12 17:13:33,719 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-11-12 17:13:33,720 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-11-12 17:13:33,720 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-11-12 17:13:33,720 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-11-12 17:13:33,720 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-11-12 17:13:33,720 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-11-12 17:13:33,720 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-11-12 17:13:33,720 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-11-12 17:13:33,720 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-11-12 17:13:33,720 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-11-12 17:13:33,721 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-11-12 17:13:33,721 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-11-12 17:13:33,721 INFO L425 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,721 INFO L425 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,721 INFO L425 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,721 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse11 (= |old(~a28~0)| ~a28~0)) (.cse12 (= 7 ~a17~0)) (.cse16 (= |old(~a25~0)| ~a25~0))) (let ((.cse0 (< 6 |calculate_output_#in~input|)) (.cse7 (< |old(~a25~0)| 0)) (.cse5 (< |old(~a28~0)| 7)) (.cse6 (< 1 |old(~a25~0)|)) (.cse4 (< 11 |old(~a28~0)|)) (.cse9 (< |calculate_output_#in~input| 1)) (.cse2 (not (= 1 |old(~a19~0)|))) (.cse10 (= 1 |old(~a25~0)|)) (.cse8 (not (= |old(~a17~0)| 8))) (.cse1 (not (= 1 ~a21~0))) (.cse15 (= |old(~a17~0)| |old(~a28~0)|)) (.cse14 (and .cse11 .cse12 .cse16)) (.cse13 (not (= 7 |old(~a17~0)|)))) (and (or .cse0 (let ((.cse3 (not (= 0 |old(~a11~0)|)))) (and (or .cse1 .cse2 .cse3 .cse4 .cse5 (not (= 0 |old(~a25~0)|))) (or .cse1 (< |old(~a28~0)| 8) .cse2 .cse6 .cse3 .cse4))) .cse7 (= ~a11~0 0) .cse8 .cse9) (or .cse0 .cse1 (and (<= 0 ~a11~0) (<= ~a11~0 1) (= ~a19~0 1)) (< 1 |old(~a11~0)|) .cse7 .cse5 (< |old(~a11~0)| 0) .cse2 .cse6 .cse4 .cse8 .cse9) (or .cse1 (not (= 7 |old(~a28~0)|)) (not .cse10) .cse2 (not (= 1 |old(~a11~0)|)) (and .cse11 (= 1 ~a11~0) .cse12 (= 1 ~a25~0) (= 1 ~a19~0)) .cse13) (or .cse1 .cse14 .cse15 .cse10 .cse13) (or .cse1 (and .cse11 (= ~a17~0 |old(~a17~0)|) .cse16) .cse8) (or .cse1 (= 10 |old(~a28~0)|) .cse15 .cse14 .cse13)))) [2018-11-12 17:13:33,722 INFO L425 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,722 INFO L425 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,722 INFO L425 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,722 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-11-12 17:13:33,722 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-11-12 17:13:33,722 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-11-12 17:13:33,722 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-11-12 17:13:33,722 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-11-12 17:13:33,722 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-11-12 17:13:33,723 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-11-12 17:13:33,723 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-11-12 17:13:33,723 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-11-12 17:13:33,723 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-11-12 17:13:33,723 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-11-12 17:13:33,723 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-11-12 17:13:33,723 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-11-12 17:13:33,723 INFO L425 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,723 INFO L425 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,723 INFO L425 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,724 INFO L425 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,724 INFO L425 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,724 INFO L425 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,724 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-11-12 17:13:33,724 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-11-12 17:13:33,724 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-11-12 17:13:33,724 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-11-12 17:13:33,724 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-11-12 17:13:33,724 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-11-12 17:13:33,724 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-11-12 17:13:33,725 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-11-12 17:13:33,725 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-11-12 17:13:33,725 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-11-12 17:13:33,725 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-11-12 17:13:33,725 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-11-12 17:13:33,725 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-11-12 17:13:33,725 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-11-12 17:13:33,725 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-11-12 17:13:33,725 INFO L425 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-11-12 17:13:33,726 INFO L425 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,726 INFO L425 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,726 INFO L425 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,726 INFO L425 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,726 INFO L425 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:33,726 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-11-12 17:13:33,726 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-11-12 17:13:33,726 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-11-12 17:13:33,726 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-11-12 17:13:33,726 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-11-12 17:13:33,727 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-11-12 17:13:33,727 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-11-12 17:13:33,727 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-11-12 17:13:33,727 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-11-12 17:13:33,727 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-11-12 17:13:33,727 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-11-12 17:13:33,727 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-11-12 17:13:33,727 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-11-12 17:13:33,727 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-11-12 17:13:33,727 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-11-12 17:13:33,728 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-11-12 17:13:33,728 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-11-12 17:13:33,728 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-11-12 17:13:33,728 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-11-12 17:13:33,728 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-12 17:13:33,728 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~z~0 26) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a~0 1) (= ~a19~0 1) (= ~a28~0 7)) [2018-11-12 17:13:33,728 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-12 17:13:33,728 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-12 17:13:33,729 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= |old(~a11~0)| 0)) (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= ~a21~0 1)) (not (= ~y~0 25)) (not (= 3 ~c~0)) (not (= |old(~a25~0)| 0)) (not (= |old(~a28~0)| 7)) (and (= ~a11~0 0) (= ~a25~0 0) (= ~a19~0 1) (= |old(~a28~0)| ~a28~0) (= ~a17~0 8)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= 8 |old(~a17~0)|)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-11-12 17:13:33,729 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-11-12 17:13:33,729 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse0 (not (= ~a28~0 ~a17~0))) (.cse1 (= 7 ~a17~0)) (.cse2 (not (= ~a28~0 10)))) (or (= |old(~a17~0)| ~a17~0) (not (= ~a21~0 1)) (not (= ~y~0 25)) (and .cse0 (not (= ~a25~0 1)) .cse1) (and (= 1 ~a11~0) .cse1 (= 1 ~a25~0) (= 1 ~a19~0) .cse2) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (and .cse0 .cse1 .cse2) (not (= |old(~a11~0)| 0)) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0)))) [2018-11-12 17:13:33,729 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-11-12 17:13:33,729 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-11-12 17:13:33,729 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse0 (not (= ~a28~0 ~a17~0))) (.cse1 (= 7 ~a17~0)) (.cse2 (not (= ~a28~0 10)))) (or (= |old(~a17~0)| ~a17~0) (not (= ~a21~0 1)) (not (= ~y~0 25)) (and .cse0 (not (= ~a25~0 1)) .cse1) (and (= 1 ~a11~0) .cse1 (= 1 ~a25~0) (= 1 ~a19~0) .cse2) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (and .cse0 .cse1 .cse2) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0)))) [2018-11-12 17:13:33,730 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-11-12 17:13:33,730 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-11-12 17:13:33,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:13:33 BoogieIcfgContainer [2018-11-12 17:13:33,745 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 17:13:33,746 INFO L168 Benchmark]: Toolchain (without parser) took 100920.99 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 2.9 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-11-12 17:13:33,751 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 17:13:33,751 INFO L168 Benchmark]: CACSL2BoogieTranslator took 763.03 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-11-12 17:13:33,752 INFO L168 Benchmark]: Boogie Procedure Inliner took 146.77 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 751.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -842.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. [2018-11-12 17:13:33,754 INFO L168 Benchmark]: Boogie Preprocessor took 115.67 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. [2018-11-12 17:13:33,755 INFO L168 Benchmark]: RCFGBuilder took 3658.75 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 114.9 MB). Peak memory consumption was 114.9 MB. Max. memory is 7.1 GB. [2018-11-12 17:13:33,756 INFO L168 Benchmark]: TraceAbstraction took 96231.71 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.9 GB in the end (delta: -782.9 MB). Peak memory consumption was 985.5 MB. Max. memory is 7.1 GB. [2018-11-12 17:13:33,765 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.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 763.03 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 146.77 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 751.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -842.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 115.67 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3658.75 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 114.9 MB). Peak memory consumption was 114.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 96231.71 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.9 GB in the end (delta: -782.9 MB). Peak memory consumption was 985.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 577]: 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: 606]: Loop Invariant Derived loop invariant: (((((((((((((((((((\old(a17) == a17 || !(a21 == 1)) || !(y == 25)) || ((!(a28 == a17) && !(a25 == 1)) && 7 == a17)) || ((((1 == a11 && 7 == a17) && 1 == a25) && 1 == a19) && !(a28 == 10))) || !(1 == \old(a19))) || !(x == 24)) || !(e == 5)) || !(d == 4)) || !(21 == u)) || !(22 == v)) || ((!(a28 == a17) && 7 == a17) && !(a28 == 10))) || !(\old(a11) == 0)) || !(z == 26)) || !(0 == \old(a25))) || !(3 == c)) || !(23 == w)) || !(\old(a28) == 7)) || !(a == 1)) || !(\old(a17) == 8)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 96.1s OverallTime, 10 OverallIterations, 5 TraceHistogramMax, 70.5s AutomataDifference, 0.0s DeadEndRemovalTime, 6.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 1663 SDtfs, 12117 SDslu, 2875 SDs, 0 SdLazy, 14266 SolverSat, 3058 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25.9s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 1662 GetRequests, 1480 SyntacticMatches, 7 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 940 ImplicationChecksByTransitivity, 8.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6876occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.6s AbstIntTime, 6 AbstIntIterations, 5 AbstIntStrong, 0.9977577235849283 AbsIntWeakeningRatio, 0.17803030303030304 AbsIntAvgWeakeningVarsNumRemoved, 21.086174242424242 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 10 MinimizatonAttempts, 1300 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 176 PreInvPairs, 270 NumberOfFragments, 611 HoareAnnotationTreeSize, 176 FomulaSimplifications, 31225 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 7 FomulaSimplificationsInter, 18613 FormulaSimplificationTreeSizeReductionInter, 5.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 2201 NumberOfCodeBlocks, 2201 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2423 ConstructedInterpolants, 0 QuantifiedInterpolants, 1481736 SizeOfPredicates, 1 NumberOfNonLiveVariables, 533 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 780/905 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...