java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label26_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ddc4263 [2018-08-08 14:09:38,025 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-08-08 14:09:38,027 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-08-08 14:09:38,039 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-08-08 14:09:38,040 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-08-08 14:09:38,041 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-08-08 14:09:38,042 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-08-08 14:09:38,044 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-08-08 14:09:38,045 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-08-08 14:09:38,046 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-08-08 14:09:38,047 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-08-08 14:09:38,047 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-08-08 14:09:38,048 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-08-08 14:09:38,049 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-08-08 14:09:38,051 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-08-08 14:09:38,051 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-08-08 14:09:38,052 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-08-08 14:09:38,054 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-08-08 14:09:38,056 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-08-08 14:09:38,058 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-08-08 14:09:38,059 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-08-08 14:09:38,060 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-08-08 14:09:38,063 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-08-08 14:09:38,063 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-08-08 14:09:38,063 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-08-08 14:09:38,064 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-08-08 14:09:38,065 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-08-08 14:09:38,066 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-08-08 14:09:38,067 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-08-08 14:09:38,068 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-08-08 14:09:38,068 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-08-08 14:09:38,069 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-08-08 14:09:38,069 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-08-08 14:09:38,069 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-08-08 14:09:38,070 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-08-08 14:09:38,071 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-08-08 14:09:38,072 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf [2018-08-08 14:09:38,087 INFO L110 SettingsManager]: Loading preferences was successful [2018-08-08 14:09:38,087 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-08-08 14:09:38,088 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-08-08 14:09:38,088 INFO L133 SettingsManager]: * User list type=DISABLED [2018-08-08 14:09:38,088 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-08-08 14:09:38,089 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-08-08 14:09:38,089 INFO L133 SettingsManager]: * Congruence Domain=false [2018-08-08 14:09:38,089 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-08-08 14:09:38,089 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2018-08-08 14:09:38,089 INFO L133 SettingsManager]: * Log string format=TERM [2018-08-08 14:09:38,090 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-08-08 14:09:38,090 INFO L133 SettingsManager]: * Interval Domain=false [2018-08-08 14:09:38,091 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-08-08 14:09:38,091 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-08-08 14:09:38,091 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-08-08 14:09:38,091 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-08-08 14:09:38,091 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-08-08 14:09:38,092 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-08-08 14:09:38,092 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-08-08 14:09:38,092 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-08-08 14:09:38,092 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-08-08 14:09:38,092 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-08-08 14:09:38,093 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-08-08 14:09:38,093 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-08-08 14:09:38,093 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-08-08 14:09:38,093 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-08-08 14:09:38,093 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-08-08 14:09:38,093 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-08-08 14:09:38,094 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-08-08 14:09:38,094 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-08-08 14:09:38,094 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-08-08 14:09:38,094 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-08-08 14:09:38,094 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-08-08 14:09:38,095 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-08-08 14:09:38,138 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-08-08 14:09:38,150 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-08-08 14:09:38,154 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-08-08 14:09:38,156 INFO L271 PluginConnector]: Initializing CDTParser... [2018-08-08 14:09:38,156 INFO L276 PluginConnector]: CDTParser initialized [2018-08-08 14:09:38,157 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label26_true-unreach-call_false-termination.c [2018-08-08 14:09:38,506 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2864d8be6/50b6faba9cb64c9998da6543be0bc9ba/FLAG377ceae65 [2018-08-08 14:09:38,782 INFO L276 CDTParser]: Found 1 translation units. [2018-08-08 14:09:38,787 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label26_true-unreach-call_false-termination.c [2018-08-08 14:09:38,808 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2864d8be6/50b6faba9cb64c9998da6543be0bc9ba/FLAG377ceae65 [2018-08-08 14:09:38,830 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2864d8be6/50b6faba9cb64c9998da6543be0bc9ba [2018-08-08 14:09:38,843 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-08-08 14:09:38,846 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-08-08 14:09:38,847 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-08-08 14:09:38,847 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-08-08 14:09:38,858 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-08-08 14:09:38,859 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.08 02:09:38" (1/1) ... [2018-08-08 14:09:38,863 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1362d52c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 02:09:38, skipping insertion in model container [2018-08-08 14:09:38,863 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.08 02:09:38" (1/1) ... [2018-08-08 14:09:39,110 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-08-08 14:09:39,445 INFO L175 PostProcessor]: Settings: Checked method=main [2018-08-08 14:09:39,483 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-08-08 14:09:39,640 INFO L175 PostProcessor]: Settings: Checked method=main [2018-08-08 14:09:39,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 02:09:39 WrapperNode [2018-08-08 14:09:39,714 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-08-08 14:09:39,715 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-08-08 14:09:39,715 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-08-08 14:09:39,715 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-08-08 14:09:39,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 02:09:39" (1/1) ... [2018-08-08 14:09:39,758 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 02:09:39" (1/1) ... [2018-08-08 14:09:39,828 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-08-08 14:09:39,829 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-08-08 14:09:39,829 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-08-08 14:09:39,829 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-08-08 14:09:39,840 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 02:09:39" (1/1) ... [2018-08-08 14:09:39,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 02:09:39" (1/1) ... [2018-08-08 14:09:39,846 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 02:09:39" (1/1) ... [2018-08-08 14:09:39,847 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 02:09:39" (1/1) ... [2018-08-08 14:09:40,072 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 02:09:39" (1/1) ... [2018-08-08 14:09:40,099 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 02:09:39" (1/1) ... [2018-08-08 14:09:40,122 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 02:09:39" (1/1) ... [2018-08-08 14:09:40,136 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-08-08 14:09:40,137 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-08-08 14:09:40,137 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-08-08 14:09:40,137 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-08-08 14:09:40,140 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 02:09:39" (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-08-08 14:09:40,218 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output [2018-08-08 14:09:40,218 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_output [2018-08-08 14:09:40,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-08-08 14:09:40,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-08-08 14:09:40,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-08-08 14:09:40,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-08-08 14:09:40,219 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-08-08 14:09:40,220 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-08-08 14:09:44,305 INFO L273 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-08-08 14:09:44,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.08 02:09:44 BoogieIcfgContainer [2018-08-08 14:09:44,306 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-08-08 14:09:44,309 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-08-08 14:09:44,310 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-08-08 14:09:44,315 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-08-08 14:09:44,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.08 02:09:38" (1/3) ... [2018-08-08 14:09:44,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dbd8ea0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.08 02:09:44, skipping insertion in model container [2018-08-08 14:09:44,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.08 02:09:39" (2/3) ... [2018-08-08 14:09:44,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dbd8ea0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.08 02:09:44, skipping insertion in model container [2018-08-08 14:09:44,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.08 02:09:44" (3/3) ... [2018-08-08 14:09:44,325 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label26_true-unreach-call_false-termination.c [2018-08-08 14:09:44,337 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-08-08 14:09:44,356 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-08-08 14:09:44,414 INFO L129 ementStrategyFactory]: Using default assertion order modulation [2018-08-08 14:09:44,415 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-08-08 14:09:44,415 INFO L382 AbstractCegarLoop]: Hoare is true [2018-08-08 14:09:44,416 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-08-08 14:09:44,416 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-08-08 14:09:44,416 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-08-08 14:09:44,416 INFO L386 AbstractCegarLoop]: Difference is false [2018-08-08 14:09:44,416 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-08-08 14:09:44,417 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-08-08 14:09:44,445 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2018-08-08 14:09:44,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-08-08 14:09:44,457 INFO L368 BasicCegarLoop]: Found error trace [2018-08-08 14:09:44,460 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-08-08 14:09:44,461 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-08-08 14:09:44,467 INFO L82 PathProgramCache]: Analyzing trace with hash 643877559, now seen corresponding path program 1 times [2018-08-08 14:09:44,470 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-08-08 14:09:44,471 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 74 with the following transitions: [2018-08-08 14:09:44,474 INFO L202 CegarAbsIntRunner]: [0], [7], [15], [23], [31], [39], [47], [55], [63], [71], [79], [87], [95], [103], [111], [119], [127], [135], [143], [151], [159], [167], [175], [183], [191], [199], [207], [215], [223], [231], [239], [247], [255], [263], [271], [279], [287], [295], [303], [311], [319], [327], [335], [343], [351], [359], [367], [375], [383], [391], [399], [407], [415], [423], [431], [439], [447], [455], [463], [471], [479], [483], [485], [947], [948], [952], [956], [962], [966], [973], [974], [975], [977] [2018-08-08 14:09:44,550 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-08-08 14:09:44,550 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-08-08 14:09:47,182 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-08-08 14:09:47,184 INFO L272 AbstractInterpreter]: Visited 72 different actions 72 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-08-08 14:09:47,234 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-08-08 14:09:48,703 INFO L232 lantSequenceWeakener]: Weakened 71 states. On average, predicates are now at 80.9% of their original sizes. [2018-08-08 14:09:48,703 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-08-08 14:09:48,984 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-08-08 14:09:48,985 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-08-08 14:09:48,986 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-08-08 14:09:48,986 INFO L262 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-08-08 14:09:48,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-08-08 14:09:49,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-08-08 14:09:49,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-08-08 14:09:49,007 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 6 states. [2018-08-08 14:09:54,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-08-08 14:09:54,569 INFO L93 Difference]: Finished difference Result 693 states and 1229 transitions. [2018-08-08 14:09:54,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-08-08 14:09:54,572 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2018-08-08 14:09:54,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-08-08 14:09:54,593 INFO L225 Difference]: With dead ends: 693 [2018-08-08 14:09:54,593 INFO L226 Difference]: Without dead ends: 436 [2018-08-08 14:09:54,600 INFO L603 BasicCegarLoop]: 2 DeclaredPredicates, 72 GetRequests, 68 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-08-08 14:09:54,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-08-08 14:09:54,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 434. [2018-08-08 14:09:54,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-08-08 14:09:54,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 615 transitions. [2018-08-08 14:09:54,680 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 615 transitions. Word has length 73 [2018-08-08 14:09:54,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-08-08 14:09:54,681 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 615 transitions. [2018-08-08 14:09:54,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-08-08 14:09:54,681 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 615 transitions. [2018-08-08 14:09:54,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-08-08 14:09:54,689 INFO L368 BasicCegarLoop]: Found error trace [2018-08-08 14:09:54,689 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-08-08 14:09:54,689 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-08-08 14:09:54,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1228229323, now seen corresponding path program 1 times [2018-08-08 14:09:54,690 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-08-08 14:09:54,690 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 159 with the following transitions: [2018-08-08 14:09:54,691 INFO L202 CegarAbsIntRunner]: [0], [7], [15], [23], [31], [39], [47], [55], [63], [71], [79], [87], [95], [103], [111], [119], [127], [135], [143], [151], [159], [167], [175], [183], [191], [199], [207], [215], [223], [231], [239], [247], [255], [263], [271], [279], [287], [295], [303], [311], [319], [327], [335], [343], [351], [359], [367], [375], [383], [391], [399], [407], [415], [423], [431], [439], [447], [455], [463], [471], [479], [483], [485], [488], [493], [497], [501], [505], [509], [513], [517], [521], [525], [529], [533], [537], [541], [545], [549], [552], [946], [947], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-08-08 14:09:54,698 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-08-08 14:09:54,698 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-08-08 14:10:03,545 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-08-08 14:10:03,545 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-08-08 14:10:03,579 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-08-08 14:10:06,168 INFO L232 lantSequenceWeakener]: Weakened 156 states. On average, predicates are now at 78.98% of their original sizes. [2018-08-08 14:10:06,168 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-08-08 14:10:10,991 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-08-08 14:10:10,992 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-08-08 14:10:10,992 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-08-08 14:10:10,992 INFO L262 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-08-08 14:10:10,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-08-08 14:10:10,994 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-08-08 14:10:10,995 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-08-08 14:10:10,995 INFO L87 Difference]: Start difference. First operand 434 states and 615 transitions. Second operand 16 states. [2018-08-08 14:10:30,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-08-08 14:10:30,810 INFO L93 Difference]: Finished difference Result 1421 states and 2494 transitions. [2018-08-08 14:10:30,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-08-08 14:10:30,812 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 158 [2018-08-08 14:10:30,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-08-08 14:10:30,825 INFO L225 Difference]: With dead ends: 1421 [2018-08-08 14:10:30,825 INFO L226 Difference]: Without dead ends: 1176 [2018-08-08 14:10:30,830 INFO L603 BasicCegarLoop]: 2 DeclaredPredicates, 176 GetRequests, 103 SyntacticMatches, 40 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=248, Invalid=942, Unknown=0, NotChecked=0, Total=1190 [2018-08-08 14:10:30,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2018-08-08 14:10:30,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 1173. [2018-08-08 14:10:30,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1173 states. [2018-08-08 14:10:30,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1406 transitions. [2018-08-08 14:10:30,930 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1406 transitions. Word has length 158 [2018-08-08 14:10:30,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-08-08 14:10:30,931 INFO L480 AbstractCegarLoop]: Abstraction has 1173 states and 1406 transitions. [2018-08-08 14:10:30,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-08-08 14:10:30,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1406 transitions. [2018-08-08 14:10:30,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-08-08 14:10:30,942 INFO L368 BasicCegarLoop]: Found error trace [2018-08-08 14:10:30,943 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-08-08 14:10:30,943 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-08-08 14:10:30,943 INFO L82 PathProgramCache]: Analyzing trace with hash 977183583, now seen corresponding path program 1 times [2018-08-08 14:10:30,944 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-08-08 14:10:30,944 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 185 with the following transitions: [2018-08-08 14:10:30,944 INFO L202 CegarAbsIntRunner]: [0], [7], [15], [23], [31], [39], [47], [55], [63], [71], [79], [87], [95], [103], [111], [119], [127], [135], [143], [151], [159], [167], [175], [183], [191], [199], [207], [215], [223], [231], [239], [247], [255], [263], [271], [279], [287], [295], [303], [311], [319], [327], [335], [343], [351], [359], [367], [375], [383], [391], [399], [407], [415], [423], [431], [439], [447], [455], [463], [471], [479], [483], [485], [488], [493], [497], [501], [505], [509], [513], [517], [521], [525], [529], [533], [537], [541], [545], [549], [553], [557], [561], [565], [569], [573], [577], [581], [585], [589], [593], [597], [601], [605], [609], [613], [617], [621], [625], [629], [633], [637], [641], [645], [649], [653], [656], [946], [947], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-08-08 14:10:30,950 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-08-08 14:10:30,950 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-08-08 14:10:41,916 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-08-08 14:10:41,917 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-08-08 14:10:41,927 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-08-08 14:10:43,751 INFO L232 lantSequenceWeakener]: Weakened 182 states. On average, predicates are now at 78.74% of their original sizes. [2018-08-08 14:10:43,752 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-08-08 14:10:44,286 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-08-08 14:10:44,286 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-08-08 14:10:44,287 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-08-08 14:10:44,287 INFO L262 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-08-08 14:10:44,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-08-08 14:10:44,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-08-08 14:10:44,288 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-08-08 14:10:44,288 INFO L87 Difference]: Start difference. First operand 1173 states and 1406 transitions. Second operand 12 states. [2018-08-08 14:10:52,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-08-08 14:10:52,519 INFO L93 Difference]: Finished difference Result 1606 states and 2190 transitions. [2018-08-08 14:10:52,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-08-08 14:10:52,520 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 184 [2018-08-08 14:10:52,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-08-08 14:10:52,533 INFO L225 Difference]: With dead ends: 1606 [2018-08-08 14:10:52,533 INFO L226 Difference]: Without dead ends: 1361 [2018-08-08 14:10:52,535 INFO L603 BasicCegarLoop]: 2 DeclaredPredicates, 192 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2018-08-08 14:10:52,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2018-08-08 14:10:52,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 1358. [2018-08-08 14:10:52,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1358 states. [2018-08-08 14:10:52,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 1604 transitions. [2018-08-08 14:10:52,598 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 1604 transitions. Word has length 184 [2018-08-08 14:10:52,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-08-08 14:10:52,599 INFO L480 AbstractCegarLoop]: Abstraction has 1358 states and 1604 transitions. [2018-08-08 14:10:52,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-08-08 14:10:52,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1604 transitions. [2018-08-08 14:10:52,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-08-08 14:10:52,605 INFO L368 BasicCegarLoop]: Found error trace [2018-08-08 14:10:52,606 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-08-08 14:10:52,606 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-08-08 14:10:52,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1295161141, now seen corresponding path program 1 times [2018-08-08 14:10:52,607 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-08-08 14:10:52,607 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 270 with the following transitions: [2018-08-08 14:10:52,607 INFO L202 CegarAbsIntRunner]: [0], [7], [15], [23], [31], [39], [47], [55], [63], [71], [79], [87], [95], [103], [111], [119], [127], [135], [143], [151], [159], [167], [175], [183], [191], [199], [207], [215], [223], [231], [239], [247], [255], [263], [271], [279], [287], [295], [303], [311], [319], [327], [335], [343], [351], [359], [367], [375], [383], [391], [399], [407], [415], [423], [431], [439], [447], [455], [463], [471], [479], [483], [485], [488], [493], [497], [501], [505], [509], [513], [517], [521], [525], [529], [533], [537], [541], [545], [549], [552], [553], [557], [561], [565], [569], [573], [577], [581], [585], [589], [593], [597], [601], [605], [609], [613], [617], [621], [625], [629], [633], [637], [641], [645], [649], [653], [656], [946], [947], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-08-08 14:10:52,612 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-08-08 14:10:52,612 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-08-08 14:11:18,307 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-08-08 14:11:18,307 INFO L272 AbstractInterpreter]: Visited 119 different actions 467 times. Merged at 7 different actions 24 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-08-08 14:11:18,314 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-08-08 14:11:21,153 INFO L232 lantSequenceWeakener]: Weakened 267 states. On average, predicates are now at 78.32% of their original sizes. [2018-08-08 14:11:21,154 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-08-08 14:11:27,824 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-08-08 14:11:27,825 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-08-08 14:11:27,825 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-08-08 14:11:27,825 INFO L262 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-08-08 14:11:27,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-08-08 14:11:27,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-08-08 14:11:27,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2018-08-08 14:11:27,827 INFO L87 Difference]: Start difference. First operand 1358 states and 1604 transitions. Second operand 18 states. [2018-08-08 14:11:54,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-08-08 14:11:54,623 INFO L93 Difference]: Finished difference Result 3312 states and 4613 transitions. [2018-08-08 14:11:54,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-08-08 14:11:54,624 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 269 [2018-08-08 14:11:54,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-08-08 14:11:54,636 INFO L225 Difference]: With dead ends: 3312 [2018-08-08 14:11:54,636 INFO L226 Difference]: Without dead ends: 2328 [2018-08-08 14:11:54,642 INFO L603 BasicCegarLoop]: 2 DeclaredPredicates, 292 GetRequests, 183 SyntacticMatches, 69 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 863 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=374, Invalid=1348, Unknown=0, NotChecked=0, Total=1722 [2018-08-08 14:11:54,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2328 states. [2018-08-08 14:11:54,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2328 to 2132. [2018-08-08 14:11:54,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2132 states. [2018-08-08 14:11:54,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 2132 states and 2472 transitions. [2018-08-08 14:11:54,724 INFO L78 Accepts]: Start accepts. Automaton has 2132 states and 2472 transitions. Word has length 269 [2018-08-08 14:11:54,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-08-08 14:11:54,725 INFO L480 AbstractCegarLoop]: Abstraction has 2132 states and 2472 transitions. [2018-08-08 14:11:54,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-08-08 14:11:54,725 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 2472 transitions. [2018-08-08 14:11:54,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-08-08 14:11:54,732 INFO L368 BasicCegarLoop]: Found error trace [2018-08-08 14:11:54,732 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-08-08 14:11:54,733 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-08-08 14:11:54,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1366036406, now seen corresponding path program 1 times [2018-08-08 14:11:54,733 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-08-08 14:11:54,734 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 295 with the following transitions: [2018-08-08 14:11:54,734 INFO L202 CegarAbsIntRunner]: [0], [7], [15], [23], [31], [39], [47], [55], [63], [71], [79], [87], [95], [103], [111], [119], [127], [135], [143], [151], [159], [167], [175], [183], [191], [199], [207], [215], [223], [231], [239], [247], [255], [263], [271], [279], [287], [295], [303], [311], [319], [327], [335], [343], [351], [359], [367], [375], [383], [391], [399], [407], [415], [423], [431], [439], [447], [455], [463], [471], [479], [483], [485], [488], [493], [497], [501], [505], [509], [513], [517], [521], [525], [529], [533], [537], [541], [545], [549], [553], [557], [561], [565], [569], [573], [577], [581], [585], [589], [593], [597], [601], [605], [609], [613], [617], [621], [625], [629], [633], [637], [641], [645], [649], [652], [653], [656], [946], [947], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-08-08 14:11:54,740 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-08-08 14:11:54,741 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-08-08 14:12:05,142 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-08-08 14:12:21,529 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-08-08 14:12:21,529 INFO L272 AbstractInterpreter]: Visited 119 different actions 580 times. Merged at 7 different actions 29 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-08-08 14:12:21,531 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-08-08 14:12:24,097 INFO L232 lantSequenceWeakener]: Weakened 292 states. On average, predicates are now at 78.23% of their original sizes. [2018-08-08 14:12:24,097 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-08-08 14:12:24,520 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-08-08 14:12:24,520 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-08-08 14:12:24,520 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-08-08 14:12:24,521 INFO L262 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-08-08 14:12:24,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-08-08 14:12:24,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-08-08 14:12:24,522 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-08-08 14:12:24,522 INFO L87 Difference]: Start difference. First operand 2132 states and 2472 transitions. Second operand 11 states. [2018-08-08 14:12:39,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-08-08 14:12:39,438 INFO L93 Difference]: Finished difference Result 2754 states and 3624 transitions. [2018-08-08 14:12:39,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-08-08 14:12:39,439 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 294 [2018-08-08 14:12:39,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-08-08 14:12:39,454 INFO L225 Difference]: With dead ends: 2754 [2018-08-08 14:12:39,455 INFO L226 Difference]: Without dead ends: 2509 [2018-08-08 14:12:39,459 INFO L603 BasicCegarLoop]: 2 DeclaredPredicates, 304 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2018-08-08 14:12:39,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2509 states. [2018-08-08 14:12:39,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2509 to 2502. [2018-08-08 14:12:39,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2502 states. [2018-08-08 14:12:39,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2502 states to 2502 states and 2906 transitions. [2018-08-08 14:12:39,567 INFO L78 Accepts]: Start accepts. Automaton has 2502 states and 2906 transitions. Word has length 294 [2018-08-08 14:12:39,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-08-08 14:12:39,568 INFO L480 AbstractCegarLoop]: Abstraction has 2502 states and 2906 transitions. [2018-08-08 14:12:39,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-08-08 14:12:39,569 INFO L276 IsEmpty]: Start isEmpty. Operand 2502 states and 2906 transitions. [2018-08-08 14:12:39,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2018-08-08 14:12:39,581 INFO L368 BasicCegarLoop]: Found error trace [2018-08-08 14:12:39,581 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-08-08 14:12:39,582 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_false_termination_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-08-08 14:12:39,582 INFO L82 PathProgramCache]: Analyzing trace with hash 464618421, now seen corresponding path program 1 times [2018-08-08 14:12:39,582 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-08-08 14:12:39,583 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 373 with the following transitions: [2018-08-08 14:12:39,583 INFO L202 CegarAbsIntRunner]: [0], [7], [15], [23], [31], [39], [47], [55], [63], [71], [79], [87], [95], [103], [111], [119], [127], [135], [143], [151], [159], [167], [175], [183], [191], [199], [207], [215], [223], [231], [239], [247], [255], [263], [271], [279], [287], [295], [303], [311], [319], [327], [335], [343], [351], [359], [367], [375], [383], [391], [399], [407], [415], [423], [431], [439], [447], [455], [463], [471], [479], [483], [485], [488], [493], [497], [501], [505], [509], [513], [517], [521], [524], [525], [529], [533], [537], [541], [545], [549], [553], [557], [561], [565], [569], [573], [577], [581], [585], [589], [593], [597], [601], [605], [609], [613], [617], [621], [625], [629], [633], [637], [641], [645], [649], [652], [653], [656], [946], [947], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-08-08 14:12:39,587 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-08-08 14:12:39,587 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-08-08 14:12:50,269 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-08-08 14:13:15,077 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-08-08 14:13:15,077 INFO L272 AbstractInterpreter]: Visited 121 different actions 830 times. Merged at 8 different actions 53 times. Widened at 1 different actions 2 times. Found 11 fixpoints after 2 different actions. Largest state had 24 variables. [2018-08-08 14:13:15,087 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-08-08 14:13:15,133 WARN L205 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-08-08 14:13:15,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.08 02:13:15 BoogieIcfgContainer [2018-08-08 14:13:15,134 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-08-08 14:13:15,135 INFO L168 Benchmark]: Toolchain (without parser) took 216291.75 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -547.2 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-08-08 14:13:15,137 INFO L168 Benchmark]: CDTParser took 0.20 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-08-08 14:13:15,138 INFO L168 Benchmark]: CACSL2BoogieTranslator took 867.05 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2018-08-08 14:13:15,138 INFO L168 Benchmark]: Boogie Procedure Inliner took 113.66 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-08-08 14:13:15,139 INFO L168 Benchmark]: Boogie Preprocessor took 308.11 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 797.4 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -896.5 MB). Peak memory consumption was 36.3 MB. Max. memory is 7.1 GB. [2018-08-08 14:13:15,140 INFO L168 Benchmark]: RCFGBuilder took 4170.96 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 139.7 MB). Peak memory consumption was 139.7 MB. Max. memory is 7.1 GB. [2018-08-08 14:13:15,141 INFO L168 Benchmark]: TraceAbstraction took 210825.14 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 146.2 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-08-08 14:13:15,146 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.20 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 867.05 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 113.66 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 308.11 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 797.4 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -896.5 MB). Peak memory consumption was 36.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4170.96 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 139.7 MB). Peak memory consumption was 139.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 210825.14 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 146.2 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 202]: 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 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 TRUE ((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8)) [L202] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 255 locations, 1 error locations. UNKNOWN Result, 210.7s OverallTime, 6 OverallIterations, 4 TraceHistogramMax, 75.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1200 SDtfs, 7482 SDslu, 1838 SDs, 0 SdLazy, 14119 SolverSat, 1691 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 66.7s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 1036 GetRequests, 811 SyntacticMatches, 109 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1434 ImplicationChecksByTransitivity, 16.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2502occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 110.6s AbstIntTime, 6 AbstIntIterations, 5 AbstIntStrong, 0.9949821057891123 AbsIntWeakeningRatio, 0.10894141829393628 AbsIntAvgWeakeningVarsNumRemoved, 98.59609455292909 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 5 MinimizatonAttempts, 211 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_label26_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-08-08_14-13-15-161.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem14_label26_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-08-08_14-13-15-161.csv Received shutdown request...