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_INTCON-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem17_label22_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 13:11:25,483 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 13:11:25,485 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 13:11:25,497 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 13:11:25,498 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 13:11:25,499 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 13:11:25,501 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 13:11:25,504 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 13:11:25,505 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 13:11:25,508 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 13:11:25,509 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 13:11:25,510 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 13:11:25,514 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 13:11:25,515 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 13:11:25,518 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 13:11:25,519 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 13:11:25,520 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 13:11:25,522 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 13:11:25,530 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 13:11:25,532 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 13:11:25,533 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 13:11:25,538 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 13:11:25,544 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 13:11:25,545 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 13:11:25,545 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 13:11:25,546 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 13:11:25,547 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 13:11:25,548 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 13:11:25,548 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 13:11:25,549 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 13:11:25,549 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 13:11:25,550 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 13:11:25,550 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 13:11:25,551 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 13:11:25,552 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 13:11:25,552 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 13:11:25,553 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf [2018-09-19 13:11:25,568 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 13:11:25,569 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 13:11:25,570 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 13:11:25,570 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 13:11:25,570 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 13:11:25,570 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 13:11:25,571 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 13:11:25,571 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-19 13:11:25,571 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-19 13:11:25,571 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 13:11:25,571 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 13:11:25,571 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 13:11:25,572 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 13:11:25,572 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 13:11:25,573 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 13:11:25,573 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 13:11:25,573 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 13:11:25,573 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 13:11:25,573 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 13:11:25,574 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 13:11:25,574 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 13:11:25,574 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 13:11:25,574 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 13:11:25,574 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 13:11:25,574 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 13:11:25,575 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 13:11:25,575 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 13:11:25,575 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 13:11:25,575 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 13:11:25,575 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 13:11:25,576 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 13:11:25,576 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 13:11:25,576 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 13:11:25,576 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 13:11:25,619 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 13:11:25,632 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 13:11:25,639 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 13:11:25,641 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 13:11:25,641 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 13:11:25,642 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label22_true-unreach-call.c [2018-09-19 13:11:25,977 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a7ca5a0e/afbf4d9209c941f7a75e7191c78c6722/FLAG60e053e38 [2018-09-19 13:11:26,485 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 13:11:26,486 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label22_true-unreach-call.c [2018-09-19 13:11:26,517 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a7ca5a0e/afbf4d9209c941f7a75e7191c78c6722/FLAG60e053e38 [2018-09-19 13:11:26,539 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a7ca5a0e/afbf4d9209c941f7a75e7191c78c6722 [2018-09-19 13:11:26,551 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 13:11:26,558 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 13:11:26,559 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 13:11:26,560 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 13:11:26,569 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 13:11:26,570 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 01:11:26" (1/1) ... [2018-09-19 13:11:26,574 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a64aa8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:11:26, skipping insertion in model container [2018-09-19 13:11:26,574 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 01:11:26" (1/1) ... [2018-09-19 13:11:26,588 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 13:11:27,711 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 13:11:27,733 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 13:11:28,120 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 13:11:28,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:11:28 WrapperNode [2018-09-19 13:11:28,376 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 13:11:28,377 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 13:11:28,377 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 13:11:28,377 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 13:11:28,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:11:28" (1/1) ... [2018-09-19 13:11:28,468 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:11:28" (1/1) ... [2018-09-19 13:11:28,658 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 13:11:28,659 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 13:11:28,659 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 13:11:28,659 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 13:11:29,217 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:11:28" (1/1) ... [2018-09-19 13:11:29,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:11:28" (1/1) ... [2018-09-19 13:11:29,243 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:11:28" (1/1) ... [2018-09-19 13:11:29,243 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:11:28" (1/1) ... [2018-09-19 13:11:29,327 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:11:28" (1/1) ... [2018-09-19 13:11:29,350 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:11:28" (1/1) ... [2018-09-19 13:11:29,417 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:11:28" (1/1) ... [2018-09-19 13:11:29,482 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 13:11:29,482 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 13:11:29,482 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 13:11:29,483 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 13:11:29,484 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:11: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 13:11:29,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 13:11:29,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 13:11:29,558 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-09-19 13:11:29,558 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-09-19 13:11:29,558 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 13:11:29,558 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 13:11:29,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 13:11:29,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 13:11:29,559 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 13:11:29,559 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 13:11:44,515 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 13:11:44,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 01:11:44 BoogieIcfgContainer [2018-09-19 13:11:44,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 13:11:44,517 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 13:11:44,518 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 13:11:44,521 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 13:11:44,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 01:11:26" (1/3) ... [2018-09-19 13:11:44,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b721b66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 01:11:44, skipping insertion in model container [2018-09-19 13:11:44,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 01:11:28" (2/3) ... [2018-09-19 13:11:44,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b721b66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 01:11:44, skipping insertion in model container [2018-09-19 13:11:44,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 01:11:44" (3/3) ... [2018-09-19 13:11:44,526 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label22_true-unreach-call.c [2018-09-19 13:11:44,537 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 13:11:44,547 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 13:11:44,619 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 13:11:44,620 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 13:11:44,620 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 13:11:44,621 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 13:11:44,621 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 13:11:44,621 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 13:11:44,621 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 13:11:44,621 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 13:11:44,621 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 13:11:44,669 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states. [2018-09-19 13:11:44,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-19 13:11:44,679 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 13:11:44,681 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] [2018-09-19 13:11:44,682 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 13:11:44,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1623542220, now seen corresponding path program 1 times [2018-09-19 13:11:44,690 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 13:11:44,692 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 59 with the following transitions: [2018-09-19 13:11:44,694 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [806], [814], [822], [830], [838], [846], [854], [862], [870], [878], [886], [894], [902], [910], [918], [926], [934], [942], [950], [958], [966], [974], [982], [990], [998], [1006], [1014], [1022], [1030], [1038], [1046], [1054], [1062], [1070], [1074], [1076], [2283], [2287], [2293], [2297], [2306], [2307], [2308], [2310] [2018-09-19 13:11:44,745 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 13:11:44,746 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 13:11:45,092 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 13:11:45,097 INFO L272 AbstractInterpreter]: Visited 57 different actions 57 times. Never merged. Never widened. Never found a fixpoint. Largest state had 25 variables. [2018-09-19 13:11:45,144 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 13:11:45,400 INFO L232 lantSequenceWeakener]: Weakened 55 states. On average, predicates are now at 77.51% of their original sizes. [2018-09-19 13:11:45,400 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 13:11:45,664 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 13:11:45,669 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 13:11:45,669 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 13:11:45,670 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 13:11:45,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 13:11:45,683 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 13:11:45,684 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 13:11:45,687 INFO L87 Difference]: Start difference. First operand 604 states. Second operand 6 states. [2018-09-19 13:11:55,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 13:11:55,555 INFO L93 Difference]: Finished difference Result 1642 states and 3016 transitions. [2018-09-19 13:11:55,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 13:11:55,557 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-09-19 13:11:55,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 13:11:55,580 INFO L225 Difference]: With dead ends: 1642 [2018-09-19 13:11:55,580 INFO L226 Difference]: Without dead ends: 1036 [2018-09-19 13:11:55,588 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 57 GetRequests, 53 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 13:11:55,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2018-09-19 13:11:55,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1034. [2018-09-19 13:11:55,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1034 states. [2018-09-19 13:11:55,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1511 transitions. [2018-09-19 13:11:55,699 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1511 transitions. Word has length 58 [2018-09-19 13:11:55,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 13:11:55,700 INFO L480 AbstractCegarLoop]: Abstraction has 1034 states and 1511 transitions. [2018-09-19 13:11:55,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 13:11:55,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1511 transitions. [2018-09-19 13:11:55,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-09-19 13:11:55,714 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 13:11:55,715 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:11:55,715 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 13:11:55,715 INFO L82 PathProgramCache]: Analyzing trace with hash 429401034, now seen corresponding path program 1 times [2018-09-19 13:11:55,716 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 13:11:55,716 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 134 with the following transitions: [2018-09-19 13:11:55,717 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [806], [814], [822], [830], [838], [846], [854], [862], [870], [878], [886], [894], [902], [910], [918], [926], [934], [942], [950], [958], [966], [974], [982], [990], [998], [1006], [1014], [1022], [1030], [1038], [1046], [1054], [1062], [1070], [1074], [1076], [1079], [1087], [1095], [1103], [1111], [1119], [1127], [1135], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1223], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-09-19 13:11:55,730 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 13:11:55,730 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 13:11:55,861 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 13:11:56,193 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 13:11:56,194 INFO L272 AbstractInterpreter]: Visited 82 different actions 233 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-09-19 13:11:56,231 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 13:11:56,602 INFO L232 lantSequenceWeakener]: Weakened 130 states. On average, predicates are now at 76.13% of their original sizes. [2018-09-19 13:11:56,602 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 13:11:57,137 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 13:11:57,138 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 13:11:57,138 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 13:11:57,138 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 13:11:57,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 13:11:57,139 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 13:11:57,140 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 13:11:57,140 INFO L87 Difference]: Start difference. First operand 1034 states and 1511 transitions. Second operand 10 states. [2018-09-19 13:12:08,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 13:12:08,595 INFO L93 Difference]: Finished difference Result 2098 states and 3472 transitions. [2018-09-19 13:12:08,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-19 13:12:08,596 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 133 [2018-09-19 13:12:08,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 13:12:08,605 INFO L225 Difference]: With dead ends: 2098 [2018-09-19 13:12:08,605 INFO L226 Difference]: Without dead ends: 1504 [2018-09-19 13:12:08,609 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 139 GetRequests, 124 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 13:12:08,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2018-09-19 13:12:08,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1499. [2018-09-19 13:12:08,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1499 states. [2018-09-19 13:12:08,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 2017 transitions. [2018-09-19 13:12:08,659 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 2017 transitions. Word has length 133 [2018-09-19 13:12:08,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 13:12:08,660 INFO L480 AbstractCegarLoop]: Abstraction has 1499 states and 2017 transitions. [2018-09-19 13:12:08,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 13:12:08,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 2017 transitions. [2018-09-19 13:12:08,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-09-19 13:12:08,665 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 13:12:08,665 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:12:08,665 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 13:12:08,666 INFO L82 PathProgramCache]: Analyzing trace with hash -499815646, now seen corresponding path program 1 times [2018-09-19 13:12:08,666 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 13:12:08,666 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 147 with the following transitions: [2018-09-19 13:12:08,667 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [806], [814], [822], [830], [838], [846], [854], [862], [870], [878], [886], [894], [902], [910], [918], [926], [934], [942], [950], [958], [966], [974], [982], [990], [998], [1006], [1014], [1022], [1030], [1038], [1046], [1054], [1062], [1070], [1074], [1076], [1079], [1087], [1095], [1103], [1111], [1119], [1127], [1135], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1224], [1228], [1232], [1236], [1240], [1244], [1255], [1259], [1263], [1267], [1271], [1275], [1279], [1282], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-09-19 13:12:08,671 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 13:12:08,671 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 13:12:08,761 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 13:12:08,953 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 13:12:08,953 INFO L272 AbstractInterpreter]: Visited 95 different actions 272 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-09-19 13:12:08,989 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 13:12:09,272 INFO L232 lantSequenceWeakener]: Weakened 143 states. On average, predicates are now at 76.02% of their original sizes. [2018-09-19 13:12:09,272 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 13:12:10,053 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 13:12:10,053 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 13:12:10,054 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 13:12:10,054 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 13:12:10,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 13:12:10,055 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 13:12:10,055 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 13:12:10,055 INFO L87 Difference]: Start difference. First operand 1499 states and 2017 transitions. Second operand 10 states. [2018-09-19 13:12:26,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 13:12:26,138 INFO L93 Difference]: Finished difference Result 2577 states and 4007 transitions. [2018-09-19 13:12:26,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-19 13:12:26,144 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 146 [2018-09-19 13:12:26,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 13:12:26,155 INFO L225 Difference]: With dead ends: 2577 [2018-09-19 13:12:26,155 INFO L226 Difference]: Without dead ends: 1983 [2018-09-19 13:12:26,158 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 152 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 13:12:26,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1983 states. [2018-09-19 13:12:26,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1983 to 1972. [2018-09-19 13:12:26,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1972 states. [2018-09-19 13:12:26,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1972 states to 1972 states and 2679 transitions. [2018-09-19 13:12:26,210 INFO L78 Accepts]: Start accepts. Automaton has 1972 states and 2679 transitions. Word has length 146 [2018-09-19 13:12:26,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 13:12:26,210 INFO L480 AbstractCegarLoop]: Abstraction has 1972 states and 2679 transitions. [2018-09-19 13:12:26,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 13:12:26,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1972 states and 2679 transitions. [2018-09-19 13:12:26,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-09-19 13:12:26,217 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 13:12:26,218 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, 2, 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] [2018-09-19 13:12:26,218 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 13:12:26,218 INFO L82 PathProgramCache]: Analyzing trace with hash -217792344, now seen corresponding path program 1 times [2018-09-19 13:12:26,218 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 13:12:26,218 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 223 with the following transitions: [2018-09-19 13:12:26,219 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [806], [814], [822], [830], [838], [846], [854], [862], [870], [878], [886], [894], [902], [910], [918], [926], [934], [942], [950], [958], [966], [974], [982], [990], [998], [1006], [1014], [1022], [1030], [1038], [1046], [1054], [1062], [1070], [1074], [1076], [1079], [1087], [1095], [1103], [1111], [1119], [1127], [1135], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1224], [1227], [1228], [1232], [1236], [1240], [1244], [1255], [1259], [1263], [1267], [1271], [1275], [1279], [1282], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-09-19 13:12:26,223 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 13:12:26,223 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 13:12:26,293 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 13:12:30,972 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 13:12:30,973 INFO L272 AbstractInterpreter]: Visited 96 different actions 371 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 26 variables. [2018-09-19 13:12:30,984 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 13:12:32,411 INFO L232 lantSequenceWeakener]: Weakened 219 states. On average, predicates are now at 75.71% of their original sizes. [2018-09-19 13:12:32,411 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 13:12:32,946 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 13:12:32,947 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 13:12:32,947 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 13:12:32,947 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 13:12:32,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 13:12:32,948 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 13:12:32,948 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 13:12:32,949 INFO L87 Difference]: Start difference. First operand 1972 states and 2679 transitions. Second operand 10 states. [2018-09-19 13:12:48,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 13:12:48,089 INFO L93 Difference]: Finished difference Result 3075 states and 4702 transitions. [2018-09-19 13:12:48,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-19 13:12:48,097 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 222 [2018-09-19 13:12:48,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 13:12:48,112 INFO L225 Difference]: With dead ends: 3075 [2018-09-19 13:12:48,112 INFO L226 Difference]: Without dead ends: 2481 [2018-09-19 13:12:48,116 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 228 GetRequests, 213 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 13:12:48,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2481 states. [2018-09-19 13:12:48,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2481 to 2461. [2018-09-19 13:12:48,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2461 states. [2018-09-19 13:12:48,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2461 states to 2461 states and 3417 transitions. [2018-09-19 13:12:48,189 INFO L78 Accepts]: Start accepts. Automaton has 2461 states and 3417 transitions. Word has length 222 [2018-09-19 13:12:48,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 13:12:48,189 INFO L480 AbstractCegarLoop]: Abstraction has 2461 states and 3417 transitions. [2018-09-19 13:12:48,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 13:12:48,190 INFO L276 IsEmpty]: Start isEmpty. Operand 2461 states and 3417 transitions. [2018-09-19 13:12:48,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-09-19 13:12:48,195 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 13:12:48,195 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 13:12:48,196 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 13:12:48,196 INFO L82 PathProgramCache]: Analyzing trace with hash 332130324, now seen corresponding path program 1 times [2018-09-19 13:12:48,196 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 13:12:48,196 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 226 with the following transitions: [2018-09-19 13:12:48,197 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [806], [814], [822], [830], [838], [846], [854], [862], [870], [878], [886], [894], [902], [910], [918], [926], [934], [942], [950], [958], [966], [974], [982], [990], [998], [1006], [1014], [1022], [1030], [1038], [1046], [1054], [1062], [1070], [1074], [1076], [1079], [1087], [1095], [1103], [1111], [1119], [1127], [1135], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1224], [1228], [1232], [1236], [1239], [1240], [1244], [1255], [1259], [1263], [1267], [1271], [1275], [1279], [1282], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-09-19 13:12:48,202 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 13:12:48,202 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 13:12:48,273 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 13:12:48,495 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-19 13:12:48,496 INFO L272 AbstractInterpreter]: Visited 97 different actions 374 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 26 variables. [2018-09-19 13:12:48,537 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 13:12:48,583 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 13:12:48,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 01:12:48 BoogieIcfgContainer [2018-09-19 13:12:48,584 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 13:12:48,585 INFO L168 Benchmark]: Toolchain (without parser) took 82032.90 ms. Allocated memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: 1.5 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -613.0 MB). Peak memory consumption was 902.2 MB. Max. memory is 7.1 GB. [2018-09-19 13:12:48,589 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 13:12:48,590 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1816.81 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 179.7 MB). Peak memory consumption was 179.7 MB. Max. memory is 7.1 GB. [2018-09-19 13:12:48,591 INFO L168 Benchmark]: Boogie Procedure Inliner took 282.08 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2018-09-19 13:12:48,593 INFO L168 Benchmark]: Boogie Preprocessor took 822.98 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 922.7 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 123.5 MB. Max. memory is 7.1 GB. [2018-09-19 13:12:48,594 INFO L168 Benchmark]: RCFGBuilder took 15034.19 ms. Allocated memory is still 2.5 GB. Free memory was 2.3 GB in the beginning and 1.9 GB in the end (delta: 454.0 MB). Peak memory consumption was 454.0 MB. Max. memory is 7.1 GB. [2018-09-19 13:12:48,595 INFO L168 Benchmark]: TraceAbstraction took 64066.76 ms. Allocated memory was 2.5 GB in the beginning and 3.0 GB in the end (delta: 592.4 MB). Free memory was 1.9 GB in the beginning and 2.0 GB in the end (delta: -150.4 MB). Peak memory consumption was 442.1 MB. Max. memory is 7.1 GB. [2018-09-19 13:12:48,603 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.21 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 1816.81 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 179.7 MB). Peak memory consumption was 179.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 282.08 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 822.98 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 922.7 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 123.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 15034.19 ms. Allocated memory is still 2.5 GB. Free memory was 2.3 GB in the beginning and 1.9 GB in the end (delta: 454.0 MB). Peak memory consumption was 454.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 64066.76 ms. Allocated memory was 2.5 GB in the beginning and 3.0 GB in the end (delta: 592.4 MB). Free memory was 1.9 GB in the beginning and 2.0 GB in the end (delta: -150.4 MB). Peak memory consumption was 442.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 161]: 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: [L8] int inputA = 1; [L9] int inputB = 2; [L10] int inputC = 3; [L11] int inputE = 5; [L12] int inputD = 4; [L13] int inputF = 6; [L16] int a24 = 1; [L17] int a21 = 124; [L18] int a26 = 222; [L19] int a14 = -79; [L20] int a28 = 111; [L2577] int output = -1; [L2580] COND TRUE 1 [L2583] int input; [L2584] input = __VERIFIER_nondet_int() [L2585] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L2588] CALL, EXPR calculate_output(input) [L25] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L28] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L31] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L34] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L37] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L40] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L43] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L46] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L49] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L52] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L55] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L58] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L61] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L64] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L67] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L70] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L73] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L76] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L79] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L82] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L85] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L88] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L91] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L94] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L97] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L100] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L103] COND FALSE !((((( -84 < a14 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L106] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L109] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L112] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L115] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L118] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L121] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L124] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L127] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L130] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L133] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L136] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L139] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L142] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L145] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L148] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L151] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L154] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L157] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L160] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L163] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L166] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L169] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L172] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L175] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L178] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L181] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L184] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L187] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L190] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L193] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L196] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L199] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L202] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L205] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L209] COND FALSE !((( a21 <= 127 && (( a26 <= -68 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 3))) && a14 <= -182 )) && (a24==3))) [L215] COND FALSE !((((a24==3) && ( ((-68 < a26) && (124 >= a26)) && ((input == 4) && (( a14 <= -182 && 300 < a28 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 ))))) && a21 <= 127 )) [L222] COND FALSE !(( -84 < a14 && ( a21 <= 127 && ( a26 <= -68 && ((a24==2) && ((input == 6) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))))) [L228] COND FALSE !((((a24==2) && ((((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )) && ((124 < a26) && (217 >= a26)) ) && a21 <= 127 )) && a14 <= -182 )) [L231] COND FALSE !(((a24==3) && ((( a21 <= 127 && (( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 1))) && a14 <= -182 ) && ((-68 < a26) && (124 >= a26)) ))) [L238] COND FALSE !((((((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 4)) && 217 < a26 ) && a21 <= 127 ) && -84 < a14 ) && (a24==1))) [L243] COND FALSE !(( a21 <= 127 && ((((input == 5) && (( a14 <= -182 && 300 < a28 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) ))) && 217 < a26 ) && (a24==2)))) [L249] COND FALSE !((((((input == 1) && ((( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 )) || ( -84 < a14 && ((37 < a28) && (134 >= a28)) ))) && ((124 < a26) && (217 >= a26)) ) && (a24==2)) && a21 <= 127 )) [L256] COND FALSE !(((( ((-182 < a14) && (-114 >= a14)) && ( a28 <= 37 && ((a24==3) && (input == 5)))) && a26 <= -68 ) && a21 <= 127 )) [L262] COND FALSE !(( a28 <= 37 && ( ((-68 < a26) && (124 >= a26)) && (( a21 <= 127 && ((input == 2) && (a24==2))) && a14 <= -182 )))) [L266] COND FALSE !((((((( ((-68 < a26) && (124 >= a26)) && -84 < a14 ) && 300 < a28 ) || (( ((124 < a26) && (217 >= a26)) && a14 <= -182 ) && a28 <= 37 )) && (input == 2)) && a21 <= 127 ) && (a24==3))) [L273] COND FALSE !((( a28 <= 37 && ( a21 <= 127 && ((a24==3) && ( ((-114 < a14) && (-84 >= a14)) && (input == 3))))) && ((124 < a26) && (217 >= a26)) )) [L287] COND FALSE !(((( a21 <= 127 && ((( ((37 < a28) && (134 >= a28)) && -84 < a14 ) || (( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( a28 <= 37 && -84 < a14 ))) && (input == 3))) && (a24==2)) && ((124 < a26) && (217 >= a26)) )) [L294] COND FALSE !((((a24==3) && ( a21 <= 127 && ( ((-182 < a14) && (-114 >= a14)) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 2))))) && ((124 < a26) && (217 >= a26)) )) [L301] COND FALSE !(( ((-68 < a26) && (124 >= a26)) && ( a14 <= -182 && ((((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 4)) && (a24==2)) && a21 <= 127 )))) [L306] COND FALSE !((( ((-114 < a14) && (-84 >= a14)) && ((a24==3) && ((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 5)) && a21 <= 127 ))) && ((124 < a26) && (217 >= a26)) )) [L313] COND FALSE !(( ((124 < a26) && (217 >= a26)) && (( a21 <= 127 && (((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 6)) && a14 <= -182 )) && (a24==3)))) [L319] COND FALSE !(( a26 <= -68 && (( a21 <= 127 && ((a24==2) && (( a28 <= 37 || ((37 < a28) && (134 >= a28)) ) && (input == 6)))) && a14 <= -182 ))) [L323] COND TRUE ( 217 < a26 && (( a21 <= 127 && ((a24==1) && ((input == 6) && (( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 )))) && -84 < a14 )) [L324] a14 = ((((a14 % 299909)- 300090) + 0) + -1) [L325] a26 = ((((a26 * 9)/ 10) - 554854) * 1) [L326] a28 = ((((a28 * 9)/ 10) * 1) - 589002) [L327] a24 = 2 [L329] RET return 25; [L2588] EXPR calculate_output(input) [L2588] output = calculate_output(input) [L2580] COND TRUE 1 [L2583] int input; [L2584] input = __VERIFIER_nondet_int() [L2585] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L2588] CALL, EXPR calculate_output(input) [L25] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L28] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L31] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L34] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L37] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L40] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L43] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L46] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L49] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L52] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L55] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L58] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L61] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L64] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L67] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L70] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L73] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L76] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L79] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L82] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L85] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L88] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L91] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L94] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L97] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L100] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L103] COND FALSE !((((( -84 < a14 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L106] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L109] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L112] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L115] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L118] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L121] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L124] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L127] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L130] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L133] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L136] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L139] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L142] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L145] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L148] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L151] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L154] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L157] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L160] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L163] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L166] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L169] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L172] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L175] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L178] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L181] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L184] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L187] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L190] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L193] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L196] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L199] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L202] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L205] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L209] COND FALSE !((( a21 <= 127 && (( a26 <= -68 && ((( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) ) || 300 < a28 ) && (input == 3))) && a14 <= -182 )) && (a24==3))) [L215] COND FALSE !((((a24==3) && ( ((-68 < a26) && (124 >= a26)) && ((input == 4) && (( a14 <= -182 && 300 < a28 ) || ( ((-182 < a14) && (-114 >= a14)) && a28 <= 37 ))))) && a21 <= 127 )) [L222] COND FALSE !(( -84 < a14 && ( a21 <= 127 && ( a26 <= -68 && ((a24==2) && ((input == 6) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 ))))))) [L228] COND FALSE !((((a24==2) && ((((input == 3) && ( ((134 < a28) && (300 >= a28)) || 300 < a28 )) && ((124 < a26) && (217 >= a26)) ) && a21 <= 127 )) && a14 <= -182 )) [L231] COND FALSE !(((a24==3) && ((( a21 <= 127 && (( ((134 < a28) && (300 >= a28)) || ( a28 <= 37 || ((37 < a28) && (134 >= a28)) )) && (input == 1))) && a14 <= -182 ) && ((-68 < a26) && (124 >= a26)) ))) [L238] COND FALSE !((((((( 300 < a28 || ( ((37 < a28) && (134 >= a28)) || ((134 < a28) && (300 >= a28)) )) && (input == 4)) && 217 < a26 ) && a21 <= 127 ) && -84 < a14 ) && (a24==1))) [L243] COND FALSE !(( a21 <= 127 && ((((input == 5) && (( a14 <= -182 && 300 < a28 ) || ( a28 <= 37 && ((-182 < a14) && (-114 >= a14)) ))) && 217 < a26 ) && (a24==2)))) [L249] COND FALSE !((((((input == 1) && ((( 300 < a28 && ((-114 < a14) && (-84 >= a14)) ) || ( -84 < a14 && a28 <= 37 )) || ( -84 < a14 && ((37 < a28) && (134 >= a28)) ))) && ((124 < a26) && (217 >= a26)) ) && (a24==2)) && a21 <= 127 )) [L256] COND FALSE !(((( ((-182 < a14) && (-114 >= a14)) && ( a28 <= 37 && ((a24==3) && (input == 5)))) && a26 <= -68 ) && a21 <= 127 )) [L262] COND TRUE ( a28 <= 37 && ( ((-68 < a26) && (124 >= a26)) && (( a21 <= 127 && ((input == 2) && (a24==2))) && a14 <= -182 ))) [L263] a26 = (((a26 - -478961) + -415672) + 258271) [L264] a28 = ((((a28 % 299849)- -300149) + 2) * 1) [L265] RET return 26; [L2588] EXPR calculate_output(input) [L2588] output = calculate_output(input) [L2580] COND TRUE 1 [L2583] int input; [L2584] input = __VERIFIER_nondet_int() [L2585] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L2588] CALL calculate_output(input) [L25] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L28] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L31] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L34] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L37] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L40] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L43] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L46] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L49] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L52] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L55] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L58] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L61] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L64] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L67] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L70] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L73] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L76] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L79] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L82] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L85] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L88] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L91] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L94] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L97] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L100] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L103] COND FALSE !((((( -84 < a14 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L106] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L109] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L112] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L115] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L118] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L121] COND FALSE !((((( a14 <= -182 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L124] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L127] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L130] COND FALSE !((((( -84 < a14 && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L133] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L136] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L139] COND FALSE !((((( a14 <= -182 && 217 < a26 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L142] COND FALSE !((((( ((-114 < a14) && (-84 >= a14)) && 217 < a26 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L145] COND FALSE !((((( a14 <= -182 && a26 <= -68 ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L148] COND FALSE !((((( -84 < a14 && a26 <= -68 ) && (a24==1)) && 300 < a28 ) && a21 <= 127 )) [L151] COND FALSE !((((( a14 <= -182 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((37 < a28) && (134 >= a28)) ) && a21 <= 127 )) [L154] COND FALSE !((((( ((-182 < a14) && (-114 >= a14)) && a26 <= -68 ) && (a24==1)) && a28 <= 37 ) && a21 <= 127 )) [L157] COND FALSE !((((( -84 < a14 && ((124 < a26) && (217 >= a26)) ) && (a24==1)) && ((134 < a28) && (300 >= a28)) ) && a21 <= 127 )) [L160] COND TRUE (((( ((-182 < a14) && (-114 >= a14)) && ((-68 < a26) && (124 >= a26)) ) && (a24==1)) && 300 < a28 ) && a21 <= 127 ) [L161] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 604 locations, 1 error locations. UNKNOWN Result, 63.9s OverallTime, 5 OverallIterations, 3 TraceHistogramMax, 52.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2113 SDtfs, 6205 SDslu, 2173 SDs, 0 SdLazy, 20634 SolverSat, 1568 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 47.2s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 576 GetRequests, 527 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2461occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 6.3s AbstIntTime, 5 AbstIntIterations, 4 AbstIntStrong, 0.996941494854538 AbsIntWeakeningRatio, 0.15135135135135136 AbsIntAvgWeakeningVarsNumRemoved, 23.956756756756757 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 38 StatesRemovedByMinimization, 4 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/Problem17_label22_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_13-12-48-627.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem17_label22_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_13-12-48-627.csv Received shutdown request...