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_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label55_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dace188-m [2018-09-15 12:11:38,384 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-15 12:11:38,386 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-15 12:11:38,399 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-15 12:11:38,400 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-15 12:11:38,401 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-15 12:11:38,402 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-15 12:11:38,404 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-15 12:11:38,405 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-15 12:11:38,406 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-15 12:11:38,407 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-15 12:11:38,408 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-15 12:11:38,408 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-15 12:11:38,409 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-15 12:11:38,410 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-15 12:11:38,411 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-15 12:11:38,412 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-15 12:11:38,414 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-15 12:11:38,416 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-15 12:11:38,418 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-15 12:11:38,419 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-15 12:11:38,420 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-15 12:11:38,423 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-15 12:11:38,423 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-15 12:11:38,423 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-15 12:11:38,424 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-15 12:11:38,425 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-15 12:11:38,426 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-15 12:11:38,427 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-15 12:11:38,428 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-15 12:11:38,428 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-15 12:11:38,429 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-15 12:11:38,430 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-15 12:11:38,430 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-15 12:11:38,431 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-15 12:11:38,432 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-15 12:11:38,432 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf [2018-09-15 12:11:38,455 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-15 12:11:38,455 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-15 12:11:38,456 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-15 12:11:38,457 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-15 12:11:38,457 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-15 12:11:38,457 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-15 12:11:38,457 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-15 12:11:38,458 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-15 12:11:38,458 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-15 12:11:38,458 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-15 12:11:38,458 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-15 12:11:38,459 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-15 12:11:38,459 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-15 12:11:38,459 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-15 12:11:38,460 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-15 12:11:38,460 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-15 12:11:38,460 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-15 12:11:38,460 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-15 12:11:38,460 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-15 12:11:38,461 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-15 12:11:38,461 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-15 12:11:38,461 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-15 12:11:38,461 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-15 12:11:38,461 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-15 12:11:38,462 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-15 12:11:38,462 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-15 12:11:38,462 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-15 12:11:38,462 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-15 12:11:38,463 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-15 12:11:38,463 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-15 12:11:38,463 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-15 12:11:38,463 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-15 12:11:38,463 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-15 12:11:38,522 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-15 12:11:38,536 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-15 12:11:38,540 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-15 12:11:38,541 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-15 12:11:38,542 INFO L276 PluginConnector]: CDTParser initialized [2018-09-15 12:11:38,543 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label55_true-unreach-call_false-termination.c [2018-09-15 12:11:38,891 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/870d321aa/0814df0e599248eca70e43c0934c993a/FLAGe65539e32 [2018-09-15 12:11:39,200 INFO L277 CDTParser]: Found 1 translation units. [2018-09-15 12:11:39,203 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label55_true-unreach-call_false-termination.c [2018-09-15 12:11:39,225 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/870d321aa/0814df0e599248eca70e43c0934c993a/FLAGe65539e32 [2018-09-15 12:11:39,251 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/870d321aa/0814df0e599248eca70e43c0934c993a [2018-09-15 12:11:39,266 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-15 12:11:39,272 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-15 12:11:39,274 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-15 12:11:39,274 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-15 12:11:39,285 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-15 12:11:39,286 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 12:11:39" (1/1) ... [2018-09-15 12:11:39,291 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a77e263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:11:39, skipping insertion in model container [2018-09-15 12:11:39,291 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 12:11:39" (1/1) ... [2018-09-15 12:11:39,306 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-15 12:11:39,885 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 12:11:39,914 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-15 12:11:40,080 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 12:11:40,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:11:40 WrapperNode [2018-09-15 12:11:40,139 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-15 12:11:40,140 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-15 12:11:40,140 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-15 12:11:40,140 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-15 12:11:40,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:11:40" (1/1) ... [2018-09-15 12:11:40,195 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:11:40" (1/1) ... [2018-09-15 12:11:40,302 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-15 12:11:40,303 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-15 12:11:40,303 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-15 12:11:40,303 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-15 12:11:40,550 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:11:40" (1/1) ... [2018-09-15 12:11:40,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:11:40" (1/1) ... [2018-09-15 12:11:40,560 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:11:40" (1/1) ... [2018-09-15 12:11:40,561 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:11:40" (1/1) ... [2018-09-15 12:11:40,595 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:11:40" (1/1) ... [2018-09-15 12:11:40,621 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:11:40" (1/1) ... [2018-09-15 12:11:40,636 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:11:40" (1/1) ... [2018-09-15 12:11:40,645 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-15 12:11:40,646 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-15 12:11:40,646 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-15 12:11:40,646 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-15 12:11:40,649 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:11:40" (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 12:11:40,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-15 12:11:40,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-15 12:11:40,730 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-15 12:11:40,730 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-15 12:11:40,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-15 12:11:40,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-15 12:11:40,730 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-15 12:11:40,731 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-15 12:11:45,013 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-15 12:11:45,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 12:11:45 BoogieIcfgContainer [2018-09-15 12:11:45,014 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-15 12:11:45,015 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-15 12:11:45,015 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-15 12:11:45,019 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-15 12:11:45,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 12:11:39" (1/3) ... [2018-09-15 12:11:45,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@112ddca7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 12:11:45, skipping insertion in model container [2018-09-15 12:11:45,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:11:40" (2/3) ... [2018-09-15 12:11:45,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@112ddca7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 12:11:45, skipping insertion in model container [2018-09-15 12:11:45,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 12:11:45" (3/3) ... [2018-09-15 12:11:45,023 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label55_true-unreach-call_false-termination.c [2018-09-15 12:11:45,034 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-15 12:11:45,044 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-15 12:11:45,097 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-15 12:11:45,098 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-15 12:11:45,098 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-15 12:11:45,099 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-15 12:11:45,099 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-15 12:11:45,099 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-15 12:11:45,099 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-15 12:11:45,100 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-15 12:11:45,100 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-15 12:11:45,143 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2018-09-15 12:11:45,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-15 12:11:45,156 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 12:11:45,157 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 12:11:45,158 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 12:11:45,164 INFO L82 PathProgramCache]: Analyzing trace with hash -353931284, now seen corresponding path program 1 times [2018-09-15 12:11:45,167 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 12:11:45,168 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 65 with the following transitions: [2018-09-15 12:11:45,171 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [413], [415], [952], [956], [962], [966], [973], [974], [975], [977] [2018-09-15 12:11:45,243 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 12:11:45,243 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 12:11:47,043 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 12:11:47,046 INFO L272 AbstractInterpreter]: Visited 63 different actions 63 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-15 12:11:47,064 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 12:11:47,911 INFO L232 lantSequenceWeakener]: Weakened 62 states. On average, predicates are now at 80.76% of their original sizes. [2018-09-15 12:11:47,911 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 12:11:48,223 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 12:11:48,225 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 12:11:48,226 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-15 12:11:48,226 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 12:11:48,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-15 12:11:48,243 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-15 12:11:48,244 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-15 12:11:48,247 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 6 states. [2018-09-15 12:11:51,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 12:11:51,671 INFO L93 Difference]: Finished difference Result 693 states and 1229 transitions. [2018-09-15 12:11:51,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-15 12:11:51,675 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-09-15 12:11:51,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 12:11:51,697 INFO L225 Difference]: With dead ends: 693 [2018-09-15 12:11:51,697 INFO L226 Difference]: Without dead ends: 436 [2018-09-15 12:11:51,705 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 63 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-15 12:11:51,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-09-15 12:11:51,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 434. [2018-09-15 12:11:51,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-09-15 12:11:51,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 615 transitions. [2018-09-15 12:11:51,801 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 615 transitions. Word has length 64 [2018-09-15 12:11:51,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 12:11:51,801 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 615 transitions. [2018-09-15 12:11:51,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-15 12:11:51,802 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 615 transitions. [2018-09-15 12:11:51,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-09-15 12:11:51,820 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 12:11:51,820 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:11:51,822 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 12:11:51,822 INFO L82 PathProgramCache]: Analyzing trace with hash 342897051, now seen corresponding path program 1 times [2018-09-15 12:11:51,822 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 12:11:51,823 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 150 with the following transitions: [2018-09-15 12:11:51,823 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [413], [415], [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], [554], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-09-15 12:11:51,835 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 12:11:51,835 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 12:11:59,436 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 12:11:59,436 INFO L272 AbstractInterpreter]: Visited 92 different actions 177 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 12:11:59,443 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 12:12:02,138 INFO L232 lantSequenceWeakener]: Weakened 147 states. On average, predicates are now at 78.83% of their original sizes. [2018-09-15 12:12:02,138 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 12:12:04,302 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 12:12:04,303 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 12:12:04,303 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-15 12:12:04,303 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 12:12:04,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-15 12:12:04,305 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-15 12:12:04,306 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-09-15 12:12:04,306 INFO L87 Difference]: Start difference. First operand 434 states and 615 transitions. Second operand 11 states. [2018-09-15 12:12:12,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 12:12:12,980 INFO L93 Difference]: Finished difference Result 1051 states and 1763 transitions. [2018-09-15 12:12:12,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-15 12:12:12,989 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 149 [2018-09-15 12:12:12,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 12:12:12,995 INFO L225 Difference]: With dead ends: 1051 [2018-09-15 12:12:12,996 INFO L226 Difference]: Without dead ends: 806 [2018-09-15 12:12:13,005 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 155 GetRequests, 87 SyntacticMatches, 52 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-15 12:12:13,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2018-09-15 12:12:13,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 803. [2018-09-15 12:12:13,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2018-09-15 12:12:13,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1002 transitions. [2018-09-15 12:12:13,070 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1002 transitions. Word has length 149 [2018-09-15 12:12:13,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 12:12:13,071 INFO L480 AbstractCegarLoop]: Abstraction has 803 states and 1002 transitions. [2018-09-15 12:12:13,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-15 12:12:13,071 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1002 transitions. [2018-09-15 12:12:13,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-09-15 12:12:13,076 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 12:12:13,076 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:12:13,077 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 12:12:13,077 INFO L82 PathProgramCache]: Analyzing trace with hash -961343481, now seen corresponding path program 1 times [2018-09-15 12:12:13,077 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 12:12:13,077 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 176 with the following transitions: [2018-09-15 12:12:13,078 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [413], [415], [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], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-09-15 12:12:13,084 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 12:12:13,085 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 12:12:26,422 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 12:12:26,422 INFO L272 AbstractInterpreter]: Visited 118 different actions 230 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 12:12:26,428 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 12:12:29,979 INFO L232 lantSequenceWeakener]: Weakened 173 states. On average, predicates are now at 78.6% of their original sizes. [2018-09-15 12:12:29,979 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 12:12:31,223 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 12:12:31,224 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 12:12:31,225 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-15 12:12:31,225 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 12:12:31,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-15 12:12:31,227 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-15 12:12:31,227 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-09-15 12:12:31,227 INFO L87 Difference]: Start difference. First operand 803 states and 1002 transitions. Second operand 11 states. [2018-09-15 12:12:41,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 12:12:41,028 INFO L93 Difference]: Finished difference Result 1236 states and 1786 transitions. [2018-09-15 12:12:41,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-15 12:12:41,029 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 175 [2018-09-15 12:12:41,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 12:12:41,036 INFO L225 Difference]: With dead ends: 1236 [2018-09-15 12:12:41,036 INFO L226 Difference]: Without dead ends: 991 [2018-09-15 12:12:41,038 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 182 GetRequests, 113 SyntacticMatches, 52 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-09-15 12:12:41,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2018-09-15 12:12:41,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 988. [2018-09-15 12:12:41,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2018-09-15 12:12:41,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1200 transitions. [2018-09-15 12:12:41,075 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1200 transitions. Word has length 175 [2018-09-15 12:12:41,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 12:12:41,076 INFO L480 AbstractCegarLoop]: Abstraction has 988 states and 1200 transitions. [2018-09-15 12:12:41,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-15 12:12:41,077 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1200 transitions. [2018-09-15 12:12:41,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-09-15 12:12:41,085 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 12:12:41,085 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 12:12:41,086 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 12:12:41,087 INFO L82 PathProgramCache]: Analyzing trace with hash -2113089928, now seen corresponding path program 1 times [2018-09-15 12:12:41,087 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 12:12:41,087 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 261 with the following transitions: [2018-09-15 12:12:41,088 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [413], [415], [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], [554], [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], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-09-15 12:12:41,095 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 12:12:41,102 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 12:12:52,331 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 12:12:52,331 INFO L272 AbstractInterpreter]: Visited 119 different actions 352 times. Merged at 7 different actions 17 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-15 12:12:52,340 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 12:12:54,064 INFO L232 lantSequenceWeakener]: Weakened 258 states. On average, predicates are now at 78.18% of their original sizes. [2018-09-15 12:12:54,064 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 12:12:54,730 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 12:12:54,730 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 12:12:54,731 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-09-15 12:12:54,731 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 12:12:54,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-15 12:12:54,732 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-15 12:12:54,733 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-09-15 12:12:54,733 INFO L87 Difference]: Start difference. First operand 988 states and 1200 transitions. Second operand 16 states. [2018-09-15 12:13:07,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 12:13:07,838 INFO L93 Difference]: Finished difference Result 2043 states and 3188 transitions. [2018-09-15 12:13:07,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-15 12:13:07,839 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 260 [2018-09-15 12:13:07,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 12:13:07,851 INFO L225 Difference]: With dead ends: 2043 [2018-09-15 12:13:07,851 INFO L226 Difference]: Without dead ends: 1798 [2018-09-15 12:13:07,855 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 278 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=260, Invalid=930, Unknown=0, NotChecked=0, Total=1190 [2018-09-15 12:13:07,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1798 states. [2018-09-15 12:13:07,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1798 to 1605. [2018-09-15 12:13:07,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1605 states. [2018-09-15 12:13:07,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 1893 transitions. [2018-09-15 12:13:07,923 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 1893 transitions. Word has length 260 [2018-09-15 12:13:07,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 12:13:07,924 INFO L480 AbstractCegarLoop]: Abstraction has 1605 states and 1893 transitions. [2018-09-15 12:13:07,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-15 12:13:07,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 1893 transitions. [2018-09-15 12:13:07,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-09-15 12:13:07,930 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 12:13:07,931 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-15 12:13:07,931 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 12:13:07,931 INFO L82 PathProgramCache]: Analyzing trace with hash -130902053, now seen corresponding path program 1 times [2018-09-15 12:13:07,932 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 12:13:07,932 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 286 with the following transitions: [2018-09-15 12:13:07,932 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [413], [415], [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], [654], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-09-15 12:13:07,942 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 12:13:07,942 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 12:13:23,075 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 12:13:40,925 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 12:13:40,925 INFO L272 AbstractInterpreter]: Visited 119 different actions 465 times. Merged at 7 different actions 22 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-15 12:13:40,934 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 12:13:44,477 INFO L232 lantSequenceWeakener]: Weakened 283 states. On average, predicates are now at 78.12% of their original sizes. [2018-09-15 12:13:44,477 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 12:13:45,622 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 12:13:45,623 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 12:13:45,623 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-15 12:13:45,623 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 12:13:45,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-15 12:13:45,625 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-15 12:13:45,625 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-09-15 12:13:45,625 INFO L87 Difference]: Start difference. First operand 1605 states and 1893 transitions. Second operand 11 states. [2018-09-15 12:13:51,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 12:13:51,203 INFO L93 Difference]: Finished difference Result 2044 states and 2683 transitions. [2018-09-15 12:13:51,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-15 12:13:51,205 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 285 [2018-09-15 12:13:51,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 12:13:51,214 INFO L225 Difference]: With dead ends: 2044 [2018-09-15 12:13:51,214 INFO L226 Difference]: Without dead ends: 1799 [2018-09-15 12:13:51,217 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 293 GetRequests, 223 SyntacticMatches, 52 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2018-09-15 12:13:51,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2018-09-15 12:13:51,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1792. [2018-09-15 12:13:51,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1792 states. [2018-09-15 12:13:51,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 2111 transitions. [2018-09-15 12:13:51,286 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 2111 transitions. Word has length 285 [2018-09-15 12:13:51,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 12:13:51,287 INFO L480 AbstractCegarLoop]: Abstraction has 1792 states and 2111 transitions. [2018-09-15 12:13:51,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-15 12:13:51,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 2111 transitions. [2018-09-15 12:13:51,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2018-09-15 12:13:51,296 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 12:13:51,297 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-15 12:13:51,297 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 12:13:51,297 INFO L82 PathProgramCache]: Analyzing trace with hash -675859729, now seen corresponding path program 1 times [2018-09-15 12:13:51,297 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 12:13:51,298 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 364 with the following transitions: [2018-09-15 12:13:51,298 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [413], [415], [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], [654], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-09-15 12:13:51,304 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 12:13:51,304 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 12:14:05,878 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 12:14:27,797 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 12:14:27,798 INFO L272 AbstractInterpreter]: Visited 120 different actions 710 times. Merged at 8 different actions 45 times. Widened at 1 different actions 1 times. Found 10 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-15 12:14:27,820 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 12:14:29,928 INFO L232 lantSequenceWeakener]: Weakened 361 states. On average, predicates are now at 77.95% of their original sizes. [2018-09-15 12:14:29,929 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 12:14:30,206 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 12:14:30,207 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 12:14:30,207 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-15 12:14:30,207 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 12:14:30,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-15 12:14:30,208 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-15 12:14:30,208 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-15 12:14:30,208 INFO L87 Difference]: Start difference. First operand 1792 states and 2111 transitions. Second operand 10 states. [2018-09-15 12:14:38,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 12:14:38,496 INFO L93 Difference]: Finished difference Result 2449 states and 3152 transitions. [2018-09-15 12:14:38,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-15 12:14:38,497 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 363 [2018-09-15 12:14:38,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 12:14:38,507 INFO L225 Difference]: With dead ends: 2449 [2018-09-15 12:14:38,507 INFO L226 Difference]: Without dead ends: 2017 [2018-09-15 12:14:38,509 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 370 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-15 12:14:38,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2017 states. [2018-09-15 12:14:38,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2017 to 1999. [2018-09-15 12:14:38,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1999 states. [2018-09-15 12:14:38,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1999 states to 1999 states and 2367 transitions. [2018-09-15 12:14:38,576 INFO L78 Accepts]: Start accepts. Automaton has 1999 states and 2367 transitions. Word has length 363 [2018-09-15 12:14:38,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 12:14:38,577 INFO L480 AbstractCegarLoop]: Abstraction has 1999 states and 2367 transitions. [2018-09-15 12:14:38,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-15 12:14:38,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1999 states and 2367 transitions. [2018-09-15 12:14:38,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2018-09-15 12:14:38,586 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 12:14:38,586 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2018-09-15 12:14:38,587 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 12:14:38,587 INFO L82 PathProgramCache]: Analyzing trace with hash 441760295, now seen corresponding path program 1 times [2018-09-15 12:14:38,587 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 12:14:38,587 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 368 with the following transitions: [2018-09-15 12:14:38,588 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [413], [415], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [542], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-09-15 12:14:38,591 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 12:14:38,591 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 12:14:52,062 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 12:15:26,203 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 12:15:26,204 INFO L272 AbstractInterpreter]: Visited 120 different actions 948 times. Merged at 8 different actions 65 times. Widened at 1 different actions 3 times. Found 14 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-15 12:15:26,210 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 12:15:28,204 INFO L232 lantSequenceWeakener]: Weakened 365 states. On average, predicates are now at 77.94% of their original sizes. [2018-09-15 12:15:28,204 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 12:15:28,458 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 12:15:28,459 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 12:15:28,459 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-15 12:15:28,459 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 12:15:28,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-15 12:15:28,460 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-15 12:15:28,460 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-15 12:15:28,460 INFO L87 Difference]: Start difference. First operand 1999 states and 2367 transitions. Second operand 10 states. [2018-09-15 12:15:34,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 12:15:34,229 INFO L93 Difference]: Finished difference Result 2831 states and 3636 transitions. [2018-09-15 12:15:34,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-15 12:15:34,230 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 367 [2018-09-15 12:15:34,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 12:15:34,240 INFO L225 Difference]: With dead ends: 2831 [2018-09-15 12:15:34,240 INFO L226 Difference]: Without dead ends: 2194 [2018-09-15 12:15:34,243 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 374 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-15 12:15:34,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2194 states. [2018-09-15 12:15:34,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2194 to 2184. [2018-09-15 12:15:34,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2184 states. [2018-09-15 12:15:34,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2184 states to 2184 states and 2585 transitions. [2018-09-15 12:15:34,316 INFO L78 Accepts]: Start accepts. Automaton has 2184 states and 2585 transitions. Word has length 367 [2018-09-15 12:15:34,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 12:15:34,317 INFO L480 AbstractCegarLoop]: Abstraction has 2184 states and 2585 transitions. [2018-09-15 12:15:34,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-15 12:15:34,317 INFO L276 IsEmpty]: Start isEmpty. Operand 2184 states and 2585 transitions. [2018-09-15 12:15:34,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-09-15 12:15:34,328 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 12:15:34,329 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 12:15:34,329 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 12:15:34,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1074557752, now seen corresponding path program 1 times [2018-09-15 12:15:34,330 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 12:15:34,330 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 389 with the following transitions: [2018-09-15 12:15:34,330 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [413], [415], [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], [626], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-09-15 12:15:34,333 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 12:15:34,333 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 12:15:47,836 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. Received shutdown request... [2018-09-15 12:15:48,358 WARN L572 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-09-15 12:15:48,359 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-09-15 12:15:48,360 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-15 12:15:48,411 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-15 12:15:48,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.09 12:15:48 BoogieIcfgContainer [2018-09-15 12:15:48,412 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-15 12:15:48,413 INFO L168 Benchmark]: Toolchain (without parser) took 249146.23 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.0 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-15 12:15:48,415 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-15 12:15:48,416 INFO L168 Benchmark]: CACSL2BoogieTranslator took 865.60 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2018-09-15 12:15:48,416 INFO L168 Benchmark]: Boogie Procedure Inliner took 162.67 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-15 12:15:48,417 INFO L168 Benchmark]: Boogie Preprocessor took 342.46 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -849.7 MB). Peak memory consumption was 33.0 MB. Max. memory is 7.1 GB. [2018-09-15 12:15:48,418 INFO L168 Benchmark]: RCFGBuilder took 4368.67 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: 130.6 MB). Peak memory consumption was 130.6 MB. Max. memory is 7.1 GB. [2018-09-15 12:15:48,419 INFO L168 Benchmark]: TraceAbstraction took 243396.43 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.0 GB in the end (delta: -906.0 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-15 12:15:48,427 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.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 865.60 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 162.67 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 342.46 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -849.7 MB). Peak memory consumption was 33.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4368.67 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: 130.6 MB). Peak memory consumption was 130.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 243396.43 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.0 GB in the end (delta: -906.0 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 175]: 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 inputD = 4; [L8] int inputB = 2; [L9] int inputC = 3; [L10] int inputF = 6; [L11] int inputE = 5; [L12] int inputA = 1; [L15] int a21 = 7; [L16] int a15 = 8; [L17] int a12 = -49; [L18] int a24 = 1; [L877] int output = -1; [L880] COND TRUE 1 [L883] int input; [L884] input = __VERIFIER_nondet_int() [L885] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L888] CALL, EXPR calculate_output(input) [L21] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) [L24] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) [L27] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L30] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) [L33] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L36] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L39] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L42] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) [L45] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) [L48] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) [L51] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L54] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) [L57] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) [L60] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) [L63] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) [L66] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L69] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L72] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L75] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L78] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) [L81] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) [L84] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) [L87] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L90] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L93] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) [L96] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) [L99] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) [L102] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L105] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) [L108] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L111] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L114] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L117] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L120] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L123] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) [L126] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L129] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) [L132] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L135] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) [L138] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L141] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) [L144] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L147] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) [L150] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L153] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) [L156] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) [L159] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L162] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) [L165] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) [L168] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L171] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) [L174] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) [L177] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L180] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L183] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) [L186] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L189] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) [L192] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L195] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L198] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) [L201] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L205] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) [L211] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) [L217] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) [L223] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) [L229] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) [L235] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) [L241] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) [L247] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) [L252] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8))) [L258] COND FALSE !(((a15==9) && (((input == 1) && ((( a12 <= -43 && (a21==10)) || ((a21==6) && ((-43 < a12) && (11 >= a12)) )) || ( ((-43 < a12) && (11 >= a12)) && (a21==7)))) && (a24==1)))) [L264] COND FALSE !((((a24==1) && (((input == 6) && ((a21==7) || (a21==8))) && 80 < a12 )) && (a15==9))) [L269] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((a15==9) && ((a24==1) && (((a21==9) || (a21==10)) && (input == 2)))))) [L275] COND FALSE !((((((input == 5) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a21==9)) && (a24==1))) [L280] COND FALSE !((( 80 < a12 && ((a15==8) && (((a21==8) || (a21==9)) && (input == 3)))) && (a24==1))) [L286] COND FALSE !(((input == 4) && ((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((a21==6) && ((a15==5) && ((a24==2) && a12 <= -43 )))))) [L293] COND FALSE !(((((a24==1) && ((input == 3) && a12 <= -43 )) && (a21==7)) && (a15==8))) [L299] COND FALSE !(((a24==1) && (((( 80 < a12 && (a15==8)) && (a21==10)) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 3)))) [L305] COND FALSE !((((a24==1) && ((a15==9) && (((a21==7) || (a21==8)) && (input == 3)))) && 80 < a12 )) [L311] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 5)) && a12 <= -43 ) && (a15==8)) && (a24==1))) [L317] COND FALSE !(((((a15==9) && ((input == 1) && (a21==8))) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) [L323] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 3)) && (a15==8)) && a12 <= -43 ) && (a24==1))) [L329] COND FALSE !(((a24==1) && (((a15==8) && ((input == 1) && (a21==9))) && ((11 < a12) && (80 >= a12)) ))) [L335] COND FALSE !(((a15==9) && ( 80 < a12 && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) [L341] COND FALSE !(( 80 < a12 && ((a15==9) && (((input == 2) && ((a21==7) || (a21==8))) && (a24==1))))) [L347] COND FALSE !((((((input == 6) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8)) && (a24==1))) [L353] COND FALSE !(((((a24==1) && ((input == 1) && ((a21==8) || ((a21==6) || (a21==7))))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) [L359] COND FALSE !(((((a21==10) && (( 80 < a12 && (a24==1)) && (a15==9))) || (((a15==5) && ((a24==2) && a12 <= -43 )) && (a21==6))) && (input == 3))) [L366] COND FALSE !(((((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 5)) && (a24==1)) && (a15==9))) [L372] COND FALSE !((((((input == 1) && (((a21==7) || (a21==8)) || (a21==9))) && (a15==9)) && a12 <= -43 ) && (a24==1))) [L378] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && ((-43 < a12) && (11 >= a12)) ) && (a21==8))))) [L384] COND FALSE !((((a24==1) && ((a15==9) && ((input == 5) && ((a21==8) || ((a21==6) || (a21==7)))))) && ((11 < a12) && (80 >= a12)) )) [L390] COND FALSE !(((((a15==8) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 5))) && ((-43 < a12) && (11 >= a12)) ) && (a24==1))) [L396] COND FALSE !(((a15==9) && ((((input == 3) && (((a21==6) || (a21==7)) || (a21==8))) && (a24==1)) && ((11 < a12) && (80 >= a12)) ))) [L402] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 3)))) && (a24==1))) [L408] COND FALSE !(((a15==9) && ((a24==1) && ((((a21==9) || (a21==10)) && (input == 5)) && ((-43 < a12) && (11 >= a12)) )))) [L414] COND FALSE !(( ((11 < a12) && (80 >= a12)) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 4))) && (a15==9)))) [L420] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && 80 < a12 ) && (a21==9))))) [L426] COND FALSE !((((a24==1) && (((input == 2) && ((a21==10) || ((a21==8) || (a21==9)))) && a12 <= -43 )) && (a15==8))) [L432] COND FALSE !(((a24==1) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))))) && (a15==9)))) [L438] COND FALSE !((((((input == 6) && ((a21==9) || ((a21==7) || (a21==8)))) && (a24==1)) && (a15==9)) && a12 <= -43 )) [L444] COND FALSE !(((( a12 <= -43 && ((input == 6) && ((a21==10) || ((a21==8) || (a21==9))))) && (a24==1)) && (a15==8))) [L449] COND TRUE (((((a21==7) && (input == 5)) && a12 <= -43 ) && (a24==1)) && (a15==8)) [L451] a21 = 10 [L453] RET return 22; [L888] EXPR calculate_output(input) [L888] output = calculate_output(input) [L880] COND TRUE 1 [L883] int input; [L884] input = __VERIFIER_nondet_int() [L885] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L888] CALL, EXPR calculate_output(input) [L21] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) [L24] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) [L27] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L30] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) [L33] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L36] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L39] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L42] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) [L45] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) [L48] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) [L51] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L54] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) [L57] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) [L60] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) [L63] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) [L66] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L69] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L72] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L75] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L78] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) [L81] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) [L84] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) [L87] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L90] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L93] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) [L96] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) [L99] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) [L102] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L105] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) [L108] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L111] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L114] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L117] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L120] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L123] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) [L126] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L129] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) [L132] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L135] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) [L138] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L141] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) [L144] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L147] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) [L150] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L153] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) [L156] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) [L159] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L162] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) [L165] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) [L168] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L171] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) [L174] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) [L177] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L180] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L183] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) [L186] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L189] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) [L192] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L195] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L198] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) [L201] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L205] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) [L211] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) [L217] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) [L223] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) [L229] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) [L235] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) [L241] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) [L247] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) [L252] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8))) [L258] COND FALSE !(((a15==9) && (((input == 1) && ((( a12 <= -43 && (a21==10)) || ((a21==6) && ((-43 < a12) && (11 >= a12)) )) || ( ((-43 < a12) && (11 >= a12)) && (a21==7)))) && (a24==1)))) [L264] COND FALSE !((((a24==1) && (((input == 6) && ((a21==7) || (a21==8))) && 80 < a12 )) && (a15==9))) [L269] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((a15==9) && ((a24==1) && (((a21==9) || (a21==10)) && (input == 2)))))) [L275] COND FALSE !((((((input == 5) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a21==9)) && (a24==1))) [L280] COND FALSE !((( 80 < a12 && ((a15==8) && (((a21==8) || (a21==9)) && (input == 3)))) && (a24==1))) [L286] COND FALSE !(((input == 4) && ((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((a21==6) && ((a15==5) && ((a24==2) && a12 <= -43 )))))) [L293] COND FALSE !(((((a24==1) && ((input == 3) && a12 <= -43 )) && (a21==7)) && (a15==8))) [L299] COND FALSE !(((a24==1) && (((( 80 < a12 && (a15==8)) && (a21==10)) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 3)))) [L305] COND FALSE !((((a24==1) && ((a15==9) && (((a21==7) || (a21==8)) && (input == 3)))) && 80 < a12 )) [L311] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 5)) && a12 <= -43 ) && (a15==8)) && (a24==1))) [L317] COND FALSE !(((((a15==9) && ((input == 1) && (a21==8))) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) [L323] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 3)) && (a15==8)) && a12 <= -43 ) && (a24==1))) [L329] COND FALSE !(((a24==1) && (((a15==8) && ((input == 1) && (a21==9))) && ((11 < a12) && (80 >= a12)) ))) [L335] COND FALSE !(((a15==9) && ( 80 < a12 && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) [L341] COND FALSE !(( 80 < a12 && ((a15==9) && (((input == 2) && ((a21==7) || (a21==8))) && (a24==1))))) [L347] COND FALSE !((((((input == 6) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8)) && (a24==1))) [L353] COND FALSE !(((((a24==1) && ((input == 1) && ((a21==8) || ((a21==6) || (a21==7))))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) [L359] COND FALSE !(((((a21==10) && (( 80 < a12 && (a24==1)) && (a15==9))) || (((a15==5) && ((a24==2) && a12 <= -43 )) && (a21==6))) && (input == 3))) [L366] COND FALSE !(((((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 5)) && (a24==1)) && (a15==9))) [L372] COND FALSE !((((((input == 1) && (((a21==7) || (a21==8)) || (a21==9))) && (a15==9)) && a12 <= -43 ) && (a24==1))) [L378] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && ((-43 < a12) && (11 >= a12)) ) && (a21==8))))) [L384] COND FALSE !((((a24==1) && ((a15==9) && ((input == 5) && ((a21==8) || ((a21==6) || (a21==7)))))) && ((11 < a12) && (80 >= a12)) )) [L390] COND FALSE !(((((a15==8) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 5))) && ((-43 < a12) && (11 >= a12)) ) && (a24==1))) [L396] COND FALSE !(((a15==9) && ((((input == 3) && (((a21==6) || (a21==7)) || (a21==8))) && (a24==1)) && ((11 < a12) && (80 >= a12)) ))) [L402] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 3)))) && (a24==1))) [L408] COND FALSE !(((a15==9) && ((a24==1) && ((((a21==9) || (a21==10)) && (input == 5)) && ((-43 < a12) && (11 >= a12)) )))) [L414] COND FALSE !(( ((11 < a12) && (80 >= a12)) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 4))) && (a15==9)))) [L420] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && 80 < a12 ) && (a21==9))))) [L426] COND FALSE !((((a24==1) && (((input == 2) && ((a21==10) || ((a21==8) || (a21==9)))) && a12 <= -43 )) && (a15==8))) [L432] COND FALSE !(((a24==1) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))))) && (a15==9)))) [L438] COND FALSE !((((((input == 6) && ((a21==9) || ((a21==7) || (a21==8)))) && (a24==1)) && (a15==9)) && a12 <= -43 )) [L444] COND TRUE ((( a12 <= -43 && ((input == 6) && ((a21==10) || ((a21==8) || (a21==9))))) && (a24==1)) && (a15==8)) [L445] a12 = ((((a12 % 26)+ -1) / 5) / 5) [L446] a21 = 7 [L448] RET return 25; [L888] EXPR calculate_output(input) [L888] output = calculate_output(input) [L880] COND TRUE 1 [L883] int input; [L884] input = __VERIFIER_nondet_int() [L885] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L888] CALL, EXPR calculate_output(input) [L21] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) [L24] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) [L27] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L30] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) [L33] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L36] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L39] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L42] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) [L45] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) [L48] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) [L51] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L54] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) [L57] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) [L60] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) [L63] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) [L66] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L69] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L72] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L75] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L78] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) [L81] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) [L84] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) [L87] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L90] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L93] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) [L96] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) [L99] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) [L102] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L105] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) [L108] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L111] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L114] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L117] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L120] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L123] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) [L126] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L129] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) [L132] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L135] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) [L138] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L141] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) [L144] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L147] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) [L150] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L153] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) [L156] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) [L159] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L162] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) [L165] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) [L168] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L171] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) [L174] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) [L177] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L180] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L183] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) [L186] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L189] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) [L192] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L195] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L198] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) [L201] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L205] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) [L211] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) [L217] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) [L223] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) [L229] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) [L235] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) [L241] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) [L247] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) [L252] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8))) [L258] COND FALSE !(((a15==9) && (((input == 1) && ((( a12 <= -43 && (a21==10)) || ((a21==6) && ((-43 < a12) && (11 >= a12)) )) || ( ((-43 < a12) && (11 >= a12)) && (a21==7)))) && (a24==1)))) [L264] COND FALSE !((((a24==1) && (((input == 6) && ((a21==7) || (a21==8))) && 80 < a12 )) && (a15==9))) [L269] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((a15==9) && ((a24==1) && (((a21==9) || (a21==10)) && (input == 2)))))) [L275] COND FALSE !((((((input == 5) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a21==9)) && (a24==1))) [L280] COND FALSE !((( 80 < a12 && ((a15==8) && (((a21==8) || (a21==9)) && (input == 3)))) && (a24==1))) [L286] COND FALSE !(((input == 4) && ((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((a21==6) && ((a15==5) && ((a24==2) && a12 <= -43 )))))) [L293] COND FALSE !(((((a24==1) && ((input == 3) && a12 <= -43 )) && (a21==7)) && (a15==8))) [L299] COND FALSE !(((a24==1) && (((( 80 < a12 && (a15==8)) && (a21==10)) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 3)))) [L305] COND FALSE !((((a24==1) && ((a15==9) && (((a21==7) || (a21==8)) && (input == 3)))) && 80 < a12 )) [L311] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 5)) && a12 <= -43 ) && (a15==8)) && (a24==1))) [L317] COND FALSE !(((((a15==9) && ((input == 1) && (a21==8))) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) [L323] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 3)) && (a15==8)) && a12 <= -43 ) && (a24==1))) [L329] COND FALSE !(((a24==1) && (((a15==8) && ((input == 1) && (a21==9))) && ((11 < a12) && (80 >= a12)) ))) [L335] COND FALSE !(((a15==9) && ( 80 < a12 && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) [L341] COND FALSE !(( 80 < a12 && ((a15==9) && (((input == 2) && ((a21==7) || (a21==8))) && (a24==1))))) [L347] COND FALSE !((((((input == 6) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8)) && (a24==1))) [L353] COND FALSE !(((((a24==1) && ((input == 1) && ((a21==8) || ((a21==6) || (a21==7))))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) [L359] COND FALSE !(((((a21==10) && (( 80 < a12 && (a24==1)) && (a15==9))) || (((a15==5) && ((a24==2) && a12 <= -43 )) && (a21==6))) && (input == 3))) [L366] COND FALSE !(((((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 5)) && (a24==1)) && (a15==9))) [L372] COND FALSE !((((((input == 1) && (((a21==7) || (a21==8)) || (a21==9))) && (a15==9)) && a12 <= -43 ) && (a24==1))) [L378] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && ((-43 < a12) && (11 >= a12)) ) && (a21==8))))) [L384] COND FALSE !((((a24==1) && ((a15==9) && ((input == 5) && ((a21==8) || ((a21==6) || (a21==7)))))) && ((11 < a12) && (80 >= a12)) )) [L390] COND FALSE !(((((a15==8) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 5))) && ((-43 < a12) && (11 >= a12)) ) && (a24==1))) [L396] COND FALSE !(((a15==9) && ((((input == 3) && (((a21==6) || (a21==7)) || (a21==8))) && (a24==1)) && ((11 < a12) && (80 >= a12)) ))) [L402] COND TRUE (( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 3)))) && (a24==1)) [L403] a12 = (((a12 - 239513) * 2) - 118149) [L404] a15 = 5 [L405] a21 = 6 [L407] RET return -1; [L888] EXPR calculate_output(input) [L888] output = calculate_output(input) [L880] COND TRUE 1 [L883] int input; [L884] input = __VERIFIER_nondet_int() [L885] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L888] CALL calculate_output(input) [L21] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) [L24] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) [L27] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L30] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) [L33] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L36] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L39] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L42] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) [L45] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) [L48] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) [L51] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L54] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) [L57] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) [L60] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) [L63] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) [L66] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L69] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L72] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L75] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L78] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) [L81] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) [L84] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) [L87] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L90] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L93] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) [L96] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) [L99] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) [L102] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L105] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) [L108] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L111] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L114] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L117] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L120] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L123] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) [L126] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L129] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) [L132] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L135] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) [L138] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L141] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) [L144] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L147] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) [L150] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L153] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) [L156] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) [L159] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L162] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) [L165] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) [L168] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L171] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) [L174] COND TRUE ((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7)) [L175] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 255 locations, 1 error locations. UNKNOWN Result, 243.3s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 54.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1637 SDtfs, 7247 SDslu, 1919 SDs, 0 SdLazy, 14701 SolverSat, 2162 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 47.6s Time, PredicateUnifierStatistics: 14 DeclaredPredicates, 1715 GetRequests, 1439 SyntacticMatches, 156 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1488 ImplicationChecksByTransitivity, 7.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2184occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 165.2s AbstIntTime, 8 AbstIntIterations, 7 AbstIntStrong, 0.9953188549006126 AbsIntWeakeningRatio, 0.10265700483091787 AbsIntAvgWeakeningVarsNumRemoved, 577.8109903381643 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 7 MinimizatonAttempts, 236 StatesRemovedByMinimization, 7 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/Problem14_label55_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-15_12-15-48-442.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem14_label55_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-15_12-15-48-442.csv Completed graceful shutdown