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/Problem18_label40_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-11 23:24:16,906 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-11 23:24:16,908 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-11 23:24:16,921 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-11 23:24:16,922 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-11 23:24:16,923 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-11 23:24:16,924 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-11 23:24:16,926 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-11 23:24:16,927 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-11 23:24:16,928 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-11 23:24:16,929 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-11 23:24:16,929 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-11 23:24:16,930 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-11 23:24:16,931 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-11 23:24:16,932 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-11 23:24:16,933 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-11 23:24:16,934 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-11 23:24:16,936 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-11 23:24:16,938 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-11 23:24:16,939 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-11 23:24:16,941 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-11 23:24:16,942 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-11 23:24:16,944 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-11 23:24:16,945 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-11 23:24:16,945 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-11 23:24:16,946 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-11 23:24:16,947 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-11 23:24:16,948 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-11 23:24:16,948 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-11 23:24:16,950 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-11 23:24:16,950 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-11 23:24:16,951 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-11 23:24:16,951 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-11 23:24:16,951 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-11 23:24:16,952 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-11 23:24:16,953 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-11 23:24:16,953 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf [2018-09-11 23:24:16,977 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-11 23:24:16,978 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-11 23:24:16,979 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-11 23:24:16,979 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-11 23:24:16,979 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-11 23:24:16,980 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-11 23:24:16,980 INFO L133 SettingsManager]: * Congruence Domain=false [2018-09-11 23:24:16,980 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-11 23:24:16,980 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2018-09-11 23:24:16,981 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-11 23:24:16,981 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-11 23:24:16,981 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-11 23:24:16,982 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-11 23:24:16,982 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-11 23:24:16,983 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-11 23:24:16,984 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-11 23:24:16,984 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-11 23:24:16,984 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-11 23:24:16,984 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-11 23:24:16,984 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-11 23:24:16,985 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-11 23:24:16,985 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-11 23:24:16,985 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-11 23:24:16,985 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-11 23:24:16,985 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-11 23:24:16,987 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-11 23:24:16,987 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-11 23:24:16,987 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-11 23:24:16,987 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-11 23:24:16,988 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-11 23:24:16,988 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-11 23:24:16,988 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-11 23:24:16,988 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-11 23:24:16,988 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-11 23:24:17,048 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-11 23:24:17,062 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-11 23:24:17,068 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-11 23:24:17,070 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-11 23:24:17,070 INFO L276 PluginConnector]: CDTParser initialized [2018-09-11 23:24:17,071 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem18_label40_true-unreach-call.c [2018-09-11 23:24:17,431 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29efc26ef/42107e3834c64cccb6f81f8704a4c62b/FLAGb27445560 [2018-09-11 23:24:17,860 INFO L276 CDTParser]: Found 1 translation units. [2018-09-11 23:24:17,861 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem18_label40_true-unreach-call.c [2018-09-11 23:24:17,888 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29efc26ef/42107e3834c64cccb6f81f8704a4c62b/FLAGb27445560 [2018-09-11 23:24:17,905 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29efc26ef/42107e3834c64cccb6f81f8704a4c62b [2018-09-11 23:24:17,916 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-11 23:24:17,920 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-11 23:24:17,921 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-11 23:24:17,921 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-11 23:24:17,928 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-11 23:24:17,929 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 11:24:17" (1/1) ... [2018-09-11 23:24:17,934 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f00c975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 11:24:17, skipping insertion in model container [2018-09-11 23:24:17,935 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 11:24:17" (1/1) ... [2018-09-11 23:24:18,289 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-11 23:24:19,214 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-11 23:24:19,232 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-11 23:24:19,671 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-11 23:24:19,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 11:24:19 WrapperNode [2018-09-11 23:24:19,827 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-11 23:24:19,828 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-11 23:24:19,828 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-11 23:24:19,828 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-11 23:24:19,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 11:24:19" (1/1) ... [2018-09-11 23:24:19,904 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 11:24:19" (1/1) ... [2018-09-11 23:24:20,038 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-11 23:24:20,039 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-11 23:24:20,039 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-11 23:24:20,039 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-11 23:24:20,474 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 11:24:19" (1/1) ... [2018-09-11 23:24:20,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 11:24:19" (1/1) ... [2018-09-11 23:24:20,492 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 11:24:19" (1/1) ... [2018-09-11 23:24:20,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 11:24:19" (1/1) ... [2018-09-11 23:24:20,571 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 11:24:19" (1/1) ... [2018-09-11 23:24:20,605 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 11:24:19" (1/1) ... [2018-09-11 23:24:20,634 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 11:24:19" (1/1) ... [2018-09-11 23:24:20,659 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-11 23:24:20,660 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-11 23:24:20,660 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-11 23:24:20,660 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-11 23:24:20,663 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 11:24:19" (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-11 23:24:20,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-11 23:24:20,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-11 23:24:20,738 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output [2018-09-11 23:24:20,739 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output [2018-09-11 23:24:20,739 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output3 [2018-09-11 23:24:20,739 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output3 [2018-09-11 23:24:20,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-11 23:24:20,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-11 23:24:20,740 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-11 23:24:20,740 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-11 23:24:20,740 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output2 [2018-09-11 23:24:20,740 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_output2 [2018-09-11 23:24:29,898 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-11 23:24:29,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 11:24:29 BoogieIcfgContainer [2018-09-11 23:24:29,899 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-11 23:24:29,900 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-11 23:24:29,900 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-11 23:24:29,903 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-11 23:24:29,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 11:24:17" (1/3) ... [2018-09-11 23:24:29,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@393d6669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 11:24:29, skipping insertion in model container [2018-09-11 23:24:29,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 11:24:19" (2/3) ... [2018-09-11 23:24:29,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@393d6669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 11:24:29, skipping insertion in model container [2018-09-11 23:24:29,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 11:24:29" (3/3) ... [2018-09-11 23:24:29,907 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem18_label40_true-unreach-call.c [2018-09-11 23:24:29,917 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-11 23:24:29,928 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-11 23:24:29,991 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-11 23:24:29,992 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-11 23:24:29,993 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-11 23:24:29,993 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-11 23:24:29,993 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-11 23:24:29,993 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-11 23:24:29,993 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-11 23:24:29,993 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-11 23:24:29,994 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-11 23:24:30,034 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states. [2018-09-11 23:24:30,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-09-11 23:24:30,044 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 23:24:30,045 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] [2018-09-11 23:24:30,046 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-11 23:24:30,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1535733793, now seen corresponding path program 1 times [2018-09-11 23:24:30,055 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 23:24:30,056 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2018-09-11 23:24:30,059 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [309], [311], [2116], [2120], [2126], [2130], [3023], [3024], [3025], [3027] [2018-09-11 23:24:30,126 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-11 23:24:30,126 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 23:24:31,929 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-11 23:24:31,931 INFO L272 AbstractInterpreter]: Visited 50 different actions 50 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-11 23:24:31,960 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-11 23:24:32,998 INFO L232 lantSequenceWeakener]: Weakened 49 states. On average, predicates are now at 80.48% of their original sizes. [2018-09-11 23:24:32,998 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-11 23:24:33,337 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-11 23:24:33,339 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-11 23:24:33,339 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-11 23:24:33,340 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-11 23:24:33,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-11 23:24:33,354 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-11 23:24:33,354 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-11 23:24:33,357 INFO L87 Difference]: Start difference. First operand 775 states. Second operand 6 states. [2018-09-11 23:24:48,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-11 23:24:48,869 INFO L93 Difference]: Finished difference Result 2253 states and 4323 transitions. [2018-09-11 23:24:48,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-11 23:24:48,872 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2018-09-11 23:24:48,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-11 23:24:48,902 INFO L225 Difference]: With dead ends: 2253 [2018-09-11 23:24:48,902 INFO L226 Difference]: Without dead ends: 1476 [2018-09-11 23:24:48,913 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-11 23:24:48,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2018-09-11 23:24:49,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 1474. [2018-09-11 23:24:49,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1474 states. [2018-09-11 23:24:49,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2167 transitions. [2018-09-11 23:24:49,060 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 2167 transitions. Word has length 51 [2018-09-11 23:24:49,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-11 23:24:49,061 INFO L480 AbstractCegarLoop]: Abstraction has 1474 states and 2167 transitions. [2018-09-11 23:24:49,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-11 23:24:49,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 2167 transitions. [2018-09-11 23:24:49,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-09-11 23:24:49,073 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 23:24:49,074 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:24:49,077 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-11 23:24:49,078 INFO L82 PathProgramCache]: Analyzing trace with hash -315299051, now seen corresponding path program 1 times [2018-09-11 23:24:49,078 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 23:24:49,078 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 239 with the following transitions: [2018-09-11 23:24:49,079 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [309], [311], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [855], [859], [863], [867], [871], [875], [879], [883], [887], [891], [895], [899], [903], [907], [911], [915], [919], [923], [927], [931], [935], [939], [943], [947], [951], [955], [959], [962], [1374], [2116], [2120], [2126], [2130], [2132], [3023], [3024], [3025], [3027], [3028] [2018-09-11 23:24:49,103 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-11 23:24:49,103 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 23:25:23,038 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-11 23:25:23,038 INFO L272 AbstractInterpreter]: Visited 195 different actions 382 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-11 23:25:23,045 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-11 23:25:23,087 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-11 23:25:23,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.09 11:25:23 BoogieIcfgContainer [2018-09-11 23:25:23,088 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-11 23:25:23,089 INFO L168 Benchmark]: Toolchain (without parser) took 65172.13 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.4 GB in the end (delta: -938.8 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-11 23:25:23,091 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-09-11 23:25:23,091 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1906.25 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: 171.8 MB). Peak memory consumption was 171.8 MB. Max. memory is 7.1 GB. [2018-09-11 23:25:23,092 INFO L168 Benchmark]: Boogie Procedure Inliner took 210.60 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-11 23:25:23,093 INFO L168 Benchmark]: Boogie Preprocessor took 620.78 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 860.4 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 85.6 MB. Max. memory is 7.1 GB. [2018-09-11 23:25:23,094 INFO L168 Benchmark]: RCFGBuilder took 9239.19 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 1.7 GB in the end (delta: 548.6 MB). Peak memory consumption was 548.6 MB. Max. memory is 7.1 GB. [2018-09-11 23:25:23,095 INFO L168 Benchmark]: TraceAbstraction took 53188.16 ms. Allocated memory was 2.4 GB in the beginning and 4.2 GB in the end (delta: 1.8 GB). Free memory was 1.7 GB in the beginning and 2.4 GB in the end (delta: -609.5 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-09-11 23:25:23,100 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 1906.25 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: 171.8 MB). Peak memory consumption was 171.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 210.60 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 620.78 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 860.4 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 85.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 9239.19 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 1.7 GB in the end (delta: 548.6 MB). Peak memory consumption was 548.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 53188.16 ms. Allocated memory was 2.4 GB in the beginning and 4.2 GB in the end (delta: 1.8 GB). Free memory was 1.7 GB in the beginning and 2.4 GB in the end (delta: -609.5 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 141]: 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: [L9] int inputD = 4; [L10] int inputA = 1; [L11] int inputC = 3; [L12] int inputE = 5; [L13] int inputB = 2; [L14] int inputF = 6; [L17] int a18 = 9; [L18] int a24 = 3; [L19] int a3 = 99; [L20] int a15 = 4; [L4256] int output = -1; [L4259] COND TRUE 1 [L4262] int input; [L4263] input = __VERIFIER_nondet_int() [L4264] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L4267] CALL, EXPR calculate_output(input) [L26] COND FALSE !(((((a24==1) && (a18==9)) && (a15==4)) && a3 <= 115 )) [L29] COND FALSE !(((((a24==1) && (a18==8)) && (a15==4)) && 417 < a3 )) [L32] COND FALSE !(((((a24==2) && (a18==11)) && (a15==4)) && 417 < a3 )) [L35] COND FALSE !(((((a24==1) && (a18==8)) && (a15==4)) && a3 <= 115 )) [L38] COND FALSE !(((((a24==0) && (a18==8)) && (a15==4)) && ((306 < a3) && (417 >= a3)) )) [L41] COND FALSE !(((((a24==0) && (a18==12)) && (a15==4)) && a3 <= 115 )) [L44] COND FALSE !(((((a24==2) && (a18==9)) && (a15==4)) && 417 < a3 )) [L47] COND FALSE !(((((a24==2) && (a18==8)) && (a15==4)) && a3 <= 115 )) [L50] COND FALSE !(((((a24==1) && (a18==9)) && (a15==4)) && 417 < a3 )) [L53] COND FALSE !(((((a24==1) && (a18==10)) && (a15==4)) && ((306 < a3) && (417 >= a3)) )) [L56] COND FALSE !(((((a24==2) && (a18==11)) && (a15==4)) && ((306 < a3) && (417 >= a3)) )) [L59] COND FALSE !(((((a24==0) && (a18==11)) && (a15==4)) && ((306 < a3) && (417 >= a3)) )) [L62] COND FALSE !(((((a24==0) && (a18==9)) && (a15==4)) && ((306 < a3) && (417 >= a3)) )) [L65] COND FALSE !(((((a24==0) && (a18==9)) && (a15==4)) && a3 <= 115 )) [L68] COND FALSE !(((((a24==1) && (a18==12)) && (a15==4)) && 417 < a3 )) [L71] COND FALSE !(((((a24==0) && (a18==12)) && (a15==4)) && ((115 < a3) && (306 >= a3)) )) [L74] COND FALSE !(((((a24==2) && (a18==8)) && (a15==4)) && ((306 < a3) && (417 >= a3)) )) [L77] COND FALSE !(((((a24==1) && (a18==12)) && (a15==4)) && ((306 < a3) && (417 >= a3)) )) [L80] COND FALSE !(((((a24==1) && (a18==9)) && (a15==4)) && ((115 < a3) && (306 >= a3)) )) [L83] COND FALSE !(((((a24==0) && (a18==10)) && (a15==4)) && ((115 < a3) && (306 >= a3)) )) [L86] COND FALSE !(((((a24==0) && (a18==10)) && (a15==4)) && a3 <= 115 )) [L89] COND FALSE !(((((a24==1) && (a18==10)) && (a15==4)) && 417 < a3 )) [L92] COND FALSE !(((((a24==1) && (a18==11)) && (a15==4)) && ((306 < a3) && (417 >= a3)) )) [L95] COND FALSE !(((((a24==2) && (a18==9)) && (a15==4)) && ((115 < a3) && (306 >= a3)) )) [L98] COND FALSE !(((((a24==1) && (a18==11)) && (a15==4)) && ((115 < a3) && (306 >= a3)) )) [L101] COND FALSE !(((((a24==0) && (a18==11)) && (a15==4)) && 417 < a3 )) [L104] COND FALSE !(((((a24==2) && (a18==8)) && (a15==4)) && ((115 < a3) && (306 >= a3)) )) [L107] COND FALSE !(((((a24==2) && (a18==12)) && (a15==4)) && ((306 < a3) && (417 >= a3)) )) [L110] COND FALSE !(((((a24==2) && (a18==8)) && (a15==4)) && 417 < a3 )) [L113] COND FALSE !(((((a24==0) && (a18==9)) && (a15==4)) && 417 < a3 )) [L116] COND FALSE !(((((a24==2) && (a18==10)) && (a15==4)) && ((115 < a3) && (306 >= a3)) )) [L119] COND FALSE !(((((a24==3) && (a18==8)) && (a15==4)) && a3 <= 115 )) [L122] COND FALSE !(((((a24==0) && (a18==9)) && (a15==4)) && ((115 < a3) && (306 >= a3)) )) [L125] COND FALSE !(((((a24==1) && (a18==8)) && (a15==4)) && ((306 < a3) && (417 >= a3)) )) [L128] COND FALSE !(((((a24==2) && (a18==12)) && (a15==4)) && 417 < a3 )) [L131] COND FALSE !(((((a24==1) && (a18==11)) && (a15==4)) && a3 <= 115 )) [L134] COND FALSE !(((((a24==0) && (a18==10)) && (a15==4)) && ((306 < a3) && (417 >= a3)) )) [L137] COND FALSE !(((((a24==1) && (a18==9)) && (a15==4)) && ((306 < a3) && (417 >= a3)) )) [L140] COND FALSE !(((((a24==2) && (a18==9)) && (a15==4)) && a3 <= 115 )) [L143] COND FALSE !(((((a24==0) && (a18==12)) && (a15==4)) && ((306 < a3) && (417 >= a3)) )) [L146] COND FALSE !(((((a24==0) && (a18==10)) && (a15==4)) && 417 < a3 )) [L149] COND FALSE !(((((a24==0) && (a18==11)) && (a15==4)) && ((115 < a3) && (306 >= a3)) )) [L152] COND FALSE !(((((a24==2) && (a18==10)) && (a15==4)) && 417 < a3 )) [L155] COND FALSE !(((((a24==2) && (a18==11)) && (a15==4)) && a3 <= 115 )) [L158] COND FALSE !(((((a24==0) && (a18==8)) && (a15==4)) && 417 < a3 )) [L161] COND FALSE !(((((a24==1) && (a18==8)) && (a15==4)) && ((115 < a3) && (306 >= a3)) )) [L164] COND FALSE !(((((a24==0) && (a18==8)) && (a15==4)) && ((115 < a3) && (306 >= a3)) )) [L167] COND FALSE !(((((a24==0) && (a18==8)) && (a15==4)) && a3 <= 115 )) [L170] COND FALSE !(((((a24==2) && (a18==12)) && (a15==4)) && ((115 < a3) && (306 >= a3)) )) [L173] COND FALSE !(((((a24==1) && (a18==12)) && (a15==4)) && a3 <= 115 )) [L176] COND FALSE !(((((a24==1) && (a18==11)) && (a15==4)) && 417 < a3 )) [L179] COND FALSE !(((((a24==0) && (a18==12)) && (a15==4)) && 417 < a3 )) [L182] COND FALSE !(((((a24==1) && (a18==10)) && (a15==4)) && a3 <= 115 )) [L185] COND FALSE !(((((a24==2) && (a18==11)) && (a15==4)) && ((115 < a3) && (306 >= a3)) )) [L188] COND FALSE !(((((a24==2) && (a18==10)) && (a15==4)) && ((306 < a3) && (417 >= a3)) )) [L191] COND FALSE !(((((a24==0) && (a18==11)) && (a15==4)) && a3 <= 115 )) [L194] COND FALSE !(((((a24==1) && (a18==10)) && (a15==4)) && ((115 < a3) && (306 >= a3)) )) [L197] COND FALSE !(((((a24==2) && (a18==9)) && (a15==4)) && ((306 < a3) && (417 >= a3)) )) [L200] COND FALSE !(((((a24==1) && (a18==12)) && (a15==4)) && ((115 < a3) && (306 >= a3)) )) [L203] COND FALSE !(((((a24==2) && (a18==10)) && (a15==4)) && a3 <= 115 )) [L206] COND FALSE !(((((a24==2) && (a18==12)) && (a15==4)) && a3 <= 115 )) [L210] COND FALSE !((((input == 5) && (( a3 <= 115 && ((a18==9) && (a24==3))) || (( 417 < a3 && ((a18==12) && (a24==2))) || ( a3 <= 115 && ((a24==3) && (a18==8)))))) && (a15==6))) [L217] COND FALSE !(((a15==5) && ((((input == 6) && ((a18==8) || (a18==9))) && (a24==3)) && 417 < a3 ))) [L224] COND FALSE !((((a15==4) && ((a24==4) && (((a18==11) || (a18==12)) && (input == 5)))) && ((115 < a3) && (306 >= a3)) )) [L231] COND FALSE !((((a24==4) && (((input == 3) && ((a18==9) || (a18==10))) && (a15==4))) && ((115 < a3) && (306 >= a3)) )) [L238] COND FALSE !(( a3 <= 115 && ((((input == 5) && ((a18==9) || (a18==10))) && (a15==5)) && (a24==1)))) [L245] COND FALSE !((((a18==10) && (( 417 < a3 && (input == 3)) && (a15==5))) && (a24==3))) [L252] COND FALSE !((((((((a18==8) || (a18==9)) || (a18==10)) && (input == 2)) && (a15==4)) && (a24==4)) && ((306 < a3) && (417 >= a3)) )) [L258] COND FALSE !(((((((a18==11) || (a18==12)) && (input == 5)) && (a15==4)) && ((115 < a3) && (306 >= a3)) ) && (a24==3))) [L263] COND FALSE !(((a18==12) && ((((input == 6) && a3 <= 115 ) && (a24==2)) && (a15==5)))) [L270] COND FALSE !((( 417 < a3 && (((((a18==10) || (a18==11)) || (a18==12)) && (input == 6)) && (a24==0))) && (a15==5))) [L276] COND FALSE !(((a24==2) && (((input == 2) && (((a18==12) && ((306 < a3) && (417 >= a3)) ) || ((a18==8) && 417 < a3 ))) && (a15==6)))) [L283] COND FALSE !(((a15==6) && ((((((a18==8) || (a18==9)) || (a18==10)) && (input == 3)) && ((115 < a3) && (306 >= a3)) ) && (a24==1)))) [L290] COND FALSE !((((a24==0) && ((a15==6) && ((input == 2) && ((a18==9) || (a18==10))))) && ((115 < a3) && (306 >= a3)) )) [L295] COND FALSE !(( ((306 < a3) && (417 >= a3)) && (((a15==5) && ((input == 2) && (a18==12))) && (a24==3)))) [L298] COND FALSE !(((a15==5) && ((a24==2) && ( ((306 < a3) && (417 >= a3)) && (((a18==9) || (a18==10)) && (input == 5)))))) [L305] COND FALSE !(((a24==1) && (((input == 4) && ((((a18==11) && ((115 < a3) && (306 >= a3)) ) || ((a18==12) && ((115 < a3) && (306 >= a3)) )) || ((a18==8) && ((306 < a3) && (417 >= a3)) ))) && (a15==5)))) [L312] COND FALSE !((((a24==1) && (( a3 <= 115 && (input == 6)) && (a15==5))) && (a18==11))) [L319] COND FALSE !(((a18==10) && ( ((306 < a3) && (417 >= a3)) && ((a15==6) && ((a24==0) && (input == 1)))))) [L326] COND FALSE !(((a24==3) && ((a15==6) && (((input == 4) && ((a18==10) || (a18==11))) && 417 < a3 )))) [L333] COND FALSE !((((((( ((306 < a3) && (417 >= a3)) && (a18==12)) || ((a18==8) && 417 < a3 )) || ( 417 < a3 && (a18==9))) && (input == 2)) && (a24==3)) && (a15==6))) [L340] COND FALSE !(((a24==4) && ((a15==4) && ( ((306 < a3) && (417 >= a3)) && (((a18==10) || ((a18==8) || (a18==9))) && (input == 1)))))) [L347] COND FALSE !(((a15==4) && (( ((306 < a3) && (417 >= a3)) && ((input == 1) && ((a18==10) || ((a18==8) || (a18==9))))) && (a24==3)))) [L353] COND FALSE !(((a24==2) && ((a15==6) && ( 417 < a3 && ((((a18==9) || (a18==10)) || (a18==11)) && (input == 2)))))) [L360] COND FALSE !((((((input == 6) && (((a18==9) || (a18==10)) || (a18==11))) && (a24==2)) && (a15==6)) && ((306 < a3) && (417 >= a3)) )) [L367] COND FALSE !((((a15==6) && ((a24==0) && (((a18==11) || (a18==12)) && (input == 1)))) && ((306 < a3) && (417 >= a3)) )) [L373] COND FALSE !(((a15==5) && ((a18==12) && (( a3 <= 115 && (input == 1)) && (a24==2))))) [L380] COND FALSE !((((a24==3) && ((input == 4) && (((a18==9) && 417 < a3 ) || (( ((306 < a3) && (417 >= a3)) && (a18==12)) || ( 417 < a3 && (a18==8)))))) && (a15==6))) [L387] COND FALSE !(((((a24==1) && ((input == 1) && (a18==8))) && a3 <= 115 ) && (a15==5))) [L393] COND FALSE !(((a15==4) && ((((((a18==12) && (a24==3)) && 417 < a3 ) || (((a24==4) && (a18==8)) && a3 <= 115 )) || (((a24==4) && (a18==9)) && a3 <= 115 )) && (input == 5)))) [L399] COND FALSE !((((a24==0) && ((a15==6) && ((input == 3) && ((a18==11) || (a18==12))))) && ((306 < a3) && (417 >= a3)) )) [L406] COND FALSE !(( ((115 < a3) && (306 >= a3)) && ((a24==0) && ((a15==6) && ((input == 1) && ((a18==9) || (a18==10))))))) [L413] COND FALSE !(((((a24==2) && ((a15==5) && (input == 2))) && a3 <= 115 ) && (a18==9))) [L420] COND FALSE !(((a24==0) && (((a15==6) && (((a18==9) || (a18==10)) && (input == 5))) && ((115 < a3) && (306 >= a3)) ))) [L426] COND FALSE !(((a15==4) && (((a24==4) && (((a18==9) || (a18==10)) && (input == 4))) && 417 < a3 ))) [L432] COND FALSE !(((a15==5) && ( 417 < a3 && ((a24==1) && ((input == 6) && (a18==11)))))) [L439] COND FALSE !(((((( 417 < a3 && ((a24==3) && (a18==12))) || (((a24==4) && (a18==8)) && a3 <= 115 )) || ( a3 <= 115 && ((a24==4) && (a18==9)))) && (input == 2)) && (a15==5))) [L446] COND FALSE !(((a15==5) && (((((a18==10) || (a18==11)) && (input == 3)) && (a24==3)) && a3 <= 115 ))) [L453] COND FALSE !((((( 417 < a3 && ((a15==5) && ((a18==11) && (a24==4)))) || ( 417 < a3 && ((a15==5) && ((a24==4) && (a18==12))))) || ( a3 <= 115 && ((a15==6) && ((a18==8) && (a24==0))))) && (input == 1))) [L460] COND FALSE !(((a15==6) && ((( a3 <= 115 && ((a18==9) && (a24==1))) || (( 417 < a3 && ((a18==12) && (a24==0))) || ( a3 <= 115 && ((a18==8) && (a24==1))))) && (input == 2)))) [L466] COND FALSE !((((a24==4) && ((( 417 < a3 && (a18==8)) || (( ((306 < a3) && (417 >= a3)) && (a18==11)) || ( ((306 < a3) && (417 >= a3)) && (a18==12)))) && (input == 2))) && (a15==4))) [L473] COND FALSE !(((a18==11) && (((a24==1) && ((input == 3) && (a15==6))) && ((306 < a3) && (417 >= a3)) ))) [L480] COND FALSE !(( ((306 < a3) && (417 >= a3)) && ((a15==5) && ((((a18==9) || (a18==10)) && (input == 5)) && (a24==1))))) [L486] COND FALSE !(((((((a18==8) && 417 < a3 ) || (( ((306 < a3) && (417 >= a3)) && (a18==11)) || ((a18==12) && ((306 < a3) && (417 >= a3)) ))) && (input == 3)) && (a24==3)) && (a15==4))) [L492] COND FALSE !(( ((306 < a3) && (417 >= a3)) && (((((a18==11) || (a18==12)) && (input == 3)) && (a24==0)) && (a15==5)))) [L498] COND FALSE !((( a3 <= 115 && (((input == 2) && (a18==12)) && (a24==2))) && (a15==6))) [L503] COND FALSE !(( ((115 < a3) && (306 >= a3)) && (((a15==6) && ((input == 1) && (a24==0))) && (a18==11)))) [L509] COND FALSE !(((a24==3) && ((a15==4) && (((input == 4) && ((a18==11) || (a18==12))) && ((115 < a3) && (306 >= a3)) )))) [L515] COND FALSE !(((((((a18==9) || (a18==10)) && (input == 5)) && 417 < a3 ) && (a15==5)) && (a24==1))) [L522] COND FALSE !((((a15==6) && (((input == 6) && (((a18==10) || (a18==11)) || (a18==12))) && a3 <= 115 )) && (a24==1))) [L529] COND FALSE !((((a24==3) && (((((a18==9) || (a18==10)) || (a18==11)) && (input == 4)) && 417 < a3 )) && (a15==4))) [L535] COND FALSE !(((((a24==1) && (((a18==11) || (a18==12)) && (input == 4))) && (a15==6)) && ((115 < a3) && (306 >= a3)) )) [L542] COND FALSE !(((a15==5) && (((a24==2) && ((input == 2) && (a18==12))) && a3 <= 115 ))) [L549] COND FALSE !((( ((306 < a3) && (417 >= a3)) && ((((a18==9) || (a18==10)) && (input == 4)) && (a24==2))) && (a15==5))) [L556] COND FALSE !(((a15==4) && ((((((a18==12) && (a24==3)) && 417 < a3 ) || ( a3 <= 115 && ((a24==4) && (a18==8)))) || (((a24==4) && (a18==9)) && a3 <= 115 )) && (input == 2)))) [L563] COND FALSE !((( ((115 < a3) && (306 >= a3)) && (((input == 6) && ((a18==10) || ((a18==8) || (a18==9)))) && (a24==2))) && (a15==6))) [L570] COND FALSE !((( ((115 < a3) && (306 >= a3)) && ((a24==0) && ((a18==12) && (input == 4)))) && (a15==5))) [L576] COND FALSE !((((((a18==8) && (input == 1)) && ((115 < a3) && (306 >= a3)) ) && (a24==4)) && (a15==4))) [L583] COND FALSE !(((a15==4) && ( ((115 < a3) && (306 >= a3)) && ((a24==3) && ((input == 2) && ((a18==8) || (a18==9))))))) [L589] COND FALSE !(((a15==6) && ((((input == 4) && ((a18==9) || (a18==10))) && (a24==0)) && ((115 < a3) && (306 >= a3)) ))) [L595] COND FALSE !(( a3 <= 115 && (((a15==5) && ((input == 4) && ((a18==10) || (a18==11)))) && (a24==0)))) [L601] COND FALSE !((((((((a18==11) && (a24==1)) && 417 < a3 ) || (((a24==1) && (a18==12)) && 417 < a3 )) || (((a18==8) && (a24==2)) && a3 <= 115 )) && (input == 3)) && (a15==6))) [L607] COND FALSE !((((((a18==12) && (input == 2)) && (a15==6)) && ((306 < a3) && (417 >= a3)) ) && (a24==1))) [L612] COND FALSE !(((a24==4) && ((((input == 2) && ((a18==9) || (a18==10))) && ((115 < a3) && (306 >= a3)) ) && (a15==5)))) [L619] COND FALSE !((((((((a18==12) && (a24==2)) && 417 < a3 ) || ( a3 <= 115 && ((a18==8) && (a24==3)))) || (((a18==9) && (a24==3)) && a3 <= 115 )) && (input == 3)) && (a15==6))) [L625] COND FALSE !(((a15==4) && (((((a24==4) && (a18==9)) && a3 <= 115 ) || (( 417 < a3 && ((a24==3) && (a18==12))) || ( a3 <= 115 && ((a24==4) && (a18==8))))) && (input == 6)))) [L631] COND FALSE !((((a15==6) && (((input == 5) && ((a18==12) || ((a18==10) || (a18==11)))) && (a24==3))) && a3 <= 115 )) [L636] COND FALSE !(((a24==4) && ( a3 <= 115 && ((a18==10) && ((input == 4) && (a15==5)))))) [L643] COND FALSE !(((a15==6) && ((a18==11) && (((a24==1) && (input == 5)) && ((306 < a3) && (417 >= a3)) )))) [L649] COND FALSE !((((((((a24==3) && (a18==12)) && 417 < a3 ) || (((a24==4) && (a18==8)) && a3 <= 115 )) || (((a24==4) && (a18==9)) && a3 <= 115 )) && (input == 5)) && (a15==5))) [L656] COND FALSE !((((a24==2) && (((input == 3) && (a18==9)) && (a15==5))) && a3 <= 115 )) [L663] COND FALSE !(((( a3 <= 115 && ((((a18==10) || (a18==11)) || (a18==12)) && (input == 2))) && (a15==6)) && (a24==3))) [L670] COND FALSE !(( 417 < a3 && ((((input == 4) && ((a18==12) || ((a18==10) || (a18==11)))) && (a15==5)) && (a24==0)))) [L676] COND FALSE !(((a15==5) && (( ((115 < a3) && (306 >= a3)) && (((a18==11) || (a18==12)) && (input == 6))) && (a24==4)))) [L683] COND FALSE !((((((input == 6) && ((a18==11) || (a18==12))) && ((115 < a3) && (306 >= a3)) ) && (a15==4)) && (a24==3))) [L689] COND FALSE !(((a15==4) && (((a24==3) && ((input == 4) && ((115 < a3) && (306 >= a3)) )) && (a18==10)))) [L694] COND FALSE !(((a15==5) && (((a24==3) && (((a18==8) || (a18==9)) && (input == 4))) && ((115 < a3) && (306 >= a3)) ))) [L701] COND FALSE !(((a15==6) && (((((a18==11) || ((a18==9) || (a18==10))) && (input == 2)) && 417 < a3 ) && (a24==0)))) [L706] COND FALSE !((( 417 < a3 && ((a24==2) && ((input == 6) && (((a18==9) || (a18==10)) || (a18==11))))) && (a15==6))) [L713] COND FALSE !((((a24==1) && ((a15==6) && ( ((306 < a3) && (417 >= a3)) && (input == 5)))) && (a18==10))) [L718] COND FALSE !(((((a15==6) && (((a18==10) || ((a18==8) || (a18==9))) && (input == 5))) && (a24==3)) && ((115 < a3) && (306 >= a3)) )) [L725] COND FALSE !((( 417 < a3 && ((a24==2) && (((a18==10) || (a18==11)) && (input == 1)))) && (a15==5))) [L732] COND FALSE !(((((((a18==9) && 417 < a3 ) || (((a18==12) && ((306 < a3) && (417 >= a3)) ) || ((a18==8) && 417 < a3 ))) && (input == 6)) && (a24==3)) && (a15==6))) [L739] COND FALSE !((((a18==11) && ( ((115 < a3) && (306 >= a3)) && ((a15==6) && (input == 2)))) && (a24==0))) [L742] COND FALSE !((((a15==5) && ((input == 2) && (( ((306 < a3) && (417 >= a3)) && (a18==8)) || (( ((115 < a3) && (306 >= a3)) && (a18==11)) || ( ((115 < a3) && (306 >= a3)) && (a18==12)))))) && (a24==2))) [L749] COND FALSE !((((a15==5) && ( a3 <= 115 && (((a18==10) || (a18==11)) && (input == 1)))) && (a24==0))) [L755] COND FALSE !(( ((306 < a3) && (417 >= a3)) && (((a15==6) && ((input == 6) && (a24==0))) && (a18==10)))) [L761] COND FALSE !((((a15==6) && ((a24==3) && ((input == 4) && (((a18==8) || (a18==9)) || (a18==10))))) && ((115 < a3) && (306 >= a3)) )) [L766] COND FALSE !((((a24==1) && ( ((306 < a3) && (417 >= a3)) && ((a15==6) && (input == 4)))) && (a18==10))) [L773] COND FALSE !((((a24==1) && ( ((115 < a3) && (306 >= a3)) && ((input == 2) && ((a18==11) || (a18==12))))) && (a15==6))) [L778] COND FALSE !(( ((306 < a3) && (417 >= a3)) && ((a15==5) && ((a24==1) && ((input == 2) && ((a18==9) || (a18==10))))))) [L784] COND FALSE !(((((input == 2) && (( ((306 < a3) && (417 >= a3)) && (a18==9)) || (( ((115 < a3) && (306 >= a3)) && (a18==12)) || ((a18==8) && ((306 < a3) && (417 >= a3)) )))) && (a15==6)) && (a24==0))) [L790] COND FALSE !((((a15==6) && ( 417 < a3 && ((input == 2) && ((a18==10) || (a18==11))))) && (a24==3))) [L797] COND FALSE !(((a15==6) && ((((((a18==8) || (a18==9)) || (a18==10)) && (input == 4)) && 417 < a3 ) && (a24==1)))) [L804] COND FALSE !((( ((306 < a3) && (417 >= a3)) && ((a24==4) && (((a18==10) || ((a18==8) || (a18==9))) && (input == 4)))) && (a15==5))) [L811] COND FALSE !(( 417 < a3 && ((a18==11) && (((input == 2) && (a24==3)) && (a15==5))))) [L818] COND FALSE !(((a24==2) && (((((a18==10) || (a18==11)) && (input == 2)) && a3 <= 115 ) && (a15==6)))) [L825] COND FALSE !((((a24==0) && (((input == 6) && ((a18==11) || (a18==12))) && ((306 < a3) && (417 >= a3)) )) && (a15==6))) [L831] COND FALSE !(( a3 <= 115 && (((a15==5) && ((a24==2) && (input == 1))) && (a18==9)))) [L838] COND FALSE !(((a24==2) && ( ((115 < a3) && (306 >= a3)) && ((a15==6) && ((((a18==8) || (a18==9)) || (a18==10)) && (input == 3)))))) [L844] COND FALSE !(((( ((115 < a3) && (306 >= a3)) && ((input == 3) && (a24==0))) && (a15==5)) && (a18==12))) [L850] COND FALSE !(( ((306 < a3) && (417 >= a3)) && ((a18==10) && (((a24==1) && (input == 6)) && (a15==6))))) [L857] COND FALSE !((( 417 < a3 && (((a24==2) && (input == 2)) && (a18==9))) && (a15==5))) [L863] COND FALSE !(((a24==1) && ((a15==6) && ((a18==10) && ( ((306 < a3) && (417 >= a3)) && (input == 3)))))) [L870] COND FALSE !((((input == 1) && (((((a24==2) && (a18==12)) && 417 < a3 ) || (((a18==8) && (a24==3)) && a3 <= 115 )) || (((a24==3) && (a18==9)) && a3 <= 115 ))) && (a15==5))) [L877] COND FALSE !(((a24==1) && ((a15==6) && ( ((306 < a3) && (417 >= a3)) && ((a18==12) && (input == 3)))))) [L883] COND FALSE !(((((((a18==8) || (a18==9)) && (input == 3)) && ((115 < a3) && (306 >= a3)) ) && (a24==3)) && (a15==5))) [L890] COND FALSE !((( 417 < a3 && (((input == 1) && ((a18==10) || ((a18==8) || (a18==9)))) && (a24==1))) && (a15==6))) [L896] COND FALSE !((( a3 <= 115 && ((a24==2) && (((a18==10) || (a18==11)) && (input == 6)))) && (a15==5))) [L903] COND FALSE !(( ((115 < a3) && (306 >= a3)) && ((a24==1) && ((a15==5) && ((input == 1) && ((a18==9) || (a18==10))))))) [L909] COND FALSE !(( a3 <= 115 && ((a15==6) && ((a24==1) && ((((a18==10) || (a18==11)) || (a18==12)) && (input == 4)))))) [L915] COND FALSE !((( ((306 < a3) && (417 >= a3)) && ((a15==6) && ((input == 6) && (((a18==9) || (a18==10)) || (a18==11))))) && (a24==3))) [L922] COND FALSE !(((a15==6) && ((((((a18==12) && (a24==2)) && 417 < a3 ) || (((a18==8) && (a24==3)) && a3 <= 115 )) || ( a3 <= 115 && ((a18==9) && (a24==3)))) && (input == 1)))) [L928] COND FALSE !(((((((a18==9) || (a18==10)) && (input == 2)) && (a15==5)) && (a24==2)) && ((306 < a3) && (417 >= a3)) )) [L935] COND FALSE !((( ((306 < a3) && (417 >= a3)) && (((((a18==8) || (a18==9)) || (a18==10)) && (input == 4)) && (a24==0))) && (a15==5))) [L941] COND FALSE !((((a15==5) && ( ((115 < a3) && (306 >= a3)) && ((input == 2) && ((a18==9) || (a18==10))))) && (a24==2))) [L948] COND FALSE !(((a24==0) && (((input == 5) && ((( ((115 < a3) && (306 >= a3)) && (a18==12)) || ( ((306 < a3) && (417 >= a3)) && (a18==8))) || ((a18==9) && ((306 < a3) && (417 >= a3)) ))) && (a15==6)))) [L954] COND FALSE !(( 417 < a3 && (((a24==0) && ((((a18==10) || (a18==11)) || (a18==12)) && (input == 3))) && (a15==5)))) [L960] COND TRUE (((a24==3) && (((input == 6) && (a18==9)) && a3 <= 115 )) && (a15==4)) [L962] a24 = 0 [L963] a18 = 8 [L965] RET return -1; [L4267] EXPR calculate_output(input) [L4267] output = calculate_output(input) [L4259] COND TRUE 1 [L4262] int input; [L4263] input = __VERIFIER_nondet_int() [L4264] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L4267] CALL calculate_output(input) [L26] COND FALSE !(((((a24==1) && (a18==9)) && (a15==4)) && a3 <= 115 )) [L29] COND FALSE !(((((a24==1) && (a18==8)) && (a15==4)) && 417 < a3 )) [L32] COND FALSE !(((((a24==2) && (a18==11)) && (a15==4)) && 417 < a3 )) [L35] COND FALSE !(((((a24==1) && (a18==8)) && (a15==4)) && a3 <= 115 )) [L38] COND FALSE !(((((a24==0) && (a18==8)) && (a15==4)) && ((306 < a3) && (417 >= a3)) )) [L41] COND FALSE !(((((a24==0) && (a18==12)) && (a15==4)) && a3 <= 115 )) [L44] COND FALSE !(((((a24==2) && (a18==9)) && (a15==4)) && 417 < a3 )) [L47] COND FALSE !(((((a24==2) && (a18==8)) && (a15==4)) && a3 <= 115 )) [L50] COND FALSE !(((((a24==1) && (a18==9)) && (a15==4)) && 417 < a3 )) [L53] COND FALSE !(((((a24==1) && (a18==10)) && (a15==4)) && ((306 < a3) && (417 >= a3)) )) [L56] COND FALSE !(((((a24==2) && (a18==11)) && (a15==4)) && ((306 < a3) && (417 >= a3)) )) [L59] COND FALSE !(((((a24==0) && (a18==11)) && (a15==4)) && ((306 < a3) && (417 >= a3)) )) [L62] COND FALSE !(((((a24==0) && (a18==9)) && (a15==4)) && ((306 < a3) && (417 >= a3)) )) [L65] COND FALSE !(((((a24==0) && (a18==9)) && (a15==4)) && a3 <= 115 )) [L68] COND FALSE !(((((a24==1) && (a18==12)) && (a15==4)) && 417 < a3 )) [L71] COND FALSE !(((((a24==0) && (a18==12)) && (a15==4)) && ((115 < a3) && (306 >= a3)) )) [L74] COND FALSE !(((((a24==2) && (a18==8)) && (a15==4)) && ((306 < a3) && (417 >= a3)) )) [L77] COND FALSE !(((((a24==1) && (a18==12)) && (a15==4)) && ((306 < a3) && (417 >= a3)) )) [L80] COND FALSE !(((((a24==1) && (a18==9)) && (a15==4)) && ((115 < a3) && (306 >= a3)) )) [L83] COND FALSE !(((((a24==0) && (a18==10)) && (a15==4)) && ((115 < a3) && (306 >= a3)) )) [L86] COND FALSE !(((((a24==0) && (a18==10)) && (a15==4)) && a3 <= 115 )) [L89] COND FALSE !(((((a24==1) && (a18==10)) && (a15==4)) && 417 < a3 )) [L92] COND FALSE !(((((a24==1) && (a18==11)) && (a15==4)) && ((306 < a3) && (417 >= a3)) )) [L95] COND FALSE !(((((a24==2) && (a18==9)) && (a15==4)) && ((115 < a3) && (306 >= a3)) )) [L98] COND FALSE !(((((a24==1) && (a18==11)) && (a15==4)) && ((115 < a3) && (306 >= a3)) )) [L101] COND FALSE !(((((a24==0) && (a18==11)) && (a15==4)) && 417 < a3 )) [L104] COND FALSE !(((((a24==2) && (a18==8)) && (a15==4)) && ((115 < a3) && (306 >= a3)) )) [L107] COND FALSE !(((((a24==2) && (a18==12)) && (a15==4)) && ((306 < a3) && (417 >= a3)) )) [L110] COND FALSE !(((((a24==2) && (a18==8)) && (a15==4)) && 417 < a3 )) [L113] COND FALSE !(((((a24==0) && (a18==9)) && (a15==4)) && 417 < a3 )) [L116] COND FALSE !(((((a24==2) && (a18==10)) && (a15==4)) && ((115 < a3) && (306 >= a3)) )) [L119] COND FALSE !(((((a24==3) && (a18==8)) && (a15==4)) && a3 <= 115 )) [L122] COND FALSE !(((((a24==0) && (a18==9)) && (a15==4)) && ((115 < a3) && (306 >= a3)) )) [L125] COND FALSE !(((((a24==1) && (a18==8)) && (a15==4)) && ((306 < a3) && (417 >= a3)) )) [L128] COND FALSE !(((((a24==2) && (a18==12)) && (a15==4)) && 417 < a3 )) [L131] COND FALSE !(((((a24==1) && (a18==11)) && (a15==4)) && a3 <= 115 )) [L134] COND FALSE !(((((a24==0) && (a18==10)) && (a15==4)) && ((306 < a3) && (417 >= a3)) )) [L137] COND FALSE !(((((a24==1) && (a18==9)) && (a15==4)) && ((306 < a3) && (417 >= a3)) )) [L140] COND TRUE ((((a24==2) && (a18==9)) && (a15==4)) && a3 <= 115 ) [L141] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 775 locations, 1 error locations. UNKNOWN Result, 53.1s OverallTime, 2 OverallIterations, 2 TraceHistogramMax, 15.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 778 SDtfs, 954 SDslu, 113 SDs, 0 SdLazy, 3177 SolverSat, 685 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.0s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1474occurred in iteration=1, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 35.8s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 0.9864822134387353 AbsIntWeakeningRatio, 0.28 AbsIntAvgWeakeningVarsNumRemoved, 54.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 1 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 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/Problem18_label40_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-11_23-25-23-115.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem18_label40_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-11_23-25-23-115.csv Received shutdown request...