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/Problem13_label18_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-11 22:23:51,019 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-11 22:23:51,020 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-11 22:23:51,032 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-11 22:23:51,032 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-11 22:23:51,034 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-11 22:23:51,035 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-11 22:23:51,037 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-11 22:23:51,038 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-11 22:23:51,039 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-11 22:23:51,040 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-11 22:23:51,040 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-11 22:23:51,041 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-11 22:23:51,042 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-11 22:23:51,043 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-11 22:23:51,044 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-11 22:23:51,045 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-11 22:23:51,047 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-11 22:23:51,048 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-11 22:23:51,050 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-11 22:23:51,051 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-11 22:23:51,052 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-11 22:23:51,055 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-11 22:23:51,055 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-11 22:23:51,055 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-11 22:23:51,056 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-11 22:23:51,057 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-11 22:23:51,058 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-11 22:23:51,059 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-11 22:23:51,060 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-11 22:23:51,060 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-11 22:23:51,061 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-11 22:23:51,061 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-11 22:23:51,061 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-11 22:23:51,062 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-11 22:23:51,063 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-11 22:23:51,063 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 22:23:51,081 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-11 22:23:51,081 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-11 22:23:51,082 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-11 22:23:51,082 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-11 22:23:51,083 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-11 22:23:51,083 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-11 22:23:51,083 INFO L133 SettingsManager]: * Congruence Domain=false [2018-09-11 22:23:51,083 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-11 22:23:51,084 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2018-09-11 22:23:51,084 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-11 22:23:51,084 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-11 22:23:51,084 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-11 22:23:51,085 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-11 22:23:51,085 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-11 22:23:51,086 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-11 22:23:51,086 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-11 22:23:51,087 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-11 22:23:51,087 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-11 22:23:51,087 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-11 22:23:51,087 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-11 22:23:51,087 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-11 22:23:51,088 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-11 22:23:51,088 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-11 22:23:51,088 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-11 22:23:51,088 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-11 22:23:51,090 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-11 22:23:51,090 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-11 22:23:51,090 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-11 22:23:51,090 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-11 22:23:51,090 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-11 22:23:51,091 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-11 22:23:51,091 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-11 22:23:51,091 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-11 22:23:51,091 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-11 22:23:51,158 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-11 22:23:51,175 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-11 22:23:51,182 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-11 22:23:51,184 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-11 22:23:51,184 INFO L276 PluginConnector]: CDTParser initialized [2018-09-11 22:23:51,185 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label18_true-unreach-call.c [2018-09-11 22:23:51,554 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0a42fb0f/8900ebc0ed5042bbb25f6b0e2a784a9a/FLAGd16bbec56 [2018-09-11 22:23:52,069 INFO L276 CDTParser]: Found 1 translation units. [2018-09-11 22:23:52,070 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label18_true-unreach-call.c [2018-09-11 22:23:52,110 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0a42fb0f/8900ebc0ed5042bbb25f6b0e2a784a9a/FLAGd16bbec56 [2018-09-11 22:23:52,131 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0a42fb0f/8900ebc0ed5042bbb25f6b0e2a784a9a [2018-09-11 22:23:52,143 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-11 22:23:52,147 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-11 22:23:52,148 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-11 22:23:52,148 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-11 22:23:52,158 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-11 22:23:52,159 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 10:23:52" (1/1) ... [2018-09-11 22:23:52,162 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ec3b694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 10:23:52, skipping insertion in model container [2018-09-11 22:23:52,163 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 10:23:52" (1/1) ... [2018-09-11 22:23:52,561 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-11 22:23:53,722 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-11 22:23:53,741 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-11 22:23:54,502 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-11 22:23:54,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 10:23:54 WrapperNode [2018-09-11 22:23:54,843 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-11 22:23:54,844 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-11 22:23:54,844 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-11 22:23:54,844 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-11 22:23:54,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 10:23:54" (1/1) ... [2018-09-11 22:23:54,977 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 10:23:54" (1/1) ... [2018-09-11 22:23:55,212 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-11 22:23:55,213 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-11 22:23:55,213 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-11 22:23:55,213 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-11 22:23:56,052 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 10:23:54" (1/1) ... [2018-09-11 22:23:56,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 10:23:54" (1/1) ... [2018-09-11 22:23:56,087 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 10:23:54" (1/1) ... [2018-09-11 22:23:56,088 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 10:23:54" (1/1) ... [2018-09-11 22:23:56,231 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 10:23:54" (1/1) ... [2018-09-11 22:23:56,266 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 10:23:54" (1/1) ... [2018-09-11 22:23:56,322 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 10:23:54" (1/1) ... [2018-09-11 22:23:56,377 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-11 22:23:56,378 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-11 22:23:56,378 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-11 22:23:56,378 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-11 22:23:56,379 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 10:23:54" (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 22:23:56,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-11 22:23:56,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-11 22:23:56,443 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 22:23:56,443 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 22:23:56,444 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 22:23:56,444 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 22:23:56,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-11 22:23:56,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-11 22:23:56,444 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_output4 [2018-09-11 22:23:56,445 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_output4 [2018-09-11 22:23:56,445 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-11 22:23:56,445 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-11 22:23:56,445 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 22:23:56,445 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 22:24:09,062 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-11 22:24:09,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 10:24:09 BoogieIcfgContainer [2018-09-11 22:24:09,063 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-11 22:24:09,064 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-11 22:24:09,064 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-11 22:24:09,067 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-11 22:24:09,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 10:23:52" (1/3) ... [2018-09-11 22:24:09,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19cead96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 10:24:09, skipping insertion in model container [2018-09-11 22:24:09,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 10:23:54" (2/3) ... [2018-09-11 22:24:09,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19cead96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 10:24:09, skipping insertion in model container [2018-09-11 22:24:09,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 10:24:09" (3/3) ... [2018-09-11 22:24:09,071 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label18_true-unreach-call.c [2018-09-11 22:24:09,081 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-11 22:24:09,093 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-11 22:24:09,157 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-11 22:24:09,157 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-11 22:24:09,157 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-11 22:24:09,158 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-11 22:24:09,158 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-11 22:24:09,158 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-11 22:24:09,158 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-11 22:24:09,158 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-11 22:24:09,158 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-11 22:24:09,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states. [2018-09-11 22:24:09,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-11 22:24:09,211 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 22:24:09,212 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] [2018-09-11 22:24:09,213 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 22:24:09,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1795030300, now seen corresponding path program 1 times [2018-09-11 22:24:09,222 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 22:24:09,223 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 71 with the following transitions: [2018-09-11 22:24:09,227 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [461], [463], [3064], [3068], [3074], [3078], [4267], [4268], [4269], [4271] [2018-09-11 22:24:09,287 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-11 22:24:09,288 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 22:24:11,427 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-11 22:24:11,429 INFO L272 AbstractInterpreter]: Visited 69 different actions 69 times. Never merged. Never widened. Never found a fixpoint. Largest state had 25 variables. [2018-09-11 22:24:11,443 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-11 22:24:12,582 INFO L232 lantSequenceWeakener]: Weakened 68 states. On average, predicates are now at 73.8% of their original sizes. [2018-09-11 22:24:12,583 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-11 22:24:12,981 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-11 22:24:12,983 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-11 22:24:12,983 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-11 22:24:12,984 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-11 22:24:12,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-11 22:24:12,996 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-11 22:24:12,997 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-11 22:24:12,999 INFO L87 Difference]: Start difference. First operand 1120 states. Second operand 6 states. [2018-09-11 22:24:40,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-11 22:24:40,326 INFO L93 Difference]: Finished difference Result 3044 states and 5648 transitions. [2018-09-11 22:24:40,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-11 22:24:40,329 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-09-11 22:24:40,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-11 22:24:40,361 INFO L225 Difference]: With dead ends: 3044 [2018-09-11 22:24:40,361 INFO L226 Difference]: Without dead ends: 1922 [2018-09-11 22:24:40,372 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 69 GetRequests, 65 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 22:24:40,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1922 states. [2018-09-11 22:24:40,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1922 to 1920. [2018-09-11 22:24:40,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1920 states. [2018-09-11 22:24:40,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1920 states to 1920 states and 2831 transitions. [2018-09-11 22:24:40,562 INFO L78 Accepts]: Start accepts. Automaton has 1920 states and 2831 transitions. Word has length 70 [2018-09-11 22:24:40,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-11 22:24:40,563 INFO L480 AbstractCegarLoop]: Abstraction has 1920 states and 2831 transitions. [2018-09-11 22:24:40,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-11 22:24:40,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1920 states and 2831 transitions. [2018-09-11 22:24:40,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-09-11 22:24:40,581 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 22:24:40,581 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:24:40,582 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 22:24:40,582 INFO L82 PathProgramCache]: Analyzing trace with hash -2146098410, now seen corresponding path program 1 times [2018-09-11 22:24:40,582 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 22:24:40,583 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 172 with the following transitions: [2018-09-11 22:24:40,583 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [461], [463], [466], [474], [482], [490], [495], [499], [503], [507], [511], [522], [526], [530], [534], [538], [542], [553], [557], [561], [565], [569], [573], [577], [581], [592], [596], [600], [604], [608], [612], [616], [620], [624], [628], [632], [636], [639], [1612], [3064], [3068], [3074], [3078], [3080], [4267], [4268], [4269], [4271], [4272] [2018-09-11 22:24:40,592 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-11 22:24:40,593 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 22:24:51,495 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-11 22:24:51,496 INFO L272 AbstractInterpreter]: Visited 108 different actions 210 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-09-11 22:24:51,504 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-11 22:24:54,652 INFO L232 lantSequenceWeakener]: Weakened 169 states. On average, predicates are now at 72.1% of their original sizes. [2018-09-11 22:24:54,652 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-11 22:24:55,670 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-11 22:24:55,670 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-11 22:24:55,670 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-11 22:24:55,671 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-11 22:24:55,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-11 22:24:55,672 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-11 22:24:55,672 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-11 22:24:55,673 INFO L87 Difference]: Start difference. First operand 1920 states and 2831 transitions. Second operand 10 states. [2018-09-11 22:26:14,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-11 22:26:14,556 INFO L93 Difference]: Finished difference Result 3839 states and 6442 transitions. [2018-09-11 22:26:14,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-11 22:26:14,557 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 171 [2018-09-11 22:26:14,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-11 22:26:14,570 INFO L225 Difference]: With dead ends: 3839 [2018-09-11 22:26:14,570 INFO L226 Difference]: Without dead ends: 2729 [2018-09-11 22:26:14,575 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 177 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-11 22:26:14,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2729 states. [2018-09-11 22:26:14,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2729 to 2726. [2018-09-11 22:26:14,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2726 states. [2018-09-11 22:26:14,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2726 states to 2726 states and 3652 transitions. [2018-09-11 22:26:14,658 INFO L78 Accepts]: Start accepts. Automaton has 2726 states and 3652 transitions. Word has length 171 [2018-09-11 22:26:14,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-11 22:26:14,660 INFO L480 AbstractCegarLoop]: Abstraction has 2726 states and 3652 transitions. [2018-09-11 22:26:14,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-11 22:26:14,660 INFO L276 IsEmpty]: Start isEmpty. Operand 2726 states and 3652 transitions. [2018-09-11 22:26:14,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-09-11 22:26:14,664 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 22:26:14,665 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-11 22:26:14,665 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-11 22:26:14,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1474766753, now seen corresponding path program 1 times [2018-09-11 22:26:14,666 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 22:26:14,666 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 201 with the following transitions: [2018-09-11 22:26:14,666 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [461], [463], [466], [474], [482], [490], [495], [499], [503], [507], [511], [522], [526], [530], [534], [538], [542], [553], [557], [561], [565], [569], [573], [577], [581], [592], [596], [600], [604], [608], [612], [616], [620], [624], [628], [632], [636], [640], [644], [648], [652], [656], [660], [664], [668], [679], [683], [687], [691], [695], [699], [703], [707], [718], [729], [740], [744], [748], [752], [756], [760], [764], [768], [772], [776], [780], [783], [1612], [3064], [3068], [3074], [3078], [3080], [4267], [4268], [4269], [4271], [4272] [2018-09-11 22:26:14,673 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-11 22:26:14,673 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-11 22:26:25,487 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-11 22:26:25,488 INFO L272 AbstractInterpreter]: Visited 137 different actions 267 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-09-11 22:26:25,506 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-11 22:26:28,055 INFO L232 lantSequenceWeakener]: Weakened 198 states. On average, predicates are now at 71.92% of their original sizes. [2018-09-11 22:26:28,055 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-11 22:26:28,849 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-11 22:26:28,850 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-11 22:26:28,850 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-11 22:26:28,850 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-11 22:26:28,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-11 22:26:28,853 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-11 22:26:28,854 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-09-11 22:26:28,854 INFO L87 Difference]: Start difference. First operand 2726 states and 3652 transitions. Second operand 12 states. [2018-09-11 22:27:53,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-11 22:27:53,845 INFO L93 Difference]: Finished difference Result 5450 states and 8859 transitions. [2018-09-11 22:27:53,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-11 22:27:53,846 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 200 [2018-09-11 22:27:53,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-11 22:27:53,867 INFO L225 Difference]: With dead ends: 5450 [2018-09-11 22:27:53,868 INFO L226 Difference]: Without dead ends: 4340 [2018-09-11 22:27:53,872 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 207 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2018-09-11 22:27:53,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4340 states. [2018-09-11 22:27:53,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4340 to 4337. [2018-09-11 22:27:53,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4337 states. [2018-09-11 22:27:54,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4337 states to 4337 states and 5285 transitions. [2018-09-11 22:27:54,009 INFO L78 Accepts]: Start accepts. Automaton has 4337 states and 5285 transitions. Word has length 200 [2018-09-11 22:27:54,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-11 22:27:54,010 INFO L480 AbstractCegarLoop]: Abstraction has 4337 states and 5285 transitions. [2018-09-11 22:27:54,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-11 22:27:54,010 INFO L276 IsEmpty]: Start isEmpty. Operand 4337 states and 5285 transitions. [2018-09-11 22:27:54,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-09-11 22:27:54,017 INFO L368 BasicCegarLoop]: Found error trace [2018-09-11 22:27:54,017 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:27:54,018 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___true_unreach_call_c__calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-11 22:27:54,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1055984150, now seen corresponding path program 1 times [2018-09-11 22:27:54,018 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-11 22:27:54,019 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 294 with the following transitions: [2018-09-11 22:27:54,019 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [461], [463], [466], [474], [482], [490], [495], [499], [503], [507], [511], [522], [526], [530], [534], [538], [542], [553], [557], [561], [565], [569], [573], [577], [581], [592], [596], [600], [604], [608], [612], [616], [620], [624], [628], [632], [636], [640], [644], [648], [652], [656], [660], [664], [668], [679], [683], [687], [691], [695], [699], [703], [707], [718], [729], [740], [744], [748], [752], [756], [760], [764], [768], [772], [776], [780], [784], [788], [799], [803], [814], [825], [829], [833], [837], [841], [845], [849], [853], [857], [861], [872], [876], [880], [891], [895], [899], [903], [907], [911], [915], [919], [930], [934], [938], [942], [946], [950], [954], [965], [969], [973], [977], [988], [992], [996], [1000], [1004], [1008], [1012], [1016], [1020], [1024], [1028], [1032], [1036], [1040], [1044], [1048], [1052], [1056], [1060], [1064], [1068], [1072], [1083], [1087], [1091], [1095], [1099], [1103], [1107], [1111], [1115], [1119], [1123], [1127], [1131], [1142], [1146], [1150], [1154], [1158], [1162], [1166], [1170], [1174], [1178], [1189], [1193], [1197], [1201], [1205], [1209], [1213], [1217], [1221], [1225], [1236], [1239], [1612], [3064], [3068], [3074], [3078], [3080], [4267], [4268], [4269], [4271], [4272] [2018-09-11 22:27:54,030 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-11 22:27:54,031 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-09-11 22:28:07,328 WARN L572 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-09-11 22:28:07,329 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-09-11 22:28:07,330 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-11 22:28:07,370 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-11 22:28:07,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.09 10:28:07 BoogieIcfgContainer [2018-09-11 22:28:07,371 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-11 22:28:07,371 INFO L168 Benchmark]: Toolchain (without parser) took 255227.96 ms. Allocated memory was 1.5 GB in the beginning and 4.4 GB in the end (delta: 2.8 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -202.7 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2018-09-11 22:28:07,373 INFO L168 Benchmark]: CDTParser took 0.19 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 22:28:07,374 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2695.11 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 338.2 MB). Peak memory consumption was 338.2 MB. Max. memory is 7.1 GB. [2018-09-11 22:28:07,375 INFO L168 Benchmark]: Boogie Procedure Inliner took 368.64 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-11 22:28:07,376 INFO L168 Benchmark]: Boogie Preprocessor took 1164.92 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.0 GB). Free memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 174.3 MB. Max. memory is 7.1 GB. [2018-09-11 22:28:07,377 INFO L168 Benchmark]: RCFGBuilder took 12685.38 ms. Allocated memory was 2.6 GB in the beginning and 2.7 GB in the end (delta: 144.2 MB). Free memory was 2.4 GB in the beginning and 2.3 GB in the end (delta: 99.7 MB). Peak memory consumption was 743.6 MB. Max. memory is 7.1 GB. [2018-09-11 22:28:07,378 INFO L168 Benchmark]: TraceAbstraction took 238306.58 ms. Allocated memory was 2.7 GB in the beginning and 4.4 GB in the end (delta: 1.6 GB). Free memory was 2.3 GB in the beginning and 1.6 GB in the end (delta: 649.4 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-09-11 22:28:07,383 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2695.11 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 338.2 MB). Peak memory consumption was 338.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 368.64 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 1164.92 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.0 GB). Free memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 174.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 12685.38 ms. Allocated memory was 2.6 GB in the beginning and 2.7 GB in the end (delta: 144.2 MB). Free memory was 2.4 GB in the beginning and 2.3 GB in the end (delta: 99.7 MB). Peak memory consumption was 743.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 238306.58 ms. Allocated memory was 2.7 GB in the beginning and 4.4 GB in the end (delta: 1.6 GB). Free memory was 2.3 GB in the beginning and 1.6 GB in the end (delta: 649.4 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 201]: 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: [L10] int inputB = 2; [L11] int inputE = 5; [L12] int inputC = 3; [L13] int inputD = 4; [L14] int inputF = 6; [L17] int a26 = 1; [L18] int a13 = 0; [L19] int a19 = 9; [L20] int a23 = 158; [L21] int a12 = 286; [L22] int a1 = 2; [L5803] int output = -1; [L5806] COND TRUE 1 [L5809] int input; [L5810] input = __VERIFIER_nondet_int() [L5811] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L5814] CALL, EXPR calculate_output(input) [L29] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L32] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L35] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) [L38] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L41] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) [L44] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) [L47] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L50] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) [L53] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) [L56] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) [L59] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L62] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) [L65] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L68] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) [L71] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) [L74] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L77] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L80] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) [L83] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L86] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L89] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L92] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L95] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L98] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) [L101] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L104] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L107] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) [L110] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L113] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L116] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) [L119] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L122] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L125] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) [L128] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L131] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) [L134] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L137] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L140] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L143] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L146] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) [L149] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) [L152] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L155] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L158] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L161] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L164] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L167] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L170] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L173] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) [L176] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) [L179] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) [L182] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L185] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L188] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) [L191] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L194] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L197] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L200] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L203] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L206] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L209] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L213] COND FALSE !(((a26==1) && (((((input == 5) && ((( ((264 < a23) && (476 >= a23)) && (a19==10)) || ( 476 < a23 && (a19==10))) || ( a23 <= 95 && (a19==11)))) && ((178 < a12) && (395 >= a12)) ) && (a1==3)) && (a13==1)))) [L221] COND FALSE !(((a19==13) && ( ((395 < a12) && (441 >= a12)) && ((a1==3) && ((a26==1) && (((input == 4) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (a13==1))))))) [L229] COND FALSE !(((((a1==2) && (((input == 2) && (((a19==12) && a23 <= 95 ) || (((a19==11) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==11))))) && !(a13==1))) && 441 < a12 ) && (a26==1))) [L236] COND FALSE !((((a26==1) && (((a13==1) && ((input == 2) && (( a23 <= 95 && (a19==13)) || (((a19==12) && ((264 < a23) && (476 >= a23)) ) || ((a19==12) && 476 < a23 ))))) && a12 <= 178 )) && (a1==3))) [L243] COND FALSE !(((((a26==1) && (((a19==11) && ((a1==2) && (input == 6))) && 441 < a12 )) && (a13==1)) && ((95 < a23) && (264 >= a23)) )) [L251] COND FALSE !(( a12 <= 178 && (!(a13==1) && ((a26==1) && (((input == 2) && (((a19==13) && a23 <= 95 ) || (( ((264 < a23) && (476 >= a23)) && (a19==12)) || ((a19==12) && 476 < a23 )))) && (a1==3)))))) [L262] COND FALSE !((((((a1==2) && (((( 476 < a23 && (a19==10)) || ((a19==11) && a23 <= 95 )) || ( ((95 < a23) && (264 >= a23)) && (a19==11))) && (input == 3))) && ((395 < a12) && (441 >= a12)) ) && (a26==1)) && !(a13==1))) [L269] COND FALSE !(( ((178 < a12) && (395 >= a12)) && ((a26==1) && (((a19==9) && (((input == 6) && (a13==1)) && (a1==3))) && 476 < a23 )))) [L275] COND FALSE !((( ((95 < a23) && (264 >= a23)) && ((!(a13==1) && ((a19==11) && ((a26==1) && (input == 4)))) && ((178 < a12) && (395 >= a12)) )) && (a1==2))) [L279] COND FALSE !(((a26==1) && (((((a19==13) && (( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 6))) && a12 <= 178 ) && !(a13==1)) && (a1==3)))) [L285] COND FALSE !(((((a26==1) && (( 441 < a12 && (!(a13==1) && (input == 2))) && ((95 < a23) && (264 >= a23)) )) && (a1==3)) && (a19==13))) [L292] COND FALSE !(((a19==13) && ((((a1==3) && ((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 3)) && 441 < a12 )) && (a26==1)) && !(a13==1)))) [L308] COND FALSE !(((a19==11) && ((a26==1) && (( 476 < a23 && ( ((395 < a12) && (441 >= a12)) && ((a1==3) && (input == 2)))) && !(a13==1))))) [L315] COND FALSE !(((a1==3) && ((a26==1) && ((((a19==13) && ((input == 3) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) ))) && ((178 < a12) && (395 >= a12)) ) && !(a13==1))))) [L321] COND FALSE !(((a26==1) && (((((((a19==11) && ((95 < a23) && (264 >= a23)) ) || (( 476 < a23 && (a19==10)) || ((a19==11) && a23 <= 95 ))) && (input == 6)) && !(a13==1)) && ((395 < a12) && (441 >= a12)) ) && (a1==3)))) [L327] COND FALSE !((((a19==10) && (((((input == 2) && ((178 < a12) && (395 >= a12)) ) && a23 <= 95 ) && (a13==1)) && (a1==3))) && (a26==1))) [L330] COND FALSE !(((((a1==2) && (((a26==1) && ((input == 2) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) || 476 < a23 ))) && 441 < a12 )) && (a13==1)) && (a19==13))) [L337] COND FALSE !(((((((a1==2) && (!(a13==1) && (input == 6))) && (a19==12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && ((178 < a12) && (395 >= a12)) )) [L342] COND FALSE !(((a26==1) && (((( ((395 < a12) && (441 >= a12)) && ((input == 5) && (a19==11))) && (a13==1)) && (a1==3)) && ((264 < a23) && (476 >= a23)) ))) [L350] COND FALSE !(((a13==1) && ((( 441 < a12 && ((input == 6) && ((( 476 < a23 && (a19==9)) || ( a23 <= 95 && (a19==10))) || ( ((95 < a23) && (264 >= a23)) && (a19==10))))) && (a26==1)) && (a1==2)))) [L365] COND FALSE !(( ((264 < a23) && (476 >= a23)) && ((a26==1) && ((!(a13==1) && ((a1==3) && ((input == 3) && (a19==10)))) && a12 <= 178 )))) [L372] COND FALSE !(((((a1==3) && ((((( ((264 < a23) && (476 >= a23)) && (a19==13)) && (a13==1)) || ((a13==1) && ( 476 < a23 && (a19==13)))) || (((a19==9) && a23 <= 95 ) && !(a13==1))) && (input == 2))) && ((395 < a12) && (441 >= a12)) ) && (a26==1))) [L379] COND FALSE !(((a19==13) && (((a13==1) && ((a1==2) && ((a26==1) && (( ((264 < a23) && (476 >= a23)) || ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (input == 5))))) && ((395 < a12) && (441 >= a12)) ))) [L387] COND FALSE !(((a26==1) && (((((a19==13) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 4))) && (a13==1)) && (a1==3)) && ((178 < a12) && (395 >= a12)) ))) [L393] COND FALSE !((!(a13==1) && ((a26==1) && (( ((178 < a12) && (395 >= a12)) && ((((a19==10) && ((95 < a23) && (264 >= a23)) ) || (((a19==9) && 476 < a23 ) || ( a23 <= 95 && (a19==10)))) && (input == 3))) && (a1==2))))) [L398] COND FALSE !((( 441 < a12 && ((a1==3) && ((a19==12) && (((input == 6) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )) && (a13==1))))) && (a26==1))) [L404] COND FALSE !(((a13==1) && ((( ((395 < a12) && (441 >= a12)) && (((( ((264 < a23) && (476 >= a23)) && (a19==9)) || ( 476 < a23 && (a19==9))) || ((a19==10) && a23 <= 95 )) && (input == 5))) && (a26==1)) && (a1==2)))) [L411] COND FALSE !((((a1==3) && ((a19==9) && ( ((395 < a12) && (441 >= a12)) && ((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 5)) && !(a13==1))))) && (a26==1))) [L417] COND FALSE !((( ((395 < a12) && (441 >= a12)) && ((a19==11) && ((a13==1) && (((input == 5) && (a1==3)) && 476 < a23 )))) && (a26==1))) [L423] COND FALSE !(( ((395 < a12) && (441 >= a12)) && (((!(a13==1) && (((((a19==12) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==12))) || ( a23 <= 95 && (a19==13))) && (input == 4))) && (a1==2)) && (a26==1)))) [L430] COND FALSE !(( ((395 < a12) && (441 >= a12)) && ((a26==1) && ((a1==2) && (!(a13==1) && ((a19==10) && ((input == 2) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )))))))) [L436] COND FALSE !(((a26==1) && ((((((input == 6) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )) && !(a13==1)) && (a19==9)) && (a1==2)) && ((178 < a12) && (395 >= a12)) ))) [L441] COND FALSE !(( ((395 < a12) && (441 >= a12)) && (((a1==2) && ((a26==1) && ((input == 4) && ((( 476 < a23 && (a19==10)) || ( a23 <= 95 && (a19==11))) || ( ((95 < a23) && (264 >= a23)) && (a19==11)))))) && !(a13==1)))) [L448] COND FALSE !(((a26==1) && (((((a1==2) && ((input == 2) && ((395 < a12) && (441 >= a12)) )) && (a19==13)) && !(a13==1)) && ((95 < a23) && (264 >= a23)) ))) [L455] COND FALSE !(( 441 < a12 && ((a13==1) && ((a26==1) && (( ((95 < a23) && (264 >= a23)) && ((input == 2) && (a19==11))) && (a1==2)))))) [L462] COND FALSE !(((((((a13==1) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 6))) && (a1==2)) && (a19==9)) && 441 < a12 ) && (a26==1))) [L469] COND FALSE !(( ((178 < a12) && (395 >= a12)) && ((a19==10) && ( ((264 < a23) && (476 >= a23)) && (((!(a13==1) && (input == 3)) && (a26==1)) && (a1==2)))))) [L476] COND FALSE !((((a1==3) && ( ((178 < a12) && (395 >= a12)) && ((a13==1) && ((a19==12) && ((input == 4) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )))))) && (a26==1))) [L480] COND FALSE !(((a19==11) && ((!(a13==1) && ((a26==1) && (((input == 2) && ((178 < a12) && (395 >= a12)) ) && (a1==2)))) && a23 <= 95 ))) [L487] COND FALSE !((((a13==1) && (((a26==1) && ((((a19==11) && 476 < a23 ) || ( a23 <= 95 && (a19==12))) && (input == 3))) && a12 <= 178 )) && (a1==4))) [L499] COND FALSE !((((a1==3) && ((a13==1) && ((((( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) || ((264 < a23) && (476 >= a23)) ) && (input == 6)) && (a26==1)) && (a19==9)))) && ((178 < a12) && (395 >= a12)) )) [L505] COND FALSE !(( ((395 < a12) && (441 >= a12)) && (((((a19==11) && ((input == 6) && (a26==1))) && (a1==3)) && (a13==1)) && ((264 < a23) && (476 >= a23)) ))) [L511] COND FALSE !((( a12 <= 178 && (!(a13==1) && (((input == 6) && (((a19==10) && a23 <= 95 ) || (( ((264 < a23) && (476 >= a23)) && (a19==9)) || ((a19==9) && 476 < a23 )))) && (a26==1)))) && (a1==4))) [L517] COND FALSE !(((a1==3) && (!(a13==1) && ((((((a19==11) && ((95 < a23) && (264 >= a23)) ) || (( 476 < a23 && (a19==10)) || ( a23 <= 95 && (a19==11)))) && (input == 3)) && ((395 < a12) && (441 >= a12)) ) && (a26==1))))) [L524] COND FALSE !(((((a26==1) && ((a1==2) && ((input == 3) && ((((a19==9) && 476 < a23 ) || ( a23 <= 95 && (a19==10))) || ( ((95 < a23) && (264 >= a23)) && (a19==10)))))) && (a13==1)) && 441 < a12 )) [L530] COND FALSE !(( 476 < a23 && ((a26==1) && ( ((178 < a12) && (395 >= a12)) && ((a13==1) && ((a1==3) && ((a19==9) && (input == 2)))))))) [L536] COND FALSE !(((( ((178 < a12) && (395 >= a12)) && ((a26==1) && ((input == 4) && ((( 476 < a23 && (a19==12)) || ((a19==13) && a23 <= 95 )) || ((a19==13) && ((95 < a23) && (264 >= a23)) ))))) && !(a13==1)) && (a1==2))) [L543] COND FALSE !(((((a26==1) && (!(a13==1) && ((( 476 < a23 && (a19==9)) || ((a19==10) && a23 <= 95 )) && (input == 2)))) && a12 <= 178 ) && (a1==3))) [L555] COND FALSE !(((a26==1) && (((((a19==12) && ((input == 4) && ((264 < a23) && (476 >= a23)) )) && 441 < a12 ) && !(a13==1)) && (a1==3)))) [L569] COND FALSE !((((input == 3) && ((!(a13==1) && ((a19==13) && ((a1==2) && ( 441 < a12 && 476 < a23 )))) || (((( a23 <= 95 && a12 <= 178 ) && (a1==3)) && (a19==9)) && (a13==1)))) && (a26==1))) [L585] COND FALSE !(((a26==1) && ( ((395 < a12) && (441 >= a12)) && (!(a13==1) && (((a1==3) && ((input == 6) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))) && (a19==13)))))) [L593] COND FALSE !((( a12 <= 178 && ((((( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 4)) && (a19==10)) && (a26==1)) && (a13==1))) && (a1==3))) [L596] COND FALSE !((((((a19==11) && ((( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 3)) && (a13==1))) && (a1==4)) && a12 <= 178 ) && (a26==1))) [L604] COND FALSE !((( a12 <= 178 && ((a1==3) && (((input == 5) && (((a19==12) && ((95 < a23) && (264 >= a23)) ) || (((a19==11) && 476 < a23 ) || ( a23 <= 95 && (a19==12))))) && (a26==1)))) && (a13==1))) [L610] COND FALSE !(((a19==11) && ( ((264 < a23) && (476 >= a23)) && ( ((395 < a12) && (441 >= a12)) && (((a26==1) && (!(a13==1) && (input == 3))) && (a1==3)))))) [L617] COND FALSE !(((((a19==13) && (( 476 < a23 && ((a13==1) && (input == 2))) && a12 <= 178 )) && (a1==3)) && (a26==1))) [L624] COND FALSE !(( 441 < a12 && (( a23 <= 95 && ((((a13==1) && (input == 4)) && (a26==1)) && (a19==11))) && (a1==3)))) [L630] COND FALSE !(((!(a13==1) && ((a26==1) && ((a1==3) && ((( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 5)) && ((178 < a12) && (395 >= a12)) )))) && (a19==13))) [L636] COND FALSE !((((a26==1) && ((input == 5) && (((( ((395 < a12) && (441 >= a12)) && 476 < a23 ) && (a19==13)) && !(a13==1)) || ((( a23 <= 95 && 441 < a12 ) && (a19==9)) && (a13==1))))) && (a1==2))) [L644] COND FALSE !(( ((395 < a12) && (441 >= a12)) && (((a1==3) && (((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 6)) && (a26==1)) && !(a13==1))) && (a19==9)))) [L647] COND FALSE !(((((a1==2) && (!(a13==1) && ((( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 4)) && ((178 < a12) && (395 >= a12)) ))) && (a19==9)) && (a26==1))) [L653] COND FALSE !(((a19==11) && ((a1==3) && ( ((395 < a12) && (441 >= a12)) && ((((input == 6) && 476 < a23 ) && (a26==1)) && !(a13==1)))))) [L659] COND FALSE !(((a26==1) && ( a12 <= 178 && (!(a13==1) && (((a19==13) && ((input == 2) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))) && (a1==3)))))) [L670] COND FALSE !((((a13==1) && (( 441 < a12 && (((input == 2) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )) && (a26==1))) && (a19==9))) && (a1==2))) [L678] COND FALSE !((!(a13==1) && ((a26==1) && ( ((178 < a12) && (395 >= a12)) && ((a1==2) && ((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 4)) && (a19==11))))))) [L693] COND FALSE !(((a26==1) && (( ((95 < a23) && (264 >= a23)) && (( 441 < a12 && ((a1==3) && (input == 5))) && !(a13==1))) && (a19==13)))) [L708] COND FALSE !(((a1==3) && (((a26==1) && (((a19==10) && (( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 2))) && (a13==1))) && ((395 < a12) && (441 >= a12)) ))) [L715] COND FALSE !(( 441 < a12 && ((a26==1) && (( ((264 < a23) && (476 >= a23)) && (((input == 5) && (a1==3)) && (a19==12))) && !(a13==1))))) [L721] COND FALSE !((((a19==11) && ( ((178 < a12) && (395 >= a12)) && (((a26==1) && ((input == 2) && (a1==3))) && ((95 < a23) && (264 >= a23)) ))) && !(a13==1))) [L727] COND FALSE !((((a26==1) && ((a1==3) && ( ((395 < a12) && (441 >= a12)) && (!(a13==1) && (( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 4)))))) && (a19==13))) [L734] COND FALSE !(((a26==1) && ( ((395 < a12) && (441 >= a12)) && (((((((a19==13) && ((264 < a23) && (476 >= a23)) ) && (a13==1)) || (( 476 < a23 && (a19==13)) && (a13==1))) || (( a23 <= 95 && (a19==9)) && !(a13==1))) && (input == 4)) && (a1==3))))) [L741] COND FALSE !(((((a13==1) && ((( a12 <= 178 && (input == 4)) && a23 <= 95 ) && (a1==4))) && (a26==1)) && (a19==13))) [L747] COND FALSE !(((a1==3) && ((a26==1) && ( a12 <= 178 && (!(a13==1) && ((input == 5) && (((a19==9) && 476 < a23 ) || ( a23 <= 95 && (a19==10))))))))) [L753] COND FALSE !(((a1==2) && (!(a13==1) && ( 441 < a12 && ((a19==13) && ((( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 5)) && (a26==1))))))) [L761] COND FALSE !(((a19==13) && (((a1==3) && (((( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 4)) && (a26==1)) && a12 <= 178 )) && (a13==1)))) [L764] COND FALSE !((((!(a13==1) && (((input == 4) && (((a19==12) && ((95 < a23) && (264 >= a23)) ) || (( 476 < a23 && (a19==11)) || ( a23 <= 95 && (a19==12))))) && a12 <= 178 )) && (a1==4)) && (a26==1))) [L778] COND FALSE !(((( 441 < a12 && (!(a13==1) && ((a19==10) && ((a1==2) && (input == 4))))) && (a26==1)) && ((264 < a23) && (476 >= a23)) )) [L784] COND FALSE !((((((a19==11) && ((a26==1) && ((input == 6) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )))) && ((178 < a12) && (395 >= a12)) ) && (a1==2)) && !(a13==1))) [L791] COND FALSE !(((a19==13) && ((a26==1) && ((a1==3) && (( ((178 < a12) && (395 >= a12)) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 4))) && !(a13==1)))))) [L800] COND FALSE !(((((a1==3) && ((a19==11) && (((input == 6) && a23 <= 95 ) && (a26==1)))) && !(a13==1)) && 441 < a12 )) [L807] COND FALSE !((((((a19==12) && (((input == 4) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (a1==3))) && ((178 < a12) && (395 >= a12)) ) && (a26==1)) && (a13==1))) [L812] COND FALSE !((((((a13==1) && ((( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 6)) && (a19==13))) && ((178 < a12) && (395 >= a12)) ) && (a26==1)) && (a1==3))) [L818] COND FALSE !(((a13==1) && (((a1==4) && (( ((95 < a23) && (264 >= a23)) && ((a19==13) && (input == 5))) && a12 <= 178 )) && (a26==1)))) [L823] COND FALSE !(( 441 < a12 && ((a1==3) && ((a26==1) && ((a13==1) && ((a19==10) && ((input == 2) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )))))))) [L830] COND FALSE !(((a26==1) && ((a1==2) && ( ((395 < a12) && (441 >= a12)) && ( ((95 < a23) && (264 >= a23)) && ((!(a13==1) && (input == 6)) && (a19==13))))))) [L838] COND FALSE !(((a13==1) && (((a26==1) && (((((a19==11) && a23 <= 95 ) || (( ((264 < a23) && (476 >= a23)) && (a19==10)) || ((a19==10) && 476 < a23 ))) && (input == 3)) && (a1==3))) && ((178 < a12) && (395 >= a12)) ))) [L845] COND FALSE !(((a19==12) && ( ((264 < a23) && (476 >= a23)) && ((a26==1) && (((!(a13==1) && (input == 3)) && (a1==3)) && 441 < a12 ))))) [L861] COND FALSE !(((a26==1) && (!(a13==1) && ((((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 6)) && ((178 < a12) && (395 >= a12)) ) && (a1==3)) && (a19==11))))) [L867] COND FALSE !(( a12 <= 178 && ((a26==1) && ((a19==9) && ((((input == 6) && a23 <= 95 ) && (a13==1)) && (a1==4)))))) [L874] COND FALSE !(( ((395 < a12) && (441 >= a12)) && (((((!(a13==1) && ( a23 <= 95 && (a19==9))) || (((a13==1) && ((a19==13) && ((264 < a23) && (476 >= a23)) )) || (((a19==13) && 476 < a23 ) && (a13==1)))) && (input == 6)) && (a1==3)) && (a26==1)))) [L881] COND FALSE !((!(a13==1) && ( ((395 < a12) && (441 >= a12)) && ((a26==1) && (((a1==3) && ((input == 5) && ((95 < a23) && (264 >= a23)) )) && (a19==9)))))) [L887] COND FALSE !(((((!(a13==1) && ((( ((95 < a23) && (264 >= a23)) && (a19==13)) || (((a19==12) && 476 < a23 ) || ((a19==13) && a23 <= 95 ))) && (input == 5))) && (a1==2)) && (a26==1)) && ((178 < a12) && (395 >= a12)) )) [L894] COND FALSE !(((((((a1==3) && ( 441 < a12 && (input == 6))) && (a26==1)) && (a19==13)) && !(a13==1)) && ((95 < a23) && (264 >= a23)) )) [L901] COND FALSE !((((a26==1) && ( 441 < a12 && ((a19==11) && (((input == 6) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) || 476 < a23 )) && !(a13==1))))) && (a1==3))) [L916] COND FALSE !(((((a19==9) && ((a13==1) && ((a1==4) && ((input == 3) && (a26==1))))) && a23 <= 95 ) && a12 <= 178 )) [L921] COND FALSE !(((a26==1) && ( 476 < a23 && ((((a13==1) && ((input == 4) && a12 <= 178 )) && (a19==13)) && (a1==3))))) [L928] COND FALSE !(((!(a13==1) && ( ((395 < a12) && (441 >= a12)) && ((((( 476 < a23 && (a19==10)) || ((a19==11) && a23 <= 95 )) || ((a19==11) && ((95 < a23) && (264 >= a23)) )) && (input == 2)) && (a1==2)))) && (a26==1))) [L936] COND FALSE !(((a26==1) && ((a19==11) && ( 441 < a12 && ((a1==3) && (((input == 2) && ( 476 < a23 || ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ))) && !(a13==1))))))) [L949] COND FALSE !((( ((395 < a12) && (441 >= a12)) && ((!(a13==1) && ((((a19==13) && ((95 < a23) && (264 >= a23)) ) || (((a19==12) && 476 < a23 ) || ((a19==13) && a23 <= 95 ))) && (input == 4))) && (a1==3))) && (a26==1))) [L956] COND FALSE !(((a1==3) && (((a26==1) && ( 441 < a12 && (!(a13==1) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 6))))) && (a19==12)))) [L962] COND FALSE !((((a1==3) && ( a12 <= 178 && (((input == 2) && ((((a19==10) && 476 < a23 ) || ( a23 <= 95 && (a19==11))) || ((a19==11) && ((95 < a23) && (264 >= a23)) ))) && !(a13==1)))) && (a26==1))) [L968] COND FALSE !(((a26==1) && ((input == 2) && ((!(a13==1) && ((( 476 < a23 && 441 < a12 ) && (a1==2)) && (a19==13))) || (((a19==9) && ((a1==3) && ( a23 <= 95 && a12 <= 178 ))) && (a13==1)))))) [L976] COND FALSE !((((((((input == 4) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (a1==2)) && ((395 < a12) && (441 >= a12)) ) && (a26==1)) && (a19==12)) && (a13==1))) [L983] COND FALSE !((((a19==13) && ((a13==1) && ((a1==3) && ((a26==1) && ( ((264 < a23) && (476 >= a23)) && (input == 5)))))) && ((178 < a12) && (395 >= a12)) )) [L990] COND FALSE !(( ((395 < a12) && (441 >= a12)) && ((((a1==3) && ((( ((264 < a23) && (476 >= a23)) || ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (input == 4)) && (a19==12))) && (a26==1)) && !(a13==1)))) [L998] COND FALSE !(((a26==1) && ( ((395 < a12) && (441 >= a12)) && ((((( a23 <= 95 && (a19==10)) || (( ((264 < a23) && (476 >= a23)) && (a19==9)) || ( 476 < a23 && (a19==9)))) && (input == 3)) && (a13==1)) && (a1==2))))) [L1006] COND FALSE !((( a12 <= 178 && ((((input == 5) && (((a19==10) && a23 <= 95 ) || (( ((264 < a23) && (476 >= a23)) && (a19==9)) || ( 476 < a23 && (a19==9))))) && (a13==1)) && (a26==1))) && (a1==4))) [L1013] COND FALSE !(((a26==1) && ((a19==13) && ((((a1==3) && ((input == 6) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) || 476 < a23 ))) && (a13==1)) && 441 < a12 )))) [L1021] COND FALSE !(((((a26==1) && ((a13==1) && (((a19==13) && (input == 5)) && a23 <= 95 ))) && a12 <= 178 ) && (a1==4))) [L1027] COND FALSE !(((((a26==1) && (((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 2)) && (a19==13)) && !(a13==1))) && (a1==3)) && 441 < a12 )) [L1034] COND FALSE !(( 441 < a12 && (((a26==1) && ((((( ((264 < a23) && (476 >= a23)) && (a19==9)) || ( 476 < a23 && (a19==9))) || ( a23 <= 95 && (a19==10))) && (input == 3)) && !(a13==1))) && (a1==3)))) [L1042] COND FALSE !(((((((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 6)) && (a19==13)) && (a26==1)) && ((178 < a12) && (395 >= a12)) ) && (a1==2)) && !(a13==1))) [L1048] COND FALSE !(((a1==3) && ((a13==1) && (( ((395 < a12) && (441 >= a12)) && ((input == 2) && ((( ((264 < a23) && (476 >= a23)) && (a19==9)) || ( 476 < a23 && (a19==9))) || ((a19==10) && a23 <= 95 )))) && (a26==1))))) [L1055] COND FALSE !(((a1==3) && ((!(a13==1) && ( a12 <= 178 && (((((a19==10) && 476 < a23 ) || ( a23 <= 95 && (a19==11))) || ( ((95 < a23) && (264 >= a23)) && (a19==11))) && (input == 6)))) && (a26==1)))) [L1062] COND FALSE !(( ((395 < a12) && (441 >= a12)) && ((a26==1) && (((((((a19==13) && 476 < a23 ) && (a13==1)) || (!(a13==1) && ( a23 <= 95 && (a19==9)))) || (!(a13==1) && ((a19==9) && ((95 < a23) && (264 >= a23)) ))) && (input == 3)) && (a1==2))))) [L1069] COND FALSE !((((((a1==4) && ((input == 6) && (((a19==11) && 476 < a23 ) || ( a23 <= 95 && (a19==12))))) && a12 <= 178 ) && (a13==1)) && (a26==1))) [L1075] COND FALSE !(((!(a13==1) && ((a19==11) && ( 441 < a12 && ((a1==3) && ((a26==1) && (input == 4)))))) && a23 <= 95 )) [L1082] COND FALSE !((((a26==1) && ((a19==10) && ((!(a13==1) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 6))) && a12 <= 178 ))) && (a1==4))) [L1087] COND FALSE !((((a1==3) && ((a26==1) && ( 441 < a12 && ((input == 3) && (( ((95 < a23) && (264 >= a23)) && (a19==10)) || (((a19==9) && 476 < a23 ) || ( a23 <= 95 && (a19==10)))))))) && (a13==1))) [L1094] COND FALSE !(( 441 < a12 && (((a26==1) && ((a19==12) && (((input == 3) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) || 476 < a23 )) && !(a13==1)))) && (a1==2)))) [L1108] COND FALSE !((( 441 < a12 && ((a26==1) && ((((input == 5) && (a13==1)) && a23 <= 95 ) && (a19==13)))) && (a1==2))) [L1116] COND FALSE !(((a26==1) && ( ((95 < a23) && (264 >= a23)) && ((a19==13) && (((a1==2) && (!(a13==1) && (input == 3))) && ((395 < a12) && (441 >= a12)) ))))) [L1121] COND FALSE !((((((!(a13==1) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 6))) && (a1==2)) && 441 < a12 ) && (a19==9)) && (a26==1))) [L1129] COND FALSE !((((((((input == 4) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) || 476 < a23 )) && (a13==1)) && (a19==10)) && (a26==1)) && ((395 < a12) && (441 >= a12)) ) && (a1==2))) [L1137] COND FALSE !((((!(a13==1) && (((( a23 <= 95 && (a19==10)) || (((a19==9) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==9)))) && (input == 3)) && a12 <= 178 )) && (a26==1)) && (a1==4))) [L1145] COND FALSE !((((input == 5) && ((((a19==13) && (( 476 < a23 && 441 < a12 ) && (a1==2))) && !(a13==1)) || (((a19==9) && ((a1==3) && ( a12 <= 178 && a23 <= 95 ))) && (a13==1)))) && (a26==1))) [L1153] COND FALSE !((((a19==9) && (!(a13==1) && (((a26==1) && ((input == 5) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))) && (a1==3)))) && ((178 < a12) && (395 >= a12)) )) [L1160] COND FALSE !(((( a12 <= 178 && ((((input == 2) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )) && (a26==1)) && (a19==11))) && (a13==1)) && (a1==4))) [L1166] COND FALSE !(( 441 < a12 && (((!(a13==1) && ((a1==3) && ((input == 3) && (a19==11)))) && a23 <= 95 ) && (a26==1)))) [L1171] COND FALSE !((((a1==3) && ( ((395 < a12) && (441 >= a12)) && ((a19==11) && ( ((264 < a23) && (476 >= a23)) && ((input == 4) && (a13==1)))))) && (a26==1))) [L1178] COND FALSE !(((a26==1) && ((a1==2) && (!(a13==1) && (((a19==11) && ( ((178 < a12) && (395 >= a12)) && (input == 3))) && a23 <= 95 ))))) [L1186] COND FALSE !(((a26==1) && (( ((395 < a12) && (441 >= a12)) && (((a1==3) && ( ((264 < a23) && (476 >= a23)) && (input == 6))) && (a19==11))) && !(a13==1)))) [L1194] COND FALSE !(((a13==1) && ((((a1==4) && ((((a19==10) && a23 <= 95 ) || (((a19==9) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==9)))) && (input == 6))) && a12 <= 178 ) && (a26==1)))) [L1208] COND FALSE !((((a1==3) && (((a19==12) && ((a26==1) && ((input == 2) && ( ((264 < a23) && (476 >= a23)) || ( a23 <= 95 || ((95 < a23) && (264 >= a23)) ))))) && !(a13==1))) && ((395 < a12) && (441 >= a12)) )) [L1214] COND FALSE !(((!(a13==1) && ((((( a23 <= 95 && (a19==10)) || (((a19==9) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==9)))) && (input == 2)) && (a26==1)) && a12 <= 178 )) && (a1==4))) [L1221] COND FALSE !((!(a13==1) && ( ((264 < a23) && (476 >= a23)) && (((a26==1) && (((a19==10) && (input == 5)) && (a1==2))) && 441 < a12 )))) [L1228] COND FALSE !(((a1==3) && ((a13==1) && ((( ((395 < a12) && (441 >= a12)) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 2))) && (a19==13)) && (a26==1))))) [L1235] COND FALSE !((((a1==2) && (((a26==1) && (((( 476 < a23 && (a19==9)) || ( a23 <= 95 && (a19==10))) || ((a19==10) && ((95 < a23) && (264 >= a23)) )) && (input == 6))) && !(a13==1))) && 441 < a12 )) [L1241] COND FALSE !(((a1==3) && ((((((((a19==10) && 476 < a23 ) || ((a19==11) && a23 <= 95 )) || ((a19==11) && ((95 < a23) && (264 >= a23)) )) && (input == 5)) && (a26==1)) && !(a13==1)) && ((395 < a12) && (441 >= a12)) ))) [L1249] COND FALSE !((((a1==3) && ((((a19==10) && ((( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) || 476 < a23 ) && (input == 3))) && (a26==1)) && 441 < a12 )) && !(a13==1))) [L1255] COND FALSE !((!(a13==1) && ((a26==1) && (( ((178 < a12) && (395 >= a12)) && ((input == 2) && (((a19==10) && 476 < a23 ) || ((a19==11) && a23 <= 95 )))) && (a1==3))))) [L1263] COND FALSE !(( a12 <= 178 && ((a1==3) && ((a13==1) && (((( a23 <= 95 && (a19==13)) || (((a19==12) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==12)))) && (input == 6)) && (a26==1)))))) [L1271] COND FALSE !(((a19==9) && ((a26==1) && (((((a1==4) && (input == 4)) && a23 <= 95 ) && a12 <= 178 ) && (a13==1))))) [L1283] COND FALSE !(((!(a13==1) && (((a19==11) && (( a23 <= 95 && (input == 6)) && ((178 < a12) && (395 >= a12)) )) && (a26==1))) && (a1==2))) [L1290] COND FALSE !(((a1==2) && ((!(a13==1) && ((a19==13) && ((a26==1) && (( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 3))))) && ((178 < a12) && (395 >= a12)) ))) [L1298] COND FALSE !(( 476 < a23 && ((a1==3) && (((((input == 2) && ((395 < a12) && (441 >= a12)) ) && (a13==1)) && (a19==12)) && (a26==1))))) [L1305] COND FALSE !((((a19==9) && (((((input == 4) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )) && (a26==1)) && (a1==3)) && ((178 < a12) && (395 >= a12)) )) && !(a13==1))) [L1312] COND FALSE !((!(a13==1) && ( ((395 < a12) && (441 >= a12)) && ((((input == 6) && (((a19==13) && a23 <= 95 ) || (((a19==12) && ((264 < a23) && (476 >= a23)) ) || ((a19==12) && 476 < a23 )))) && (a1==2)) && (a26==1))))) [L1319] COND FALSE !(( ((395 < a12) && (441 >= a12)) && (((((a26==1) && ((input == 4) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))) && (a1==3)) && (a13==1)) && (a19==10)))) [L1325] COND FALSE !(((((a13==1) && (((input == 4) && (((a19==12) && ((95 < a23) && (264 >= a23)) ) || (((a19==11) && 476 < a23 ) || ((a19==12) && a23 <= 95 )))) && (a1==3))) && (a26==1)) && a12 <= 178 )) [L1330] COND FALSE !(((a19==11) && ((a26==1) && ((!(a13==1) && (((input == 3) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )) && ((395 < a12) && (441 >= a12)) )) && (a1==2))))) [L1337] COND FALSE !(((a1==4) && (((a26==1) && ( a12 <= 178 && ((( 476 < a23 && (a19==11)) || ((a19==12) && a23 <= 95 )) && (input == 5)))) && (a13==1)))) [L1343] COND FALSE !(( 441 < a12 && ((a19==13) && (!(a13==1) && ((((input == 4) && (a1==3)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)))))) [L1354] COND TRUE ((a1==2) && ((a26==1) && ((!(a13==1) && ((( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 5)) && (a19==9))) && ((178 < a12) && (395 >= a12)) ))) [L1355] a12 = (((a12 / -5) - 156259) / 5) [L1356] a23 = ((((a23 - 539579) * 1) * 10)/ 9) [L1357] a13 = 1 [L1359] RET return -1; [L5814] EXPR calculate_output(input) [L5814] output = calculate_output(input) [L5806] COND TRUE 1 [L5809] int input; [L5810] input = __VERIFIER_nondet_int() [L5811] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L5814] CALL calculate_output(input) [L29] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L32] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L35] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) [L38] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L41] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) [L44] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) [L47] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L50] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) [L53] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) [L56] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) [L59] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L62] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) [L65] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L68] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) [L71] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) [L74] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L77] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L80] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) [L83] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L86] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L89] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L92] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L95] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L98] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) [L101] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L104] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L107] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) [L110] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L113] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L116] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) [L119] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L122] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L125] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) [L128] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L131] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) [L134] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L137] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L140] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L143] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L146] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) [L149] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) [L152] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L155] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L158] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L161] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L164] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L167] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L170] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L173] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) [L176] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) [L179] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) [L182] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L185] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L188] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) [L191] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L194] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L197] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L200] COND TRUE ((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1)) [L201] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 1120 locations, 1 error locations. UNKNOWN Result, 238.2s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 191.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3739 SDtfs, 5511 SDslu, 2997 SDs, 0 SdLazy, 32123 SolverSat, 3111 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 181.2s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 453 GetRequests, 416 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4337occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 37.2s AbstIntTime, 4 AbstIntIterations, 3 AbstIntStrong, 0.994421906099988 AbsIntWeakeningRatio, 0.13013698630136986 AbsIntAvgWeakeningVarsNumRemoved, 384.82648401826486 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 3 MinimizatonAttempts, 8 StatesRemovedByMinimization, 3 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/Problem13_label18_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-11_22-28-07-408.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem13_label18_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-11_22-28-07-408.csv Completed graceful shutdown