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_label38_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dace188-m [2018-09-15 19:25:11,470 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-15 19:25:11,473 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-15 19:25:11,488 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-15 19:25:11,488 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-15 19:25:11,490 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-15 19:25:11,491 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-15 19:25:11,494 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-15 19:25:11,496 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-15 19:25:11,503 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-15 19:25:11,504 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-15 19:25:11,504 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-15 19:25:11,508 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-15 19:25:11,509 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-15 19:25:11,512 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-15 19:25:11,513 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-15 19:25:11,514 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-15 19:25:11,517 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-15 19:25:11,523 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-15 19:25:11,525 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-15 19:25:11,527 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-15 19:25:11,528 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-15 19:25:11,530 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-15 19:25:11,530 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-15 19:25:11,531 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-15 19:25:11,533 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-15 19:25:11,535 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-15 19:25:11,536 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-15 19:25:11,537 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-15 19:25:11,539 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-15 19:25:11,539 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-15 19:25:11,542 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-15 19:25:11,542 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-15 19:25:11,542 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-15 19:25:11,545 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-15 19:25:11,547 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-15 19:25:11,547 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:25:11,564 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-15 19:25:11,564 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-15 19:25:11,566 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-15 19:25:11,566 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-15 19:25:11,566 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-15 19:25:11,567 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-15 19:25:11,567 INFO L133 SettingsManager]: * Congruence Domain=false [2018-09-15 19:25:11,567 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-15 19:25:11,567 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2018-09-15 19:25:11,567 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-15 19:25:11,570 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-15 19:25:11,570 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-15 19:25:11,571 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-15 19:25:11,571 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-15 19:25:11,571 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-15 19:25:11,571 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-15 19:25:11,572 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-15 19:25:11,572 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-15 19:25:11,572 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-15 19:25:11,572 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-15 19:25:11,574 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-15 19:25:11,574 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-15 19:25:11,574 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-15 19:25:11,575 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-15 19:25:11,575 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-15 19:25:11,575 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-15 19:25:11,575 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-15 19:25:11,575 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-15 19:25:11,576 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-15 19:25:11,576 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-15 19:25:11,576 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-15 19:25:11,576 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-15 19:25:11,576 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-15 19:25:11,577 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-15 19:25:11,632 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-15 19:25:11,645 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-15 19:25:11,649 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-15 19:25:11,650 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-15 19:25:11,651 INFO L276 PluginConnector]: CDTParser initialized [2018-09-15 19:25:11,651 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label38_true-unreach-call.c [2018-09-15 19:25:12,012 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22caad913/ef27c4c11e824f88a7a320b7fbbc2f83/FLAG00d23c1e7 [2018-09-15 19:25:12,307 INFO L277 CDTParser]: Found 1 translation units. [2018-09-15 19:25:12,308 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label38_true-unreach-call.c [2018-09-15 19:25:12,337 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22caad913/ef27c4c11e824f88a7a320b7fbbc2f83/FLAG00d23c1e7 [2018-09-15 19:25:12,357 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22caad913/ef27c4c11e824f88a7a320b7fbbc2f83 [2018-09-15 19:25:12,368 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-15 19:25:12,372 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-15 19:25:12,373 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-15 19:25:12,373 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-15 19:25:12,380 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-15 19:25:12,381 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 07:25:12" (1/1) ... [2018-09-15 19:25:12,384 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76a7336e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:25:12, skipping insertion in model container [2018-09-15 19:25:12,384 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 07:25:12" (1/1) ... [2018-09-15 19:25:12,397 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-15 19:25:13,004 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 19:25:13,025 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-15 19:25:13,163 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 19:25:13,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:25:13 WrapperNode [2018-09-15 19:25:13,212 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-15 19:25:13,213 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-15 19:25:13,213 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-15 19:25:13,213 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-15 19:25:13,222 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:25:13" (1/1) ... [2018-09-15 19:25:13,258 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:25:13" (1/1) ... [2018-09-15 19:25:13,342 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-15 19:25:13,343 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-15 19:25:13,343 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-15 19:25:13,343 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-15 19:25:13,494 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:25:13" (1/1) ... [2018-09-15 19:25:13,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:25:13" (1/1) ... [2018-09-15 19:25:13,504 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:25:13" (1/1) ... [2018-09-15 19:25:13,504 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:25:13" (1/1) ... [2018-09-15 19:25:13,552 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:25:13" (1/1) ... [2018-09-15 19:25:13,575 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:25:13" (1/1) ... [2018-09-15 19:25:13,595 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:25:13" (1/1) ... [2018-09-15 19:25:13,609 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-15 19:25:13,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-15 19:25:13,610 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-15 19:25:13,610 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-15 19:25:13,613 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:25: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:25:13,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-15 19:25:13,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-15 19:25:13,682 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-15 19:25:13,682 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-15 19:25:13,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-15 19:25:13,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-15 19:25:13,682 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-15 19:25:13,683 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-15 19:25:16,914 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-15 19:25:16,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 07:25:16 BoogieIcfgContainer [2018-09-15 19:25:16,915 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-15 19:25:16,916 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-15 19:25:16,916 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-15 19:25:16,919 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-15 19:25:16,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 07:25:12" (1/3) ... [2018-09-15 19:25:16,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45621351 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 07:25:16, skipping insertion in model container [2018-09-15 19:25:16,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:25:13" (2/3) ... [2018-09-15 19:25:16,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45621351 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 07:25:16, skipping insertion in model container [2018-09-15 19:25:16,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 07:25:16" (3/3) ... [2018-09-15 19:25:16,922 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label38_true-unreach-call.c [2018-09-15 19:25:16,933 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-15 19:25:16,943 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-15 19:25:16,997 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-15 19:25:16,998 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-15 19:25:16,999 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-15 19:25:16,999 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-15 19:25:16,999 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-15 19:25:16,999 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-15 19:25:17,000 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-15 19:25:17,000 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-15 19:25:17,000 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-15 19:25:17,028 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-15 19:25:17,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-09-15 19:25:17,037 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 19:25:17,038 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] [2018-09-15 19:25:17,040 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 19:25:17,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1705771087, now seen corresponding path program 1 times [2018-09-15 19:25:17,048 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 19:25:17,049 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-09-15 19:25:17,053 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], [213], [215], [796], [800], [806], [810], [817], [818], [819], [821] [2018-09-15 19:25:17,109 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 19:25:17,109 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 19:25:18,073 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 19:25:18,075 INFO L272 AbstractInterpreter]: Visited 38 different actions 38 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-15 19:25:18,090 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 19:25:18,679 INFO L232 lantSequenceWeakener]: Weakened 37 states. On average, predicates are now at 75.15% of their original sizes. [2018-09-15 19:25:18,679 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 19:25:19,028 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 19:25:19,030 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 19:25:19,030 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-15 19:25:19,030 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 19:25:19,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-15 19:25:19,046 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-15 19:25:19,047 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-15 19:25:19,051 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 6 states. [2018-09-15 19:25:24,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 19:25:24,401 INFO L93 Difference]: Finished difference Result 576 states and 995 transitions. [2018-09-15 19:25:24,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-15 19:25:24,404 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-09-15 19:25:24,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 19:25:24,422 INFO L225 Difference]: With dead ends: 576 [2018-09-15 19:25:24,422 INFO L226 Difference]: Without dead ends: 358 [2018-09-15 19:25:24,429 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-15 19:25:24,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-09-15 19:25:24,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-09-15 19:25:24,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-15 19:25:24,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2018-09-15 19:25:24,509 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 39 [2018-09-15 19:25:24,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 19:25:24,510 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2018-09-15 19:25:24,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-15 19:25:24,510 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2018-09-15 19:25:24,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-09-15 19:25:24,519 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 19:25:24,519 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:24,522 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 19:25:24,522 INFO L82 PathProgramCache]: Analyzing trace with hash -518419837, now seen corresponding path program 1 times [2018-09-15 19:25:24,523 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 19:25:24,523 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 111 with the following transitions: [2018-09-15 19:25:24,523 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], [213], [215], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 19:25:24,536 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 19:25:24,536 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 19:25:26,008 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 19:25:28,693 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 19:25:28,694 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:25:28,701 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 19:25:30,309 INFO L232 lantSequenceWeakener]: Weakened 108 states. On average, predicates are now at 73.68% of their original sizes. [2018-09-15 19:25:30,309 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 19:25:31,272 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 19:25:31,272 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 19:25:31,272 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-15 19:25:31,272 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 19:25:31,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-15 19:25:31,274 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-15 19:25:31,274 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-15 19:25:31,275 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand 10 states. [2018-09-15 19:25:38,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 19:25:38,518 INFO L93 Difference]: Finished difference Result 711 states and 1126 transitions. [2018-09-15 19:25:38,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-15 19:25:38,519 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 110 [2018-09-15 19:25:38,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 19:25:38,527 INFO L225 Difference]: With dead ends: 711 [2018-09-15 19:25:38,527 INFO L226 Difference]: Without dead ends: 505 [2018-09-15 19:25:38,530 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 116 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-15 19:25:38,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-09-15 19:25:38,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 502. [2018-09-15 19:25:38,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2018-09-15 19:25:38,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 655 transitions. [2018-09-15 19:25:38,571 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 655 transitions. Word has length 110 [2018-09-15 19:25:38,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 19:25:38,572 INFO L480 AbstractCegarLoop]: Abstraction has 502 states and 655 transitions. [2018-09-15 19:25:38,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-15 19:25:38,572 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 655 transitions. [2018-09-15 19:25:38,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-09-15 19:25:38,575 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 19:25:38,576 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:38,576 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 19:25:38,577 INFO L82 PathProgramCache]: Analyzing trace with hash 2078110268, now seen corresponding path program 1 times [2018-09-15 19:25:38,577 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 19:25:38,579 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 120 with the following transitions: [2018-09-15 19:25:38,580 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], [213], [215], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 19:25:38,587 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 19:25:38,587 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 19:25:43,565 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 19:25:43,565 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:25:43,572 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 19:25:44,408 INFO L232 lantSequenceWeakener]: Weakened 117 states. On average, predicates are now at 73.61% of their original sizes. [2018-09-15 19:25:44,409 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 19:25:44,927 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 19:25:44,927 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 19:25:44,927 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-15 19:25:44,927 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 19:25:44,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-15 19:25:44,928 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-15 19:25:44,928 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-09-15 19:25:44,929 INFO L87 Difference]: Start difference. First operand 502 states and 655 transitions. Second operand 12 states. [2018-09-15 19:25:55,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 19:25:55,840 INFO L93 Difference]: Finished difference Result 1002 states and 1569 transitions. [2018-09-15 19:25:55,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-15 19:25:55,842 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 119 [2018-09-15 19:25:55,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 19:25:55,852 INFO L225 Difference]: With dead ends: 1002 [2018-09-15 19:25:55,852 INFO L226 Difference]: Without dead ends: 796 [2018-09-15 19:25:55,854 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 126 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2018-09-15 19:25:55,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2018-09-15 19:25:55,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 793. [2018-09-15 19:25:55,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2018-09-15 19:25:55,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 962 transitions. [2018-09-15 19:25:55,904 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 962 transitions. Word has length 119 [2018-09-15 19:25:55,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 19:25:55,905 INFO L480 AbstractCegarLoop]: Abstraction has 793 states and 962 transitions. [2018-09-15 19:25:55,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-15 19:25:55,905 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 962 transitions. [2018-09-15 19:25:55,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-09-15 19:25:55,910 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 19:25:55,910 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:55,911 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 19:25:55,911 INFO L82 PathProgramCache]: Analyzing trace with hash -812786876, now seen corresponding path program 1 times [2018-09-15 19:25:55,911 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 19:25:55,911 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 156 with the following transitions: [2018-09-15 19:25:55,912 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], [213], [215], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 19:25:55,917 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 19:25:55,917 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 19:26:00,913 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 19:26:11,380 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 19:26:11,381 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:26:11,386 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 19:26:13,412 INFO L232 lantSequenceWeakener]: Weakened 153 states. On average, predicates are now at 73.4% of their original sizes. [2018-09-15 19:26:13,412 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 19:26:14,186 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 19:26:14,186 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 19:26:14,186 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-15 19:26:14,187 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 19:26:14,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-15 19:26:14,187 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-15 19:26:14,188 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-09-15 19:26:14,188 INFO L87 Difference]: Start difference. First operand 793 states and 962 transitions. Second operand 14 states. [2018-09-15 19:26:26,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 19:26:26,858 INFO L93 Difference]: Finished difference Result 1161 states and 1610 transitions. [2018-09-15 19:26:26,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-15 19:26:26,872 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 155 [2018-09-15 19:26:26,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 19:26:26,879 INFO L225 Difference]: With dead ends: 1161 [2018-09-15 19:26:26,879 INFO L226 Difference]: Without dead ends: 955 [2018-09-15 19:26:26,881 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 166 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2018-09-15 19:26:26,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2018-09-15 19:26:26,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 943. [2018-09-15 19:26:26,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2018-09-15 19:26:26,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1137 transitions. [2018-09-15 19:26:26,943 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1137 transitions. Word has length 155 [2018-09-15 19:26:26,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 19:26:26,944 INFO L480 AbstractCegarLoop]: Abstraction has 943 states and 1137 transitions. [2018-09-15 19:26:26,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-15 19:26:26,944 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1137 transitions. [2018-09-15 19:26:26,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-09-15 19:26:26,949 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 19:26:26,949 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:26,949 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 19:26:26,950 INFO L82 PathProgramCache]: Analyzing trace with hash -894996733, now seen corresponding path program 1 times [2018-09-15 19:26:26,950 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 19:26:26,950 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 175 with the following transitions: [2018-09-15 19:26:26,952 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], [213], [215], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [754], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 19:26:26,964 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 19:26:26,964 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 19:26:41,312 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 19:26:41,312 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:26:41,317 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 19:26:42,965 INFO L232 lantSequenceWeakener]: Weakened 172 states. On average, predicates are now at 73.33% of their original sizes. [2018-09-15 19:26:42,966 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 19:26:44,326 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 19:26:44,327 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 19:26:44,327 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-09-15 19:26:44,327 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 19:26:44,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-15 19:26:44,328 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-15 19:26:44,328 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-09-15 19:26:44,329 INFO L87 Difference]: Start difference. First operand 943 states and 1137 transitions. Second operand 18 states. [2018-09-15 19:26:53,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 19:26:53,576 INFO L93 Difference]: Finished difference Result 1561 states and 2167 transitions. [2018-09-15 19:26:53,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-15 19:26:53,579 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 174 [2018-09-15 19:26:53,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 19:26:53,587 INFO L225 Difference]: With dead ends: 1561 [2018-09-15 19:26:53,587 INFO L226 Difference]: Without dead ends: 1207 [2018-09-15 19:26:53,590 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 190 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=287, Invalid=903, Unknown=0, NotChecked=0, Total=1190 [2018-09-15 19:26:53,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2018-09-15 19:26:53,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 1205. [2018-09-15 19:26:53,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2018-09-15 19:26:53,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1418 transitions. [2018-09-15 19:26:53,653 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1418 transitions. Word has length 174 [2018-09-15 19:26:53,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 19:26:53,653 INFO L480 AbstractCegarLoop]: Abstraction has 1205 states and 1418 transitions. [2018-09-15 19:26:53,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-15 19:26:53,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1418 transitions. [2018-09-15 19:26:53,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-09-15 19:26:53,657 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 19:26:53,658 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 19:26:53,658 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 19:26:53,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1553969338, now seen corresponding path program 1 times [2018-09-15 19:26:53,659 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 19:26:53,659 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 187 with the following transitions: [2018-09-15 19:26:53,659 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], [213], [215], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [518], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 19:26:53,664 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 19:26:53,665 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 19:26:55,322 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 19:27:02,539 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 19:27:02,540 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:27:02,548 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 19:27:04,115 INFO L232 lantSequenceWeakener]: Weakened 184 states. On average, predicates are now at 73.35% of their original sizes. [2018-09-15 19:27:04,115 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 19:27:04,686 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 19:27:04,686 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 19:27:04,687 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-15 19:27:04,687 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 19:27:04,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-15 19:27:04,687 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-15 19:27:04,688 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-09-15 19:27:04,688 INFO L87 Difference]: Start difference. First operand 1205 states and 1418 transitions. Second operand 11 states. [2018-09-15 19:27:15,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 19:27:15,816 INFO L93 Difference]: Finished difference Result 1717 states and 2233 transitions. [2018-09-15 19:27:15,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-15 19:27:15,817 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 186 [2018-09-15 19:27:15,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 19:27:15,823 INFO L225 Difference]: With dead ends: 1717 [2018-09-15 19:27:15,823 INFO L226 Difference]: Without dead ends: 1363 [2018-09-15 19:27:15,825 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 195 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2018-09-15 19:27:15,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2018-09-15 19:27:15,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1353. [2018-09-15 19:27:15,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1353 states. [2018-09-15 19:27:15,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1584 transitions. [2018-09-15 19:27:15,882 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1584 transitions. Word has length 186 [2018-09-15 19:27:15,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 19:27:15,882 INFO L480 AbstractCegarLoop]: Abstraction has 1353 states and 1584 transitions. [2018-09-15 19:27:15,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-15 19:27:15,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1584 transitions. [2018-09-15 19:27:15,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-09-15 19:27:15,886 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 19:27:15,886 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-15 19:27:15,886 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 19:27:15,887 INFO L82 PathProgramCache]: Analyzing trace with hash 2089257230, now seen corresponding path program 1 times [2018-09-15 19:27:15,887 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 19:27:15,887 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 191 with the following transitions: [2018-09-15 19:27:15,887 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], [213], [215], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 19:27:15,890 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 19:27:15,890 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 19:27:17,176 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 19:27:35,875 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 19:27:35,876 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:27:35,911 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 19:27:38,027 INFO L232 lantSequenceWeakener]: Weakened 188 states. On average, predicates are now at 73.34% of their original sizes. [2018-09-15 19:27:38,027 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 19:27:38,833 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 19:27:38,833 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 19:27:38,833 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-15 19:27:38,834 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 19:27:38,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-15 19:27:38,834 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-15 19:27:38,835 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-09-15 19:27:38,835 INFO L87 Difference]: Start difference. First operand 1353 states and 1584 transitions. Second operand 14 states. [2018-09-15 19:27:52,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 19:27:52,554 INFO L93 Difference]: Finished difference Result 2668 states and 3597 transitions. [2018-09-15 19:27:52,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-15 19:27:52,555 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 190 [2018-09-15 19:27:52,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 19:27:52,565 INFO L225 Difference]: With dead ends: 2668 [2018-09-15 19:27:52,566 INFO L226 Difference]: Without dead ends: 2166 [2018-09-15 19:27:52,568 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 202 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2018-09-15 19:27:52,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2166 states. [2018-09-15 19:27:52,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2166 to 2068. [2018-09-15 19:27:52,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2068 states. [2018-09-15 19:27:52,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2068 states to 2068 states and 2458 transitions. [2018-09-15 19:27:52,661 INFO L78 Accepts]: Start accepts. Automaton has 2068 states and 2458 transitions. Word has length 190 [2018-09-15 19:27:52,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 19:27:52,662 INFO L480 AbstractCegarLoop]: Abstraction has 2068 states and 2458 transitions. [2018-09-15 19:27:52,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-15 19:27:52,662 INFO L276 IsEmpty]: Start isEmpty. Operand 2068 states and 2458 transitions. [2018-09-15 19:27:52,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-09-15 19:27:52,667 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 19:27:52,668 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 19:27:52,668 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 19:27:52,668 INFO L82 PathProgramCache]: Analyzing trace with hash -2009516059, now seen corresponding path program 1 times [2018-09-15 19:27:52,669 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 19:27:52,669 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 224 with the following transitions: [2018-09-15 19:27:52,669 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], [213], [215], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 19:27:52,673 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 19:27:52,673 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 19:27:54,420 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 19:28:13,862 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 19:28:13,863 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:28:13,868 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 19:28:16,663 INFO L232 lantSequenceWeakener]: Weakened 221 states. On average, predicates are now at 73.25% of their original sizes. [2018-09-15 19:28:16,663 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 19:28:18,343 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 19:28:18,344 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 19:28:18,344 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-09-15 19:28:18,344 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 19:28:18,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-15 19:28:18,344 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-15 19:28:18,345 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2018-09-15 19:28:18,345 INFO L87 Difference]: Start difference. First operand 2068 states and 2458 transitions. Second operand 19 states. [2018-09-15 19:28:31,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 19:28:31,710 INFO L93 Difference]: Finished difference Result 4578 states and 5789 transitions. [2018-09-15 19:28:31,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-15 19:28:31,713 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 223 [2018-09-15 19:28:31,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 19:28:31,729 INFO L225 Difference]: With dead ends: 4578 [2018-09-15 19:28:31,730 INFO L226 Difference]: Without dead ends: 3070 [2018-09-15 19:28:31,736 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 241 GetRequests, 205 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:28:31,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3070 states. [2018-09-15 19:28:31,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3070 to 3004. [2018-09-15 19:28:31,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3004 states. [2018-09-15 19:28:31,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3004 states to 3004 states and 3582 transitions. [2018-09-15 19:28:31,893 INFO L78 Accepts]: Start accepts. Automaton has 3004 states and 3582 transitions. Word has length 223 [2018-09-15 19:28:31,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 19:28:31,893 INFO L480 AbstractCegarLoop]: Abstraction has 3004 states and 3582 transitions. [2018-09-15 19:28:31,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-15 19:28:31,894 INFO L276 IsEmpty]: Start isEmpty. Operand 3004 states and 3582 transitions. [2018-09-15 19:28:31,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-09-15 19:28:31,899 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 19:28:31,900 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 19:28:31,900 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 19:28:31,900 INFO L82 PathProgramCache]: Analyzing trace with hash 689483636, now seen corresponding path program 1 times [2018-09-15 19:28:31,901 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 19:28:31,901 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 229 with the following transitions: [2018-09-15 19:28:31,901 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], [213], [215], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 19:28:31,904 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 19:28:31,905 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 19:28:36,191 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 19:29:05,522 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 19:29:05,523 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:29:05,529 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 19:29:08,092 INFO L232 lantSequenceWeakener]: Weakened 226 states. On average, predicates are now at 73.23% of their original sizes. [2018-09-15 19:29:08,093 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 19:29:11,680 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 19:29:11,680 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 19:29:11,680 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-09-15 19:29:11,681 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 19:29:11,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-15 19:29:11,681 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-15 19:29:11,681 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2018-09-15 19:29:11,682 INFO L87 Difference]: Start difference. First operand 3004 states and 3582 transitions. Second operand 17 states. [2018-09-15 19:29:20,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 19:29:20,396 INFO L93 Difference]: Finished difference Result 5350 states and 6601 transitions. [2018-09-15 19:29:20,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-15 19:29:20,397 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 228 [2018-09-15 19:29:20,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 19:29:20,411 INFO L225 Difference]: With dead ends: 5350 [2018-09-15 19:29:20,412 INFO L226 Difference]: Without dead ends: 3197 [2018-09-15 19:29:20,420 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 241 GetRequests, 201 SyntacticMatches, 11 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=236, Invalid=694, Unknown=0, NotChecked=0, Total=930 [2018-09-15 19:29:20,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3197 states. [2018-09-15 19:29:20,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3197 to 3156. [2018-09-15 19:29:20,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3156 states. [2018-09-15 19:29:20,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3156 states to 3156 states and 3781 transitions. [2018-09-15 19:29:20,569 INFO L78 Accepts]: Start accepts. Automaton has 3156 states and 3781 transitions. Word has length 228 [2018-09-15 19:29:20,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 19:29:20,570 INFO L480 AbstractCegarLoop]: Abstraction has 3156 states and 3781 transitions. [2018-09-15 19:29:20,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-15 19:29:20,570 INFO L276 IsEmpty]: Start isEmpty. Operand 3156 states and 3781 transitions. [2018-09-15 19:29:20,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-09-15 19:29:20,577 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 19:29:20,577 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-15 19:29:20,577 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 19:29:20,578 INFO L82 PathProgramCache]: Analyzing trace with hash 23683883, now seen corresponding path program 1 times [2018-09-15 19:29:20,578 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 19:29:20,578 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 234 with the following transitions: [2018-09-15 19:29:20,579 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], [213], [215], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [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:29:20,582 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 19:29:20,583 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 19:29:25,260 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. Received shutdown request... [2018-09-15 19:29:35,582 WARN L572 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-09-15 19:29:35,583 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-09-15 19:29:35,584 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-15 19:29:35,625 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-15 19:29:35,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.09 07:29:35 BoogieIcfgContainer [2018-09-15 19:29:35,625 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-15 19:29:35,626 INFO L168 Benchmark]: Toolchain (without parser) took 263257.31 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 3.9 GB in the end (delta: -2.5 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-15 19:29:35,629 INFO L168 Benchmark]: CDTParser took 0.19 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:29:35,629 INFO L168 Benchmark]: CACSL2BoogieTranslator took 839.06 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. [2018-09-15 19:29:35,630 INFO L168 Benchmark]: Boogie Procedure Inliner took 130.02 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:29:35,631 INFO L168 Benchmark]: Boogie Preprocessor took 266.81 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 753.9 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -855.3 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. [2018-09-15 19:29:35,632 INFO L168 Benchmark]: RCFGBuilder took 3304.93 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 121.5 MB). Peak memory consumption was 121.5 MB. Max. memory is 7.1 GB. [2018-09-15 19:29:35,632 INFO L168 Benchmark]: TraceAbstraction took 258709.94 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 3.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-09-15 19:29:35,637 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.19 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 839.06 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 130.02 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 266.81 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 753.9 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -855.3 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3304.93 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 121.5 MB). Peak memory consumption was 121.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 258709.94 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 3.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 100]: 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 TRUE (((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7)) [L100] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNKNOWN Result, 258.6s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 92.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1801 SDtfs, 9772 SDslu, 2872 SDs, 0 SdLazy, 16786 SolverSat, 2025 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 79.3s Time, PredicateUnifierStatistics: 18 DeclaredPredicates, 1515 GetRequests, 1301 SyntacticMatches, 11 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1134 ImplicationChecksByTransitivity, 17.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3156occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 138.8s AbstIntTime, 10 AbstIntIterations, 9 AbstIntStrong, 0.993576725931926 AbsIntWeakeningRatio, 0.13992932862190813 AbsIntAvgWeakeningVarsNumRemoved, 73.3434628975265 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 9 MinimizatonAttempts, 237 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_label38_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-15_19-29-35-652.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label38_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-15_19-29-35-652.csv Completed graceful shutdown