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/Problem11_label16_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 20:07:07,222 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 20:07:07,224 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 20:07:07,241 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 20:07:07,241 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 20:07:07,242 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 20:07:07,245 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 20:07:07,247 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 20:07:07,249 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 20:07:07,250 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 20:07:07,250 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 20:07:07,251 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 20:07:07,252 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 20:07:07,254 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 20:07:07,262 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 20:07:07,263 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 20:07:07,264 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 20:07:07,267 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 20:07:07,271 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 20:07:07,273 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 20:07:07,277 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 20:07:07,278 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 20:07:07,282 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 20:07:07,283 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 20:07:07,283 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 20:07:07,284 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 20:07:07,285 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 20:07:07,287 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 20:07:07,288 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 20:07:07,290 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 20:07:07,291 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 20:07:07,292 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 20:07:07,292 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 20:07:07,292 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 20:07:07,293 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 20:07:07,294 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 20:07:07,295 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-07 20:07:07,325 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 20:07:07,325 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 20:07:07,326 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 20:07:07,326 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 20:07:07,326 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 20:07:07,326 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 20:07:07,327 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 20:07:07,327 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 20:07:07,327 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 20:07:07,327 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 20:07:07,328 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 20:07:07,328 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 20:07:07,328 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 20:07:07,330 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 20:07:07,330 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 20:07:07,330 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 20:07:07,330 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 20:07:07,331 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 20:07:07,331 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 20:07:07,331 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 20:07:07,331 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 20:07:07,331 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 20:07:07,331 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 20:07:07,333 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 20:07:07,333 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 20:07:07,333 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 20:07:07,334 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 20:07:07,334 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 20:07:07,334 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 20:07:07,334 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 20:07:07,334 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 20:07:07,334 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 20:07:07,335 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 20:07:07,335 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 20:07:07,335 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 20:07:07,407 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 20:07:07,425 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 20:07:07,429 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 20:07:07,431 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 20:07:07,431 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 20:07:07,432 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label16_true-unreach-call.c [2018-11-07 20:07:07,498 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e18d15f94/58b23d393c924a42abbdd4dbf4d5af90/FLAG6903d9263 [2018-11-07 20:07:08,144 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 20:07:08,145 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label16_true-unreach-call.c [2018-11-07 20:07:08,179 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e18d15f94/58b23d393c924a42abbdd4dbf4d5af90/FLAG6903d9263 [2018-11-07 20:07:08,195 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e18d15f94/58b23d393c924a42abbdd4dbf4d5af90 [2018-11-07 20:07:08,206 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 20:07:08,208 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 20:07:08,209 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 20:07:08,209 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 20:07:08,214 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 20:07:08,215 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:07:08" (1/1) ... [2018-11-07 20:07:08,219 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b66f157 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:07:08, skipping insertion in model container [2018-11-07 20:07:08,219 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:07:08" (1/1) ... [2018-11-07 20:07:08,229 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 20:07:08,320 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 20:07:08,932 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 20:07:08,937 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 20:07:09,148 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 20:07:09,179 INFO L193 MainTranslator]: Completed translation [2018-11-07 20:07:09,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:07:09 WrapperNode [2018-11-07 20:07:09,180 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 20:07:09,181 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 20:07:09,182 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 20:07:09,182 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 20:07:09,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:07:09" (1/1) ... [2018-11-07 20:07:09,356 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:07:09" (1/1) ... [2018-11-07 20:07:09,374 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 20:07:09,375 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 20:07:09,375 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 20:07:09,375 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 20:07:09,395 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:07:09" (1/1) ... [2018-11-07 20:07:09,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:07:09" (1/1) ... [2018-11-07 20:07:09,409 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:07:09" (1/1) ... [2018-11-07 20:07:09,409 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:07:09" (1/1) ... [2018-11-07 20:07:09,472 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:07:09" (1/1) ... [2018-11-07 20:07:09,503 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:07:09" (1/1) ... [2018-11-07 20:07:09,522 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:07:09" (1/1) ... [2018-11-07 20:07:09,535 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 20:07:09,535 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 20:07:09,536 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 20:07:09,536 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 20:07:09,537 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:07:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 20:07:09,605 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 20:07:09,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 20:07:09,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 20:07:09,606 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 20:07:09,606 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 20:07:09,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 20:07:09,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 20:07:09,607 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 20:07:09,607 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 20:07:13,724 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 20:07:13,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:07:13 BoogieIcfgContainer [2018-11-07 20:07:13,725 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 20:07:13,727 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 20:07:13,727 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 20:07:13,730 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 20:07:13,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:07:08" (1/3) ... [2018-11-07 20:07:13,732 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@436ff136 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:07:13, skipping insertion in model container [2018-11-07 20:07:13,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:07:09" (2/3) ... [2018-11-07 20:07:13,732 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@436ff136 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:07:13, skipping insertion in model container [2018-11-07 20:07:13,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:07:13" (3/3) ... [2018-11-07 20:07:13,734 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label16_true-unreach-call.c [2018-11-07 20:07:13,745 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 20:07:13,753 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 20:07:13,769 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 20:07:13,808 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 20:07:13,809 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 20:07:13,809 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 20:07:13,809 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 20:07:13,809 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 20:07:13,810 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 20:07:13,810 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 20:07:13,810 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 20:07:13,841 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states. [2018-11-07 20:07:13,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-07 20:07:13,850 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:07:13,852 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] [2018-11-07 20:07:13,854 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:07:13,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:07:13,861 INFO L82 PathProgramCache]: Analyzing trace with hash -328635820, now seen corresponding path program 1 times [2018-11-07 20:07:13,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:07:13,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:07:13,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:07:13,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:07:13,919 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:07:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:07:14,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:07:14,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:07:14,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 20:07:14,416 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:07:14,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 20:07:14,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 20:07:14,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:07:14,446 INFO L87 Difference]: Start difference. First operand 293 states. Second operand 4 states. [2018-11-07 20:07:17,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:07:17,415 INFO L93 Difference]: Finished difference Result 985 states and 1761 transitions. [2018-11-07 20:07:17,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 20:07:17,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-11-07 20:07:17,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:07:17,444 INFO L225 Difference]: With dead ends: 985 [2018-11-07 20:07:17,445 INFO L226 Difference]: Without dead ends: 686 [2018-11-07 20:07:17,454 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:07:17,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2018-11-07 20:07:17,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 686. [2018-11-07 20:07:17,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2018-11-07 20:07:17,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 1046 transitions. [2018-11-07 20:07:17,564 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 1046 transitions. Word has length 50 [2018-11-07 20:07:17,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:07:17,565 INFO L480 AbstractCegarLoop]: Abstraction has 686 states and 1046 transitions. [2018-11-07 20:07:17,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 20:07:17,565 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 1046 transitions. [2018-11-07 20:07:17,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-07 20:07:17,573 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:07:17,574 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:07:17,574 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:07:17,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:07:17,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1947059533, now seen corresponding path program 1 times [2018-11-07 20:07:17,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:07:17,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:07:17,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:07:17,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:07:17,577 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:07:17,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:07:17,919 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:07:17,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:07:17,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 20:07:17,920 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:07:17,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 20:07:17,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 20:07:17,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-07 20:07:17,923 INFO L87 Difference]: Start difference. First operand 686 states and 1046 transitions. Second operand 6 states. [2018-11-07 20:07:22,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:07:22,729 INFO L93 Difference]: Finished difference Result 2339 states and 3734 transitions. [2018-11-07 20:07:22,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 20:07:22,731 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2018-11-07 20:07:22,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:07:22,748 INFO L225 Difference]: With dead ends: 2339 [2018-11-07 20:07:22,749 INFO L226 Difference]: Without dead ends: 1659 [2018-11-07 20:07:22,754 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-07 20:07:22,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2018-11-07 20:07:22,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1642. [2018-11-07 20:07:22,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1642 states. [2018-11-07 20:07:22,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1642 states to 1642 states and 2354 transitions. [2018-11-07 20:07:22,848 INFO L78 Accepts]: Start accepts. Automaton has 1642 states and 2354 transitions. Word has length 131 [2018-11-07 20:07:22,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:07:22,849 INFO L480 AbstractCegarLoop]: Abstraction has 1642 states and 2354 transitions. [2018-11-07 20:07:22,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 20:07:22,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1642 states and 2354 transitions. [2018-11-07 20:07:22,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-07 20:07:22,868 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:07:22,868 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:07:22,868 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:07:22,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:07:22,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1463851825, now seen corresponding path program 1 times [2018-11-07 20:07:22,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:07:22,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:07:22,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:07:22,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:07:22,872 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:07:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:07:23,231 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:07:23,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:07:23,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 20:07:23,232 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:07:23,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 20:07:23,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 20:07:23,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:07:23,235 INFO L87 Difference]: Start difference. First operand 1642 states and 2354 transitions. Second operand 4 states. [2018-11-07 20:07:26,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:07:26,152 INFO L93 Difference]: Finished difference Result 6013 states and 9018 transitions. [2018-11-07 20:07:26,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 20:07:26,153 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2018-11-07 20:07:26,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:07:26,189 INFO L225 Difference]: With dead ends: 6013 [2018-11-07 20:07:26,189 INFO L226 Difference]: Without dead ends: 4377 [2018-11-07 20:07:26,206 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:07:26,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4377 states. [2018-11-07 20:07:26,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4377 to 4354. [2018-11-07 20:07:26,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4354 states. [2018-11-07 20:07:26,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4354 states to 4354 states and 6078 transitions. [2018-11-07 20:07:26,352 INFO L78 Accepts]: Start accepts. Automaton has 4354 states and 6078 transitions. Word has length 182 [2018-11-07 20:07:26,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:07:26,353 INFO L480 AbstractCegarLoop]: Abstraction has 4354 states and 6078 transitions. [2018-11-07 20:07:26,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 20:07:26,354 INFO L276 IsEmpty]: Start isEmpty. Operand 4354 states and 6078 transitions. [2018-11-07 20:07:26,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-11-07 20:07:26,365 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:07:26,365 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:07:26,366 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:07:26,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:07:26,366 INFO L82 PathProgramCache]: Analyzing trace with hash -572064998, now seen corresponding path program 1 times [2018-11-07 20:07:26,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:07:26,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:07:26,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:07:26,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:07:26,368 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:07:26,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:07:26,664 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 86 proven. 68 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 20:07:26,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:07:26,665 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:07:26,666 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 227 with the following transitions: [2018-11-07 20:07:26,668 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [301], [303], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [618], [623], [625], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-07 20:07:26,738 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:07:26,738 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:07:27,460 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:07:27,463 INFO L272 AbstractInterpreter]: Visited 106 different actions 106 times. Never merged. Never widened. Never found a fixpoint. Largest state had 28 variables. [2018-11-07 20:07:27,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:07:27,527 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:07:28,206 INFO L227 lantSequenceWeakener]: Weakened 215 states. On average, predicates are now at 73.51% of their original sizes. [2018-11-07 20:07:28,207 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:07:28,391 INFO L415 sIntCurrentIteration]: We unified 225 AI predicates to 225 [2018-11-07 20:07:28,391 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:07:28,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:07:28,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2018-11-07 20:07:28,393 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:07:28,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 20:07:28,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 20:07:28,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-07 20:07:28,394 INFO L87 Difference]: Start difference. First operand 4354 states and 6078 transitions. Second operand 7 states. [2018-11-07 20:07:31,150 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:07:39,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:07:39,324 INFO L93 Difference]: Finished difference Result 8894 states and 12374 transitions. [2018-11-07 20:07:39,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 20:07:39,324 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 226 [2018-11-07 20:07:39,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:07:39,355 INFO L225 Difference]: With dead ends: 8894 [2018-11-07 20:07:39,356 INFO L226 Difference]: Without dead ends: 4546 [2018-11-07 20:07:39,375 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 226 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-07 20:07:39,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4546 states. [2018-11-07 20:07:39,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4546 to 4544. [2018-11-07 20:07:39,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4544 states. [2018-11-07 20:07:39,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4544 states to 4544 states and 6278 transitions. [2018-11-07 20:07:39,698 INFO L78 Accepts]: Start accepts. Automaton has 4544 states and 6278 transitions. Word has length 226 [2018-11-07 20:07:39,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:07:39,699 INFO L480 AbstractCegarLoop]: Abstraction has 4544 states and 6278 transitions. [2018-11-07 20:07:39,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 20:07:39,700 INFO L276 IsEmpty]: Start isEmpty. Operand 4544 states and 6278 transitions. [2018-11-07 20:07:39,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-11-07 20:07:39,716 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:07:39,717 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 20:07:39,717 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:07:39,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:07:39,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1720249895, now seen corresponding path program 1 times [2018-11-07 20:07:39,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:07:39,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:07:39,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:07:39,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:07:39,719 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:07:39,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:07:40,076 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-11-07 20:07:40,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:07:40,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 20:07:40,077 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:07:40,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 20:07:40,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 20:07:40,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 20:07:40,079 INFO L87 Difference]: Start difference. First operand 4544 states and 6278 transitions. Second operand 3 states. [2018-11-07 20:07:43,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:07:43,583 INFO L93 Difference]: Finished difference Result 10605 states and 15140 transitions. [2018-11-07 20:07:43,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 20:07:43,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2018-11-07 20:07:43,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:07:43,615 INFO L225 Difference]: With dead ends: 10605 [2018-11-07 20:07:43,616 INFO L226 Difference]: Without dead ends: 6257 [2018-11-07 20:07:43,643 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 20:07:43,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6257 states. [2018-11-07 20:07:43,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6257 to 6257. [2018-11-07 20:07:43,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6257 states. [2018-11-07 20:07:43,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6257 states to 6257 states and 8403 transitions. [2018-11-07 20:07:43,806 INFO L78 Accepts]: Start accepts. Automaton has 6257 states and 8403 transitions. Word has length 320 [2018-11-07 20:07:43,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:07:43,807 INFO L480 AbstractCegarLoop]: Abstraction has 6257 states and 8403 transitions. [2018-11-07 20:07:43,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 20:07:43,807 INFO L276 IsEmpty]: Start isEmpty. Operand 6257 states and 8403 transitions. [2018-11-07 20:07:43,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2018-11-07 20:07:43,828 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:07:43,828 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:07:43,829 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:07:43,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:07:43,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1616066757, now seen corresponding path program 1 times [2018-11-07 20:07:43,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:07:43,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:07:43,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:07:43,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:07:43,833 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:07:43,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:07:44,357 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 312 proven. 2 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-11-07 20:07:44,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:07:44,357 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:07:44,357 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 354 with the following transitions: [2018-11-07 20:07:44,358 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [301], [303], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [578], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [710], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-07 20:07:44,364 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:07:44,364 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:07:44,474 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:07:44,667 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:07:44,667 INFO L272 AbstractInterpreter]: Visited 126 different actions 246 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-11-07 20:07:44,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:07:44,708 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:07:45,411 INFO L227 lantSequenceWeakener]: Weakened 350 states. On average, predicates are now at 73.4% of their original sizes. [2018-11-07 20:07:45,411 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:07:46,065 INFO L415 sIntCurrentIteration]: We unified 352 AI predicates to 352 [2018-11-07 20:07:46,066 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:07:46,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:07:46,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-11-07 20:07:46,066 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:07:46,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 20:07:46,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 20:07:46,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-07 20:07:46,072 INFO L87 Difference]: Start difference. First operand 6257 states and 8403 transitions. Second operand 11 states. [2018-11-07 20:07:55,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:07:55,872 INFO L93 Difference]: Finished difference Result 12513 states and 16837 transitions. [2018-11-07 20:07:55,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 20:07:55,873 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 353 [2018-11-07 20:07:55,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:07:55,900 INFO L225 Difference]: With dead ends: 12513 [2018-11-07 20:07:55,900 INFO L226 Difference]: Without dead ends: 6452 [2018-11-07 20:07:55,919 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 361 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2018-11-07 20:07:55,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6452 states. [2018-11-07 20:07:56,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6452 to 6448. [2018-11-07 20:07:56,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6448 states. [2018-11-07 20:07:56,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6448 states to 6448 states and 8614 transitions. [2018-11-07 20:07:56,069 INFO L78 Accepts]: Start accepts. Automaton has 6448 states and 8614 transitions. Word has length 353 [2018-11-07 20:07:56,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:07:56,070 INFO L480 AbstractCegarLoop]: Abstraction has 6448 states and 8614 transitions. [2018-11-07 20:07:56,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 20:07:56,070 INFO L276 IsEmpty]: Start isEmpty. Operand 6448 states and 8614 transitions. [2018-11-07 20:07:56,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2018-11-07 20:07:56,090 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:07:56,091 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:07:56,091 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:07:56,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:07:56,092 INFO L82 PathProgramCache]: Analyzing trace with hash 2033122385, now seen corresponding path program 1 times [2018-11-07 20:07:56,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:07:56,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:07:56,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:07:56,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:07:56,094 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:07:56,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:07:56,928 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 312 proven. 2 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-11-07 20:07:56,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:07:56,928 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:07:56,929 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 364 with the following transitions: [2018-11-07 20:07:56,929 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [301], [303], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [578], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [750], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-07 20:07:56,935 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:07:56,935 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:07:56,998 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:07:57,270 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:07:57,271 INFO L272 AbstractInterpreter]: Visited 136 different actions 395 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-11-07 20:07:57,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:07:57,307 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:07:57,811 INFO L227 lantSequenceWeakener]: Weakened 360 states. On average, predicates are now at 73.39% of their original sizes. [2018-11-07 20:07:57,812 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:07:57,931 INFO L415 sIntCurrentIteration]: We unified 362 AI predicates to 362 [2018-11-07 20:07:57,931 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:07:57,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:07:57,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-11-07 20:07:57,932 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:07:57,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 20:07:57,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 20:07:57,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-07 20:07:57,933 INFO L87 Difference]: Start difference. First operand 6448 states and 8614 transitions. Second operand 11 states. [2018-11-07 20:08:15,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:08:15,566 INFO L93 Difference]: Finished difference Result 13097 states and 17561 transitions. [2018-11-07 20:08:15,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 20:08:15,566 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 363 [2018-11-07 20:08:15,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:08:15,593 INFO L225 Difference]: With dead ends: 13097 [2018-11-07 20:08:15,593 INFO L226 Difference]: Without dead ends: 7036 [2018-11-07 20:08:15,608 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 372 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2018-11-07 20:08:15,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7036 states. [2018-11-07 20:08:15,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7036 to 7026. [2018-11-07 20:08:15,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7026 states. [2018-11-07 20:08:15,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7026 states to 7026 states and 9285 transitions. [2018-11-07 20:08:15,754 INFO L78 Accepts]: Start accepts. Automaton has 7026 states and 9285 transitions. Word has length 363 [2018-11-07 20:08:15,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:08:15,755 INFO L480 AbstractCegarLoop]: Abstraction has 7026 states and 9285 transitions. [2018-11-07 20:08:15,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 20:08:15,755 INFO L276 IsEmpty]: Start isEmpty. Operand 7026 states and 9285 transitions. [2018-11-07 20:08:15,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2018-11-07 20:08:15,776 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:08:15,777 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:08:15,777 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:08:15,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:08:15,778 INFO L82 PathProgramCache]: Analyzing trace with hash 139923236, now seen corresponding path program 1 times [2018-11-07 20:08:15,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:08:15,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:08:15,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:08:15,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:08:15,779 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:08:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:08:16,393 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 312 proven. 2 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-11-07 20:08:16,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:08:16,394 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:08:16,394 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 366 with the following transitions: [2018-11-07 20:08:16,394 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [301], [303], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [578], [579], [582], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [769], [772], [776], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-07 20:08:16,404 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:08:16,405 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:08:16,496 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:08:17,871 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 20:08:17,871 INFO L272 AbstractInterpreter]: Visited 142 different actions 986 times. Merged at 8 different actions 61 times. Widened at 1 different actions 2 times. Found 13 fixpoints after 2 different actions. Largest state had 28 variables. [2018-11-07 20:08:17,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:08:17,879 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 20:08:17,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:08:17,880 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 20:08:17,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:08:17,891 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 20:08:18,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:08:18,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 20:08:18,198 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2018-11-07 20:08:18,201 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 20:08:19,573 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2018-11-07 20:08:19,605 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:08:19,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 8 [2018-11-07 20:08:19,606 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:08:19,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 20:08:19,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 20:08:19,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-07 20:08:19,607 INFO L87 Difference]: Start difference. First operand 7026 states and 9285 transitions. Second operand 3 states. [2018-11-07 20:08:22,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:08:22,014 INFO L93 Difference]: Finished difference Result 17803 states and 24487 transitions. [2018-11-07 20:08:22,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 20:08:22,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 365 [2018-11-07 20:08:22,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:08:22,061 INFO L225 Difference]: With dead ends: 17803 [2018-11-07 20:08:22,061 INFO L226 Difference]: Without dead ends: 11163 [2018-11-07 20:08:22,095 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 735 GetRequests, 728 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-07 20:08:22,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11163 states. [2018-11-07 20:08:22,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11163 to 10970. [2018-11-07 20:08:22,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10970 states. [2018-11-07 20:08:22,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10970 states to 10970 states and 14595 transitions. [2018-11-07 20:08:22,406 INFO L78 Accepts]: Start accepts. Automaton has 10970 states and 14595 transitions. Word has length 365 [2018-11-07 20:08:22,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:08:22,407 INFO L480 AbstractCegarLoop]: Abstraction has 10970 states and 14595 transitions. [2018-11-07 20:08:22,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 20:08:22,407 INFO L276 IsEmpty]: Start isEmpty. Operand 10970 states and 14595 transitions. [2018-11-07 20:08:22,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2018-11-07 20:08:22,445 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:08:22,445 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:08:22,446 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:08:22,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:08:22,447 INFO L82 PathProgramCache]: Analyzing trace with hash -294220068, now seen corresponding path program 1 times [2018-11-07 20:08:22,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:08:22,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:08:22,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:08:22,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:08:22,448 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:08:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:08:23,214 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 323 proven. 82 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 20:08:23,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:08:23,214 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:08:23,214 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 368 with the following transitions: [2018-11-07 20:08:23,215 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [301], [303], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [554], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [680], [685], [687], [688], [692], [696], [707], [710], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-07 20:08:23,218 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:08:23,218 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:08:23,371 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:08:24,045 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:08:24,045 INFO L272 AbstractInterpreter]: Visited 126 different actions 497 times. Merged at 7 different actions 26 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 28 variables. [2018-11-07 20:08:24,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:08:24,083 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:08:24,664 INFO L227 lantSequenceWeakener]: Weakened 362 states. On average, predicates are now at 75.32% of their original sizes. [2018-11-07 20:08:24,664 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:08:24,928 INFO L415 sIntCurrentIteration]: We unified 366 AI predicates to 366 [2018-11-07 20:08:24,928 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:08:24,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:08:24,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-07 20:08:24,928 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:08:24,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 20:08:24,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 20:08:24,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-07 20:08:24,930 INFO L87 Difference]: Start difference. First operand 10970 states and 14595 transitions. Second operand 10 states. [2018-11-07 20:08:32,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:08:32,763 INFO L93 Difference]: Finished difference Result 23466 states and 31669 transitions. [2018-11-07 20:08:32,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 20:08:32,763 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 367 [2018-11-07 20:08:32,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:08:32,820 INFO L225 Difference]: With dead ends: 23466 [2018-11-07 20:08:32,820 INFO L226 Difference]: Without dead ends: 13839 [2018-11-07 20:08:32,846 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 373 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-11-07 20:08:32,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13839 states. [2018-11-07 20:08:33,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13839 to 13823. [2018-11-07 20:08:33,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13823 states. [2018-11-07 20:08:33,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13823 states to 13823 states and 18186 transitions. [2018-11-07 20:08:33,159 INFO L78 Accepts]: Start accepts. Automaton has 13823 states and 18186 transitions. Word has length 367 [2018-11-07 20:08:33,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:08:33,160 INFO L480 AbstractCegarLoop]: Abstraction has 13823 states and 18186 transitions. [2018-11-07 20:08:33,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 20:08:33,160 INFO L276 IsEmpty]: Start isEmpty. Operand 13823 states and 18186 transitions. [2018-11-07 20:08:33,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2018-11-07 20:08:33,201 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:08:33,202 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 20:08:33,202 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:08:33,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:08:33,202 INFO L82 PathProgramCache]: Analyzing trace with hash 858162467, now seen corresponding path program 1 times [2018-11-07 20:08:33,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:08:33,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:08:33,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:08:33,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:08:33,204 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:08:33,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:08:33,826 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 313 proven. 2 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-11-07 20:08:33,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:08:33,826 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:08:33,826 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 368 with the following transitions: [2018-11-07 20:08:33,827 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [301], [303], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [494], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [680], [685], [687], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [769], [772], [776], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-07 20:08:33,830 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:08:33,830 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:08:34,042 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:08:35,855 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:08:35,855 INFO L272 AbstractInterpreter]: Visited 143 different actions 704 times. Merged at 8 different actions 35 times. Never widened. Found 9 fixpoints after 1 different actions. Largest state had 28 variables. [2018-11-07 20:08:35,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:08:35,893 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:08:36,527 INFO L227 lantSequenceWeakener]: Weakened 364 states. On average, predicates are now at 73.46% of their original sizes. [2018-11-07 20:08:36,528 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:08:37,316 INFO L415 sIntCurrentIteration]: We unified 366 AI predicates to 366 [2018-11-07 20:08:37,316 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:08:37,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:08:37,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [6] total 19 [2018-11-07 20:08:37,317 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:08:37,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 20:08:37,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 20:08:37,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-11-07 20:08:37,318 INFO L87 Difference]: Start difference. First operand 13823 states and 18186 transitions. Second operand 15 states. [2018-11-07 20:09:49,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:09:49,718 INFO L93 Difference]: Finished difference Result 39408 states and 53060 transitions. [2018-11-07 20:09:49,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-11-07 20:09:49,718 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 367 [2018-11-07 20:09:49,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:09:49,832 INFO L225 Difference]: With dead ends: 39408 [2018-11-07 20:09:49,832 INFO L226 Difference]: Without dead ends: 24768 [2018-11-07 20:09:49,880 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 409 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 909 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=441, Invalid=2865, Unknown=0, NotChecked=0, Total=3306 [2018-11-07 20:09:49,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24768 states. [2018-11-07 20:09:50,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24768 to 24061. [2018-11-07 20:09:50,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24061 states. [2018-11-07 20:09:50,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24061 states to 24061 states and 30987 transitions. [2018-11-07 20:09:50,381 INFO L78 Accepts]: Start accepts. Automaton has 24061 states and 30987 transitions. Word has length 367 [2018-11-07 20:09:50,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:09:50,382 INFO L480 AbstractCegarLoop]: Abstraction has 24061 states and 30987 transitions. [2018-11-07 20:09:50,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 20:09:50,382 INFO L276 IsEmpty]: Start isEmpty. Operand 24061 states and 30987 transitions. [2018-11-07 20:09:50,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2018-11-07 20:09:50,436 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:09:50,436 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:09:50,437 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:09:50,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:09:50,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1511023171, now seen corresponding path program 1 times [2018-11-07 20:09:50,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:09:50,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:09:50,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:09:50,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:09:50,438 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:09:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:09:51,137 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 329 proven. 2 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-11-07 20:09:51,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:09:51,138 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:09:51,138 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 382 with the following transitions: [2018-11-07 20:09:51,139 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [301], [303], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [582], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [649], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [769], [772], [776], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-07 20:09:51,143 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:09:51,143 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:09:51,273 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:09:53,211 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 20:09:53,212 INFO L272 AbstractInterpreter]: Visited 142 different actions 842 times. Merged at 8 different actions 48 times. Widened at 1 different actions 1 times. Found 11 fixpoints after 2 different actions. Largest state had 28 variables. [2018-11-07 20:09:53,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:09:53,213 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 20:09:53,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:09:53,213 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 20:09:53,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:09:53,223 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 20:09:53,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:09:53,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 20:09:53,484 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 329 proven. 2 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-11-07 20:09:53,485 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 20:09:53,882 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 329 proven. 2 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-11-07 20:09:53,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 20:09:53,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2018-11-07 20:09:53,916 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 20:09:53,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 20:09:53,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 20:09:53,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-07 20:09:53,918 INFO L87 Difference]: Start difference. First operand 24061 states and 30987 transitions. Second operand 6 states. [2018-11-07 20:09:55,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:09:55,855 INFO L93 Difference]: Finished difference Result 39351 states and 52348 transitions. [2018-11-07 20:09:55,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 20:09:55,859 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 381 [2018-11-07 20:09:55,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:09:55,950 INFO L225 Difference]: With dead ends: 39351 [2018-11-07 20:09:55,950 INFO L226 Difference]: Without dead ends: 23189 [2018-11-07 20:09:55,998 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 773 GetRequests, 763 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-07 20:09:56,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23189 states. [2018-11-07 20:09:56,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23189 to 22675. [2018-11-07 20:09:56,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22675 states. [2018-11-07 20:09:56,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22675 states to 22675 states and 28111 transitions. [2018-11-07 20:09:56,430 INFO L78 Accepts]: Start accepts. Automaton has 22675 states and 28111 transitions. Word has length 381 [2018-11-07 20:09:56,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:09:56,431 INFO L480 AbstractCegarLoop]: Abstraction has 22675 states and 28111 transitions. [2018-11-07 20:09:56,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 20:09:56,431 INFO L276 IsEmpty]: Start isEmpty. Operand 22675 states and 28111 transitions. [2018-11-07 20:09:56,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-11-07 20:09:56,468 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:09:56,469 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:09:56,469 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:09:56,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:09:56,469 INFO L82 PathProgramCache]: Analyzing trace with hash 153125677, now seen corresponding path program 1 times [2018-11-07 20:09:56,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:09:56,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:09:56,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:09:56,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:09:56,472 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:09:56,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:09:56,985 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-07 20:09:57,443 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 356 proven. 2 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-11-07 20:09:57,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:09:57,443 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:09:57,444 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 415 with the following transitions: [2018-11-07 20:09:57,444 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [301], [303], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [680], [685], [687], [688], [692], [696], [707], [710], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [777], [781], [784], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-07 20:09:57,447 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:09:57,447 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:09:57,540 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:09:58,462 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:09:58,462 INFO L272 AbstractInterpreter]: Visited 143 different actions 706 times. Merged at 8 different actions 39 times. Widened at 1 different actions 1 times. Found 8 fixpoints after 3 different actions. Largest state had 28 variables. [2018-11-07 20:09:58,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:09:58,466 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:09:58,985 INFO L227 lantSequenceWeakener]: Weakened 411 states. On average, predicates are now at 73.37% of their original sizes. [2018-11-07 20:09:58,985 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:09:59,160 INFO L415 sIntCurrentIteration]: We unified 413 AI predicates to 413 [2018-11-07 20:09:59,160 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:09:59,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:09:59,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [11] total 21 [2018-11-07 20:09:59,161 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:09:59,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 20:09:59,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 20:09:59,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-07 20:09:59,162 INFO L87 Difference]: Start difference. First operand 22675 states and 28111 transitions. Second operand 12 states. [2018-11-07 20:10:10,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:10:10,811 INFO L93 Difference]: Finished difference Result 38124 states and 47597 transitions. [2018-11-07 20:10:10,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 20:10:10,811 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 414 [2018-11-07 20:10:10,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:10:10,880 INFO L225 Difference]: With dead ends: 38124 [2018-11-07 20:10:10,880 INFO L226 Difference]: Without dead ends: 24051 [2018-11-07 20:10:10,912 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 427 GetRequests, 403 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2018-11-07 20:10:10,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24051 states. [2018-11-07 20:10:11,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24051 to 24020. [2018-11-07 20:10:11,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24020 states. [2018-11-07 20:10:11,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24020 states to 24020 states and 29602 transitions. [2018-11-07 20:10:11,305 INFO L78 Accepts]: Start accepts. Automaton has 24020 states and 29602 transitions. Word has length 414 [2018-11-07 20:10:11,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:10:11,306 INFO L480 AbstractCegarLoop]: Abstraction has 24020 states and 29602 transitions. [2018-11-07 20:10:11,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 20:10:11,306 INFO L276 IsEmpty]: Start isEmpty. Operand 24020 states and 29602 transitions. [2018-11-07 20:10:11,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2018-11-07 20:10:11,340 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:10:11,340 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:10:11,341 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:10:11,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:10:11,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1741291606, now seen corresponding path program 1 times [2018-11-07 20:10:11,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:10:11,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:10:11,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:10:11,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:10:11,342 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:10:11,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:10:12,221 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2018-11-07 20:10:12,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:10:12,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 20:10:12,222 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:10:12,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 20:10:12,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 20:10:12,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:10:12,223 INFO L87 Difference]: Start difference. First operand 24020 states and 29602 transitions. Second operand 4 states. [2018-11-07 20:10:14,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:10:14,225 INFO L93 Difference]: Finished difference Result 49651 states and 63250 transitions. [2018-11-07 20:10:14,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 20:10:14,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 428 [2018-11-07 20:10:14,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:10:14,226 INFO L225 Difference]: With dead ends: 49651 [2018-11-07 20:10:14,226 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 20:10:14,352 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:10:14,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 20:10:14,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 20:10:14,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 20:10:14,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 20:10:14,353 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 428 [2018-11-07 20:10:14,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:10:14,353 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 20:10:14,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 20:10:14,354 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 20:10:14,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 20:10:14,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 20:10:15,170 WARN L179 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 335 DAG size of output: 116 [2018-11-07 20:10:15,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:10:15,558 WARN L179 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 419 DAG size of output: 103 [2018-11-07 20:10:15,982 WARN L179 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 18 [2018-11-07 20:10:16,471 WARN L179 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 33 [2018-11-07 20:10:23,738 WARN L179 SmtUtils]: Spent 7.24 s on a formula simplification. DAG size of input: 523 DAG size of output: 216 [2018-11-07 20:10:23,981 WARN L179 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 39 [2018-11-07 20:10:24,158 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 39 [2018-11-07 20:10:24,161 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 20:10:24,161 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a29~0 |old(~a29~0)|) (= ~a4~0 |old(~a4~0)|)) [2018-11-07 20:10:24,161 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 20:10:24,162 INFO L425 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2018-11-07 20:10:24,162 INFO L425 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2018-11-07 20:10:24,162 INFO L425 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-11-07 20:10:24,162 INFO L425 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,162 INFO L425 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,162 INFO L425 ceAbstractionStarter]: For program point L170(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,162 INFO L425 ceAbstractionStarter]: For program point L104(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,162 INFO L425 ceAbstractionStarter]: For program point L38(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,163 INFO L425 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,163 INFO L425 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,163 INFO L425 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2018-11-07 20:10:24,163 INFO L425 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2018-11-07 20:10:24,163 INFO L425 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-11-07 20:10:24,163 INFO L425 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,163 INFO L425 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,163 INFO L425 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,163 INFO L425 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,164 INFO L425 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,164 INFO L425 ceAbstractionStarter]: For program point L173(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,164 INFO L425 ceAbstractionStarter]: For program point L107(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,164 INFO L425 ceAbstractionStarter]: For program point L41(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,164 INFO L425 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,164 INFO L425 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2018-11-07 20:10:24,164 INFO L425 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2018-11-07 20:10:24,164 INFO L425 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2018-11-07 20:10:24,164 INFO L425 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,165 INFO L425 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,165 INFO L425 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,165 INFO L425 ceAbstractionStarter]: For program point L176(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,165 INFO L425 ceAbstractionStarter]: For program point L110(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,165 INFO L425 ceAbstractionStarter]: For program point L44(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,165 INFO L425 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,165 INFO L425 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,165 INFO L425 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,165 INFO L425 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2018-11-07 20:10:24,165 INFO L425 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2018-11-07 20:10:24,166 INFO L425 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2018-11-07 20:10:24,166 INFO L425 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2018-11-07 20:10:24,166 INFO L425 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2018-11-07 20:10:24,166 INFO L425 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2018-11-07 20:10:24,166 INFO L425 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2018-11-07 20:10:24,166 INFO L425 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,166 INFO L425 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,166 INFO L425 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,167 INFO L425 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,167 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,167 INFO L425 ceAbstractionStarter]: For program point L179(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,167 INFO L425 ceAbstractionStarter]: For program point L113(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,167 INFO L425 ceAbstractionStarter]: For program point L47(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,167 INFO L425 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,167 INFO L425 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,167 INFO L425 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2018-11-07 20:10:24,167 INFO L425 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2018-11-07 20:10:24,168 INFO L425 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2018-11-07 20:10:24,168 INFO L425 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,168 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,168 INFO L425 ceAbstractionStarter]: For program point L182(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,168 INFO L425 ceAbstractionStarter]: For program point L116(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,168 INFO L425 ceAbstractionStarter]: For program point L50(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,168 INFO L425 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2018-11-07 20:10:24,168 INFO L425 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2018-11-07 20:10:24,168 INFO L425 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-11-07 20:10:24,168 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,169 INFO L425 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,169 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,169 INFO L425 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,169 INFO L425 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,169 INFO L425 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2018-11-07 20:10:24,169 INFO L425 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2018-11-07 20:10:24,169 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,169 INFO L425 ceAbstractionStarter]: For program point L185(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,170 INFO L425 ceAbstractionStarter]: For program point L119(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,170 INFO L425 ceAbstractionStarter]: For program point L53(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,170 INFO L425 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,170 INFO L425 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,170 INFO L425 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2018-11-07 20:10:24,170 INFO L425 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2018-11-07 20:10:24,170 INFO L425 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,170 INFO L425 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,170 INFO L425 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-11-07 20:10:24,170 INFO L425 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2018-11-07 20:10:24,171 INFO L425 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2018-11-07 20:10:24,171 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 135) no Hoare annotation was computed. [2018-11-07 20:10:24,171 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,171 INFO L425 ceAbstractionStarter]: For program point L188(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,171 INFO L425 ceAbstractionStarter]: For program point L122(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,171 INFO L425 ceAbstractionStarter]: For program point L56(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,171 INFO L425 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,171 INFO L425 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,171 INFO L425 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,172 INFO L425 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2018-11-07 20:10:24,172 INFO L425 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2018-11-07 20:10:24,172 INFO L425 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2018-11-07 20:10:24,172 INFO L425 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2018-11-07 20:10:24,172 INFO L425 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2018-11-07 20:10:24,172 INFO L425 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2018-11-07 20:10:24,172 INFO L425 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2018-11-07 20:10:24,172 INFO L425 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,172 INFO L425 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,172 INFO L425 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2018-11-07 20:10:24,172 INFO L425 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2018-11-07 20:10:24,173 INFO L425 ceAbstractionStarter]: For program point L191(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,173 INFO L425 ceAbstractionStarter]: For program point L125(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,173 INFO L425 ceAbstractionStarter]: For program point L59(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,173 INFO L425 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,174 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 22 1026) the Hoare annotation is: (let ((.cse33 (= ~a29~0 |old(~a29~0)|)) (.cse34 (= ~a4~0 |old(~a4~0)|)) (.cse10 (< 312 |old(~a23~0)|)) (.cse12 (< |old(~a29~0)| 130)) (.cse39 (+ |old(~a23~0)| 599772)) (.cse28 (< 1 |old(~a4~0)|)) (.cse38 (< 274 |old(~a29~0)|)) (.cse27 (= 1 |old(~a4~0)|)) (.cse11 (= 11 |old(~a25~0)|)) (.cse41 (<= 9 ~a25~0)) (.cse13 (<= ~a23~0 312)) (.cse37 (+ ~a23~0 599772)) (.cse24 (<= ~a25~0 12))) (let ((.cse21 (< |old(~a25~0)| 10)) (.cse23 (<= 10 ~a25~0)) (.cse19 (< |old(~a29~0)| 141)) (.cse14 (< 245 |old(~a29~0)|)) (.cse17 (<= ~a23~0 138)) (.cse16 (< 138 |old(~a23~0)|)) (.cse31 (and .cse41 .cse13 (or (<= 0 .cse37) (and (= (mod ~a25~0 3) 0) (<= ~a29~0 274) (<= 245 ~a29~0))) (<= 0 (+ ~a23~0 599777)) .cse24)) (.cse32 (< (+ |old(~a23~0)| 599777) 0)) (.cse1 (not .cse11)) (.cse2 (< (+ |old(~a23~0)| 518036) 0)) (.cse3 (< |old(~a29~0)| 246)) (.cse6 (< 0 (+ |old(~a23~0)| 517856))) (.cse7 (not .cse27)) (.cse18 (let ((.cse43 (< |old(~a25~0)| 9)) (.cse44 (< |old(~a4~0)| 0))) (and (or .cse10 .cse43 .cse44 .cse28 .cse12 (< .cse39 0)) (or .cse43 .cse44 (< |old(~a29~0)| 245) .cse28 .cse38 (< 211 |old(~a23~0)|) (not (= 0 (mod |old(~a25~0)| 3))))))) (.cse26 (< 12 |old(~a25~0)|)) (.cse40 (< 0 (+ ~a23~0 43))) (.cse20 (<= (+ |old(~a23~0)| 43) 0)) (.cse0 (< 6 |calculate_output_#in~input|)) (.cse22 (= (mod ~a23~0 2) 0)) (.cse35 (<= 0 (+ ~a23~0 2147483648))) (.cse29 (< (+ |old(~a29~0)| 35629) 0)) (.cse36 (< (+ |old(~a23~0)| 2147483648) 0)) (.cse15 (not (= 12 |old(~a25~0)|))) (.cse4 (not (= 15 ~a8~0))) (.cse5 (not (= 1 ~a3~0))) (.cse30 (< (+ |old(~a4~0)| 1) 0)) (.cse25 (not (= 0 (mod |old(~a23~0)| 2)))) (.cse8 (< 275 |old(~a29~0)|)) (.cse9 (< |calculate_output_#in~input| 1)) (.cse42 (and .cse33 .cse34))) (and (or .cse0 .cse1 .cse2 .cse3 (and (<= 0 (+ ~a23~0 518036)) (= ~a25~0 11) (<= (+ ~a23~0 517856) 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 (< |old(~a23~0)| 307) .cse4 .cse5 .cse11 .cse12 (< 140 |old(~a29~0)|) .cse7 (and .cse13 (<= 307 ~a23~0))) (or (not (= 10 |old(~a25~0)|)) (not (= 312 |old(~a23~0)|)) (not (= 130 |old(~a29~0)|)) .cse9 .cse0 (= ~a25~0 10) .cse5 .cse4 .cse7) (or .cse0 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse4 .cse5 .cse20 .cse9) (or .cse0 .cse21 (and .cse13 .cse22 .cse23 .cse24 (<= 0 (+ ~a23~0 4))) (< (+ |old(~a23~0)| 4) 0) .cse10 .cse4 .cse5 .cse7 .cse25 .cse26 .cse9) (or .cse0 .cse14 .cse17 .cse16 .cse19 .cse4 .cse5 .cse7 .cse20 .cse9) (or (= 12 ~a25~0) .cse15) (or .cse0 .cse21 .cse14 .cse27 .cse28 .cse11 .cse29 .cse10 (and .cse13 .cse22 .cse23 .cse24) .cse4 .cse5 .cse30 .cse20 .cse25 .cse26 .cse9) (or .cse0 .cse14 .cse31 .cse11 .cse18 .cse4 .cse5 .cse32 .cse26 .cse9) (or .cse11 (and .cse33 (not (= 11 ~a25~0)) .cse34)) (or .cse7 (<= 312 ~a23~0) (< |old(~a23~0)| 312)) (or .cse0 .cse21 (and .cse13 .cse22 .cse23 .cse24 .cse35) (or .cse27 (< 130 |old(~a29~0)|)) .cse28 .cse29 .cse36 .cse10 .cse4 .cse5 .cse30 .cse25 .cse26 .cse9) (or .cse19 .cse4 .cse5 .cse14 .cse11 .cse7 .cse17 .cse20 .cse16) (or .cse0 (<= .cse37 0) .cse38 (< 0 .cse39) .cse15 .cse4 .cse5 (< |old(~a29~0)| 260) .cse32 (not (= 0 |old(~a4~0)|)) .cse9) (or (and .cse33 .cse40 .cse34) .cse7 .cse20) (or .cse0 .cse31 .cse27 .cse18 .cse4 .cse5 .cse32 .cse8 .cse26 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse22 .cse6 .cse7 .cse25 .cse8 .cse9) (or .cse0 (and .cse41 .cse13 .cse24) .cse18 .cse4 .cse5 .cse20 .cse8 .cse26 .cse9) (or .cse40 .cse11 .cse20) (or .cse0 (and .cse13 .cse22 .cse35) .cse27 .cse28 .cse29 .cse36 .cse15 .cse10 .cse4 .cse5 .cse30 .cse25 .cse8 .cse9) (or .cse27 .cse42) (or .cse42 (< 277 |old(~a29~0)|))))) [2018-11-07 20:10:24,174 INFO L425 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,174 INFO L425 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2018-11-07 20:10:24,174 INFO L425 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2018-11-07 20:10:24,174 INFO L425 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2018-11-07 20:10:24,175 INFO L425 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,175 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,175 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,175 INFO L425 ceAbstractionStarter]: For program point L194(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,175 INFO L425 ceAbstractionStarter]: For program point L128(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,175 INFO L425 ceAbstractionStarter]: For program point L62(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,175 INFO L425 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2018-11-07 20:10:24,175 INFO L425 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2018-11-07 20:10:24,175 INFO L425 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2018-11-07 20:10:24,175 INFO L425 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,176 INFO L425 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,176 INFO L425 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,176 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,176 INFO L425 ceAbstractionStarter]: For program point L197(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,176 INFO L425 ceAbstractionStarter]: For program point L131(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,176 INFO L425 ceAbstractionStarter]: For program point L65(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,176 INFO L425 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,176 INFO L425 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2018-11-07 20:10:24,176 INFO L425 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2018-11-07 20:10:24,176 INFO L425 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2018-11-07 20:10:24,176 INFO L425 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,177 INFO L425 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,177 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,177 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,177 INFO L425 ceAbstractionStarter]: For program point L200(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,177 INFO L425 ceAbstractionStarter]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,177 INFO L425 ceAbstractionStarter]: For program point L68(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,177 INFO L425 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,177 INFO L425 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,177 INFO L425 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,178 INFO L425 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,178 INFO L425 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2018-11-07 20:10:24,178 INFO L425 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2018-11-07 20:10:24,178 INFO L425 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2018-11-07 20:10:24,178 INFO L425 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2018-11-07 20:10:24,178 INFO L425 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2018-11-07 20:10:24,178 INFO L425 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,178 INFO L425 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,178 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,178 INFO L425 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,178 INFO L425 ceAbstractionStarter]: For program point L203(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,179 INFO L425 ceAbstractionStarter]: For program point L137(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,179 INFO L425 ceAbstractionStarter]: For program point L71(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,179 INFO L425 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2018-11-07 20:10:24,179 INFO L425 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-11-07 20:10:24,179 INFO L425 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2018-11-07 20:10:24,179 INFO L425 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,179 INFO L425 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,179 INFO L425 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,179 INFO L425 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2018-11-07 20:10:24,179 INFO L425 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2018-11-07 20:10:24,179 INFO L425 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,180 INFO L425 ceAbstractionStarter]: For program point L140(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,180 INFO L425 ceAbstractionStarter]: For program point L74(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,180 INFO L425 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,180 INFO L425 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,180 INFO L425 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2018-11-07 20:10:24,180 INFO L425 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2018-11-07 20:10:24,180 INFO L425 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,180 INFO L425 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,180 INFO L425 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2018-11-07 20:10:24,180 INFO L425 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2018-11-07 20:10:24,180 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,181 INFO L425 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,181 INFO L425 ceAbstractionStarter]: For program point L143(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,181 INFO L425 ceAbstractionStarter]: For program point L77(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,181 INFO L425 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,181 INFO L425 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,181 INFO L425 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2018-11-07 20:10:24,181 INFO L425 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2018-11-07 20:10:24,181 INFO L425 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2018-11-07 20:10:24,181 INFO L425 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2018-11-07 20:10:24,181 INFO L425 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,181 INFO L425 ceAbstractionStarter]: For program point L146(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,182 INFO L425 ceAbstractionStarter]: For program point L80(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,182 INFO L425 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,182 INFO L425 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,182 INFO L425 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,182 INFO L425 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,182 INFO L425 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,182 INFO L425 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2018-11-07 20:10:24,182 INFO L425 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2018-11-07 20:10:24,182 INFO L425 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2018-11-07 20:10:24,182 INFO L425 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2018-11-07 20:10:24,183 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2018-11-07 20:10:24,183 INFO L425 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2018-11-07 20:10:24,183 INFO L425 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,183 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,183 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,183 INFO L425 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,183 INFO L425 ceAbstractionStarter]: For program point L149(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,183 INFO L425 ceAbstractionStarter]: For program point L83(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,183 INFO L425 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,183 INFO L425 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-11-07 20:10:24,183 INFO L425 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2018-11-07 20:10:24,184 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,184 INFO L425 ceAbstractionStarter]: For program point L152(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,184 INFO L425 ceAbstractionStarter]: For program point L86(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,184 INFO L425 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,184 INFO L425 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,184 INFO L425 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,184 INFO L425 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,184 INFO L425 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2018-11-07 20:10:24,184 INFO L425 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2018-11-07 20:10:24,184 INFO L425 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,184 INFO L425 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,185 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,185 INFO L425 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,185 INFO L425 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,185 INFO L425 ceAbstractionStarter]: For program point L155(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,185 INFO L425 ceAbstractionStarter]: For program point L89(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,185 INFO L425 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2018-11-07 20:10:24,185 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,185 INFO L425 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,185 INFO L425 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,185 INFO L425 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2018-11-07 20:10:24,185 INFO L425 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2018-11-07 20:10:24,186 INFO L425 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-11-07 20:10:24,186 INFO L425 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,186 INFO L425 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2018-11-07 20:10:24,186 INFO L425 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,186 INFO L425 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2018-11-07 20:10:24,186 INFO L425 ceAbstractionStarter]: For program point L158(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,186 INFO L425 ceAbstractionStarter]: For program point L92(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,186 INFO L425 ceAbstractionStarter]: For program point L26(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,186 INFO L425 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,186 INFO L425 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,186 INFO L425 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,187 INFO L425 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2018-11-07 20:10:24,187 INFO L425 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2018-11-07 20:10:24,187 INFO L425 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-11-07 20:10:24,187 INFO L425 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,187 INFO L425 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,187 INFO L425 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,187 INFO L425 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,187 INFO L425 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,187 INFO L425 ceAbstractionStarter]: For program point L161(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,187 INFO L425 ceAbstractionStarter]: For program point L95(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,187 INFO L425 ceAbstractionStarter]: For program point L29(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,188 INFO L425 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,188 INFO L425 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,188 INFO L425 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2018-11-07 20:10:24,188 INFO L425 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-11-07 20:10:24,188 INFO L425 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-11-07 20:10:24,188 INFO L425 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,188 INFO L425 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2018-11-07 20:10:24,188 INFO L425 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2018-11-07 20:10:24,188 INFO L425 ceAbstractionStarter]: For program point L164(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,188 INFO L425 ceAbstractionStarter]: For program point L98(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,188 INFO L425 ceAbstractionStarter]: For program point L32(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,189 INFO L425 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,189 INFO L425 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,189 INFO L425 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,189 INFO L425 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2018-11-07 20:10:24,189 INFO L425 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2018-11-07 20:10:24,189 INFO L425 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2018-11-07 20:10:24,189 INFO L425 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,189 INFO L425 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,189 INFO L425 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,189 INFO L425 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,189 INFO L425 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2018-11-07 20:10:24,190 INFO L425 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2018-11-07 20:10:24,190 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,190 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,190 INFO L425 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2018-11-07 20:10:24,190 INFO L425 ceAbstractionStarter]: For program point L167(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,190 INFO L425 ceAbstractionStarter]: For program point L101(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,190 INFO L425 ceAbstractionStarter]: For program point L35(lines 22 1026) no Hoare annotation was computed. [2018-11-07 20:10:24,190 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 20:10:24,191 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a23~0 312) (= ~a8~0 15) (= ~a29~0 130) (= 1 ~a4~0) (= ~a25~0 10) (= ~a3~0 1)) [2018-11-07 20:10:24,191 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 20:10:24,191 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 20:10:24,191 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 1028 1044) the Hoare annotation is: (or (not (= 10 |old(~a25~0)|)) (not (= 15 ~a8~0)) (not (= 1 ~a3~0)) (not (= 312 |old(~a23~0)|)) (not (= 1 |old(~a4~0)|)) (not (= 130 |old(~a29~0)|)) (and (= ~a29~0 |old(~a29~0)|) (= ~a25~0 10) (= ~a23~0 312) (= ~a4~0 |old(~a4~0)|))) [2018-11-07 20:10:24,191 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 1028 1044) no Hoare annotation was computed. [2018-11-07 20:10:24,191 INFO L421 ceAbstractionStarter]: At program point L1042(line 1042) the Hoare annotation is: (or (not (= 10 |old(~a25~0)|)) (<= ~a29~0 277) (< 0 (+ ~a23~0 43)) (not (= 15 ~a8~0)) (not (= 1 ~a3~0)) (not (= 312 |old(~a23~0)|)) (not (= 11 ~a25~0)) (not (= 1 |old(~a4~0)|)) (not (= 130 |old(~a29~0)|)) (not (= ~a4~0 1))) [2018-11-07 20:10:24,191 INFO L425 ceAbstractionStarter]: For program point L1042-1(line 1042) no Hoare annotation was computed. [2018-11-07 20:10:24,191 INFO L425 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2018-11-07 20:10:24,192 INFO L425 ceAbstractionStarter]: For program point L1034-1(lines 1034 1043) no Hoare annotation was computed. [2018-11-07 20:10:24,192 INFO L421 ceAbstractionStarter]: At program point L1034-3(lines 1034 1043) the Hoare annotation is: (or (not (= 10 |old(~a25~0)|)) (<= ~a29~0 277) (< 0 (+ ~a23~0 43)) (not (= 15 ~a8~0)) (not (= 1 ~a3~0)) (not (= 312 |old(~a23~0)|)) (not (= 11 ~a25~0)) (not (= 1 |old(~a4~0)|)) (not (= 130 |old(~a29~0)|)) (not (= ~a4~0 1))) [2018-11-07 20:10:24,192 INFO L425 ceAbstractionStarter]: For program point L1034-4(lines 1028 1044) no Hoare annotation was computed. [2018-11-07 20:10:24,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:10:24 BoogieIcfgContainer [2018-11-07 20:10:24,203 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 20:10:24,204 INFO L168 Benchmark]: Toolchain (without parser) took 195996.91 ms. Allocated memory was 1.5 GB in the beginning and 5.8 GB in the end (delta: 4.2 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -707.7 MB). Peak memory consumption was 3.5 GB. Max. memory is 7.1 GB. [2018-11-07 20:10:24,205 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-07 20:10:24,206 INFO L168 Benchmark]: CACSL2BoogieTranslator took 971.64 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: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. [2018-11-07 20:10:24,206 INFO L168 Benchmark]: Boogie Procedure Inliner took 193.18 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 753.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -859.8 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. [2018-11-07 20:10:24,207 INFO L168 Benchmark]: Boogie Preprocessor took 160.23 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 20:10:24,208 INFO L168 Benchmark]: RCFGBuilder took 4190.06 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: 172.7 MB). Peak memory consumption was 172.7 MB. Max. memory is 7.1 GB. [2018-11-07 20:10:24,209 INFO L168 Benchmark]: TraceAbstraction took 190476.62 ms. Allocated memory was 2.3 GB in the beginning and 5.8 GB in the end (delta: 3.5 GB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: -83.9 MB). Peak memory consumption was 3.4 GB. Max. memory is 7.1 GB. [2018-11-07 20:10:24,213 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 971.64 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: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 193.18 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 753.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -859.8 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 160.23 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 4190.06 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: 172.7 MB). Peak memory consumption was 172.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 190476.62 ms. Allocated memory was 2.3 GB in the beginning and 5.8 GB in the end (delta: 3.5 GB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: -83.9 MB). Peak memory consumption was 3.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 135]: 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: 1034]: Loop Invariant Derived loop invariant: ((((((((!(10 == \old(a25)) || a29 <= 277) || 0 < a23 + 43) || !(15 == a8)) || !(1 == a3)) || !(312 == \old(a23))) || !(11 == a25)) || !(1 == \old(a4))) || !(130 == \old(a29))) || !(a4 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 293 locations, 1 error locations. SAFE Result, 190.3s OverallTime, 13 OverallIterations, 4 TraceHistogramMax, 151.8s AutomataDifference, 0.0s DeadEndRemovalTime, 9.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 3311 SDtfs, 11486 SDslu, 3606 SDs, 0 SdLazy, 26884 SolverSat, 3014 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 54.6s Time, PredicateUnifierStatistics: 12 DeclaredPredicates, 3704 GetRequests, 3537 SyntacticMatches, 3 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1177 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24061occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 9.1s AbstIntTime, 8 AbstIntIterations, 6 AbstIntStrong, 0.9976592195068389 AbsIntWeakeningRatio, 0.09884836852207293 AbsIntAvgWeakeningVarsNumRemoved, 24.037907869481767 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 1517 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 535 PreInvPairs, 800 NumberOfFragments, 1322 HoareAnnotationTreeSize, 535 FomulaSimplifications, 39151 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 19945 FormulaSimplificationTreeSizeReductionInter, 8.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 4693 NumberOfCodeBlocks, 4693 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 5422 ConstructedInterpolants, 0 QuantifiedInterpolants, 5434308 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1246 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 17 InterpolantComputations, 7 PerfectInterpolantSequences, 5315/5481 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...