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_INT-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label47_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 06:20:26,266 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 06:20:26,268 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 06:20:26,284 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 06:20:26,284 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 06:20:26,286 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 06:20:26,288 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 06:20:26,291 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 06:20:26,292 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 06:20:26,293 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 06:20:26,295 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 06:20:26,296 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 06:20:26,297 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 06:20:26,298 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 06:20:26,301 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 06:20:26,307 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 06:20:26,310 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 06:20:26,312 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 06:20:26,317 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 06:20:26,318 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 06:20:26,322 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 06:20:26,323 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 06:20:26,327 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 06:20:26,327 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 06:20:26,327 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 06:20:26,328 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 06:20:26,330 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 06:20:26,331 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 06:20:26,332 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 06:20:26,335 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 06:20:26,335 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 06:20:26,336 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 06:20:26,336 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 06:20:26,336 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 06:20:26,337 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 06:20:26,339 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 06:20:26,340 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_INT-OldIcfg.epf [2018-09-19 06:20:26,370 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 06:20:26,370 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 06:20:26,371 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 06:20:26,371 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 06:20:26,371 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 06:20:26,372 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 06:20:26,372 INFO L133 SettingsManager]: * Congruence Domain=false [2018-09-19 06:20:26,372 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 06:20:26,372 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-19 06:20:26,372 INFO L133 SettingsManager]: * Abstract domain=IntervalDomain [2018-09-19 06:20:26,373 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 06:20:26,373 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 06:20:26,373 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 06:20:26,374 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 06:20:26,374 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 06:20:26,374 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 06:20:26,375 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 06:20:26,375 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 06:20:26,375 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 06:20:26,375 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 06:20:26,375 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 06:20:26,376 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 06:20:26,376 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 06:20:26,376 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 06:20:26,376 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 06:20:26,377 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 06:20:26,377 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 06:20:26,377 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 06:20:26,377 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 06:20:26,377 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 06:20:26,378 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 06:20:26,378 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 06:20:26,378 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 06:20:26,378 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 06:20:26,378 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 06:20:26,424 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 06:20:26,439 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 06:20:26,445 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 06:20:26,447 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 06:20:26,447 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 06:20:26,448 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label47_true-unreach-call_false-termination.c [2018-09-19 06:20:26,797 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8df8470cf/9a051659fae64246a4f48b16240507b2/FLAG06c1cbb7b [2018-09-19 06:20:27,083 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 06:20:27,084 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label47_true-unreach-call_false-termination.c [2018-09-19 06:20:27,106 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8df8470cf/9a051659fae64246a4f48b16240507b2/FLAG06c1cbb7b [2018-09-19 06:20:27,129 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8df8470cf/9a051659fae64246a4f48b16240507b2 [2018-09-19 06:20:27,142 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 06:20:27,146 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 06:20:27,147 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 06:20:27,147 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 06:20:27,157 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 06:20:27,158 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 06:20:27" (1/1) ... [2018-09-19 06:20:27,161 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17281938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:20:27, skipping insertion in model container [2018-09-19 06:20:27,161 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 06:20:27" (1/1) ... [2018-09-19 06:20:27,174 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 06:20:27,784 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 06:20:27,803 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 06:20:28,033 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 06:20:28,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:20:28 WrapperNode [2018-09-19 06:20:28,088 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 06:20:28,089 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 06:20:28,090 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 06:20:28,090 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 06:20:28,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:20:28" (1/1) ... [2018-09-19 06:20:28,128 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:20:28" (1/1) ... [2018-09-19 06:20:28,193 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 06:20:28,193 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 06:20:28,194 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 06:20:28,194 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 06:20:28,359 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:20:28" (1/1) ... [2018-09-19 06:20:28,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:20:28" (1/1) ... [2018-09-19 06:20:28,364 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:20:28" (1/1) ... [2018-09-19 06:20:28,364 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:20:28" (1/1) ... [2018-09-19 06:20:28,398 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:20:28" (1/1) ... [2018-09-19 06:20:28,419 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:20:28" (1/1) ... [2018-09-19 06:20:28,426 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:20:28" (1/1) ... [2018-09-19 06:20:28,438 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 06:20:28,439 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 06:20:28,439 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 06:20:28,439 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 06:20:28,440 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:20:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 06:20:28,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 06:20:28,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 06:20:28,508 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 06:20:28,509 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 06:20:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 06:20:28,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 06:20:28,509 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 06:20:28,510 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 06:20:32,235 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 06:20:32,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 06:20:32 BoogieIcfgContainer [2018-09-19 06:20:32,236 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 06:20:32,238 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 06:20:32,238 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 06:20:32,242 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 06:20:32,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 06:20:27" (1/3) ... [2018-09-19 06:20:32,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e666db6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 06:20:32, skipping insertion in model container [2018-09-19 06:20:32,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:20:28" (2/3) ... [2018-09-19 06:20:32,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e666db6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 06:20:32, skipping insertion in model container [2018-09-19 06:20:32,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 06:20:32" (3/3) ... [2018-09-19 06:20:32,247 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label47_true-unreach-call_false-termination.c [2018-09-19 06:20:32,256 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 06:20:32,264 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 06:20:32,317 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 06:20:32,318 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 06:20:32,319 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 06:20:32,319 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 06:20:32,319 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 06:20:32,319 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 06:20:32,319 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 06:20:32,320 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 06:20:32,320 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 06:20:32,347 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2018-09-19 06:20:32,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-19 06:20:32,357 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:20:32,358 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] [2018-09-19 06:20:32,360 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:20:32,365 INFO L82 PathProgramCache]: Analyzing trace with hash -312611828, now seen corresponding path program 1 times [2018-09-19 06:20:32,367 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:20:32,368 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-09-19 06:20:32,371 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], [221], [223], [952], [956], [962], [966], [973], [974], [975], [977] [2018-09-19 06:20:32,413 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:20:32,413 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:20:32,625 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:20:32,629 INFO L272 AbstractInterpreter]: Visited 39 different actions 39 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-19 06:20:32,675 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:20:32,801 INFO L232 lantSequenceWeakener]: Weakened 37 states. On average, predicates are now at 79.56% of their original sizes. [2018-09-19 06:20:32,801 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:20:33,048 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:20:33,050 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:20:33,050 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 06:20:33,050 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:20:33,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 06:20:33,065 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 06:20:33,066 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 06:20:33,069 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 6 states. [2018-09-19 06:20:35,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:20:35,704 INFO L93 Difference]: Finished difference Result 693 states and 1229 transitions. [2018-09-19 06:20:35,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 06:20:35,706 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-09-19 06:20:35,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:20:35,724 INFO L225 Difference]: With dead ends: 693 [2018-09-19 06:20:35,725 INFO L226 Difference]: Without dead ends: 436 [2018-09-19 06:20:35,732 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 06:20:35,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-09-19 06:20:35,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 434. [2018-09-19 06:20:35,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-09-19 06:20:35,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 615 transitions. [2018-09-19 06:20:35,809 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 615 transitions. Word has length 40 [2018-09-19 06:20:35,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:20:35,810 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 615 transitions. [2018-09-19 06:20:35,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 06:20:35,810 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 615 transitions. [2018-09-19 06:20:35,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-09-19 06:20:35,817 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:20:35,817 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:20:35,818 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:20:35,818 INFO L82 PathProgramCache]: Analyzing trace with hash 703392059, now seen corresponding path program 1 times [2018-09-19 06:20:35,818 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:20:35,819 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 126 with the following transitions: [2018-09-19 06:20:35,819 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], [221], [223], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [554], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-09-19 06:20:35,826 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:20:35,826 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:20:36,013 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:20:36,013 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-19 06:20:36,053 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:20:36,267 INFO L232 lantSequenceWeakener]: Weakened 122 states. On average, predicates are now at 78.04% of their original sizes. [2018-09-19 06:20:36,267 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:20:36,816 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:20:36,816 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:20:36,818 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:20:36,818 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:20:36,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:20:36,819 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:20:36,820 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:20:36,820 INFO L87 Difference]: Start difference. First operand 434 states and 615 transitions. Second operand 10 states. [2018-09-19 06:20:41,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:20:41,478 INFO L93 Difference]: Finished difference Result 874 states and 1407 transitions. [2018-09-19 06:20:41,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-19 06:20:41,482 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 125 [2018-09-19 06:20:41,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:20:41,488 INFO L225 Difference]: With dead ends: 874 [2018-09-19 06:20:41,489 INFO L226 Difference]: Without dead ends: 629 [2018-09-19 06:20:41,491 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 131 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 06:20:41,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-09-19 06:20:41,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 626. [2018-09-19 06:20:41,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-09-19 06:20:41,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 822 transitions. [2018-09-19 06:20:41,531 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 822 transitions. Word has length 125 [2018-09-19 06:20:41,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:20:41,532 INFO L480 AbstractCegarLoop]: Abstraction has 626 states and 822 transitions. [2018-09-19 06:20:41,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:20:41,532 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 822 transitions. [2018-09-19 06:20:41,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-09-19 06:20:41,536 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:20:41,537 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:20:41,537 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:20:41,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1822151769, now seen corresponding path program 1 times [2018-09-19 06:20:41,538 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:20:41,538 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 152 with the following transitions: [2018-09-19 06:20:41,539 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], [221], [223], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-09-19 06:20:41,544 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:20:41,544 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:20:41,678 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:20:41,678 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-19 06:20:41,715 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:20:41,839 INFO L232 lantSequenceWeakener]: Weakened 148 states. On average, predicates are now at 77.91% of their original sizes. [2018-09-19 06:20:41,839 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:20:42,286 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:20:42,286 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:20:42,286 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:20:42,288 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:20:42,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:20:42,290 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:20:42,290 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:20:42,290 INFO L87 Difference]: Start difference. First operand 626 states and 822 transitions. Second operand 10 states. [2018-09-19 06:20:44,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:20:44,673 INFO L93 Difference]: Finished difference Result 1059 states and 1606 transitions. [2018-09-19 06:20:44,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-19 06:20:44,675 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 151 [2018-09-19 06:20:44,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:20:44,680 INFO L225 Difference]: With dead ends: 1059 [2018-09-19 06:20:44,681 INFO L226 Difference]: Without dead ends: 814 [2018-09-19 06:20:44,682 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 157 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 06:20:44,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2018-09-19 06:20:44,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 811. [2018-09-19 06:20:44,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2018-09-19 06:20:44,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1020 transitions. [2018-09-19 06:20:44,718 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1020 transitions. Word has length 151 [2018-09-19 06:20:44,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:20:44,719 INFO L480 AbstractCegarLoop]: Abstraction has 811 states and 1020 transitions. [2018-09-19 06:20:44,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:20:44,719 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1020 transitions. [2018-09-19 06:20:44,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-09-19 06:20:44,734 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:20:44,738 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:20:44,738 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:20:44,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1431093608, now seen corresponding path program 1 times [2018-09-19 06:20:44,739 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:20:44,739 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 237 with the following transitions: [2018-09-19 06:20:44,739 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], [221], [223], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [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-19 06:20:44,747 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:20:44,747 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:20:44,918 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:20:44,918 INFO L272 AbstractInterpreter]: Visited 119 different actions 351 times. Merged at 7 different actions 16 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 06:20:44,956 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:20:45,190 INFO L232 lantSequenceWeakener]: Weakened 233 states. On average, predicates are now at 77.71% of their original sizes. [2018-09-19 06:20:45,192 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:20:45,379 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:20:45,379 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:20:45,380 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:20:45,380 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:20:45,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:20:45,381 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:20:45,381 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:20:45,382 INFO L87 Difference]: Start difference. First operand 811 states and 1020 transitions. Second operand 10 states. [2018-09-19 06:20:49,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:20:49,434 INFO L93 Difference]: Finished difference Result 1262 states and 1823 transitions. [2018-09-19 06:20:49,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-19 06:20:49,441 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 236 [2018-09-19 06:20:49,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:20:49,447 INFO L225 Difference]: With dead ends: 1262 [2018-09-19 06:20:49,447 INFO L226 Difference]: Without dead ends: 1017 [2018-09-19 06:20:49,449 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 242 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 06:20:49,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2018-09-19 06:20:49,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 1012. [2018-09-19 06:20:49,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1012 states. [2018-09-19 06:20:49,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1251 transitions. [2018-09-19 06:20:49,485 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1251 transitions. Word has length 236 [2018-09-19 06:20:49,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:20:49,486 INFO L480 AbstractCegarLoop]: Abstraction has 1012 states and 1251 transitions. [2018-09-19 06:20:49,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:20:49,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1251 transitions. [2018-09-19 06:20:49,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-09-19 06:20:49,493 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:20:49,494 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-19 06:20:49,494 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:20:49,494 INFO L82 PathProgramCache]: Analyzing trace with hash -2064776965, now seen corresponding path program 1 times [2018-09-19 06:20:49,495 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:20:49,495 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 262 with the following transitions: [2018-09-19 06:20:49,495 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], [221], [223], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-09-19 06:20:49,503 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:20:49,503 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:20:49,615 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:20:51,339 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:20:51,340 INFO L272 AbstractInterpreter]: Visited 119 different actions 463 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 06:20:51,348 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:20:51,799 INFO L232 lantSequenceWeakener]: Weakened 258 states. On average, predicates are now at 77.67% of their original sizes. [2018-09-19 06:20:51,800 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:20:51,919 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:20:51,919 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:20:51,919 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:20:51,919 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:20:51,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:20:51,920 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:20:51,920 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:20:51,921 INFO L87 Difference]: Start difference. First operand 1012 states and 1251 transitions. Second operand 10 states. [2018-09-19 06:20:55,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:20:55,429 INFO L93 Difference]: Finished difference Result 1451 states and 2041 transitions. [2018-09-19 06:20:55,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-19 06:20:55,436 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 261 [2018-09-19 06:20:55,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:20:55,447 INFO L225 Difference]: With dead ends: 1451 [2018-09-19 06:20:55,447 INFO L226 Difference]: Without dead ends: 1206 [2018-09-19 06:20:55,449 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 268 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:20:55,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2018-09-19 06:20:55,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 1199. [2018-09-19 06:20:55,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1199 states. [2018-09-19 06:20:55,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1469 transitions. [2018-09-19 06:20:55,486 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1469 transitions. Word has length 261 [2018-09-19 06:20:55,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:20:55,487 INFO L480 AbstractCegarLoop]: Abstraction has 1199 states and 1469 transitions. [2018-09-19 06:20:55,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:20:55,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1469 transitions. [2018-09-19 06:20:55,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-09-19 06:20:55,493 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:20:55,494 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:20:55,494 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:20:55,494 INFO L82 PathProgramCache]: Analyzing trace with hash -940963441, now seen corresponding path program 1 times [2018-09-19 06:20:55,495 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:20:55,495 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 340 with the following transitions: [2018-09-19 06:20:55,495 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], [221], [223], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-09-19 06:20:55,507 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:20:55,507 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:20:55,610 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:20:56,758 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-19 06:20:56,758 INFO L272 AbstractInterpreter]: Visited 121 different actions 591 times. Merged at 8 different actions 33 times. Never widened. Found 8 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 06:20:56,764 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 06:20:56,811 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 06:20:56,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 06:20:56 BoogieIcfgContainer [2018-09-19 06:20:56,812 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 06:20:56,815 INFO L168 Benchmark]: Toolchain (without parser) took 29670.37 ms. Allocated memory was 1.6 GB in the beginning and 2.8 GB in the end (delta: 1.3 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -736.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-09-19 06:20:56,818 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 06:20:56,818 INFO L168 Benchmark]: CACSL2BoogieTranslator took 942.06 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-19 06:20:56,819 INFO L168 Benchmark]: Boogie Procedure Inliner took 103.86 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-19 06:20:56,820 INFO L168 Benchmark]: Boogie Preprocessor took 245.19 ms. Allocated memory was 1.6 GB in the beginning and 2.4 GB in the end (delta: 802.2 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -905.2 MB). Peak memory consumption was 33.0 MB. Max. memory is 7.1 GB. [2018-09-19 06:20:56,821 INFO L168 Benchmark]: RCFGBuilder took 3797.62 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 132.3 MB). Peak memory consumption was 132.3 MB. Max. memory is 7.1 GB. [2018-09-19 06:20:56,821 INFO L168 Benchmark]: TraceAbstraction took 24574.21 ms. Allocated memory was 2.4 GB in the beginning and 2.8 GB in the end (delta: 461.4 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -16.9 MB). Peak memory consumption was 997.9 MB. Max. memory is 7.1 GB. [2018-09-19 06:20:56,826 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 942.06 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 103.86 ms. Allocated memory is still 1.6 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 245.19 ms. Allocated memory was 1.6 GB in the beginning and 2.4 GB in the end (delta: 802.2 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -905.2 MB). Peak memory consumption was 33.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3797.62 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 132.3 MB). Peak memory consumption was 132.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 24574.21 ms. Allocated memory was 2.4 GB in the beginning and 2.8 GB in the end (delta: 461.4 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -16.9 MB). Peak memory consumption was 997.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 103]: 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 TRUE ((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8)) [L253] a12 = ((((a12 - 438298) * 1) + 564710) - 684902) [L254] a15 = 5 [L255] a21 = 6 [L257] 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 TRUE ((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9)) [L103] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 255 locations, 1 error locations. UNKNOWN Result, 24.5s OverallTime, 6 OverallIterations, 4 TraceHistogramMax, 17.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1188 SDtfs, 3573 SDslu, 1695 SDs, 0 SdLazy, 10389 SolverSat, 944 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.3s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 837 GetRequests, 772 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1199occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.0s AbstIntTime, 6 AbstIntIterations, 5 AbstIntStrong, 0.996791973452004 AbsIntWeakeningRatio, 0.1311881188118812 AbsIntAvgWeakeningVarsNumRemoved, 19.448019801980198 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 20 StatesRemovedByMinimization, 5 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_label47_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_INT-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_06-20-56-843.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem14_label47_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_INT-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_06-20-56-843.csv Received shutdown request...