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_CON-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem18_label18_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 07:56:19,333 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 07:56:19,334 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 07:56:19,347 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 07:56:19,347 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 07:56:19,348 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 07:56:19,349 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 07:56:19,351 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 07:56:19,353 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 07:56:19,354 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 07:56:19,355 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 07:56:19,355 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 07:56:19,356 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 07:56:19,357 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 07:56:19,358 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 07:56:19,359 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 07:56:19,360 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 07:56:19,361 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 07:56:19,363 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 07:56:19,365 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 07:56:19,366 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 07:56:19,367 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 07:56:19,370 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 07:56:19,370 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 07:56:19,370 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 07:56:19,371 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 07:56:19,372 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 07:56:19,373 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 07:56:19,374 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 07:56:19,375 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 07:56:19,375 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 07:56:19,376 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 07:56:19,376 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 07:56:19,377 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 07:56:19,378 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 07:56:19,378 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 07:56:19,379 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf [2018-09-19 07:56:19,394 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 07:56:19,394 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 07:56:19,395 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 07:56:19,395 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 07:56:19,395 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 07:56:19,396 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 07:56:19,396 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 07:56:19,396 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-19 07:56:19,396 INFO L133 SettingsManager]: * Abstract domain=CongruenceDomain [2018-09-19 07:56:19,396 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 07:56:19,397 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 07:56:19,397 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 07:56:19,397 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-19 07:56:19,398 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 07:56:19,398 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 07:56:19,398 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 07:56:19,398 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 07:56:19,399 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 07:56:19,399 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 07:56:19,399 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 07:56:19,399 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 07:56:19,399 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 07:56:19,400 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 07:56:19,400 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 07:56:19,400 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 07:56:19,400 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 07:56:19,400 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 07:56:19,401 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 07:56:19,401 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 07:56:19,401 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 07:56:19,401 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 07:56:19,401 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 07:56:19,402 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 07:56:19,402 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 07:56:19,402 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 07:56:19,444 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 07:56:19,457 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 07:56:19,461 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 07:56:19,463 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 07:56:19,463 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 07:56:19,464 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem18_label18_true-unreach-call.c [2018-09-19 07:56:19,841 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f5162300/4944ce80718e46db814daa3153a86eb7/FLAG64f5ceadf [2018-09-19 07:56:20,313 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 07:56:20,314 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem18_label18_true-unreach-call.c [2018-09-19 07:56:20,342 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f5162300/4944ce80718e46db814daa3153a86eb7/FLAG64f5ceadf [2018-09-19 07:56:20,363 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f5162300/4944ce80718e46db814daa3153a86eb7 [2018-09-19 07:56:20,376 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 07:56:20,381 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 07:56:20,382 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 07:56:20,382 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 07:56:20,393 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 07:56:20,394 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 07:56:20" (1/1) ... [2018-09-19 07:56:20,398 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@560f8b24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:56:20, skipping insertion in model container [2018-09-19 07:56:20,398 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 07:56:20" (1/1) ... [2018-09-19 07:56:20,410 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 07:56:21,559 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 07:56:21,585 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 07:56:22,060 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 07:56:22,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:56:22 WrapperNode [2018-09-19 07:56:22,217 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 07:56:22,218 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 07:56:22,219 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 07:56:22,219 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 07:56:22,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:56:22" (1/1) ... [2018-09-19 07:56:22,303 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:56:22" (1/1) ... [2018-09-19 07:56:22,433 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 07:56:22,433 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 07:56:22,433 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 07:56:22,433 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 07:56:22,829 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:56:22" (1/1) ... [2018-09-19 07:56:22,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:56:22" (1/1) ... [2018-09-19 07:56:22,843 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:56:22" (1/1) ... [2018-09-19 07:56:22,844 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:56:22" (1/1) ... [2018-09-19 07:56:22,932 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:56:22" (1/1) ... [2018-09-19 07:56:22,974 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:56:22" (1/1) ... [2018-09-19 07:56:23,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:56:22" (1/1) ... [2018-09-19 07:56:23,043 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 07:56:23,043 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 07:56:23,044 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 07:56:23,044 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 07:56:23,045 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:56:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 07:56:23,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 07:56:23,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 07:56:23,121 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-09-19 07:56:23,121 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-09-19 07:56:23,121 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-09-19 07:56:23,121 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-09-19 07:56:23,122 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 07:56:23,122 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 07:56:23,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 07:56:23,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 07:56:23,122 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 07:56:23,122 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 07:56:31,849 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 07:56:31,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 07:56:31 BoogieIcfgContainer [2018-09-19 07:56:31,850 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 07:56:31,851 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 07:56:31,851 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 07:56:31,854 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 07:56:31,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 07:56:20" (1/3) ... [2018-09-19 07:56:31,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c7b7a08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 07:56:31, skipping insertion in model container [2018-09-19 07:56:31,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 07:56:22" (2/3) ... [2018-09-19 07:56:31,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c7b7a08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 07:56:31, skipping insertion in model container [2018-09-19 07:56:31,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 07:56:31" (3/3) ... [2018-09-19 07:56:31,858 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem18_label18_true-unreach-call.c [2018-09-19 07:56:31,866 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 07:56:31,876 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 07:56:31,934 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 07:56:31,935 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 07:56:31,935 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 07:56:31,935 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 07:56:31,935 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 07:56:31,935 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 07:56:31,935 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 07:56:31,935 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 07:56:31,936 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 07:56:31,971 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states. [2018-09-19 07:56:31,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-19 07:56:31,981 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 07:56:31,982 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] [2018-09-19 07:56:31,983 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 07:56:31,988 INFO L82 PathProgramCache]: Analyzing trace with hash -502294996, now seen corresponding path program 1 times [2018-09-19 07:56:31,990 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 07:56:31,992 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 65 with the following transitions: [2018-09-19 07:56:31,994 INFO L202 CegarAbsIntRunner]: [0], [1], [1624], [1631], [1639], [1647], [1655], [1663], [1671], [1679], [1687], [1695], [1703], [1711], [1719], [1727], [1735], [1743], [1751], [1759], [1767], [1775], [1783], [1791], [1799], [1807], [1815], [1823], [1831], [1839], [1847], [1855], [1863], [1871], [1879], [1887], [1895], [1903], [1911], [1919], [1927], [1935], [1943], [1951], [1959], [1967], [1975], [1983], [1991], [1999], [2007], [2015], [2023], [2031], [2035], [2037], [3000], [3004], [3010], [3014], [3025], [3026], [3027], [3029] [2018-09-19 07:56:32,028 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-19 07:56:32,029 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 07:56:32,201 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 07:56:32,203 INFO L272 AbstractInterpreter]: Visited 63 different actions 63 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-19 07:56:32,245 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 07:56:32,434 INFO L232 lantSequenceWeakener]: Weakened 61 states. On average, predicates are now at 80.51% of their original sizes. [2018-09-19 07:56:32,434 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 07:56:32,599 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 07:56:32,601 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 07:56:32,601 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-19 07:56:32,601 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 07:56:32,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-19 07:56:32,614 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-19 07:56:32,615 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-19 07:56:32,618 INFO L87 Difference]: Start difference. First operand 775 states. Second operand 5 states. [2018-09-19 07:56:42,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 07:56:42,351 INFO L93 Difference]: Finished difference Result 2253 states and 4323 transitions. [2018-09-19 07:56:42,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-19 07:56:42,355 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2018-09-19 07:56:42,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 07:56:42,390 INFO L225 Difference]: With dead ends: 2253 [2018-09-19 07:56:42,390 INFO L226 Difference]: Without dead ends: 1476 [2018-09-19 07:56:42,400 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 63 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-19 07:56:42,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2018-09-19 07:56:42,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 1474. [2018-09-19 07:56:42,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1474 states. [2018-09-19 07:56:42,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2167 transitions. [2018-09-19 07:56:42,558 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 2167 transitions. Word has length 64 [2018-09-19 07:56:42,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 07:56:42,559 INFO L480 AbstractCegarLoop]: Abstraction has 1474 states and 2167 transitions. [2018-09-19 07:56:42,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-19 07:56:42,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 2167 transitions. [2018-09-19 07:56:42,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-09-19 07:56:42,572 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 07:56:42,573 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 07:56:42,573 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 07:56:42,573 INFO L82 PathProgramCache]: Analyzing trace with hash -362740881, now seen corresponding path program 1 times [2018-09-19 07:56:42,573 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 07:56:42,574 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 252 with the following transitions: [2018-09-19 07:56:42,575 INFO L202 CegarAbsIntRunner]: [0], [1], [1624], [1631], [1639], [1647], [1655], [1663], [1671], [1679], [1687], [1695], [1703], [1711], [1719], [1727], [1735], [1743], [1751], [1759], [1767], [1775], [1783], [1791], [1799], [1807], [1815], [1823], [1831], [1839], [1847], [1855], [1863], [1871], [1879], [1887], [1895], [1903], [1911], [1919], [1927], [1935], [1943], [1951], [1959], [1967], [1975], [1983], [1991], [1999], [2007], [2015], [2023], [2031], [2035], [2037], [2040], [2048], [2056], [2064], [2072], [2080], [2088], [2096], [2104], [2112], [2117], [2121], [2125], [2129], [2133], [2137], [2141], [2145], [2149], [2153], [2157], [2161], [2165], [2169], [2173], [2177], [2181], [2185], [2189], [2193], [2197], [2201], [2205], [2209], [2213], [2217], [2221], [2225], [2229], [2233], [2237], [2241], [2245], [2249], [2253], [2257], [2261], [2265], [2269], [2273], [2277], [2281], [2285], [2289], [2293], [2297], [2301], [2305], [2309], [2313], [2317], [2321], [2325], [2329], [2333], [2337], [2341], [2345], [2349], [2353], [2357], [2361], [2365], [2369], [2373], [2377], [2381], [2385], [2389], [2393], [2397], [2401], [2405], [2409], [2413], [2417], [2421], [2425], [2429], [2433], [2437], [2441], [2445], [2449], [2453], [2457], [2461], [2465], [2469], [2473], [2477], [2481], [2485], [2489], [2493], [2497], [2501], [2505], [2509], [2513], [2517], [2521], [2525], [2529], [2533], [2537], [2541], [2545], [2549], [2553], [2557], [2561], [2565], [2569], [2573], [2577], [2581], [2584], [2996], [3000], [3004], [3010], [3014], [3016], [3025], [3026], [3027], [3029], [3030] [2018-09-19 07:56:42,585 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-19 07:56:42,585 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 07:56:42,714 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-19 07:56:42,714 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-19 07:56:42,755 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 07:56:42,807 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 07:56:42,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 07:56:42 BoogieIcfgContainer [2018-09-19 07:56:42,808 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 07:56:42,809 INFO L168 Benchmark]: Toolchain (without parser) took 22430.70 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.4 GB in the beginning and 1.8 GB in the end (delta: -329.8 MB). Peak memory consumption was 700.4 MB. Max. memory is 7.1 GB. [2018-09-19 07:56:42,811 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 07:56:42,812 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1835.71 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 169.1 MB). Peak memory consumption was 169.1 MB. Max. memory is 7.1 GB. [2018-09-19 07:56:42,813 INFO L168 Benchmark]: Boogie Procedure Inliner took 214.47 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-19 07:56:42,814 INFO L168 Benchmark]: Boogie Preprocessor took 609.97 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 877.7 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 96.2 MB. Max. memory is 7.1 GB. [2018-09-19 07:56:42,815 INFO L168 Benchmark]: RCFGBuilder took 8806.74 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 1.8 GB in the end (delta: 484.8 MB). Peak memory consumption was 484.8 MB. Max. memory is 7.1 GB. [2018-09-19 07:56:42,818 INFO L168 Benchmark]: TraceAbstraction took 10956.84 ms. Allocated memory was 2.4 GB in the beginning and 2.6 GB in the end (delta: 152.6 MB). Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 75.7 MB). Peak memory consumption was 228.3 MB. Max. memory is 7.1 GB. [2018-09-19 07:56:42,826 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1835.71 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 169.1 MB). Peak memory consumption was 169.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 214.47 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 609.97 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 877.7 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 96.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 8806.74 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 1.8 GB in the end (delta: 484.8 MB). Peak memory consumption was 484.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10956.84 ms. Allocated memory was 2.4 GB in the beginning and 2.6 GB in the end (delta: 152.6 MB). Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 75.7 MB). Peak memory consumption was 228.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 180]: 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 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 TRUE ((((a24==0) && (a18==12)) && (a15==4)) && 417 < a3 ) [L180] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 775 locations, 1 error locations. UNKNOWN Result, 10.8s OverallTime, 2 OverallIterations, 2 TraceHistogramMax, 9.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 780 SDtfs, 702 SDslu, 261 SDs, 0 SdLazy, 4829 SolverSat, 682 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.3s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 63 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s 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, 0.4s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 0.9969731326874183 AbsIntWeakeningRatio, 0.2222222222222222 AbsIntAvgWeakeningVarsNumRemoved, 16.73015873015873 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_label18_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_07-56-42-847.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem18_label18_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_07-56-42-847.csv Received shutdown request...