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_label37_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 10:03:06,086 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 10:03:06,092 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 10:03:06,111 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 10:03:06,111 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 10:03:06,112 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 10:03:06,114 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 10:03:06,116 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 10:03:06,117 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 10:03:06,118 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 10:03:06,119 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 10:03:06,119 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 10:03:06,120 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 10:03:06,122 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 10:03:06,126 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 10:03:06,127 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 10:03:06,128 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 10:03:06,130 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 10:03:06,132 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 10:03:06,133 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 10:03:06,134 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 10:03:06,136 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 10:03:06,138 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 10:03:06,138 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 10:03:06,139 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 10:03:06,140 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 10:03:06,141 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 10:03:06,141 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 10:03:06,142 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 10:03:06,143 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 10:03:06,144 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 10:03:06,144 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 10:03:06,145 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 10:03:06,145 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 10:03:06,146 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 10:03:06,146 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 10:03:06,147 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 10:03:06,175 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 10:03:06,176 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 10:03:06,177 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 10:03:06,177 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 10:03:06,177 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 10:03:06,178 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 10:03:06,178 INFO L133 SettingsManager]: * Congruence Domain=false [2018-09-19 10:03:06,178 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 10:03:06,179 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2018-09-19 10:03:06,179 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 10:03:06,179 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 10:03:06,179 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 10:03:06,179 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-19 10:03:06,180 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 10:03:06,181 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 10:03:06,181 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 10:03:06,182 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 10:03:06,182 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 10:03:06,182 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 10:03:06,182 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 10:03:06,184 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 10:03:06,184 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 10:03:06,184 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 10:03:06,184 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 10:03:06,184 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 10:03:06,185 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 10:03:06,185 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 10:03:06,185 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 10:03:06,186 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 10:03:06,186 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 10:03:06,186 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 10:03:06,186 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 10:03:06,186 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 10:03:06,187 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 10:03:06,187 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 10:03:06,264 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 10:03:06,284 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 10:03:06,294 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 10:03:06,296 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 10:03:06,296 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 10:03:06,298 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label37_true-unreach-call.c [2018-09-19 10:03:06,645 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7eb228bd/664e229cf52144fba2510c8a7c3c703c/FLAGa9a56b2c6 [2018-09-19 10:03:06,937 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 10:03:06,938 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label37_true-unreach-call.c [2018-09-19 10:03:06,956 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7eb228bd/664e229cf52144fba2510c8a7c3c703c/FLAGa9a56b2c6 [2018-09-19 10:03:06,972 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7eb228bd/664e229cf52144fba2510c8a7c3c703c [2018-09-19 10:03:06,985 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 10:03:06,988 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 10:03:06,990 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 10:03:06,990 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 10:03:06,997 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 10:03:06,998 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 10:03:06" (1/1) ... [2018-09-19 10:03:07,001 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58150d2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:03:06, skipping insertion in model container [2018-09-19 10:03:07,001 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 10:03:06" (1/1) ... [2018-09-19 10:03:07,014 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 10:03:07,516 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 10:03:07,536 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 10:03:07,698 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 10:03:07,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:03:07 WrapperNode [2018-09-19 10:03:07,749 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 10:03:07,750 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 10:03:07,751 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 10:03:07,751 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 10:03:07,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:03:07" (1/1) ... [2018-09-19 10:03:07,786 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:03:07" (1/1) ... [2018-09-19 10:03:07,854 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 10:03:07,854 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 10:03:07,854 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 10:03:07,855 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 10:03:08,040 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:03:07" (1/1) ... [2018-09-19 10:03:08,040 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:03:07" (1/1) ... [2018-09-19 10:03:08,059 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:03:07" (1/1) ... [2018-09-19 10:03:08,059 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:03:07" (1/1) ... [2018-09-19 10:03:08,100 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:03:07" (1/1) ... [2018-09-19 10:03:08,122 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:03:07" (1/1) ... [2018-09-19 10:03:08,141 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:03:07" (1/1) ... [2018-09-19 10:03:08,151 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 10:03:08,152 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 10:03:08,153 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 10:03:08,153 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 10:03:08,154 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:03:07" (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 10:03:08,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 10:03:08,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 10:03:08,234 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 10:03:08,235 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 10:03:08,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 10:03:08,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 10:03:08,235 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 10:03:08,236 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 10:03:11,431 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 10:03:11,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 10:03:11 BoogieIcfgContainer [2018-09-19 10:03:11,432 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 10:03:11,433 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 10:03:11,433 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 10:03:11,437 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 10:03:11,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 10:03:06" (1/3) ... [2018-09-19 10:03:11,438 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f074424 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 10:03:11, skipping insertion in model container [2018-09-19 10:03:11,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:03:07" (2/3) ... [2018-09-19 10:03:11,439 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f074424 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 10:03:11, skipping insertion in model container [2018-09-19 10:03:11,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 10:03:11" (3/3) ... [2018-09-19 10:03:11,441 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label37_true-unreach-call.c [2018-09-19 10:03:11,451 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 10:03:11,460 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 10:03:11,517 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 10:03:11,518 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 10:03:11,518 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 10:03:11,518 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 10:03:11,518 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 10:03:11,518 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 10:03:11,519 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 10:03:11,519 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 10:03:11,519 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 10:03:11,545 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-19 10:03:11,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-19 10:03:11,554 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:03:11,555 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, 1, 1, 1, 1, 1, 1, 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:03:11,557 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:03:11,561 INFO L82 PathProgramCache]: Analyzing trace with hash -890432215, now seen corresponding path program 1 times [2018-09-19 10:03:11,563 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:03:11,564 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 62 with the following transitions: [2018-09-19 10:03:11,566 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [796], [800], [806], [810], [817], [818], [819], [821] [2018-09-19 10:03:11,647 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:03:11,648 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:03:13,175 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:03:13,177 INFO L272 AbstractInterpreter]: Visited 60 different actions 60 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-19 10:03:13,222 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:03:13,946 INFO L232 lantSequenceWeakener]: Weakened 59 states. On average, predicates are now at 75.94% of their original sizes. [2018-09-19 10:03:13,946 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:03:14,247 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:03:14,249 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:03:14,249 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 10:03:14,249 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:03:14,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 10:03:14,263 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 10:03:14,264 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 10:03:14,266 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 6 states. [2018-09-19 10:03:20,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:03:20,557 INFO L93 Difference]: Finished difference Result 576 states and 995 transitions. [2018-09-19 10:03:20,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 10:03:20,562 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-09-19 10:03:20,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:03:20,584 INFO L225 Difference]: With dead ends: 576 [2018-09-19 10:03:20,584 INFO L226 Difference]: Without dead ends: 358 [2018-09-19 10:03:20,592 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 60 GetRequests, 56 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 10:03:20,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-09-19 10:03:20,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-09-19 10:03:20,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-19 10:03:20,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2018-09-19 10:03:20,675 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 61 [2018-09-19 10:03:20,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:03:20,675 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2018-09-19 10:03:20,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 10:03:20,676 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2018-09-19 10:03:20,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-09-19 10:03:20,683 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:03:20,683 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, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 10:03:20,684 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:03:20,684 INFO L82 PathProgramCache]: Analyzing trace with hash -116714533, now seen corresponding path program 1 times [2018-09-19 10:03:20,684 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:03:20,685 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 133 with the following transitions: [2018-09-19 10:03:20,685 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [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 10:03:20,692 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:03:20,692 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:03:22,200 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:03:25,267 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:03:25,268 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 10:03:25,278 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:03:26,382 INFO L232 lantSequenceWeakener]: Weakened 130 states. On average, predicates are now at 74.26% of their original sizes. [2018-09-19 10:03:26,383 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:03:27,013 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:03:27,014 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:03:27,014 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 10:03:27,014 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:03:27,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 10:03:27,016 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 10:03:27,016 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 10:03:27,016 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand 10 states. [2018-09-19 10:03:35,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:03:35,213 INFO L93 Difference]: Finished difference Result 717 states and 1132 transitions. [2018-09-19 10:03:35,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 10:03:35,217 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 132 [2018-09-19 10:03:35,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:03:35,224 INFO L225 Difference]: With dead ends: 717 [2018-09-19 10:03:35,224 INFO L226 Difference]: Without dead ends: 511 [2018-09-19 10:03:35,227 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 138 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 10:03:35,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-09-19 10:03:35,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 505. [2018-09-19 10:03:35,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2018-09-19 10:03:35,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 669 transitions. [2018-09-19 10:03:35,268 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 669 transitions. Word has length 132 [2018-09-19 10:03:35,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:03:35,269 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 669 transitions. [2018-09-19 10:03:35,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 10:03:35,270 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 669 transitions. [2018-09-19 10:03:35,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-09-19 10:03:35,274 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:03:35,274 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, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 10:03:35,275 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:03:35,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1877603308, now seen corresponding path program 1 times [2018-09-19 10:03:35,275 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:03:35,276 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 142 with the following transitions: [2018-09-19 10:03:35,276 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [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 10:03:35,281 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:03:35,281 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:03:40,533 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:03:42,332 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:03:42,333 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 10:03:42,339 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:03:43,405 INFO L232 lantSequenceWeakener]: Weakened 139 states. On average, predicates are now at 74.16% of their original sizes. [2018-09-19 10:03:43,406 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:03:44,194 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:03:44,194 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:03:44,194 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-19 10:03:44,194 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:03:44,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-19 10:03:44,195 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-19 10:03:44,196 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-09-19 10:03:44,196 INFO L87 Difference]: Start difference. First operand 505 states and 669 transitions. Second operand 13 states. [2018-09-19 10:03:53,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:03:53,358 INFO L93 Difference]: Finished difference Result 1333 states and 2096 transitions. [2018-09-19 10:03:53,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-19 10:03:53,360 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 141 [2018-09-19 10:03:53,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:03:53,368 INFO L225 Difference]: With dead ends: 1333 [2018-09-19 10:03:53,368 INFO L226 Difference]: Without dead ends: 978 [2018-09-19 10:03:53,371 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 155 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=164, Invalid=592, Unknown=0, NotChecked=0, Total=756 [2018-09-19 10:03:53,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2018-09-19 10:03:53,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 762. [2018-09-19 10:03:53,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2018-09-19 10:03:53,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 953 transitions. [2018-09-19 10:03:53,421 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 953 transitions. Word has length 141 [2018-09-19 10:03:53,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:03:53,422 INFO L480 AbstractCegarLoop]: Abstraction has 762 states and 953 transitions. [2018-09-19 10:03:53,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-19 10:03:53,422 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 953 transitions. [2018-09-19 10:03:53,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-09-19 10:03:53,426 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:03:53,426 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 10:03:53,427 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:03:53,427 INFO L82 PathProgramCache]: Analyzing trace with hash -851202276, now seen corresponding path program 1 times [2018-09-19 10:03:53,427 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:03:53,427 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 178 with the following transitions: [2018-09-19 10:03:53,428 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [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 10:03:53,434 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:03:53,434 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:03:56,287 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:04:02,853 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:04:02,853 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 10:04:02,862 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:04:03,895 INFO L232 lantSequenceWeakener]: Weakened 175 states. On average, predicates are now at 73.86% of their original sizes. [2018-09-19 10:04:03,895 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:04:05,216 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:04:05,216 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:04:05,217 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-19 10:04:05,217 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:04:05,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-19 10:04:05,220 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-19 10:04:05,220 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-09-19 10:04:05,220 INFO L87 Difference]: Start difference. First operand 762 states and 953 transitions. Second operand 12 states. [2018-09-19 10:04:12,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:04:12,394 INFO L93 Difference]: Finished difference Result 1677 states and 2220 transitions. [2018-09-19 10:04:12,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 10:04:12,395 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 177 [2018-09-19 10:04:12,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:04:12,403 INFO L225 Difference]: With dead ends: 1677 [2018-09-19 10:04:12,403 INFO L226 Difference]: Without dead ends: 1067 [2018-09-19 10:04:12,406 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 185 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2018-09-19 10:04:12,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2018-09-19 10:04:12,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1056. [2018-09-19 10:04:12,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1056 states. [2018-09-19 10:04:12,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1287 transitions. [2018-09-19 10:04:12,450 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1287 transitions. Word has length 177 [2018-09-19 10:04:12,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:04:12,450 INFO L480 AbstractCegarLoop]: Abstraction has 1056 states and 1287 transitions. [2018-09-19 10:04:12,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-19 10:04:12,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1287 transitions. [2018-09-19 10:04:12,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-09-19 10:04:12,454 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:04:12,454 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 10:04:12,455 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:04:12,455 INFO L82 PathProgramCache]: Analyzing trace with hash 931633243, now seen corresponding path program 1 times [2018-09-19 10:04:12,455 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:04:12,455 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 197 with the following transitions: [2018-09-19 10:04:12,456 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [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 10:04:12,464 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:04:12,464 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:04:22,509 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:04:22,510 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 10:04:22,520 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:04:23,440 INFO L232 lantSequenceWeakener]: Weakened 194 states. On average, predicates are now at 73.75% of their original sizes. [2018-09-19 10:04:23,440 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:04:23,845 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:04:23,845 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:04:23,845 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-19 10:04:23,846 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:04:23,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-19 10:04:23,846 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-19 10:04:23,846 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-09-19 10:04:23,847 INFO L87 Difference]: Start difference. First operand 1056 states and 1287 transitions. Second operand 12 states. [2018-09-19 10:04:33,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:04:33,204 INFO L93 Difference]: Finished difference Result 2268 states and 2899 transitions. [2018-09-19 10:04:33,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-19 10:04:33,209 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 196 [2018-09-19 10:04:33,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:04:33,215 INFO L225 Difference]: With dead ends: 2268 [2018-09-19 10:04:33,215 INFO L226 Difference]: Without dead ends: 1364 [2018-09-19 10:04:33,219 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 205 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2018-09-19 10:04:33,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2018-09-19 10:04:33,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1352. [2018-09-19 10:04:33,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-09-19 10:04:33,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1615 transitions. [2018-09-19 10:04:33,267 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1615 transitions. Word has length 196 [2018-09-19 10:04:33,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:04:33,268 INFO L480 AbstractCegarLoop]: Abstraction has 1352 states and 1615 transitions. [2018-09-19 10:04:33,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-19 10:04:33,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1615 transitions. [2018-09-19 10:04:33,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-09-19 10:04:33,271 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:04:33,272 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 10:04:33,272 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:04:33,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1252369150, now seen corresponding path program 1 times [2018-09-19 10:04:33,272 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:04:33,273 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 209 with the following transitions: [2018-09-19 10:04:33,273 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [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 10:04:33,276 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:04:33,276 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:04:34,631 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:04:39,672 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:04:39,672 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 10:04:39,679 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:04:40,777 INFO L232 lantSequenceWeakener]: Weakened 206 states. On average, predicates are now at 73.74% of their original sizes. [2018-09-19 10:04:40,778 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:04:41,069 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:04:41,070 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:04:41,070 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 10:04:41,070 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:04:41,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 10:04:41,071 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 10:04:41,071 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 10:04:41,072 INFO L87 Difference]: Start difference. First operand 1352 states and 1615 transitions. Second operand 10 states. [2018-09-19 10:04:47,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:04:47,837 INFO L93 Difference]: Finished difference Result 2719 states and 3388 transitions. [2018-09-19 10:04:47,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 10:04:47,840 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 208 [2018-09-19 10:04:47,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:04:47,849 INFO L225 Difference]: With dead ends: 2719 [2018-09-19 10:04:47,850 INFO L226 Difference]: Without dead ends: 1521 [2018-09-19 10:04:47,854 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 215 GetRequests, 199 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 10:04:47,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2018-09-19 10:04:47,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1503. [2018-09-19 10:04:47,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2018-09-19 10:04:47,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1792 transitions. [2018-09-19 10:04:47,918 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1792 transitions. Word has length 208 [2018-09-19 10:04:47,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:04:47,919 INFO L480 AbstractCegarLoop]: Abstraction has 1503 states and 1792 transitions. [2018-09-19 10:04:47,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 10:04:47,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1792 transitions. [2018-09-19 10:04:47,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-09-19 10:04:47,923 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:04:47,924 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 10:04:47,924 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:04:47,924 INFO L82 PathProgramCache]: Analyzing trace with hash 930697442, now seen corresponding path program 1 times [2018-09-19 10:04:47,924 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:04:47,925 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 211 with the following transitions: [2018-09-19 10:04:47,925 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [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 10:04:47,927 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:04:47,928 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:04:49,531 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:04:55,460 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:04:55,460 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 10:04:55,465 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:04:56,328 INFO L232 lantSequenceWeakener]: Weakened 208 states. On average, predicates are now at 73.73% of their original sizes. [2018-09-19 10:04:56,328 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:04:56,583 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:04:56,584 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:04:56,584 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 10:04:56,584 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:04:56,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 10:04:56,585 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 10:04:56,585 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 10:04:56,585 INFO L87 Difference]: Start difference. First operand 1503 states and 1792 transitions. Second operand 10 states. [2018-09-19 10:05:03,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:05:03,668 INFO L93 Difference]: Finished difference Result 3020 states and 3751 transitions. [2018-09-19 10:05:03,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 10:05:03,676 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 210 [2018-09-19 10:05:03,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:05:03,683 INFO L225 Difference]: With dead ends: 3020 [2018-09-19 10:05:03,684 INFO L226 Difference]: Without dead ends: 1671 [2018-09-19 10:05:03,687 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 217 GetRequests, 201 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:05:03,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-09-19 10:05:03,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1654. [2018-09-19 10:05:03,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1654 states. [2018-09-19 10:05:03,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 1988 transitions. [2018-09-19 10:05:03,744 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 1988 transitions. Word has length 210 [2018-09-19 10:05:03,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:05:03,744 INFO L480 AbstractCegarLoop]: Abstraction has 1654 states and 1988 transitions. [2018-09-19 10:05:03,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 10:05:03,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 1988 transitions. [2018-09-19 10:05:03,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-09-19 10:05:03,750 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:05:03,751 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:05:03,751 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:05:03,751 INFO L82 PathProgramCache]: Analyzing trace with hash -48941910, now seen corresponding path program 1 times [2018-09-19 10:05:03,751 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:05:03,752 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 215 with the following transitions: [2018-09-19 10:05:03,752 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [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 10:05:03,754 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:05:03,754 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:05:05,195 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:05:10,607 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:05:10,608 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 10:05:10,616 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:05:11,519 INFO L232 lantSequenceWeakener]: Weakened 212 states. On average, predicates are now at 73.71% of their original sizes. [2018-09-19 10:05:11,520 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:05:11,802 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:05:11,802 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:05:11,803 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 10:05:11,803 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:05:11,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 10:05:11,804 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 10:05:11,804 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 10:05:11,804 INFO L87 Difference]: Start difference. First operand 1654 states and 1988 transitions. Second operand 10 states. [2018-09-19 10:05:16,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:05:16,650 INFO L93 Difference]: Finished difference Result 3477 states and 4328 transitions. [2018-09-19 10:05:16,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 10:05:16,651 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 214 [2018-09-19 10:05:16,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:05:16,660 INFO L225 Difference]: With dead ends: 3477 [2018-09-19 10:05:16,661 INFO L226 Difference]: Without dead ends: 1977 [2018-09-19 10:05:16,666 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 221 GetRequests, 205 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:05:16,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2018-09-19 10:05:16,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1954. [2018-09-19 10:05:16,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1954 states. [2018-09-19 10:05:16,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2362 transitions. [2018-09-19 10:05:16,744 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2362 transitions. Word has length 214 [2018-09-19 10:05:16,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:05:16,745 INFO L480 AbstractCegarLoop]: Abstraction has 1954 states and 2362 transitions. [2018-09-19 10:05:16,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 10:05:16,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2362 transitions. [2018-09-19 10:05:16,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-09-19 10:05:16,751 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:05:16,752 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 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:05:16,752 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:05:16,753 INFO L82 PathProgramCache]: Analyzing trace with hash 56122966, now seen corresponding path program 1 times [2018-09-19 10:05:16,753 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:05:16,753 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 221 with the following transitions: [2018-09-19 10:05:16,753 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [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 10:05:16,756 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:05:16,757 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:05:18,423 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:05:27,870 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:05:27,870 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 10:05:27,882 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:05:28,881 INFO L232 lantSequenceWeakener]: Weakened 218 states. On average, predicates are now at 73.68% of their original sizes. [2018-09-19 10:05:28,881 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:05:29,176 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:05:29,176 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:05:29,177 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 10:05:29,177 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:05:29,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 10:05:29,177 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 10:05:29,178 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 10:05:29,178 INFO L87 Difference]: Start difference. First operand 1954 states and 2362 transitions. Second operand 10 states. [2018-09-19 10:05:36,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:05:36,345 INFO L93 Difference]: Finished difference Result 3932 states and 4909 transitions. [2018-09-19 10:05:36,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 10:05:36,352 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 220 [2018-09-19 10:05:36,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:05:36,361 INFO L225 Difference]: With dead ends: 3932 [2018-09-19 10:05:36,361 INFO L226 Difference]: Without dead ends: 2132 [2018-09-19 10:05:36,366 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 227 GetRequests, 211 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 10:05:36,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2132 states. [2018-09-19 10:05:36,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2132 to 2109. [2018-09-19 10:05:36,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2109 states. [2018-09-19 10:05:36,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2109 states to 2109 states and 2577 transitions. [2018-09-19 10:05:36,454 INFO L78 Accepts]: Start accepts. Automaton has 2109 states and 2577 transitions. Word has length 220 [2018-09-19 10:05:36,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:05:36,455 INFO L480 AbstractCegarLoop]: Abstraction has 2109 states and 2577 transitions. [2018-09-19 10:05:36,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 10:05:36,455 INFO L276 IsEmpty]: Start isEmpty. Operand 2109 states and 2577 transitions. [2018-09-19 10:05:36,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-09-19 10:05:36,464 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:05:36,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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:36,464 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:05:36,465 INFO L82 PathProgramCache]: Analyzing trace with hash -699720387, now seen corresponding path program 1 times [2018-09-19 10:05:36,465 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:05:36,465 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 230 with the following transitions: [2018-09-19 10:05:36,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], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [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 10:05:36,468 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:05:36,468 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:05:37,763 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:05:47,952 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:05:47,952 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 10:05:47,958 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:05:49,016 INFO L232 lantSequenceWeakener]: Weakened 227 states. On average, predicates are now at 73.64% of their original sizes. [2018-09-19 10:05:49,016 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:05:49,348 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:05:49,348 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:05:49,348 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-19 10:05:49,348 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:05:49,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-19 10:05:49,349 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-19 10:05:49,349 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-09-19 10:05:49,349 INFO L87 Difference]: Start difference. First operand 2109 states and 2577 transitions. Second operand 11 states. [2018-09-19 10:05:58,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:05:58,028 INFO L93 Difference]: Finished difference Result 4320 states and 5463 transitions. [2018-09-19 10:05:58,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 10:05:58,028 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 229 [2018-09-19 10:05:58,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:05:58,038 INFO L225 Difference]: With dead ends: 4320 [2018-09-19 10:05:58,038 INFO L226 Difference]: Without dead ends: 2365 [2018-09-19 10:05:58,043 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 237 GetRequests, 219 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 10:05:58,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2365 states. [2018-09-19 10:05:58,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2365 to 2262. [2018-09-19 10:05:58,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2262 states. [2018-09-19 10:05:58,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 2262 states and 2792 transitions. [2018-09-19 10:05:58,126 INFO L78 Accepts]: Start accepts. Automaton has 2262 states and 2792 transitions. Word has length 229 [2018-09-19 10:05:58,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:05:58,127 INFO L480 AbstractCegarLoop]: Abstraction has 2262 states and 2792 transitions. [2018-09-19 10:05:58,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-19 10:05:58,127 INFO L276 IsEmpty]: Start isEmpty. Operand 2262 states and 2792 transitions. [2018-09-19 10:05:58,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-09-19 10:05:58,132 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:05:58,133 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:58,133 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:05:58,133 INFO L82 PathProgramCache]: Analyzing trace with hash -523787479, now seen corresponding path program 1 times [2018-09-19 10:05:58,133 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:05:58,134 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 236 with the following transitions: [2018-09-19 10:05:58,134 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [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 10:05:58,137 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:05:58,137 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:05:59,618 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:06:07,342 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:06:07,342 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 10:06:07,350 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:06:08,287 INFO L232 lantSequenceWeakener]: Weakened 233 states. On average, predicates are now at 73.62% of their original sizes. [2018-09-19 10:06:08,287 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:06:08,638 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:06:08,639 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:06:08,639 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-19 10:06:08,639 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:06:08,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-19 10:06:08,640 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-19 10:06:08,640 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-09-19 10:06:08,640 INFO L87 Difference]: Start difference. First operand 2262 states and 2792 transitions. Second operand 11 states. [2018-09-19 10:06:16,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:06:16,648 INFO L93 Difference]: Finished difference Result 4808 states and 6139 transitions. [2018-09-19 10:06:16,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-19 10:06:16,655 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 235 [2018-09-19 10:06:16,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:06:16,665 INFO L225 Difference]: With dead ends: 4808 [2018-09-19 10:06:16,666 INFO L226 Difference]: Without dead ends: 2700 [2018-09-19 10:06:16,671 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 243 GetRequests, 225 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 10:06:16,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2700 states. [2018-09-19 10:06:16,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2700 to 2670. [2018-09-19 10:06:16,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2670 states. [2018-09-19 10:06:16,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2670 states to 2670 states and 3328 transitions. [2018-09-19 10:06:16,757 INFO L78 Accepts]: Start accepts. Automaton has 2670 states and 3328 transitions. Word has length 235 [2018-09-19 10:06:16,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:06:16,757 INFO L480 AbstractCegarLoop]: Abstraction has 2670 states and 3328 transitions. [2018-09-19 10:06:16,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-19 10:06:16,758 INFO L276 IsEmpty]: Start isEmpty. Operand 2670 states and 3328 transitions. [2018-09-19 10:06:16,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-09-19 10:06:16,763 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:06:16,764 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:16,764 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:06:16,764 INFO L82 PathProgramCache]: Analyzing trace with hash -2022248670, now seen corresponding path program 1 times [2018-09-19 10:06:16,764 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:06:16,765 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 243 with the following transitions: [2018-09-19 10:06:16,765 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [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 10:06:16,768 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:06:16,768 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:06:18,149 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:06:27,127 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:06:27,127 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 10:06:27,134 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:06:28,070 INFO L232 lantSequenceWeakener]: Weakened 240 states. On average, predicates are now at 73.59% of their original sizes. [2018-09-19 10:06:28,070 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:06:28,412 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:06:28,412 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:06:28,412 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-19 10:06:28,412 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:06:28,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-19 10:06:28,413 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-19 10:06:28,413 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-09-19 10:06:28,413 INFO L87 Difference]: Start difference. First operand 2670 states and 3328 transitions. Second operand 11 states. [2018-09-19 10:06:36,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:06:36,279 INFO L93 Difference]: Finished difference Result 5752 states and 7377 transitions. [2018-09-19 10:06:36,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 10:06:36,280 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 242 [2018-09-19 10:06:36,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:06:36,296 INFO L225 Difference]: With dead ends: 5752 [2018-09-19 10:06:36,296 INFO L226 Difference]: Without dead ends: 3236 [2018-09-19 10:06:36,303 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 250 GetRequests, 232 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 10:06:36,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3236 states. [2018-09-19 10:06:36,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3236 to 3129. [2018-09-19 10:06:36,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2018-09-19 10:06:36,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 3930 transitions. [2018-09-19 10:06:36,426 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 3930 transitions. Word has length 242 [2018-09-19 10:06:36,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:06:36,427 INFO L480 AbstractCegarLoop]: Abstraction has 3129 states and 3930 transitions. [2018-09-19 10:06:36,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-19 10:06:36,427 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 3930 transitions. [2018-09-19 10:06:36,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-09-19 10:06:36,433 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:06:36,434 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:36,434 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:06:36,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1552392797, now seen corresponding path program 1 times [2018-09-19 10:06:36,435 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:06:36,435 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 246 with the following transitions: [2018-09-19 10:06:36,435 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [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 10:06:36,441 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:06:36,441 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:06:37,952 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:06:47,240 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:06:47,240 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 10:06:47,249 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:06:48,247 INFO L232 lantSequenceWeakener]: Weakened 243 states. On average, predicates are now at 73.58% of their original sizes. [2018-09-19 10:06:48,247 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:06:48,689 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:06:48,689 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:06:48,689 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-19 10:06:48,689 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:06:48,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-19 10:06:48,690 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-19 10:06:48,690 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-09-19 10:06:48,691 INFO L87 Difference]: Start difference. First operand 3129 states and 3930 transitions. Second operand 13 states. [2018-09-19 10:06:59,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:06:59,234 INFO L93 Difference]: Finished difference Result 6701 states and 8709 transitions. [2018-09-19 10:06:59,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 10:06:59,236 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 245 [2018-09-19 10:06:59,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:06:59,248 INFO L225 Difference]: With dead ends: 6701 [2018-09-19 10:06:59,248 INFO L226 Difference]: Without dead ends: 3726 [2018-09-19 10:06:59,254 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 257 GetRequests, 233 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:06:59,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3726 states. [2018-09-19 10:06:59,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3726 to 3529. [2018-09-19 10:06:59,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3529 states. [2018-09-19 10:06:59,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3529 states to 3529 states and 4443 transitions. [2018-09-19 10:06:59,364 INFO L78 Accepts]: Start accepts. Automaton has 3529 states and 4443 transitions. Word has length 245 [2018-09-19 10:06:59,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:06:59,365 INFO L480 AbstractCegarLoop]: Abstraction has 3529 states and 4443 transitions. [2018-09-19 10:06:59,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-19 10:06:59,365 INFO L276 IsEmpty]: Start isEmpty. Operand 3529 states and 4443 transitions. [2018-09-19 10:06:59,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-09-19 10:06:59,370 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:06:59,370 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:59,371 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:06:59,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1471145108, now seen corresponding path program 1 times [2018-09-19 10:06:59,371 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:06:59,371 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 251 with the following transitions: [2018-09-19 10:06:59,372 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [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:06:59,375 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:06:59,375 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:07:01,904 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:07:13,203 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:07:13,204 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:07:13,210 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:07:14,221 INFO L232 lantSequenceWeakener]: Weakened 248 states. On average, predicates are now at 73.57% of their original sizes. [2018-09-19 10:07:14,221 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:07:14,492 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:07:14,493 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:07:14,493 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 10:07:14,493 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:07:14,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 10:07:14,494 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 10:07:14,494 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 10:07:14,494 INFO L87 Difference]: Start difference. First operand 3529 states and 4443 transitions. Second operand 10 states. [2018-09-19 10:07:22,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:07:22,549 INFO L93 Difference]: Finished difference Result 7079 states and 9092 transitions. [2018-09-19 10:07:22,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 10:07:22,550 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 250 [2018-09-19 10:07:22,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:07:22,565 INFO L225 Difference]: With dead ends: 7079 [2018-09-19 10:07:22,565 INFO L226 Difference]: Without dead ends: 3704 [2018-09-19 10:07:22,573 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 257 GetRequests, 241 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 10:07:22,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3704 states. [2018-09-19 10:07:22,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3704 to 3677. [2018-09-19 10:07:22,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3677 states. [2018-09-19 10:07:22,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3677 states to 3677 states and 4642 transitions. [2018-09-19 10:07:22,698 INFO L78 Accepts]: Start accepts. Automaton has 3677 states and 4642 transitions. Word has length 250 [2018-09-19 10:07:22,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:07:22,699 INFO L480 AbstractCegarLoop]: Abstraction has 3677 states and 4642 transitions. [2018-09-19 10:07:22,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 10:07:22,699 INFO L276 IsEmpty]: Start isEmpty. Operand 3677 states and 4642 transitions. [2018-09-19 10:07:22,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-09-19 10:07:22,705 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:07:22,705 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:22,706 INFO L423 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:07:22,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1673902714, now seen corresponding path program 1 times [2018-09-19 10:07:22,706 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:07:22,706 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 255 with the following transitions: [2018-09-19 10:07:22,707 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [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:07:22,710 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:07:22,710 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:07:24,328 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. Received shutdown request... [2018-09-19 10:07:26,071 WARN L572 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-09-19 10:07:26,072 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-09-19 10:07:26,073 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 10:07:26,107 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 10:07:26,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 10:07:26 BoogieIcfgContainer [2018-09-19 10:07:26,108 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 10:07:26,109 INFO L168 Benchmark]: Toolchain (without parser) took 259123.35 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 4.0 GB in the end (delta: -2.6 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-19 10:07:26,110 INFO L168 Benchmark]: CDTParser took 0.71 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:07:26,111 INFO L168 Benchmark]: CACSL2BoogieTranslator took 759.88 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-19 10:07:26,112 INFO L168 Benchmark]: Boogie Procedure Inliner took 103.62 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:07:26,112 INFO L168 Benchmark]: Boogie Preprocessor took 297.56 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 764.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -853.9 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. [2018-09-19 10:07:26,113 INFO L168 Benchmark]: RCFGBuilder took 3279.86 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: 112.8 MB). Peak memory consumption was 112.8 MB. Max. memory is 7.1 GB. [2018-09-19 10:07:26,114 INFO L168 Benchmark]: TraceAbstraction took 254674.87 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 4.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-09-19 10:07:26,119 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.71 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 759.88 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 103.62 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 297.56 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 764.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -853.9 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3279.86 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: 112.8 MB). Peak memory consumption was 112.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 254674.87 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 4.0 GB in the end (delta: -1.9 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: 166]: 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 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 TRUE (((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)) [L166] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNKNOWN Result, 254.5s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 109.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2712 SDtfs, 10002 SDslu, 5893 SDs, 0 SdLazy, 29803 SolverSat, 2491 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 95.8s Time, PredicateUnifierStatistics: 28 DeclaredPredicates, 2867 GetRequests, 2625 SyntacticMatches, 0 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 812 ImplicationChecksByTransitivity, 10.1s 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, 123.8s AbstIntTime, 15 AbstIntIterations, 14 AbstIntStrong, 0.9945427268984869 AbsIntWeakeningRatio, 0.11944646758922069 AbsIntAvgWeakeningVarsNumRemoved, 879.6598689002185 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s 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_label37_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_10-07-26-134.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label37_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_10-07-26-134.csv Completed graceful shutdown