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 --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label06_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 09:56:16,527 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 09:56:16,531 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 09:56:16,552 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 09:56:16,553 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 09:56:16,554 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 09:56:16,557 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 09:56:16,560 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 09:56:16,563 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 09:56:16,566 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 09:56:16,569 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 09:56:16,569 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 09:56:16,572 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 09:56:16,573 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 09:56:16,582 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 09:56:16,583 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 09:56:16,584 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 09:56:16,590 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 09:56:16,595 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 09:56:16,599 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 09:56:16,601 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 09:56:16,604 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 09:56:16,611 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 09:56:16,611 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 09:56:16,611 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 09:56:16,613 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 09:56:16,614 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 09:56:16,616 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 09:56:16,617 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 09:56:16,619 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 09:56:16,620 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 09:56:16,622 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 09:56:16,622 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 09:56:16,622 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 09:56:16,625 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 09:56:16,626 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 09:56:16,626 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf [2018-09-19 09:56:16,656 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 09:56:16,658 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 09:56:16,659 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 09:56:16,660 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 09:56:16,660 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 09:56:16,660 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 09:56:16,660 INFO L133 SettingsManager]: * Congruence Domain=false [2018-09-19 09:56:16,661 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 09:56:16,661 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2018-09-19 09:56:16,661 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 09:56:16,661 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 09:56:16,665 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 09:56:16,665 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-19 09:56:16,666 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 09:56:16,666 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 09:56:16,667 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 09:56:16,667 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 09:56:16,667 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 09:56:16,667 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 09:56:16,668 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 09:56:16,668 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 09:56:16,668 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 09:56:16,670 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 09:56:16,671 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 09:56:16,671 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 09:56:16,671 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 09:56:16,671 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 09:56:16,672 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 09:56:16,672 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 09:56:16,672 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 09:56:16,672 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 09:56:16,672 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 09:56:16,673 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 09:56:16,673 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 09:56:16,673 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 09:56:16,752 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 09:56:16,776 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 09:56:16,781 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 09:56:16,785 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 09:56:16,786 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 09:56:16,787 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label06_true-unreach-call.c [2018-09-19 09:56:17,093 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/911a16fd9/15b3c4f521044fb4b5df4fa12ea23310/FLAG724eedb16 [2018-09-19 09:56:17,486 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 09:56:17,487 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label06_true-unreach-call.c [2018-09-19 09:56:17,503 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/911a16fd9/15b3c4f521044fb4b5df4fa12ea23310/FLAG724eedb16 [2018-09-19 09:56:17,522 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/911a16fd9/15b3c4f521044fb4b5df4fa12ea23310 [2018-09-19 09:56:17,538 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 09:56:17,545 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 09:56:17,547 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 09:56:17,547 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 09:56:17,556 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 09:56:17,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 09:56:17" (1/1) ... [2018-09-19 09:56:17,561 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ddc0e27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 09:56:17, skipping insertion in model container [2018-09-19 09:56:17,561 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 09:56:17" (1/1) ... [2018-09-19 09:56:17,574 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 09:56:18,191 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 09:56:18,216 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 09:56:18,362 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 09:56:18,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 09:56:18 WrapperNode [2018-09-19 09:56:18,414 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 09:56:18,415 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 09:56:18,415 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 09:56:18,416 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 09:56:18,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 09:56:18" (1/1) ... [2018-09-19 09:56:18,457 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 09:56:18" (1/1) ... [2018-09-19 09:56:18,563 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 09:56:18,564 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 09:56:18,564 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 09:56:18,565 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 09:56:18,751 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 09:56:18" (1/1) ... [2018-09-19 09:56:18,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 09:56:18" (1/1) ... [2018-09-19 09:56:18,774 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 09:56:18" (1/1) ... [2018-09-19 09:56:18,774 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 09:56:18" (1/1) ... [2018-09-19 09:56:18,805 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 09:56:18" (1/1) ... [2018-09-19 09:56:18,830 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 09:56:18" (1/1) ... [2018-09-19 09:56:18,845 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 09:56:18" (1/1) ... [2018-09-19 09:56:18,859 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 09:56:18,860 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 09:56:18,860 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 09:56:18,860 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 09:56:18,864 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 09:56:18" (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-09-19 09:56:18,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 09:56:18,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 09:56:18,952 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 09:56:18,952 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 09:56:18,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 09:56:18,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 09:56:18,953 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 09:56:18,953 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 09:56:22,347 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 09:56:22,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 09:56:22 BoogieIcfgContainer [2018-09-19 09:56:22,348 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 09:56:22,350 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 09:56:22,350 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 09:56:22,353 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 09:56:22,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 09:56:17" (1/3) ... [2018-09-19 09:56:22,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b342832 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 09:56:22, skipping insertion in model container [2018-09-19 09:56:22,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 09:56:18" (2/3) ... [2018-09-19 09:56:22,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b342832 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 09:56:22, skipping insertion in model container [2018-09-19 09:56:22,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 09:56:22" (3/3) ... [2018-09-19 09:56:22,358 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label06_true-unreach-call.c [2018-09-19 09:56:22,369 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 09:56:22,380 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 09:56:22,446 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 09:56:22,447 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 09:56:22,447 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 09:56:22,448 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 09:56:22,448 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 09:56:22,448 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 09:56:22,448 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 09:56:22,448 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 09:56:22,449 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 09:56:22,478 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-19 09:56:22,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-09-19 09:56:22,490 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 09:56:22,491 INFO L376 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] [2018-09-19 09:56:22,492 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 09:56:22,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1783356911, now seen corresponding path program 1 times [2018-09-19 09:56:22,500 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 09:56:22,501 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-09-19 09:56:22,503 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [149], [151], [796], [800], [806], [810], [817], [818], [819], [821] [2018-09-19 09:56:22,569 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 09:56:22,569 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 09:56:23,524 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 09:56:23,526 INFO L272 AbstractInterpreter]: Visited 30 different actions 30 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-19 09:56:23,561 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 09:56:23,953 INFO L232 lantSequenceWeakener]: Weakened 29 states. On average, predicates are now at 74.57% of their original sizes. [2018-09-19 09:56:23,953 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 09:56:24,243 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 09:56:24,245 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 09:56:24,246 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 09:56:24,246 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 09:56:24,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 09:56:24,260 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 09:56:24,261 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 09:56:24,263 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 6 states. [2018-09-19 09:56:29,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 09:56:29,058 INFO L93 Difference]: Finished difference Result 576 states and 995 transitions. [2018-09-19 09:56:29,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 09:56:29,067 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-09-19 09:56:29,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 09:56:29,089 INFO L225 Difference]: With dead ends: 576 [2018-09-19 09:56:29,089 INFO L226 Difference]: Without dead ends: 358 [2018-09-19 09:56:29,104 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 09:56:29,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-09-19 09:56:29,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-09-19 09:56:29,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-19 09:56:29,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2018-09-19 09:56:29,226 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 31 [2018-09-19 09:56:29,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 09:56:29,227 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2018-09-19 09:56:29,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 09:56:29,227 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2018-09-19 09:56:29,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-09-19 09:56:29,235 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 09:56:29,235 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 09:56:29,237 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 09:56:29,238 INFO L82 PathProgramCache]: Analyzing trace with hash 228974179, now seen corresponding path program 1 times [2018-09-19 09:56:29,238 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 09:56:29,238 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 103 with the following transitions: [2018-09-19 09:56:29,239 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [149], [151], [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], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 09:56:29,255 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 09:56:29,256 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 09:56:30,602 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 09:56:33,497 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 09:56:33,497 INFO L272 AbstractInterpreter]: Visited 78 different actions 221 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 09:56:33,509 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 09:56:34,336 INFO L232 lantSequenceWeakener]: Weakened 100 states. On average, predicates are now at 73.35% of their original sizes. [2018-09-19 09:56:34,336 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 09:56:34,866 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 09:56:34,866 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 09:56:34,867 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 09:56:34,867 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 09:56:34,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 09:56:34,868 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 09:56:34,868 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 09:56:34,869 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand 10 states. [2018-09-19 09:56:42,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 09:56:42,291 INFO L93 Difference]: Finished difference Result 717 states and 1132 transitions. [2018-09-19 09:56:42,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 09:56:42,296 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 102 [2018-09-19 09:56:42,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 09:56:42,302 INFO L225 Difference]: With dead ends: 717 [2018-09-19 09:56:42,302 INFO L226 Difference]: Without dead ends: 511 [2018-09-19 09:56:42,305 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 108 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 09:56:42,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-09-19 09:56:42,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 505. [2018-09-19 09:56:42,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2018-09-19 09:56:42,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 669 transitions. [2018-09-19 09:56:42,344 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 669 transitions. Word has length 102 [2018-09-19 09:56:42,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 09:56:42,345 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 669 transitions. [2018-09-19 09:56:42,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 09:56:42,346 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 669 transitions. [2018-09-19 09:56:42,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-09-19 09:56:42,350 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 09:56:42,350 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 09:56:42,351 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 09:56:42,351 INFO L82 PathProgramCache]: Analyzing trace with hash 812548124, now seen corresponding path program 1 times [2018-09-19 09:56:42,351 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 09:56:42,352 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 112 with the following transitions: [2018-09-19 09:56:42,352 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [149], [151], [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], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 09:56:42,357 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 09:56:42,357 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 09:56:46,424 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 09:56:48,227 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 09:56:48,228 INFO L272 AbstractInterpreter]: Visited 87 different actions 248 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 09:56:48,272 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 09:56:49,026 INFO L232 lantSequenceWeakener]: Weakened 109 states. On average, predicates are now at 73.3% of their original sizes. [2018-09-19 09:56:49,027 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 09:56:50,484 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 09:56:50,485 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 09:56:50,485 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-19 09:56:50,485 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 09:56:50,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-19 09:56:50,486 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-19 09:56:50,487 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-09-19 09:56:50,487 INFO L87 Difference]: Start difference. First operand 505 states and 669 transitions. Second operand 13 states. [2018-09-19 09:56:59,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 09:56:59,412 INFO L93 Difference]: Finished difference Result 1333 states and 2096 transitions. [2018-09-19 09:56:59,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-19 09:56:59,414 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 111 [2018-09-19 09:56:59,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 09:56:59,421 INFO L225 Difference]: With dead ends: 1333 [2018-09-19 09:56:59,422 INFO L226 Difference]: Without dead ends: 978 [2018-09-19 09:56:59,425 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 125 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=164, Invalid=592, Unknown=0, NotChecked=0, Total=756 [2018-09-19 09:56:59,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2018-09-19 09:56:59,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 762. [2018-09-19 09:56:59,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2018-09-19 09:56:59,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 953 transitions. [2018-09-19 09:56:59,472 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 953 transitions. Word has length 111 [2018-09-19 09:56:59,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 09:56:59,472 INFO L480 AbstractCegarLoop]: Abstraction has 762 states and 953 transitions. [2018-09-19 09:56:59,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-19 09:56:59,473 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 953 transitions. [2018-09-19 09:56:59,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-09-19 09:56:59,479 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 09:56:59,480 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 09:56:59,480 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 09:56:59,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1611542820, now seen corresponding path program 1 times [2018-09-19 09:56:59,480 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 09:56:59,481 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 148 with the following transitions: [2018-09-19 09:56:59,481 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [149], [151], [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], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 09:56:59,487 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 09:56:59,488 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 09:57:02,982 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 09:57:10,225 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 09:57:10,225 INFO L272 AbstractInterpreter]: Visited 123 different actions 356 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 09:57:10,233 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 09:57:10,896 INFO L232 lantSequenceWeakener]: Weakened 145 states. On average, predicates are now at 73.16% of their original sizes. [2018-09-19 09:57:10,896 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 09:57:11,301 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 09:57:11,301 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 09:57:11,301 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-19 09:57:11,302 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 09:57:11,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-19 09:57:11,303 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-19 09:57:11,303 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-09-19 09:57:11,303 INFO L87 Difference]: Start difference. First operand 762 states and 953 transitions. Second operand 12 states. [2018-09-19 09:57:21,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 09:57:21,759 INFO L93 Difference]: Finished difference Result 1677 states and 2220 transitions. [2018-09-19 09:57:21,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 09:57:21,759 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 147 [2018-09-19 09:57:21,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 09:57:21,767 INFO L225 Difference]: With dead ends: 1677 [2018-09-19 09:57:21,767 INFO L226 Difference]: Without dead ends: 1067 [2018-09-19 09:57:21,771 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 155 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2018-09-19 09:57:21,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2018-09-19 09:57:21,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1056. [2018-09-19 09:57:21,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1056 states. [2018-09-19 09:57:21,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1287 transitions. [2018-09-19 09:57:21,813 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1287 transitions. Word has length 147 [2018-09-19 09:57:21,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 09:57:21,814 INFO L480 AbstractCegarLoop]: Abstraction has 1056 states and 1287 transitions. [2018-09-19 09:57:21,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-19 09:57:21,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1287 transitions. [2018-09-19 09:57:21,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-09-19 09:57:21,818 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 09:57:21,819 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 09:57:21,819 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 09:57:21,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1713093917, now seen corresponding path program 1 times [2018-09-19 09:57:21,820 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 09:57:21,820 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 167 with the following transitions: [2018-09-19 09:57:21,820 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [149], [151], [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], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [754], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 09:57:21,826 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 09:57:21,826 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 09:57:31,562 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 09:57:31,562 INFO L272 AbstractInterpreter]: Visited 142 different actions 413 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 09:57:31,567 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 09:57:32,346 INFO L232 lantSequenceWeakener]: Weakened 164 states. On average, predicates are now at 73.11% of their original sizes. [2018-09-19 09:57:32,347 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 09:57:32,699 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 09:57:32,699 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 09:57:32,699 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-19 09:57:32,700 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 09:57:32,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-19 09:57:32,700 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-19 09:57:32,700 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-09-19 09:57:32,701 INFO L87 Difference]: Start difference. First operand 1056 states and 1287 transitions. Second operand 12 states. [2018-09-19 09:57:41,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 09:57:41,124 INFO L93 Difference]: Finished difference Result 2268 states and 2899 transitions. [2018-09-19 09:57:41,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-19 09:57:41,135 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 166 [2018-09-19 09:57:41,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 09:57:41,144 INFO L225 Difference]: With dead ends: 2268 [2018-09-19 09:57:41,144 INFO L226 Difference]: Without dead ends: 1364 [2018-09-19 09:57:41,148 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 175 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2018-09-19 09:57:41,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2018-09-19 09:57:41,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1352. [2018-09-19 09:57:41,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-09-19 09:57:41,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1615 transitions. [2018-09-19 09:57:41,210 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1615 transitions. Word has length 166 [2018-09-19 09:57:41,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 09:57:41,210 INFO L480 AbstractCegarLoop]: Abstraction has 1352 states and 1615 transitions. [2018-09-19 09:57:41,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-19 09:57:41,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1615 transitions. [2018-09-19 09:57:41,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-09-19 09:57:41,215 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 09:57:41,215 INFO L376 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 09:57:41,216 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 09:57:41,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1151580506, now seen corresponding path program 1 times [2018-09-19 09:57:41,217 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 09:57:41,217 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 179 with the following transitions: [2018-09-19 09:57:41,218 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [149], [151], [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], [511], [515], [518], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 09:57:41,230 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 09:57:41,230 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 09:57:42,655 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 09:57:47,483 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 09:57:47,483 INFO L272 AbstractInterpreter]: Visited 84 different actions 323 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 09:57:47,492 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 09:57:48,271 INFO L232 lantSequenceWeakener]: Weakened 176 states. On average, predicates are now at 73.13% of their original sizes. [2018-09-19 09:57:48,271 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 09:57:48,799 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 09:57:48,799 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 09:57:48,799 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 09:57:48,799 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 09:57:48,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 09:57:48,800 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 09:57:48,800 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 09:57:48,801 INFO L87 Difference]: Start difference. First operand 1352 states and 1615 transitions. Second operand 10 states. [2018-09-19 09:57:56,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 09:57:56,098 INFO L93 Difference]: Finished difference Result 2719 states and 3388 transitions. [2018-09-19 09:57:56,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 09:57:56,098 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 178 [2018-09-19 09:57:56,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 09:57:56,108 INFO L225 Difference]: With dead ends: 2719 [2018-09-19 09:57:56,109 INFO L226 Difference]: Without dead ends: 1521 [2018-09-19 09:57:56,113 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 185 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 09:57:56,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2018-09-19 09:57:56,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1503. [2018-09-19 09:57:56,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2018-09-19 09:57:56,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1792 transitions. [2018-09-19 09:57:56,191 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1792 transitions. Word has length 178 [2018-09-19 09:57:56,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 09:57:56,192 INFO L480 AbstractCegarLoop]: Abstraction has 1503 states and 1792 transitions. [2018-09-19 09:57:56,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 09:57:56,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1792 transitions. [2018-09-19 09:57:56,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-09-19 09:57:56,196 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 09:57:56,197 INFO L376 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-09-19 09:57:56,197 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 09:57:56,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1448109174, now seen corresponding path program 1 times [2018-09-19 09:57:56,197 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 09:57:56,198 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 181 with the following transitions: [2018-09-19 09:57:56,198 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [149], [151], [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], [511], [515], [519], [523], [526], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 09:57:56,202 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 09:57:56,202 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 09:57:57,784 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 09:58:03,406 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 09:58:03,407 INFO L272 AbstractInterpreter]: Visited 86 different actions 333 times. Merged at 7 different actions 22 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 09:58:03,428 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 09:58:04,203 INFO L232 lantSequenceWeakener]: Weakened 178 states. On average, predicates are now at 73.13% of their original sizes. [2018-09-19 09:58:04,203 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 09:58:04,497 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 09:58:04,498 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 09:58:04,498 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 09:58:04,498 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 09:58:04,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 09:58:04,499 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 09:58:04,499 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 09:58:04,499 INFO L87 Difference]: Start difference. First operand 1503 states and 1792 transitions. Second operand 10 states. [2018-09-19 09:58:10,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 09:58:10,896 INFO L93 Difference]: Finished difference Result 3020 states and 3751 transitions. [2018-09-19 09:58:10,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 09:58:10,897 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 180 [2018-09-19 09:58:10,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 09:58:10,905 INFO L225 Difference]: With dead ends: 3020 [2018-09-19 09:58:10,905 INFO L226 Difference]: Without dead ends: 1671 [2018-09-19 09:58:10,909 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 187 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 09:58:10,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-09-19 09:58:10,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1654. [2018-09-19 09:58:10,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1654 states. [2018-09-19 09:58:10,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 1988 transitions. [2018-09-19 09:58:10,965 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 1988 transitions. Word has length 180 [2018-09-19 09:58:10,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 09:58:10,966 INFO L480 AbstractCegarLoop]: Abstraction has 1654 states and 1988 transitions. [2018-09-19 09:58:10,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 09:58:10,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 1988 transitions. [2018-09-19 09:58:10,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-09-19 09:58:10,969 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 09:58:10,969 INFO L376 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 09:58:10,970 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 09:58:10,970 INFO L82 PathProgramCache]: Analyzing trace with hash 304663890, now seen corresponding path program 1 times [2018-09-19 09:58:10,970 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 09:58:10,970 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 185 with the following transitions: [2018-09-19 09:58:10,971 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [149], [151], [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], [511], [515], [519], [523], [527], [531], [535], [539], [542], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 09:58:10,973 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 09:58:10,973 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 09:58:12,451 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 09:58:18,066 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 09:58:18,066 INFO L272 AbstractInterpreter]: Visited 90 different actions 349 times. Merged at 7 different actions 22 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 09:58:18,073 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 09:58:18,863 INFO L232 lantSequenceWeakener]: Weakened 182 states. On average, predicates are now at 73.12% of their original sizes. [2018-09-19 09:58:18,863 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 09:58:19,150 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 09:58:19,150 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 09:58:19,151 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 09:58:19,151 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 09:58:19,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 09:58:19,151 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 09:58:19,151 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 09:58:19,152 INFO L87 Difference]: Start difference. First operand 1654 states and 1988 transitions. Second operand 10 states. [2018-09-19 09:58:27,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 09:58:27,341 INFO L93 Difference]: Finished difference Result 3477 states and 4328 transitions. [2018-09-19 09:58:27,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 09:58:27,342 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 184 [2018-09-19 09:58:27,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 09:58:27,351 INFO L225 Difference]: With dead ends: 3477 [2018-09-19 09:58:27,351 INFO L226 Difference]: Without dead ends: 1977 [2018-09-19 09:58:27,355 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 191 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 09:58:27,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2018-09-19 09:58:27,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1954. [2018-09-19 09:58:27,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1954 states. [2018-09-19 09:58:27,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2362 transitions. [2018-09-19 09:58:27,423 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2362 transitions. Word has length 184 [2018-09-19 09:58:27,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 09:58:27,424 INFO L480 AbstractCegarLoop]: Abstraction has 1954 states and 2362 transitions. [2018-09-19 09:58:27,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 09:58:27,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2362 transitions. [2018-09-19 09:58:27,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-09-19 09:58:27,427 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 09:58:27,427 INFO L376 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 09:58:27,428 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 09:58:27,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1591929854, now seen corresponding path program 1 times [2018-09-19 09:58:27,428 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 09:58:27,428 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 191 with the following transitions: [2018-09-19 09:58:27,429 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [149], [151], [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], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 09:58:27,431 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 09:58:27,432 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 09:58:28,739 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 09:58:38,211 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 09:58:38,212 INFO L272 AbstractInterpreter]: Visited 96 different actions 373 times. Merged at 7 different actions 22 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 09:58:38,219 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 09:58:39,017 INFO L232 lantSequenceWeakener]: Weakened 188 states. On average, predicates are now at 73.11% of their original sizes. [2018-09-19 09:58:39,017 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 09:58:39,283 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 09:58:39,284 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 09:58:39,284 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 09:58:39,284 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 09:58:39,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 09:58:39,284 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 09:58:39,285 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 09:58:39,285 INFO L87 Difference]: Start difference. First operand 1954 states and 2362 transitions. Second operand 10 states. [2018-09-19 09:58:47,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 09:58:47,019 INFO L93 Difference]: Finished difference Result 3932 states and 4909 transitions. [2018-09-19 09:58:47,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 09:58:47,020 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 190 [2018-09-19 09:58:47,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 09:58:47,029 INFO L225 Difference]: With dead ends: 3932 [2018-09-19 09:58:47,029 INFO L226 Difference]: Without dead ends: 2132 [2018-09-19 09:58:47,034 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 197 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 09:58:47,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2132 states. [2018-09-19 09:58:47,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2132 to 2109. [2018-09-19 09:58:47,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2109 states. [2018-09-19 09:58:47,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2109 states to 2109 states and 2577 transitions. [2018-09-19 09:58:47,107 INFO L78 Accepts]: Start accepts. Automaton has 2109 states and 2577 transitions. Word has length 190 [2018-09-19 09:58:47,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 09:58:47,107 INFO L480 AbstractCegarLoop]: Abstraction has 2109 states and 2577 transitions. [2018-09-19 09:58:47,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 09:58:47,107 INFO L276 IsEmpty]: Start isEmpty. Operand 2109 states and 2577 transitions. [2018-09-19 09:58:47,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-09-19 09:58:47,111 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 09:58:47,111 INFO L376 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 09:58:47,112 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 09:58:47,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1921769179, now seen corresponding path program 1 times [2018-09-19 09:58:47,112 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 09:58:47,112 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 200 with the following transitions: [2018-09-19 09:58:47,113 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [149], [151], [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], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [602], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 09:58:47,115 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 09:58:47,116 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 09:58:48,621 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 09:58:58,834 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 09:58:58,834 INFO L272 AbstractInterpreter]: Visited 105 different actions 407 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 09:58:58,840 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 09:58:59,849 INFO L232 lantSequenceWeakener]: Weakened 197 states. On average, predicates are now at 73.09% of their original sizes. [2018-09-19 09:58:59,849 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 09:59:00,185 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 09:59:00,185 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 09:59:00,185 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-19 09:59:00,186 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 09:59:00,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-19 09:59:00,186 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-19 09:59:00,186 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-09-19 09:59:00,187 INFO L87 Difference]: Start difference. First operand 2109 states and 2577 transitions. Second operand 11 states. [2018-09-19 09:59:05,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 09:59:05,884 INFO L93 Difference]: Finished difference Result 4320 states and 5463 transitions. [2018-09-19 09:59:05,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 09:59:05,884 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 199 [2018-09-19 09:59:05,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 09:59:05,893 INFO L225 Difference]: With dead ends: 4320 [2018-09-19 09:59:05,893 INFO L226 Difference]: Without dead ends: 2365 [2018-09-19 09:59:05,897 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 207 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2018-09-19 09:59:05,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2365 states. [2018-09-19 09:59:05,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2365 to 2262. [2018-09-19 09:59:05,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2262 states. [2018-09-19 09:59:05,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 2262 states and 2792 transitions. [2018-09-19 09:59:05,972 INFO L78 Accepts]: Start accepts. Automaton has 2262 states and 2792 transitions. Word has length 199 [2018-09-19 09:59:05,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 09:59:05,973 INFO L480 AbstractCegarLoop]: Abstraction has 2262 states and 2792 transitions. [2018-09-19 09:59:05,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-19 09:59:05,973 INFO L276 IsEmpty]: Start isEmpty. Operand 2262 states and 2792 transitions. [2018-09-19 09:59:05,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-09-19 09:59:05,977 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 09:59:05,977 INFO L376 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 09:59:05,978 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 09:59:05,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1342665711, now seen corresponding path program 1 times [2018-09-19 09:59:05,978 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 09:59:05,978 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 206 with the following transitions: [2018-09-19 09:59:05,979 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [149], [151], [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], [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], [619], [623], [626], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 09:59:05,981 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 09:59:05,981 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 09:59:07,321 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 09:59:15,401 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 09:59:15,402 INFO L272 AbstractInterpreter]: Visited 111 different actions 433 times. Merged at 7 different actions 22 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 09:59:15,411 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 09:59:16,228 INFO L232 lantSequenceWeakener]: Weakened 203 states. On average, predicates are now at 73.08% of their original sizes. [2018-09-19 09:59:16,228 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 09:59:16,562 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 09:59:16,563 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 09:59:16,563 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-19 09:59:16,563 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 09:59:16,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-19 09:59:16,563 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-19 09:59:16,563 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-09-19 09:59:16,564 INFO L87 Difference]: Start difference. First operand 2262 states and 2792 transitions. Second operand 11 states. [2018-09-19 09:59:24,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 09:59:24,135 INFO L93 Difference]: Finished difference Result 4808 states and 6139 transitions. [2018-09-19 09:59:24,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-19 09:59:24,135 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 205 [2018-09-19 09:59:24,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 09:59:24,146 INFO L225 Difference]: With dead ends: 4808 [2018-09-19 09:59:24,146 INFO L226 Difference]: Without dead ends: 2700 [2018-09-19 09:59:24,151 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 213 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2018-09-19 09:59:24,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2700 states. [2018-09-19 09:59:24,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2700 to 2670. [2018-09-19 09:59:24,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2670 states. [2018-09-19 09:59:24,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2670 states to 2670 states and 3328 transitions. [2018-09-19 09:59:24,239 INFO L78 Accepts]: Start accepts. Automaton has 2670 states and 3328 transitions. Word has length 205 [2018-09-19 09:59:24,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 09:59:24,240 INFO L480 AbstractCegarLoop]: Abstraction has 2670 states and 3328 transitions. [2018-09-19 09:59:24,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-19 09:59:24,240 INFO L276 IsEmpty]: Start isEmpty. Operand 2670 states and 3328 transitions. [2018-09-19 09:59:24,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-09-19 09:59:24,245 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 09:59:24,245 INFO L376 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 09:59:24,245 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 09:59:24,246 INFO L82 PathProgramCache]: Analyzing trace with hash -654857782, now seen corresponding path program 1 times [2018-09-19 09:59:24,246 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 09:59:24,246 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 213 with the following transitions: [2018-09-19 09:59:24,246 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [149], [151], [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], [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], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 09:59:24,249 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 09:59:24,249 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 09:59:25,623 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 09:59:35,145 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 09:59:35,145 INFO L272 AbstractInterpreter]: Visited 118 different actions 459 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 09:59:35,154 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 09:59:36,048 INFO L232 lantSequenceWeakener]: Weakened 210 states. On average, predicates are now at 73.07% of their original sizes. [2018-09-19 09:59:36,049 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 09:59:36,372 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 09:59:36,372 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 09:59:36,372 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-19 09:59:36,373 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 09:59:36,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-19 09:59:36,373 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-19 09:59:36,373 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-09-19 09:59:36,374 INFO L87 Difference]: Start difference. First operand 2670 states and 3328 transitions. Second operand 11 states. [2018-09-19 09:59:43,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 09:59:43,288 INFO L93 Difference]: Finished difference Result 5752 states and 7377 transitions. [2018-09-19 09:59:43,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 09:59:43,295 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 212 [2018-09-19 09:59:43,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 09:59:43,310 INFO L225 Difference]: With dead ends: 5752 [2018-09-19 09:59:43,310 INFO L226 Difference]: Without dead ends: 3236 [2018-09-19 09:59:43,316 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 220 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2018-09-19 09:59:43,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3236 states. [2018-09-19 09:59:43,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3236 to 3129. [2018-09-19 09:59:43,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2018-09-19 09:59:43,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 3930 transitions. [2018-09-19 09:59:43,440 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 3930 transitions. Word has length 212 [2018-09-19 09:59:43,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 09:59:43,441 INFO L480 AbstractCegarLoop]: Abstraction has 3129 states and 3930 transitions. [2018-09-19 09:59:43,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-19 09:59:43,441 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 3930 transitions. [2018-09-19 09:59:43,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-09-19 09:59:43,445 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 09:59:43,445 INFO L376 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 09:59:43,446 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 09:59:43,446 INFO L82 PathProgramCache]: Analyzing trace with hash 732454469, now seen corresponding path program 1 times [2018-09-19 09:59:43,446 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 09:59:43,453 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 216 with the following transitions: [2018-09-19 09:59:43,453 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [149], [151], [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], [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], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 09:59:43,457 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 09:59:43,458 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 09:59:45,182 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 09:59:55,237 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 09:59:55,237 INFO L272 AbstractInterpreter]: Visited 121 different actions 471 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 09:59:55,243 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 09:59:56,088 INFO L232 lantSequenceWeakener]: Weakened 213 states. On average, predicates are now at 73.06% of their original sizes. [2018-09-19 09:59:56,088 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 09:59:56,532 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 09:59:56,533 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 09:59:56,533 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-19 09:59:56,533 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 09:59:56,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-19 09:59:56,534 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-19 09:59:56,534 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-09-19 09:59:56,535 INFO L87 Difference]: Start difference. First operand 3129 states and 3930 transitions. Second operand 13 states. [2018-09-19 10:00:07,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:00:07,427 INFO L93 Difference]: Finished difference Result 6701 states and 8709 transitions. [2018-09-19 10:00:07,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 10:00:07,428 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 215 [2018-09-19 10:00:07,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:00:07,444 INFO L225 Difference]: With dead ends: 6701 [2018-09-19 10:00:07,445 INFO L226 Difference]: Without dead ends: 3726 [2018-09-19 10:00:07,451 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 227 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2018-09-19 10:00:07,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3726 states. [2018-09-19 10:00:07,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3726 to 3529. [2018-09-19 10:00:07,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3529 states. [2018-09-19 10:00:07,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3529 states to 3529 states and 4443 transitions. [2018-09-19 10:00:07,577 INFO L78 Accepts]: Start accepts. Automaton has 3529 states and 4443 transitions. Word has length 215 [2018-09-19 10:00:07,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:00:07,578 INFO L480 AbstractCegarLoop]: Abstraction has 3529 states and 4443 transitions. [2018-09-19 10:00:07,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-19 10:00:07,578 INFO L276 IsEmpty]: Start isEmpty. Operand 3529 states and 4443 transitions. [2018-09-19 10:00:07,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-09-19 10:00:07,582 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:00:07,583 INFO L376 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 10:00:07,583 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:00:07,583 INFO L82 PathProgramCache]: Analyzing trace with hash -401062956, now seen corresponding path program 1 times [2018-09-19 10:00:07,583 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:00:07,584 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 221 with the following transitions: [2018-09-19 10:00:07,584 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [149], [151], [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], [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], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 10:00:07,587 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:00:07,588 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:00:10,350 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:00:22,208 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:00:22,208 INFO L272 AbstractInterpreter]: Visited 124 different actions 603 times. Merged at 7 different actions 27 times. Never widened. Found 5 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 10:00:22,213 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:00:23,093 INFO L232 lantSequenceWeakener]: Weakened 218 states. On average, predicates are now at 73.06% of their original sizes. [2018-09-19 10:00:23,094 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:00:23,365 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:00:23,366 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:00:23,366 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 10:00:23,366 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:00:23,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 10:00:23,367 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 10:00:23,367 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 10:00:23,367 INFO L87 Difference]: Start difference. First operand 3529 states and 4443 transitions. Second operand 10 states. [2018-09-19 10:00:28,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:00:28,292 INFO L93 Difference]: Finished difference Result 7079 states and 9092 transitions. [2018-09-19 10:00:28,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 10:00:28,293 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 220 [2018-09-19 10:00:28,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:00:28,313 INFO L225 Difference]: With dead ends: 7079 [2018-09-19 10:00:28,313 INFO L226 Difference]: Without dead ends: 3704 [2018-09-19 10:00:28,321 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 227 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 10:00:28,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3704 states. [2018-09-19 10:00:28,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3704 to 3677. [2018-09-19 10:00:28,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3677 states. [2018-09-19 10:00:28,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3677 states to 3677 states and 4642 transitions. [2018-09-19 10:00:28,458 INFO L78 Accepts]: Start accepts. Automaton has 3677 states and 4642 transitions. Word has length 220 [2018-09-19 10:00:28,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:00:28,458 INFO L480 AbstractCegarLoop]: Abstraction has 3677 states and 4642 transitions. [2018-09-19 10:00:28,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 10:00:28,459 INFO L276 IsEmpty]: Start isEmpty. Operand 3677 states and 4642 transitions. [2018-09-19 10:00:28,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-09-19 10:00:28,463 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:00:28,464 INFO L376 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 10:00:28,464 INFO L423 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:00:28,464 INFO L82 PathProgramCache]: Analyzing trace with hash -753508574, now seen corresponding path program 1 times [2018-09-19 10:00:28,464 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:00:28,465 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 225 with the following transitions: [2018-09-19 10:00:28,465 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [149], [151], [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], [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], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [702], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 10:00:28,468 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:00:28,468 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:00:30,099 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. Received shutdown request... [2018-09-19 10:00:36,483 WARN L572 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-09-19 10:00:36,484 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-09-19 10:00:36,485 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 10:00:36,521 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 10:00:36,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 10:00:36 BoogieIcfgContainer [2018-09-19 10:00:36,522 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 10:00:36,523 INFO L168 Benchmark]: Toolchain (without parser) took 258984.22 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 3.7 GB in the end (delta: -2.2 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-19 10:00:36,525 INFO L168 Benchmark]: CDTParser took 0.21 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-09-19 10:00:36,526 INFO L168 Benchmark]: CACSL2BoogieTranslator took 867.96 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-19 10:00:36,530 INFO L168 Benchmark]: Boogie Procedure Inliner took 148.47 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-19 10:00:36,531 INFO L168 Benchmark]: Boogie Preprocessor took 295.58 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 761.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -843.4 MB). Peak memory consumption was 29.1 MB. Max. memory is 7.1 GB. [2018-09-19 10:00:36,532 INFO L168 Benchmark]: RCFGBuilder took 3488.98 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: 125.5 MB). Peak memory consumption was 125.5 MB. Max. memory is 7.1 GB. [2018-09-19 10:00:36,534 INFO L168 Benchmark]: TraceAbstraction took 254172.27 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 3.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-09-19 10:00:36,541 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.21 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 867.96 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 148.47 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 295.58 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 761.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -843.4 MB). Peak memory consumption was 29.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3488.98 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: 125.5 MB). Peak memory consumption was 125.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 254172.27 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 3.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 76]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L7] int inputC = 3; [L8] int inputD = 4; [L9] int inputE = 5; [L10] int inputF = 6; [L11] int inputB = 2; [L14] int a1 = 23; [L15] int a19 = 9; [L16] int a10 = 0; [L17] int a12 = 0; [L18] int a4 = 14; [L579] int output = -1; [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND TRUE ((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0))) [L211] a1 = (((a1 + -15535) - 211896) / 5) [L212] a10 = 2 [L214] RET return 22; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L425] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) [L430] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) [L436] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) [L442] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) [L448] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) [L454] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) [L460] COND TRUE ((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0)))) [L461] a1 = (((a1 / 5) + 105416) + 61704) [L462] a10 = 4 [L464] RET return 24; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND TRUE (((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6)) [L76] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNKNOWN Result, 254.0s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 105.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2712 SDtfs, 10604 SDslu, 5189 SDs, 0 SdLazy, 27520 SolverSat, 2518 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 92.7s Time, PredicateUnifierStatistics: 28 DeclaredPredicates, 2447 GetRequests, 2205 SyntacticMatches, 0 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 812 ImplicationChecksByTransitivity, 9.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3677occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 129.6s AbstIntTime, 15 AbstIntIterations, 14 AbstIntStrong, 0.9935573207494591 AbsIntWeakeningRatio, 0.1410146173688736 AbsIntAvgWeakeningVarsNumRemoved, 872.7368873602752 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 792 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: No data available, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label06_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_10-00-36-564.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label06_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_10-00-36-564.csv Completed graceful shutdown