java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem11_label08_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 23:27:07,292 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 23:27:07,295 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 23:27:07,314 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 23:27:07,314 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 23:27:07,315 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 23:27:07,317 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 23:27:07,318 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 23:27:07,320 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 23:27:07,321 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 23:27:07,322 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 23:27:07,322 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 23:27:07,323 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 23:27:07,324 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 23:27:07,326 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 23:27:07,326 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 23:27:07,327 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 23:27:07,329 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 23:27:07,331 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 23:27:07,333 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 23:27:07,334 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 23:27:07,335 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 23:27:07,338 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 23:27:07,338 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 23:27:07,338 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 23:27:07,339 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 23:27:07,340 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 23:27:07,341 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 23:27:07,342 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 23:27:07,343 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 23:27:07,343 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 23:27:07,344 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 23:27:07,344 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 23:27:07,345 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 23:27:07,346 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 23:27:07,346 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 23:27:07,347 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-24 23:27:07,373 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 23:27:07,374 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 23:27:07,375 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 23:27:07,375 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 23:27:07,375 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 23:27:07,375 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 23:27:07,375 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-24 23:27:07,376 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 23:27:07,376 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-24 23:27:07,376 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 23:27:07,376 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 23:27:07,377 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 23:27:07,377 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 23:27:07,377 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 23:27:07,379 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 23:27:07,379 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 23:27:07,379 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 23:27:07,379 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 23:27:07,380 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 23:27:07,380 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 23:27:07,380 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 23:27:07,380 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 23:27:07,381 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 23:27:07,382 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 23:27:07,382 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 23:27:07,382 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 23:27:07,383 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 23:27:07,383 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 23:27:07,383 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 23:27:07,383 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 23:27:07,383 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 23:27:07,384 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 23:27:07,384 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 23:27:07,384 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 23:27:07,385 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 23:27:07,385 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 23:27:07,451 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 23:27:07,471 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 23:27:07,475 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 23:27:07,477 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 23:27:07,477 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 23:27:07,478 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label08_false-unreach-call.c [2018-10-24 23:27:07,542 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/f292ab16d/5723c47ea81e4cafb4c1a9db3ff08b8e/FLAG437bcd924 [2018-10-24 23:27:08,132 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 23:27:08,133 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label08_false-unreach-call.c [2018-10-24 23:27:08,154 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/f292ab16d/5723c47ea81e4cafb4c1a9db3ff08b8e/FLAG437bcd924 [2018-10-24 23:27:08,174 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/f292ab16d/5723c47ea81e4cafb4c1a9db3ff08b8e [2018-10-24 23:27:08,187 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 23:27:08,190 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 23:27:08,191 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 23:27:08,191 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 23:27:08,199 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 23:27:08,200 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:27:08" (1/1) ... [2018-10-24 23:27:08,203 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dfdac62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:08, skipping insertion in model container [2018-10-24 23:27:08,204 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:27:08" (1/1) ... [2018-10-24 23:27:08,215 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 23:27:08,291 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 23:27:08,970 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:27:08,974 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 23:27:09,116 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:27:09,136 INFO L193 MainTranslator]: Completed translation [2018-10-24 23:27:09,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:09 WrapperNode [2018-10-24 23:27:09,137 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 23:27:09,138 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 23:27:09,138 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 23:27:09,138 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 23:27:09,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:09" (1/1) ... [2018-10-24 23:27:09,181 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:09" (1/1) ... [2018-10-24 23:27:09,428 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 23:27:09,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 23:27:09,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 23:27:09,429 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 23:27:09,440 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:09" (1/1) ... [2018-10-24 23:27:09,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:09" (1/1) ... [2018-10-24 23:27:09,460 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:09" (1/1) ... [2018-10-24 23:27:09,460 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:09" (1/1) ... [2018-10-24 23:27:09,520 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:09" (1/1) ... [2018-10-24 23:27:09,548 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:09" (1/1) ... [2018-10-24 23:27:09,563 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:09" (1/1) ... [2018-10-24 23:27:09,574 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 23:27:09,574 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 23:27:09,575 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 23:27:09,575 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 23:27:09,576 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 23:27:09,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 23:27:09,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 23:27:09,640 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-24 23:27:09,641 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-24 23:27:09,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 23:27:09,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 23:27:09,643 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 23:27:09,643 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 23:27:15,009 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 23:27:15,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:27:15 BoogieIcfgContainer [2018-10-24 23:27:15,010 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 23:27:15,011 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 23:27:15,011 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 23:27:15,015 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 23:27:15,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:27:08" (1/3) ... [2018-10-24 23:27:15,018 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@426189bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:27:15, skipping insertion in model container [2018-10-24 23:27:15,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:09" (2/3) ... [2018-10-24 23:27:15,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@426189bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:27:15, skipping insertion in model container [2018-10-24 23:27:15,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:27:15" (3/3) ... [2018-10-24 23:27:15,022 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label08_false-unreach-call.c [2018-10-24 23:27:15,035 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 23:27:15,049 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 23:27:15,068 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 23:27:15,124 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 23:27:15,125 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 23:27:15,125 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 23:27:15,126 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 23:27:15,126 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 23:27:15,126 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 23:27:15,126 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 23:27:15,126 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 23:27:15,177 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states. [2018-10-24 23:27:15,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-24 23:27:15,187 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:27:15,189 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] [2018-10-24 23:27:15,192 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:27:15,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:27:15,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1486587100, now seen corresponding path program 1 times [2018-10-24 23:27:15,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:27:15,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:27:15,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:27:15,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:27:15,269 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:27:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:27:15,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:27:15,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:27:15,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 23:27:15,702 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:27:15,709 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 23:27:15,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 23:27:15,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 23:27:15,732 INFO L87 Difference]: Start difference. First operand 293 states. Second operand 3 states. [2018-10-24 23:27:18,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:27:18,451 INFO L93 Difference]: Finished difference Result 782 states and 1372 transitions. [2018-10-24 23:27:18,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 23:27:18,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-10-24 23:27:18,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:27:18,477 INFO L225 Difference]: With dead ends: 782 [2018-10-24 23:27:18,477 INFO L226 Difference]: Without dead ends: 487 [2018-10-24 23:27:18,487 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 23:27:18,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2018-10-24 23:27:18,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 482. [2018-10-24 23:27:18,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2018-10-24 23:27:18,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 837 transitions. [2018-10-24 23:27:18,601 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 837 transitions. Word has length 22 [2018-10-24 23:27:18,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:27:18,602 INFO L481 AbstractCegarLoop]: Abstraction has 482 states and 837 transitions. [2018-10-24 23:27:18,603 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 23:27:18,603 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 837 transitions. [2018-10-24 23:27:18,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-24 23:27:18,609 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:27:18,609 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:27:18,610 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:27:18,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:27:18,610 INFO L82 PathProgramCache]: Analyzing trace with hash 838371767, now seen corresponding path program 1 times [2018-10-24 23:27:18,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:27:18,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:27:18,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:27:18,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:27:18,612 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:27:18,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:27:19,032 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:27:19,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:27:19,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:27:19,033 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:27:19,035 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:27:19,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:27:19,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:27:19,036 INFO L87 Difference]: Start difference. First operand 482 states and 837 transitions. Second operand 6 states. [2018-10-24 23:27:25,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:27:25,445 INFO L93 Difference]: Finished difference Result 1804 states and 3389 transitions. [2018-10-24 23:27:25,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-24 23:27:25,446 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-10-24 23:27:25,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:27:25,461 INFO L225 Difference]: With dead ends: 1804 [2018-10-24 23:27:25,461 INFO L226 Difference]: Without dead ends: 1328 [2018-10-24 23:27:25,472 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-10-24 23:27:25,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2018-10-24 23:27:25,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1286. [2018-10-24 23:27:25,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1286 states. [2018-10-24 23:27:25,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 1955 transitions. [2018-10-24 23:27:25,568 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 1955 transitions. Word has length 93 [2018-10-24 23:27:25,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:27:25,569 INFO L481 AbstractCegarLoop]: Abstraction has 1286 states and 1955 transitions. [2018-10-24 23:27:25,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:27:25,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1955 transitions. [2018-10-24 23:27:25,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-24 23:27:25,572 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:27:25,573 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:27:25,573 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:27:25,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:27:25,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1072390589, now seen corresponding path program 1 times [2018-10-24 23:27:25,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:27:25,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:27:25,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:27:25,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:27:25,575 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:27:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:27:25,881 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:27:25,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:27:25,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:27:25,882 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:27:25,884 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:27:25,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:27:25,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:27:25,885 INFO L87 Difference]: Start difference. First operand 1286 states and 1955 transitions. Second operand 6 states. [2018-10-24 23:27:30,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:27:30,075 INFO L93 Difference]: Finished difference Result 4479 states and 7249 transitions. [2018-10-24 23:27:30,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:27:30,078 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2018-10-24 23:27:30,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:27:30,103 INFO L225 Difference]: With dead ends: 4479 [2018-10-24 23:27:30,104 INFO L226 Difference]: Without dead ends: 3199 [2018-10-24 23:27:30,119 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-24 23:27:30,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3199 states. [2018-10-24 23:27:30,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3199 to 3160. [2018-10-24 23:27:30,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3160 states. [2018-10-24 23:27:30,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3160 states to 3160 states and 4524 transitions. [2018-10-24 23:27:30,245 INFO L78 Accepts]: Start accepts. Automaton has 3160 states and 4524 transitions. Word has length 103 [2018-10-24 23:27:30,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:27:30,246 INFO L481 AbstractCegarLoop]: Abstraction has 3160 states and 4524 transitions. [2018-10-24 23:27:30,247 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:27:30,247 INFO L276 IsEmpty]: Start isEmpty. Operand 3160 states and 4524 transitions. [2018-10-24 23:27:30,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-10-24 23:27:30,259 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:27:30,259 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:27:30,260 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:27:30,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:27:30,260 INFO L82 PathProgramCache]: Analyzing trace with hash -2038666381, now seen corresponding path program 1 times [2018-10-24 23:27:30,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:27:30,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:27:30,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:27:30,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:27:30,263 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:27:30,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:27:30,486 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 99 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:27:30,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:27:30,487 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 23:27:30,488 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 168 with the following transitions: [2018-10-24 23:27:30,490 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [77], [79], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [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], [498], [499], [503], [507], [510], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-10-24 23:27:30,538 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 23:27:30,538 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 23:27:31,297 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 23:27:31,299 INFO L272 AbstractInterpreter]: Visited 79 different actions 79 times. Never merged. Never widened. Never found a fixpoint. Largest state had 28 variables. [2018-10-24 23:27:31,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:27:31,343 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 23:27:32,126 INFO L232 lantSequenceWeakener]: Weakened 158 states. On average, predicates are now at 73.04% of their original sizes. [2018-10-24 23:27:32,127 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 23:27:32,392 INFO L413 sIntCurrentIteration]: We have 166 unified AI predicates [2018-10-24 23:27:32,392 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 23:27:32,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 23:27:32,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-24 23:27:32,393 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:27:32,394 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:27:32,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:27:32,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:27:32,395 INFO L87 Difference]: Start difference. First operand 3160 states and 4524 transitions. Second operand 6 states. [2018-10-24 23:28:10,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:28:10,428 INFO L93 Difference]: Finished difference Result 6506 states and 9259 transitions. [2018-10-24 23:28:10,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 23:28:10,428 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 167 [2018-10-24 23:28:10,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:28:10,450 INFO L225 Difference]: With dead ends: 6506 [2018-10-24 23:28:10,450 INFO L226 Difference]: Without dead ends: 3352 [2018-10-24 23:28:10,464 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 167 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-24 23:28:10,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3352 states. [2018-10-24 23:28:10,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3352 to 3350. [2018-10-24 23:28:10,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3350 states. [2018-10-24 23:28:10,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3350 states to 3350 states and 4723 transitions. [2018-10-24 23:28:10,559 INFO L78 Accepts]: Start accepts. Automaton has 3350 states and 4723 transitions. Word has length 167 [2018-10-24 23:28:10,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:28:10,559 INFO L481 AbstractCegarLoop]: Abstraction has 3350 states and 4723 transitions. [2018-10-24 23:28:10,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:28:10,560 INFO L276 IsEmpty]: Start isEmpty. Operand 3350 states and 4723 transitions. [2018-10-24 23:28:10,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-10-24 23:28:10,564 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:28:10,564 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 23:28:10,565 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:28:10,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:28:10,565 INFO L82 PathProgramCache]: Analyzing trace with hash 170993114, now seen corresponding path program 1 times [2018-10-24 23:28:10,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:28:10,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:28:10,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:28:10,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:28:10,567 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:28:10,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:28:11,315 WARN L179 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 13 [2018-10-24 23:28:11,513 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 109 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:28:11,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:28:11,513 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 23:28:11,513 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 221 with the following transitions: [2018-10-24 23:28:11,514 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [77], [79], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [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], [538], [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], [688], [692], [696], [707], [710], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-10-24 23:28:11,529 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 23:28:11,529 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 23:28:13,171 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 23:28:13,171 INFO L272 AbstractInterpreter]: Visited 126 different actions 497 times. Merged at 7 different actions 28 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 28 variables. [2018-10-24 23:28:13,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:28:13,212 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 23:28:13,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:28:13,212 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 23:28:13,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:28:13,227 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 23:28:13,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:28:13,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 23:28:13,633 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 109 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:28:13,634 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 23:28:13,951 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-24 23:28:14,479 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-24 23:28:14,740 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 109 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:28:14,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 23:28:14,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-10-24 23:28:14,781 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 23:28:14,782 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-24 23:28:14,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-24 23:28:14,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-10-24 23:28:14,782 INFO L87 Difference]: Start difference. First operand 3350 states and 4723 transitions. Second operand 9 states. [2018-10-24 23:28:21,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:28:21,956 INFO L93 Difference]: Finished difference Result 9605 states and 18146 transitions. [2018-10-24 23:28:21,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-24 23:28:21,956 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 220 [2018-10-24 23:28:21,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:28:22,030 INFO L225 Difference]: With dead ends: 9605 [2018-10-24 23:28:22,030 INFO L226 Difference]: Without dead ends: 6451 [2018-10-24 23:28:22,123 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 445 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2018-10-24 23:28:22,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6451 states. [2018-10-24 23:28:22,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6451 to 6129. [2018-10-24 23:28:22,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6129 states. [2018-10-24 23:28:22,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6129 states to 6129 states and 8780 transitions. [2018-10-24 23:28:22,442 INFO L78 Accepts]: Start accepts. Automaton has 6129 states and 8780 transitions. Word has length 220 [2018-10-24 23:28:22,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:28:22,443 INFO L481 AbstractCegarLoop]: Abstraction has 6129 states and 8780 transitions. [2018-10-24 23:28:22,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-24 23:28:22,443 INFO L276 IsEmpty]: Start isEmpty. Operand 6129 states and 8780 transitions. [2018-10-24 23:28:22,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-10-24 23:28:22,450 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:28:22,451 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2018-10-24 23:28:22,451 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:28:22,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:28:22,452 INFO L82 PathProgramCache]: Analyzing trace with hash 226627033, now seen corresponding path program 1 times [2018-10-24 23:28:22,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:28:22,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:28:22,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:28:22,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:28:22,453 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:28:22,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:28:22,856 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-10-24 23:28:22,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:28:22,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 23:28:22,857 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:28:22,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 23:28:22,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 23:28:22,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:28:22,858 INFO L87 Difference]: Start difference. First operand 6129 states and 8780 transitions. Second operand 4 states. [2018-10-24 23:28:26,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:28:26,537 INFO L93 Difference]: Finished difference Result 18487 states and 30026 transitions. [2018-10-24 23:28:26,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 23:28:26,538 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 241 [2018-10-24 23:28:26,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:28:26,620 INFO L225 Difference]: With dead ends: 18487 [2018-10-24 23:28:26,621 INFO L226 Difference]: Without dead ends: 12554 [2018-10-24 23:28:26,665 INFO L605 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-10-24 23:28:26,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12554 states. [2018-10-24 23:28:27,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12554 to 10015. [2018-10-24 23:28:27,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10015 states. [2018-10-24 23:28:27,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10015 states to 10015 states and 14831 transitions. [2018-10-24 23:28:27,089 INFO L78 Accepts]: Start accepts. Automaton has 10015 states and 14831 transitions. Word has length 241 [2018-10-24 23:28:27,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:28:27,090 INFO L481 AbstractCegarLoop]: Abstraction has 10015 states and 14831 transitions. [2018-10-24 23:28:27,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 23:28:27,090 INFO L276 IsEmpty]: Start isEmpty. Operand 10015 states and 14831 transitions. [2018-10-24 23:28:27,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-10-24 23:28:27,103 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:28:27,103 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-10-24 23:28:27,103 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:28:27,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:28:27,104 INFO L82 PathProgramCache]: Analyzing trace with hash -764405825, now seen corresponding path program 1 times [2018-10-24 23:28:27,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:28:27,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:28:27,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:28:27,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:28:27,106 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:28:27,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:28:27,548 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-10-24 23:28:27,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:28:27,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 23:28:27,548 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:28:27,549 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 23:28:27,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 23:28:27,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 23:28:27,550 INFO L87 Difference]: Start difference. First operand 10015 states and 14831 transitions. Second operand 3 states. [2018-10-24 23:28:31,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:28:31,580 INFO L93 Difference]: Finished difference Result 23857 states and 37396 transitions. [2018-10-24 23:28:31,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 23:28:31,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 262 [2018-10-24 23:28:31,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:28:31,686 INFO L225 Difference]: With dead ends: 23857 [2018-10-24 23:28:31,686 INFO L226 Difference]: Without dead ends: 14038 [2018-10-24 23:28:31,747 INFO L605 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-10-24 23:28:31,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14038 states. [2018-10-24 23:28:32,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14038 to 14028. [2018-10-24 23:28:32,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14028 states. [2018-10-24 23:28:32,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14028 states to 14028 states and 20435 transitions. [2018-10-24 23:28:32,175 INFO L78 Accepts]: Start accepts. Automaton has 14028 states and 20435 transitions. Word has length 262 [2018-10-24 23:28:32,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:28:32,176 INFO L481 AbstractCegarLoop]: Abstraction has 14028 states and 20435 transitions. [2018-10-24 23:28:32,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 23:28:32,176 INFO L276 IsEmpty]: Start isEmpty. Operand 14028 states and 20435 transitions. [2018-10-24 23:28:32,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-10-24 23:28:32,187 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:28:32,187 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-10-24 23:28:32,188 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:28:32,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:28:32,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1252280123, now seen corresponding path program 1 times [2018-10-24 23:28:32,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:28:32,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:28:32,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:28:32,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:28:32,190 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:28:32,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:28:33,198 WARN L179 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2018-10-24 23:28:33,656 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-10-24 23:28:33,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:28:33,657 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 23:28:33,657 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 266 with the following transitions: [2018-10-24 23:28:33,658 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [77], [79], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [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], [665], [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-10-24 23:28:33,665 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 23:28:33,666 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 23:28:35,876 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 23:28:35,877 INFO L272 AbstractInterpreter]: Visited 141 different actions 554 times. Merged at 7 different actions 25 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 28 variables. [2018-10-24 23:28:35,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:28:35,912 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 23:28:35,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:28:35,912 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 23:28:35,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:28:35,929 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 23:28:36,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:28:36,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 23:28:37,763 WARN L179 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 10 [2018-10-24 23:28:37,878 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 139 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:28:37,878 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 23:28:38,616 WARN L179 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 10 [2018-10-24 23:28:39,053 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-24 23:28:39,180 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-24 23:28:40,020 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 31 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:28:40,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 23:28:40,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2018-10-24 23:28:40,042 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 23:28:40,043 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-24 23:28:40,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-24 23:28:40,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2018-10-24 23:28:40,045 INFO L87 Difference]: Start difference. First operand 14028 states and 20435 transitions. Second operand 15 states. [2018-10-24 23:28:44,139 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 14 [2018-10-24 23:29:03,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:29:03,411 INFO L93 Difference]: Finished difference Result 48121 states and 88366 transitions. [2018-10-24 23:29:03,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-24 23:29:03,411 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 265 [2018-10-24 23:29:03,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:29:03,707 INFO L225 Difference]: With dead ends: 48121 [2018-10-24 23:29:03,708 INFO L226 Difference]: Without dead ends: 34289 [2018-10-24 23:29:03,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 598 GetRequests, 523 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1686 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=977, Invalid=4723, Unknown=0, NotChecked=0, Total=5700 [2018-10-24 23:29:03,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34289 states. [2018-10-24 23:29:05,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34289 to 31713. [2018-10-24 23:29:05,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31713 states. [2018-10-24 23:29:05,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31713 states to 31713 states and 42748 transitions. [2018-10-24 23:29:05,266 INFO L78 Accepts]: Start accepts. Automaton has 31713 states and 42748 transitions. Word has length 265 [2018-10-24 23:29:05,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:29:05,267 INFO L481 AbstractCegarLoop]: Abstraction has 31713 states and 42748 transitions. [2018-10-24 23:29:05,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-24 23:29:05,267 INFO L276 IsEmpty]: Start isEmpty. Operand 31713 states and 42748 transitions. [2018-10-24 23:29:05,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-10-24 23:29:05,283 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:29:05,284 INFO L375 BasicCegarLoop]: trace histogram [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, 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-10-24 23:29:05,284 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:29:05,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:29:05,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1320582186, now seen corresponding path program 1 times [2018-10-24 23:29:05,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:29:05,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:29:05,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:29:05,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:29:05,286 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:29:05,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:29:05,731 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 47 proven. 15 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2018-10-24 23:29:05,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:29:05,731 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 23:29:05,731 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 295 with the following transitions: [2018-10-24 23:29:05,732 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [77], [79], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [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], [510], [511], [515], [519], [523], [527], [531], [535], [538], [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], [688], [692], [696], [707], [710], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-10-24 23:29:05,737 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 23:29:05,738 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 23:29:07,128 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 23:29:07,128 INFO L272 AbstractInterpreter]: Visited 127 different actions 388 times. Merged at 8 different actions 31 times. Widened at 1 different actions 2 times. Found 5 fixpoints after 2 different actions. Largest state had 28 variables. [2018-10-24 23:29:07,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:29:07,136 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 23:29:07,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:29:07,136 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 23:29:07,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:29:07,144 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 23:29:07,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:29:07,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 23:29:09,451 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((v_~a23~0_511 Int)) (let ((.cse0 (* 9 v_~a23~0_511))) (let ((.cse1 (div .cse0 10))) (let ((.cse2 (mod (+ .cse1 29) 90))) (and (= 0 (mod .cse0 10)) (<= |c_old(~a23~0)| v_~a23~0_511) (= (mod (+ .cse1 30) 90) 0) (<= c_~a23~0 (+ .cse2 48)) (= 0 .cse2)))))) (exists ((v_prenex_4 Int)) (let ((.cse4 (* 9 v_prenex_4))) (let ((.cse3 (div .cse4 10))) (and (<= 0 (+ .cse3 58979)) (< (+ .cse3 58980) 0) (<= c_~a23~0 (+ (mod (+ .cse3 29) 90) 48)) (= 0 (mod .cse4 10)) (<= |c_old(~a23~0)| v_prenex_4) (not (= (mod (+ .cse3 30) 90) 0)))))) (exists ((v_prenex_13 Int)) (let ((.cse6 (* 9 v_prenex_13))) (let ((.cse7 (div .cse6 10))) (let ((.cse5 (mod (+ .cse7 30) 90))) (and (<= |c_old(~a23~0)| v_prenex_13) (<= (+ c_~a23~0 42) .cse5) (< .cse6 0) (<= 0 (+ .cse7 58979)) (< (+ .cse7 58980) 0) (not (= 0 (mod .cse6 10))) (not (= .cse5 0))))))) (exists ((v_prenex_14 Int)) (let ((.cse10 (* 9 v_prenex_14))) (let ((.cse8 (div .cse10 10))) (let ((.cse9 (mod (+ .cse8 29) 90))) (and (= (mod (+ .cse8 30) 90) 0) (<= |c_old(~a23~0)| v_prenex_14) (<= c_~a23~0 (+ .cse9 48)) (= 0 .cse9) (<= 0 .cse10)))))) (exists ((v_prenex_2 Int)) (let ((.cse13 (* 9 v_prenex_2))) (let ((.cse11 (div .cse13 10))) (let ((.cse12 (mod (+ .cse11 29) 90))) (and (= (mod (+ .cse11 30) 90) 0) (<= (+ c_~a23~0 42) .cse12) (< (+ .cse11 58979) 0) (<= |c_old(~a23~0)| v_prenex_2) (not (= 0 .cse12)) (<= 0 .cse13)))))) (exists ((v_prenex_24 Int)) (let ((.cse14 (* 9 v_prenex_24))) (let ((.cse16 (div .cse14 10))) (let ((.cse15 (mod (+ .cse16 30) 90))) (and (not (= 0 (mod .cse14 10))) (<= |c_old(~a23~0)| v_prenex_24) (= .cse15 0) (<= 0 (+ .cse16 58979)) (<= c_~a23~0 (+ .cse15 48)) (< .cse14 0)))))) (exists ((v_prenex_1 Int)) (let ((.cse19 (* 9 v_prenex_1))) (let ((.cse17 (div .cse19 10))) (let ((.cse18 (mod (+ .cse17 29) 90))) (and (< (+ .cse17 58979) 0) (<= (+ c_~a23~0 42) .cse18) (not (= 0 .cse18)) (= 0 (mod .cse19 10)) (= (mod (+ .cse17 30) 90) 0) (<= |c_old(~a23~0)| v_prenex_1)))))) (exists ((v_prenex_21 Int)) (let ((.cse21 (* 9 v_prenex_21))) (let ((.cse20 (div .cse21 10))) (and (<= 0 (+ .cse20 58979)) (< (+ .cse20 58980) 0) (<= |c_old(~a23~0)| v_prenex_21) (not (= (mod (+ .cse20 30) 90) 0)) (<= c_~a23~0 (+ (mod (+ .cse20 29) 90) 48)) (<= 0 .cse21))))) (exists ((v_prenex_23 Int)) (let ((.cse23 (* 9 v_prenex_23))) (let ((.cse22 (div .cse23 10))) (and (= (mod (+ .cse22 30) 90) 0) (<= |c_old(~a23~0)| v_prenex_23) (<= 0 (+ .cse22 58979)) (<= 0 .cse23) (<= c_~a23~0 (+ (mod (+ .cse22 29) 90) 48)))))) (exists ((v_prenex_6 Int)) (let ((.cse24 (* 9 v_prenex_6))) (let ((.cse25 (div .cse24 10))) (and (< .cse24 0) (<= 0 (+ .cse25 58979)) (not (= 0 (mod .cse24 10))) (<= c_~a23~0 (+ (mod (+ .cse25 30) 90) 48)) (<= |c_old(~a23~0)| v_prenex_6) (<= 0 (+ .cse25 58980)))))) (exists ((v_prenex_16 Int)) (let ((.cse26 (* 9 v_prenex_16))) (let ((.cse27 (div .cse26 10))) (and (= 0 (mod .cse26 10)) (<= |c_old(~a23~0)| v_prenex_16) (<= c_~a23~0 (+ (mod (+ .cse27 29) 90) 48)) (<= 0 (+ .cse27 58979)) (= (mod (+ .cse27 30) 90) 0))))) (exists ((v_prenex_10 Int)) (let ((.cse29 (* 9 v_prenex_10))) (let ((.cse28 (div .cse29 10))) (and (<= 0 (+ .cse28 58979)) (= 0 (mod .cse29 10)) (<= c_~a23~0 (+ (mod (+ .cse28 29) 90) 48)) (<= 0 (+ .cse28 58980)) (<= |c_old(~a23~0)| v_prenex_10))))) (exists ((v_prenex_25 Int)) (let ((.cse30 (* 9 v_prenex_25))) (let ((.cse32 (div .cse30 10))) (let ((.cse31 (mod (+ .cse32 29) 90))) (and (= 0 (mod .cse30 10)) (<= |c_old(~a23~0)| v_prenex_25) (= 0 .cse31) (<= 0 (+ .cse32 58980)) (<= c_~a23~0 (+ .cse31 48))))))) (exists ((v_prenex_17 Int)) (let ((.cse35 (* 9 v_prenex_17))) (let ((.cse33 (div .cse35 10))) (let ((.cse34 (mod (+ .cse33 29) 90))) (and (< (+ .cse33 58979) 0) (<= (+ c_~a23~0 42) .cse34) (<= |c_old(~a23~0)| v_prenex_17) (<= 0 .cse35) (not (= 0 .cse34)) (<= 0 (+ .cse33 58980))))))) (exists ((v_prenex_15 Int)) (let ((.cse36 (* 9 v_prenex_15))) (let ((.cse38 (div .cse36 10))) (let ((.cse37 (mod (+ .cse38 29) 90))) (and (= 0 (mod .cse36 10)) (<= |c_old(~a23~0)| v_prenex_15) (not (= 0 .cse37)) (< (+ .cse38 58980) 0) (<= (+ c_~a23~0 42) .cse37) (< (+ .cse38 58979) 0) (not (= (mod (+ .cse38 30) 90) 0))))))) (exists ((v_prenex_8 Int)) (let ((.cse40 (* 9 v_prenex_8))) (let ((.cse39 (div .cse40 10))) (let ((.cse41 (mod (+ .cse39 29) 90))) (and (<= 0 (+ .cse39 58980)) (<= 0 .cse40) (= 0 .cse41) (<= |c_old(~a23~0)| v_prenex_8) (<= c_~a23~0 (+ .cse41 48))))))) (exists ((v_prenex_7 Int)) (let ((.cse42 (* 9 v_prenex_7))) (let ((.cse43 (div .cse42 10))) (let ((.cse44 (mod (+ .cse43 30) 90))) (and (< .cse42 0) (not (= 0 (mod (+ .cse43 29) 90))) (< (+ .cse43 58979) 0) (<= |c_old(~a23~0)| v_prenex_7) (= .cse44 0) (not (= 0 (mod .cse42 10))) (<= c_~a23~0 (+ .cse44 48))))))) (exists ((v_prenex_3 Int)) (let ((.cse45 (* 9 v_prenex_3))) (let ((.cse46 (div .cse45 10))) (and (< .cse45 0) (= 0 (mod (+ .cse46 29) 90)) (not (= 0 (mod .cse45 10))) (<= 0 (+ .cse46 58980)) (<= c_~a23~0 (+ (mod (+ .cse46 30) 90) 48)) (<= |c_old(~a23~0)| v_prenex_3))))) (exists ((v_prenex_18 Int)) (let ((.cse49 (* 9 v_prenex_18))) (let ((.cse47 (div .cse49 10))) (let ((.cse48 (mod (+ .cse47 29) 90))) (and (not (= (mod (+ .cse47 30) 90) 0)) (< (+ .cse47 58980) 0) (= 0 .cse48) (<= |c_old(~a23~0)| v_prenex_18) (= 0 (mod .cse49 10)) (<= c_~a23~0 (+ .cse48 48))))))) (exists ((v_prenex_22 Int)) (let ((.cse52 (* 9 v_prenex_22))) (let ((.cse51 (div .cse52 10))) (let ((.cse50 (mod (+ .cse51 30) 90))) (and (<= (+ c_~a23~0 42) .cse50) (<= |c_old(~a23~0)| v_prenex_22) (= 0 (mod (+ .cse51 29) 90)) (< .cse52 0) (not (= 0 (mod .cse52 10))) (< (+ .cse51 58980) 0) (not (= .cse50 0))))))) (exists ((v_prenex_9 Int)) (let ((.cse54 (* 9 v_prenex_9))) (let ((.cse55 (div .cse54 10))) (let ((.cse53 (mod (+ .cse55 29) 90))) (and (not (= 0 .cse53)) (<= 0 .cse54) (<= |c_old(~a23~0)| v_prenex_9) (<= (+ c_~a23~0 42) .cse53) (not (= (mod (+ .cse55 30) 90) 0)) (< (+ .cse55 58980) 0) (< (+ .cse55 58979) 0)))))) (exists ((v_prenex_26 Int)) (let ((.cse57 (* 9 v_prenex_26))) (let ((.cse56 (div .cse57 10))) (and (<= |c_old(~a23~0)| v_prenex_26) (<= 0 (+ .cse56 58980)) (<= 0 (+ .cse56 58979)) (<= c_~a23~0 (+ (mod (+ .cse56 29) 90) 48)) (<= 0 .cse57))))) (exists ((v_prenex_20 Int)) (let ((.cse59 (* 9 v_prenex_20))) (let ((.cse60 (div .cse59 10))) (let ((.cse58 (mod (+ .cse60 29) 90))) (and (not (= 0 .cse58)) (<= (+ c_~a23~0 42) .cse58) (= 0 (mod .cse59 10)) (<= |c_old(~a23~0)| v_prenex_20) (<= 0 (+ .cse60 58980)) (< (+ .cse60 58979) 0)))))) (exists ((v_prenex_5 Int)) (let ((.cse61 (* 9 v_prenex_5))) (let ((.cse62 (div .cse61 10))) (and (not (= 0 (mod .cse61 10))) (not (= 0 (mod (+ .cse62 29) 90))) (<= c_~a23~0 (+ (mod (+ .cse62 30) 90) 48)) (<= 0 (+ .cse62 58980)) (<= |c_old(~a23~0)| v_prenex_5) (< .cse61 0) (< (+ .cse62 58979) 0))))) (exists ((v_prenex_19 Int)) (let ((.cse64 (* 9 v_prenex_19))) (let ((.cse65 (div .cse64 10))) (let ((.cse63 (mod (+ .cse65 30) 90))) (and (<= (+ c_~a23~0 42) .cse63) (not (= .cse63 0)) (< .cse64 0) (not (= 0 (mod .cse64 10))) (< (+ .cse65 58979) 0) (not (= 0 (mod (+ .cse65 29) 90))) (<= |c_old(~a23~0)| v_prenex_19) (< (+ .cse65 58980) 0)))))) (exists ((v_prenex_12 Int)) (let ((.cse66 (* 9 v_prenex_12))) (let ((.cse68 (div .cse66 10))) (let ((.cse67 (mod (+ .cse68 30) 90))) (and (<= |c_old(~a23~0)| v_prenex_12) (not (= 0 (mod .cse66 10))) (<= c_~a23~0 (+ .cse67 48)) (= 0 (mod (+ .cse68 29) 90)) (= .cse67 0) (< .cse66 0)))))) (exists ((v_prenex_11 Int)) (let ((.cse69 (* 9 v_prenex_11))) (let ((.cse71 (div .cse69 10))) (let ((.cse70 (mod (+ .cse71 29) 90))) (and (<= 0 .cse69) (<= |c_old(~a23~0)| v_prenex_11) (<= c_~a23~0 (+ .cse70 48)) (= 0 .cse70) (< (+ .cse71 58980) 0) (not (= (mod (+ .cse71 30) 90) 0)))))))) is different from true [2018-10-24 23:29:10,261 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 47 proven. 152 refuted. 0 times theorem prover too weak. 71 trivial. 4 not checked. [2018-10-24 23:29:10,261 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 23:29:10,589 WARN L179 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-10-24 23:29:11,000 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 201 proven. 2 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-24 23:29:11,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 23:29:11,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 5] total 12 [2018-10-24 23:29:11,022 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 23:29:11,023 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-24 23:29:11,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-24 23:29:11,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=83, Unknown=1, NotChecked=18, Total=132 [2018-10-24 23:29:11,023 INFO L87 Difference]: Start difference. First operand 31713 states and 42748 transitions. Second operand 10 states. [2018-10-24 23:30:10,782 WARN L179 SmtUtils]: Spent 58.87 s on a formula simplification. DAG size of input: 506 DAG size of output: 28 Received shutdown request... [2018-10-24 23:31:04,813 WARN L187 SmtUtils]: Removed 11 from assertion stack [2018-10-24 23:31:04,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-24 23:31:04,813 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 23:31:04,817 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 23:31:04,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:31:04 BoogieIcfgContainer [2018-10-24 23:31:04,818 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 23:31:04,819 INFO L168 Benchmark]: Toolchain (without parser) took 236631.32 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 3.5 GB in the end (delta: -2.0 GB). Peak memory consumption was 453.7 MB. Max. memory is 7.1 GB. [2018-10-24 23:31:04,820 INFO L168 Benchmark]: CDTParser took 0.22 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-10-24 23:31:04,820 INFO L168 Benchmark]: CACSL2BoogieTranslator took 946.06 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: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2018-10-24 23:31:04,821 INFO L168 Benchmark]: Boogie Procedure Inliner took 290.53 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 736.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -816.8 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. [2018-10-24 23:31:04,823 INFO L168 Benchmark]: Boogie Preprocessor took 145.47 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-10-24 23:31:04,823 INFO L168 Benchmark]: RCFGBuilder took 5435.96 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 202.0 MB). Peak memory consumption was 202.0 MB. Max. memory is 7.1 GB. [2018-10-24 23:31:04,824 INFO L168 Benchmark]: TraceAbstraction took 229806.58 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.8 GB). Free memory was 2.0 GB in the beginning and 3.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 279.5 MB. Max. memory is 7.1 GB. [2018-10-24 23:31:04,829 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.22 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 946.06 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: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 290.53 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 736.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -816.8 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 145.47 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 5435.96 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 202.0 MB). Peak memory consumption was 202.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 229806.58 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.8 GB). Free memory was 2.0 GB in the beginning and 3.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 279.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 51). Cancelled while BasicCegarLoop was constructing difference of abstraction (31713states) and FLOYD_HOARE automaton (currently 12 states, 10 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 504. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 293 locations, 1 error locations. TIMEOUT Result, 229.7s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 204.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2155 SDtfs, 11940 SDslu, 2891 SDs, 0 SdLazy, 27434 SolverSat, 5075 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 72.6s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 1872 GetRequests, 1726 SyntacticMatches, 11 SemanticMatches, 134 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1823 ImplicationChecksByTransitivity, 72.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31713occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 6.2s AbstIntTime, 4 AbstIntIterations, 1 AbstIntStrong, 0.997144732777263 AbsIntWeakeningRatio, 0.1686746987951807 AbsIntAvgWeakeningVarsNumRemoved, 17.8855421686747 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.9s AutomataMinimizationTime, 8 MinimizatonAttempts, 5535 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 12.9s InterpolantComputationTime, 2446 NumberOfCodeBlocks, 2446 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 3210 ConstructedInterpolants, 2 QuantifiedInterpolants, 4443965 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1435 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 15 InterpolantComputations, 5 PerfectInterpolantSequences, 1649/1979 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown