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_label02_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dace188-m [2018-09-15 19:16:11,301 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-15 19:16:11,305 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-15 19:16:11,326 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-15 19:16:11,327 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-15 19:16:11,329 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-15 19:16:11,333 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-15 19:16:11,336 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-15 19:16:11,338 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-15 19:16:11,339 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-15 19:16:11,342 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-15 19:16:11,344 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-15 19:16:11,346 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-15 19:16:11,347 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-15 19:16:11,348 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-15 19:16:11,351 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-15 19:16:11,354 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-15 19:16:11,364 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-15 19:16:11,369 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-15 19:16:11,375 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-15 19:16:11,382 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-15 19:16:11,384 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-15 19:16:11,391 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-15 19:16:11,393 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-15 19:16:11,393 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-15 19:16:11,396 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-15 19:16:11,398 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-15 19:16:11,398 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-15 19:16:11,399 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-15 19:16:11,401 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-15 19:16:11,401 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-15 19:16:11,402 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-15 19:16:11,402 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-15 19:16:11,402 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-15 19:16:11,403 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-15 19:16:11,404 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-15 19:16:11,404 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-15 19:16:11,421 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-15 19:16:11,422 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-15 19:16:11,423 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-15 19:16:11,423 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-15 19:16:11,423 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-15 19:16:11,424 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-15 19:16:11,424 INFO L133 SettingsManager]: * Congruence Domain=false [2018-09-15 19:16:11,424 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-15 19:16:11,424 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2018-09-15 19:16:11,424 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-15 19:16:11,425 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-15 19:16:11,425 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-15 19:16:11,426 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-15 19:16:11,426 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-15 19:16:11,426 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-15 19:16:11,426 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-15 19:16:11,426 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-15 19:16:11,427 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-15 19:16:11,427 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-15 19:16:11,427 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-15 19:16:11,427 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-15 19:16:11,428 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-15 19:16:11,428 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-15 19:16:11,428 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-15 19:16:11,428 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-15 19:16:11,428 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-15 19:16:11,429 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-15 19:16:11,429 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-15 19:16:11,429 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-15 19:16:11,429 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-15 19:16:11,429 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-15 19:16:11,430 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-15 19:16:11,430 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-15 19:16:11,430 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-15 19:16:11,483 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-15 19:16:11,503 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-15 19:16:11,508 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-15 19:16:11,509 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-15 19:16:11,510 INFO L276 PluginConnector]: CDTParser initialized [2018-09-15 19:16:11,511 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label02_true-unreach-call.c [2018-09-15 19:16:11,892 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ad81ec26/e9dc22daa37147ba9e7a9301c7f7e111/FLAG08325df42 [2018-09-15 19:16:12,219 INFO L277 CDTParser]: Found 1 translation units. [2018-09-15 19:16:12,222 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label02_true-unreach-call.c [2018-09-15 19:16:12,250 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ad81ec26/e9dc22daa37147ba9e7a9301c7f7e111/FLAG08325df42 [2018-09-15 19:16:12,280 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ad81ec26/e9dc22daa37147ba9e7a9301c7f7e111 [2018-09-15 19:16:12,292 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-15 19:16:12,297 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-15 19:16:12,298 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-15 19:16:12,299 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-15 19:16:12,307 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-15 19:16:12,309 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 07:16:12" (1/1) ... [2018-09-15 19:16:12,314 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21a68a4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:16:12, skipping insertion in model container [2018-09-15 19:16:12,314 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 07:16:12" (1/1) ... [2018-09-15 19:16:12,330 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-15 19:16:12,836 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 19:16:12,856 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-15 19:16:12,953 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 19:16:13,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:16:13 WrapperNode [2018-09-15 19:16:13,014 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-15 19:16:13,016 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-15 19:16:13,016 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-15 19:16:13,016 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-15 19:16:13,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:16:13" (1/1) ... [2018-09-15 19:16:13,066 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:16:13" (1/1) ... [2018-09-15 19:16:13,169 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-15 19:16:13,169 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-15 19:16:13,170 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-15 19:16:13,170 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-15 19:16:13,353 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:16:13" (1/1) ... [2018-09-15 19:16:13,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:16:13" (1/1) ... [2018-09-15 19:16:13,366 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:16:13" (1/1) ... [2018-09-15 19:16:13,366 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:16:13" (1/1) ... [2018-09-15 19:16:13,409 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:16:13" (1/1) ... [2018-09-15 19:16:13,438 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:16:13" (1/1) ... [2018-09-15 19:16:13,452 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:16:13" (1/1) ... [2018-09-15 19:16:13,459 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-15 19:16:13,460 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-15 19:16:13,460 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-15 19:16:13,461 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-15 19:16:13,462 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:16:13" (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-15 19:16:13,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-15 19:16:13,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-15 19:16:13,539 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-15 19:16:13,539 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-15 19:16:13,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-15 19:16:13,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-15 19:16:13,540 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-15 19:16:13,540 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-15 19:16:17,031 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-15 19:16:17,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 07:16:17 BoogieIcfgContainer [2018-09-15 19:16:17,033 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-15 19:16:17,036 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-15 19:16:17,037 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-15 19:16:17,043 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-15 19:16:17,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 07:16:12" (1/3) ... [2018-09-15 19:16:17,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44e1ccd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 07:16:17, skipping insertion in model container [2018-09-15 19:16:17,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:16:13" (2/3) ... [2018-09-15 19:16:17,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44e1ccd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 07:16:17, skipping insertion in model container [2018-09-15 19:16:17,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 07:16:17" (3/3) ... [2018-09-15 19:16:17,053 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label02_true-unreach-call.c [2018-09-15 19:16:17,067 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-15 19:16:17,082 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-15 19:16:17,144 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-15 19:16:17,145 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-15 19:16:17,145 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-15 19:16:17,145 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-15 19:16:17,145 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-15 19:16:17,146 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-15 19:16:17,146 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-15 19:16:17,146 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-15 19:16:17,146 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-15 19:16:17,192 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-15 19:16:17,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-15 19:16:17,205 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 19:16:17,206 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, 1, 1, 1, 1, 1] [2018-09-15 19:16:17,208 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 19:16:17,212 INFO L82 PathProgramCache]: Analyzing trace with hash 417311892, now seen corresponding path program 1 times [2018-09-15 19:16:17,215 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 19:16:17,216 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 67 with the following transitions: [2018-09-15 19:16:17,219 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], [393], [401], [409], [417], [425], [429], [431], [796], [800], [806], [810], [817], [818], [819], [821] [2018-09-15 19:16:17,289 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 19:16:17,289 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 19:16:19,039 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 19:16:19,042 INFO L272 AbstractInterpreter]: Visited 65 different actions 65 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-15 19:16:19,066 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 19:16:19,802 INFO L232 lantSequenceWeakener]: Weakened 64 states. On average, predicates are now at 76.05% of their original sizes. [2018-09-15 19:16:19,802 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 19:16:20,107 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 19:16:20,109 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 19:16:20,110 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-15 19:16:20,110 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 19:16:20,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-15 19:16:20,128 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-15 19:16:20,129 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-15 19:16:20,132 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 6 states. [2018-09-15 19:16:23,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 19:16:23,547 INFO L93 Difference]: Finished difference Result 576 states and 995 transitions. [2018-09-15 19:16:23,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-15 19:16:23,554 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-09-15 19:16:23,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 19:16:23,575 INFO L225 Difference]: With dead ends: 576 [2018-09-15 19:16:23,575 INFO L226 Difference]: Without dead ends: 358 [2018-09-15 19:16:23,583 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 65 GetRequests, 61 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-15 19:16:23,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-09-15 19:16:23,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-09-15 19:16:23,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-15 19:16:23,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2018-09-15 19:16:23,670 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 66 [2018-09-15 19:16:23,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 19:16:23,671 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2018-09-15 19:16:23,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-15 19:16:23,673 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2018-09-15 19:16:23,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-09-15 19:16:23,684 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 19:16:23,685 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, 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-15 19:16:23,685 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 19:16:23,686 INFO L82 PathProgramCache]: Analyzing trace with hash 696839107, now seen corresponding path program 1 times [2018-09-15 19:16:23,687 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 19:16:23,687 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 138 with the following transitions: [2018-09-15 19:16:23,687 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], [393], [401], [409], [417], [425], [429], [431], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 19:16:23,700 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 19:16:23,700 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 19:16:25,104 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 19:16:27,784 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 19:16:27,784 INFO L272 AbstractInterpreter]: Visited 78 different actions 150 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-15 19:16:27,790 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 19:16:29,768 INFO L232 lantSequenceWeakener]: Weakened 135 states. On average, predicates are now at 74.4% of their original sizes. [2018-09-15 19:16:29,768 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 19:16:30,615 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 19:16:30,615 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 19:16:30,615 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-15 19:16:30,616 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 19:16:30,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-15 19:16:30,618 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-15 19:16:30,618 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-15 19:16:30,618 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand 10 states. [2018-09-15 19:16:39,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 19:16:39,674 INFO L93 Difference]: Finished difference Result 711 states and 1126 transitions. [2018-09-15 19:16:39,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-15 19:16:39,678 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 137 [2018-09-15 19:16:39,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 19:16:39,684 INFO L225 Difference]: With dead ends: 711 [2018-09-15 19:16:39,684 INFO L226 Difference]: Without dead ends: 505 [2018-09-15 19:16:39,688 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 143 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-15 19:16:39,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-09-15 19:16:39,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 502. [2018-09-15 19:16:39,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2018-09-15 19:16:39,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 655 transitions. [2018-09-15 19:16:39,728 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 655 transitions. Word has length 137 [2018-09-15 19:16:39,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 19:16:39,730 INFO L480 AbstractCegarLoop]: Abstraction has 502 states and 655 transitions. [2018-09-15 19:16:39,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-15 19:16:39,730 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 655 transitions. [2018-09-15 19:16:39,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-09-15 19:16:39,734 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 19:16:39,735 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, 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] [2018-09-15 19:16:39,735 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 19:16:39,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1246975752, now seen corresponding path program 1 times [2018-09-15 19:16:39,735 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 19:16:39,736 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 147 with the following transitions: [2018-09-15 19:16:39,736 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], [393], [401], [409], [417], [425], [429], [431], [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-15 19:16:39,741 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 19:16:39,741 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 19:16:44,487 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 19:16:44,487 INFO L272 AbstractInterpreter]: Visited 87 different actions 167 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-15 19:16:44,495 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 19:16:45,413 INFO L232 lantSequenceWeakener]: Weakened 144 states. On average, predicates are now at 74.3% of their original sizes. [2018-09-15 19:16:45,413 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 19:16:45,969 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 19:16:45,970 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 19:16:45,970 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-15 19:16:45,970 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 19:16:45,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-15 19:16:45,971 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-15 19:16:45,971 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-09-15 19:16:45,972 INFO L87 Difference]: Start difference. First operand 502 states and 655 transitions. Second operand 12 states. [2018-09-15 19:16:53,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 19:16:53,118 INFO L93 Difference]: Finished difference Result 1002 states and 1569 transitions. [2018-09-15 19:16:53,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-15 19:16:53,118 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 146 [2018-09-15 19:16:53,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 19:16:53,125 INFO L225 Difference]: With dead ends: 1002 [2018-09-15 19:16:53,125 INFO L226 Difference]: Without dead ends: 796 [2018-09-15 19:16:53,127 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 153 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2018-09-15 19:16:53,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2018-09-15 19:16:53,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 793. [2018-09-15 19:16:53,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2018-09-15 19:16:53,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 962 transitions. [2018-09-15 19:16:53,177 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 962 transitions. Word has length 146 [2018-09-15 19:16:53,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 19:16:53,178 INFO L480 AbstractCegarLoop]: Abstraction has 793 states and 962 transitions. [2018-09-15 19:16:53,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-15 19:16:53,178 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 962 transitions. [2018-09-15 19:16:53,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-09-15 19:16:53,183 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 19:16:53,183 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, 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] [2018-09-15 19:16:53,184 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 19:16:53,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1408154240, now seen corresponding path program 1 times [2018-09-15 19:16:53,184 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 19:16:53,184 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 183 with the following transitions: [2018-09-15 19:16:53,185 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], [393], [401], [409], [417], [425], [429], [431], [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-15 19:16:53,191 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 19:16:53,192 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 19:16:56,901 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 19:17:06,124 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 19:17:06,125 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-15 19:17:06,131 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 19:17:08,271 INFO L232 lantSequenceWeakener]: Weakened 180 states. On average, predicates are now at 73.98% of their original sizes. [2018-09-15 19:17:08,271 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 19:17:09,231 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 19:17:09,231 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 19:17:09,231 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-15 19:17:09,232 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 19:17:09,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-15 19:17:09,233 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-15 19:17:09,233 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-09-15 19:17:09,233 INFO L87 Difference]: Start difference. First operand 793 states and 962 transitions. Second operand 14 states. [2018-09-15 19:17:20,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 19:17:20,471 INFO L93 Difference]: Finished difference Result 1161 states and 1610 transitions. [2018-09-15 19:17:20,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-15 19:17:20,472 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 182 [2018-09-15 19:17:20,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 19:17:20,480 INFO L225 Difference]: With dead ends: 1161 [2018-09-15 19:17:20,480 INFO L226 Difference]: Without dead ends: 955 [2018-09-15 19:17:20,482 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 193 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2018-09-15 19:17:20,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2018-09-15 19:17:20,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 943. [2018-09-15 19:17:20,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2018-09-15 19:17:20,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1137 transitions. [2018-09-15 19:17:20,533 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1137 transitions. Word has length 182 [2018-09-15 19:17:20,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 19:17:20,533 INFO L480 AbstractCegarLoop]: Abstraction has 943 states and 1137 transitions. [2018-09-15 19:17:20,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-15 19:17:20,534 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1137 transitions. [2018-09-15 19:17:20,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-09-15 19:17:20,538 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 19:17:20,539 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, 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] [2018-09-15 19:17:20,539 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 19:17:20,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1512419139, now seen corresponding path program 1 times [2018-09-15 19:17:20,540 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 19:17:20,540 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 202 with the following transitions: [2018-09-15 19:17:20,540 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], [393], [401], [409], [417], [425], [429], [431], [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-15 19:17:20,552 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 19:17:20,553 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 19:17:32,702 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 19:17:32,702 INFO L272 AbstractInterpreter]: Visited 142 different actions 278 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-15 19:17:32,707 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 19:17:34,507 INFO L232 lantSequenceWeakener]: Weakened 199 states. On average, predicates are now at 73.86% of their original sizes. [2018-09-15 19:17:34,507 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 19:17:35,904 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 19:17:35,905 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 19:17:35,905 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-09-15 19:17:35,905 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 19:17:35,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-15 19:17:35,906 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-15 19:17:35,906 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-09-15 19:17:35,906 INFO L87 Difference]: Start difference. First operand 943 states and 1137 transitions. Second operand 18 states. [2018-09-15 19:17:45,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 19:17:45,944 INFO L93 Difference]: Finished difference Result 1561 states and 2167 transitions. [2018-09-15 19:17:45,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-15 19:17:45,953 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 201 [2018-09-15 19:17:45,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 19:17:45,959 INFO L225 Difference]: With dead ends: 1561 [2018-09-15 19:17:45,960 INFO L226 Difference]: Without dead ends: 1207 [2018-09-15 19:17:45,962 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 217 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=287, Invalid=903, Unknown=0, NotChecked=0, Total=1190 [2018-09-15 19:17:45,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2018-09-15 19:17:46,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 1205. [2018-09-15 19:17:46,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2018-09-15 19:17:46,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1418 transitions. [2018-09-15 19:17:46,026 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1418 transitions. Word has length 201 [2018-09-15 19:17:46,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 19:17:46,027 INFO L480 AbstractCegarLoop]: Abstraction has 1205 states and 1418 transitions. [2018-09-15 19:17:46,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-15 19:17:46,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1418 transitions. [2018-09-15 19:17:46,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-09-15 19:17:46,032 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 19:17:46,032 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, 3, 3, 3, 3, 3, 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-15 19:17:46,032 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 19:17:46,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1959328001, now seen corresponding path program 1 times [2018-09-15 19:17:46,033 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 19:17:46,033 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 214 with the following transitions: [2018-09-15 19:17:46,033 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], [393], [401], [409], [417], [425], [429], [431], [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-15 19:17:46,036 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 19:17:46,037 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 19:17:47,389 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 19:17:53,408 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 19:17:53,408 INFO L272 AbstractInterpreter]: Visited 84 different actions 244 times. Merged at 7 different actions 14 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-15 19:17:53,417 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 19:17:55,209 INFO L232 lantSequenceWeakener]: Weakened 211 states. On average, predicates are now at 73.85% of their original sizes. [2018-09-15 19:17:55,210 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 19:17:55,701 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 19:17:55,702 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 19:17:55,702 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-15 19:17:55,702 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 19:17:55,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-15 19:17:55,702 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-15 19:17:55,703 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-09-15 19:17:55,703 INFO L87 Difference]: Start difference. First operand 1205 states and 1418 transitions. Second operand 11 states. [2018-09-15 19:18:05,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 19:18:05,044 INFO L93 Difference]: Finished difference Result 1717 states and 2233 transitions. [2018-09-15 19:18:05,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-15 19:18:05,045 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 213 [2018-09-15 19:18:05,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 19:18:05,051 INFO L225 Difference]: With dead ends: 1717 [2018-09-15 19:18:05,051 INFO L226 Difference]: Without dead ends: 1363 [2018-09-15 19:18:05,053 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 222 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2018-09-15 19:18:05,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2018-09-15 19:18:05,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1353. [2018-09-15 19:18:05,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1353 states. [2018-09-15 19:18:05,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1584 transitions. [2018-09-15 19:18:05,113 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1584 transitions. Word has length 213 [2018-09-15 19:18:05,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 19:18:05,114 INFO L480 AbstractCegarLoop]: Abstraction has 1353 states and 1584 transitions. [2018-09-15 19:18:05,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-15 19:18:05,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1584 transitions. [2018-09-15 19:18:05,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-09-15 19:18:05,118 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 19:18:05,118 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, 3, 3, 3, 3, 3, 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] [2018-09-15 19:18:05,118 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 19:18:05,119 INFO L82 PathProgramCache]: Analyzing trace with hash 862806071, now seen corresponding path program 1 times [2018-09-15 19:18:05,119 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 19:18:05,119 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 218 with the following transitions: [2018-09-15 19:18:05,119 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], [393], [401], [409], [417], [425], [429], [431], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 19:18:05,122 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 19:18:05,122 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 19:18:06,425 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 19:18:22,929 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 19:18:22,930 INFO L272 AbstractInterpreter]: Visited 88 different actions 511 times. Merged at 7 different actions 38 times. Widened at 1 different actions 1 times. Found 7 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-15 19:18:22,937 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 19:18:24,752 INFO L232 lantSequenceWeakener]: Weakened 215 states. On average, predicates are now at 73.83% of their original sizes. [2018-09-15 19:18:24,753 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 19:18:25,703 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 19:18:25,703 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 19:18:25,703 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-09-15 19:18:25,703 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 19:18:25,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-15 19:18:25,704 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-15 19:18:25,704 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-09-15 19:18:25,705 INFO L87 Difference]: Start difference. First operand 1353 states and 1584 transitions. Second operand 15 states. [2018-09-15 19:18:40,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 19:18:40,398 INFO L93 Difference]: Finished difference Result 2559 states and 3382 transitions. [2018-09-15 19:18:40,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-15 19:18:40,401 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 217 [2018-09-15 19:18:40,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 19:18:40,410 INFO L225 Difference]: With dead ends: 2559 [2018-09-15 19:18:40,410 INFO L226 Difference]: Without dead ends: 2057 [2018-09-15 19:18:40,413 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 228 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=177, Invalid=525, Unknown=0, NotChecked=0, Total=702 [2018-09-15 19:18:40,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2057 states. [2018-09-15 19:18:40,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2057 to 2037. [2018-09-15 19:18:40,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2037 states. [2018-09-15 19:18:40,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 2037 states and 2424 transitions. [2018-09-15 19:18:40,508 INFO L78 Accepts]: Start accepts. Automaton has 2037 states and 2424 transitions. Word has length 217 [2018-09-15 19:18:40,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 19:18:40,509 INFO L480 AbstractCegarLoop]: Abstraction has 2037 states and 2424 transitions. [2018-09-15 19:18:40,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-15 19:18:40,509 INFO L276 IsEmpty]: Start isEmpty. Operand 2037 states and 2424 transitions. [2018-09-15 19:18:40,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-09-15 19:18:40,515 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 19:18:40,516 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, 3, 3, 3, 3, 3, 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-15 19:18:40,516 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 19:18:40,516 INFO L82 PathProgramCache]: Analyzing trace with hash 151529664, now seen corresponding path program 1 times [2018-09-15 19:18:40,517 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 19:18:40,517 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 251 with the following transitions: [2018-09-15 19:18:40,517 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], [393], [401], [409], [417], [425], [429], [431], [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-15 19:18:40,521 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 19:18:40,521 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 19:18:41,969 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 19:18:59,568 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 19:18:59,568 INFO L272 AbstractInterpreter]: Visited 121 different actions 356 times. Merged at 7 different actions 15 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-15 19:18:59,576 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 19:19:02,433 INFO L232 lantSequenceWeakener]: Weakened 248 states. On average, predicates are now at 73.68% of their original sizes. [2018-09-15 19:19:02,433 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 19:19:04,110 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 19:19:04,111 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 19:19:04,111 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-09-15 19:19:04,111 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 19:19:04,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-15 19:19:04,112 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-15 19:19:04,112 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2018-09-15 19:19:04,112 INFO L87 Difference]: Start difference. First operand 2037 states and 2424 transitions. Second operand 19 states. [2018-09-15 19:19:19,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 19:19:19,205 INFO L93 Difference]: Finished difference Result 4438 states and 5613 transitions. [2018-09-15 19:19:19,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-15 19:19:19,207 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 250 [2018-09-15 19:19:19,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 19:19:19,220 INFO L225 Difference]: With dead ends: 4438 [2018-09-15 19:19:19,221 INFO L226 Difference]: Without dead ends: 2961 [2018-09-15 19:19:19,226 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 268 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=341, Invalid=1065, Unknown=0, NotChecked=0, Total=1406 [2018-09-15 19:19:19,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2018-09-15 19:19:19,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 2897. [2018-09-15 19:19:19,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2897 states. [2018-09-15 19:19:19,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2897 states to 2897 states and 3445 transitions. [2018-09-15 19:19:19,365 INFO L78 Accepts]: Start accepts. Automaton has 2897 states and 3445 transitions. Word has length 250 [2018-09-15 19:19:19,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 19:19:19,365 INFO L480 AbstractCegarLoop]: Abstraction has 2897 states and 3445 transitions. [2018-09-15 19:19:19,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-15 19:19:19,366 INFO L276 IsEmpty]: Start isEmpty. Operand 2897 states and 3445 transitions. [2018-09-15 19:19:19,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-09-15 19:19:19,376 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 19:19:19,376 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, 3, 3, 3, 3, 3, 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-15 19:19:19,377 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 19:19:19,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1058847117, now seen corresponding path program 1 times [2018-09-15 19:19:19,377 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 19:19:19,377 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 256 with the following transitions: [2018-09-15 19:19:19,378 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], [393], [401], [409], [417], [425], [429], [431], [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-15 19:19:19,381 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 19:19:19,381 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 19:19:23,032 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 19:19:49,622 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 19:19:49,623 INFO L272 AbstractInterpreter]: Visited 124 different actions 604 times. Merged at 7 different actions 28 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-15 19:19:49,629 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 19:19:52,657 INFO L232 lantSequenceWeakener]: Weakened 253 states. On average, predicates are now at 73.67% of their original sizes. [2018-09-15 19:19:52,658 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 19:19:56,392 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 19:19:56,393 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 19:19:56,393 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-09-15 19:19:56,393 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 19:19:56,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-15 19:19:56,394 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-15 19:19:56,394 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2018-09-15 19:19:56,394 INFO L87 Difference]: Start difference. First operand 2897 states and 3445 transitions. Second operand 17 states. [2018-09-15 19:20:09,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 19:20:09,954 INFO L93 Difference]: Finished difference Result 5136 states and 6327 transitions. [2018-09-15 19:20:09,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-15 19:20:09,958 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 255 [2018-09-15 19:20:09,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 19:20:09,970 INFO L225 Difference]: With dead ends: 5136 [2018-09-15 19:20:09,970 INFO L226 Difference]: Without dead ends: 3090 [2018-09-15 19:20:09,977 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 268 GetRequests, 228 SyntacticMatches, 11 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=236, Invalid=694, Unknown=0, NotChecked=0, Total=930 [2018-09-15 19:20:09,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3090 states. [2018-09-15 19:20:10,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3090 to 3049. [2018-09-15 19:20:10,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3049 states. [2018-09-15 19:20:10,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3049 states to 3049 states and 3644 transitions. [2018-09-15 19:20:10,120 INFO L78 Accepts]: Start accepts. Automaton has 3049 states and 3644 transitions. Word has length 255 [2018-09-15 19:20:10,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 19:20:10,120 INFO L480 AbstractCegarLoop]: Abstraction has 3049 states and 3644 transitions. [2018-09-15 19:20:10,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-15 19:20:10,121 INFO L276 IsEmpty]: Start isEmpty. Operand 3049 states and 3644 transitions. [2018-09-15 19:20:10,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-09-15 19:20:10,129 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 19:20:10,129 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, 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] [2018-09-15 19:20:10,129 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 19:20:10,130 INFO L82 PathProgramCache]: Analyzing trace with hash 643941016, now seen corresponding path program 1 times [2018-09-15 19:20:10,130 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 19:20:10,130 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 261 with the following transitions: [2018-09-15 19:20:10,130 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], [393], [401], [409], [417], [425], [429], [431], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [526], [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-15 19:20:10,133 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 19:20:10,134 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 19:20:13,888 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. Received shutdown request... [2018-09-15 19:20:34,303 WARN L572 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-09-15 19:20:34,304 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-09-15 19:20:34,304 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-15 19:20:34,344 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-15 19:20:34,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.09 07:20:34 BoogieIcfgContainer [2018-09-15 19:20:34,345 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-15 19:20:34,346 INFO L168 Benchmark]: Toolchain (without parser) took 262052.88 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -139.5 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-15 19:20:34,347 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-15 19:20:34,348 INFO L168 Benchmark]: CACSL2BoogieTranslator took 716.48 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-15 19:20:34,349 INFO L168 Benchmark]: Boogie Procedure Inliner took 153.43 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-15 19:20:34,349 INFO L168 Benchmark]: Boogie Preprocessor took 290.04 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 713.0 MB). Free memory was 1.3 GB in the beginning and 2.1 GB in the end (delta: -791.9 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. [2018-09-15 19:20:34,350 INFO L168 Benchmark]: RCFGBuilder took 3573.68 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 112.9 MB). Peak memory consumption was 112.9 MB. Max. memory is 7.1 GB. [2018-09-15 19:20:34,351 INFO L168 Benchmark]: TraceAbstraction took 257308.40 ms. Allocated memory was 2.2 GB in the beginning and 4.1 GB in the end (delta: 1.9 GB). Free memory was 2.0 GB in the beginning and 1.5 GB in the end (delta: 497.3 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-15 19:20:34,356 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 716.48 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 153.43 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 290.04 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 713.0 MB). Free memory was 1.3 GB in the beginning and 2.1 GB in the end (delta: -791.9 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3573.68 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 112.9 MB). Peak memory consumption was 112.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 257308.40 ms. Allocated memory was 2.2 GB in the beginning and 4.1 GB in the end (delta: 1.9 GB). Free memory was 2.0 GB in the beginning and 1.5 GB in the end (delta: 497.3 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 181]: 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 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 TRUE ((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0)) [L426] a1 = ((((a1 / 5) * 5) / 5) + 505228) [L427] a10 = 1 [L429] RET return 25; [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 TRUE (((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0)) [L245] a1 = (((((a1 % 25)- -13) - 42605) / 5) - -8517) [L246] a10 = 3 [L248] RET return 26; [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 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 TRUE (((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6)) [L181] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNKNOWN Result, 257.2s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 93.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1800 SDtfs, 8486 SDslu, 2936 SDs, 0 SdLazy, 17210 SolverSat, 1912 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 80.2s Time, PredicateUnifierStatistics: 18 DeclaredPredicates, 1757 GetRequests, 1543 SyntacticMatches, 11 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 17.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3049occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 134.5s AbstIntTime, 10 AbstIntIterations, 9 AbstIntStrong, 0.9945181346162093 AbsIntWeakeningRatio, 0.11942098914354644 AbsIntAvgWeakeningVarsNumRemoved, 92.49276236429434 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 9 MinimizatonAttempts, 157 StatesRemovedByMinimization, 9 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_label02_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-15_19-20-34-377.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label02_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-15_19-20-34-377.csv Completed graceful shutdown