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_INT-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem13_label13_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 06:12:21,059 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 06:12:21,061 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 06:12:21,074 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 06:12:21,075 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 06:12:21,076 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 06:12:21,078 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 06:12:21,079 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 06:12:21,081 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 06:12:21,082 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 06:12:21,083 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 06:12:21,083 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 06:12:21,084 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 06:12:21,085 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 06:12:21,086 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 06:12:21,087 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 06:12:21,088 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 06:12:21,090 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 06:12:21,092 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 06:12:21,093 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 06:12:21,095 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 06:12:21,096 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 06:12:21,100 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 06:12:21,101 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 06:12:21,101 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 06:12:21,102 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 06:12:21,103 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 06:12:21,106 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 06:12:21,107 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 06:12:21,108 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 06:12:21,111 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 06:12:21,112 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 06:12:21,112 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 06:12:21,112 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 06:12:21,113 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 06:12:21,116 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 06:12:21,116 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_INT-OldIcfg.epf [2018-09-19 06:12:21,146 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 06:12:21,146 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 06:12:21,147 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 06:12:21,147 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 06:12:21,147 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 06:12:21,149 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 06:12:21,150 INFO L133 SettingsManager]: * Congruence Domain=false [2018-09-19 06:12:21,150 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 06:12:21,150 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-19 06:12:21,150 INFO L133 SettingsManager]: * Abstract domain=IntervalDomain [2018-09-19 06:12:21,150 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 06:12:21,151 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 06:12:21,151 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 06:12:21,152 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 06:12:21,152 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 06:12:21,152 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 06:12:21,152 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 06:12:21,153 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 06:12:21,153 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 06:12:21,153 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 06:12:21,154 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 06:12:21,154 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 06:12:21,154 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 06:12:21,154 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 06:12:21,155 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 06:12:21,155 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 06:12:21,155 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 06:12:21,155 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 06:12:21,156 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 06:12:21,156 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 06:12:21,156 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 06:12:21,156 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 06:12:21,156 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 06:12:21,156 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 06:12:21,157 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 06:12:21,212 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 06:12:21,228 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 06:12:21,234 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 06:12:21,236 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 06:12:21,236 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 06:12:21,237 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label13_true-unreach-call.c [2018-09-19 06:12:21,604 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cea037fae/e06de13547f447f094b5d1702a495b14/FLAG0e1eb4716 [2018-09-19 06:12:22,130 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 06:12:22,131 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label13_true-unreach-call.c [2018-09-19 06:12:22,164 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cea037fae/e06de13547f447f094b5d1702a495b14/FLAG0e1eb4716 [2018-09-19 06:12:22,179 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cea037fae/e06de13547f447f094b5d1702a495b14 [2018-09-19 06:12:22,190 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 06:12:22,193 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 06:12:22,194 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 06:12:22,195 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 06:12:22,202 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 06:12:22,203 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 06:12:22" (1/1) ... [2018-09-19 06:12:22,206 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ee9519a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:12:22, skipping insertion in model container [2018-09-19 06:12:22,206 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 06:12:22" (1/1) ... [2018-09-19 06:12:22,219 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 06:12:23,730 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 06:12:23,751 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 06:12:24,560 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 06:12:24,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:12:24 WrapperNode [2018-09-19 06:12:24,911 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 06:12:24,912 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 06:12:24,912 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 06:12:24,913 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 06:12:24,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:12:24" (1/1) ... [2018-09-19 06:12:25,032 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:12:24" (1/1) ... [2018-09-19 06:12:25,190 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 06:12:25,191 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 06:12:25,191 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 06:12:25,191 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 06:12:26,029 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:12:24" (1/1) ... [2018-09-19 06:12:26,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:12:24" (1/1) ... [2018-09-19 06:12:26,089 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:12:24" (1/1) ... [2018-09-19 06:12:26,090 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:12:24" (1/1) ... [2018-09-19 06:12:26,240 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:12:24" (1/1) ... [2018-09-19 06:12:26,295 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:12:24" (1/1) ... [2018-09-19 06:12:26,361 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:12:24" (1/1) ... [2018-09-19 06:12:26,422 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 06:12:26,423 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 06:12:26,423 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 06:12:26,423 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 06:12:26,424 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:12:24" (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 06:12:26,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 06:12:26,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 06:12:26,491 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-09-19 06:12:26,491 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-09-19 06:12:26,491 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-09-19 06:12:26,491 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-09-19 06:12:26,491 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-09-19 06:12:26,492 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-09-19 06:12:26,492 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 06:12:26,492 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 06:12:26,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 06:12:26,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 06:12:26,493 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 06:12:26,493 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 06:12:36,714 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 06:12:36,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 06:12:36 BoogieIcfgContainer [2018-09-19 06:12:36,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 06:12:36,715 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 06:12:36,716 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 06:12:36,719 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 06:12:36,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 06:12:22" (1/3) ... [2018-09-19 06:12:36,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a54380f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 06:12:36, skipping insertion in model container [2018-09-19 06:12:36,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:12:24" (2/3) ... [2018-09-19 06:12:36,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a54380f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 06:12:36, skipping insertion in model container [2018-09-19 06:12:36,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 06:12:36" (3/3) ... [2018-09-19 06:12:36,722 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label13_true-unreach-call.c [2018-09-19 06:12:36,732 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 06:12:36,741 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 06:12:36,813 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 06:12:36,814 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 06:12:36,814 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 06:12:36,814 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 06:12:36,814 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 06:12:36,814 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 06:12:36,815 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 06:12:36,815 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 06:12:36,815 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 06:12:36,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states. [2018-09-19 06:12:36,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-19 06:12:36,886 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:12:36,887 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 06:12:36,888 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:12:36,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1465464788, now seen corresponding path program 1 times [2018-09-19 06:12:36,895 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:12:36,896 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 65 with the following transitions: [2018-09-19 06:12:36,898 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2699], [2707], [2715], [2723], [2731], [2739], [2747], [2755], [2763], [2771], [2779], [2787], [2795], [2803], [2811], [2819], [2827], [2835], [2843], [2851], [2859], [2867], [2875], [2883], [2891], [2899], [2907], [2915], [2923], [2931], [2939], [2947], [2955], [2963], [2971], [2979], [2987], [2995], [3003], [3011], [3019], [3027], [3035], [3039], [3041], [4242], [4246], [4252], [4256], [4269], [4270], [4271], [4273] [2018-09-19 06:12:36,942 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:12:36,942 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:12:37,245 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:12:37,247 INFO L272 AbstractInterpreter]: Visited 63 different actions 63 times. Never merged. Never widened. Never found a fixpoint. Largest state had 25 variables. [2018-09-19 06:12:37,294 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:12:37,454 INFO L232 lantSequenceWeakener]: Weakened 61 states. On average, predicates are now at 73.25% of their original sizes. [2018-09-19 06:12:37,455 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:12:37,769 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:12:37,771 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:12:37,771 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 06:12:37,771 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:12:37,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 06:12:37,785 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 06:12:37,786 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 06:12:37,789 INFO L87 Difference]: Start difference. First operand 1120 states. Second operand 6 states. [2018-09-19 06:12:50,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:12:50,547 INFO L93 Difference]: Finished difference Result 3044 states and 5648 transitions. [2018-09-19 06:12:50,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 06:12:50,550 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-09-19 06:12:50,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:12:50,590 INFO L225 Difference]: With dead ends: 3044 [2018-09-19 06:12:50,591 INFO L226 Difference]: Without dead ends: 1922 [2018-09-19 06:12:50,600 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 63 GetRequests, 59 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-19 06:12:50,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1922 states. [2018-09-19 06:12:50,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1922 to 1920. [2018-09-19 06:12:50,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1920 states. [2018-09-19 06:12:50,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1920 states to 1920 states and 2831 transitions. [2018-09-19 06:12:50,763 INFO L78 Accepts]: Start accepts. Automaton has 1920 states and 2831 transitions. Word has length 64 [2018-09-19 06:12:50,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:12:50,764 INFO L480 AbstractCegarLoop]: Abstraction has 1920 states and 2831 transitions. [2018-09-19 06:12:50,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 06:12:50,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1920 states and 2831 transitions. [2018-09-19 06:12:50,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-09-19 06:12:50,773 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:12:50,773 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] [2018-09-19 06:12:50,774 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:12:50,774 INFO L82 PathProgramCache]: Analyzing trace with hash -2091389760, now seen corresponding path program 1 times [2018-09-19 06:12:50,774 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:12:50,775 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 166 with the following transitions: [2018-09-19 06:12:50,775 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2699], [2707], [2715], [2723], [2731], [2739], [2747], [2755], [2763], [2771], [2779], [2787], [2795], [2803], [2811], [2819], [2827], [2835], [2843], [2851], [2859], [2867], [2875], [2883], [2891], [2899], [2907], [2915], [2923], [2931], [2939], [2947], [2955], [2963], [2971], [2979], [2987], [2995], [3003], [3011], [3019], [3027], [3035], [3039], [3041], [3044], [3052], [3060], [3068], [3076], [3084], [3092], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [3152], [3156], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [3222], [3226], [3230], [3234], [3238], [3242], [3246], [3250], [3254], [3258], [3262], [3265], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-09-19 06:12:50,782 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:12:50,782 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:12:51,144 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:12:51,144 INFO L272 AbstractInterpreter]: Visited 108 different actions 311 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-09-19 06:12:51,182 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:12:51,411 INFO L232 lantSequenceWeakener]: Weakened 162 states. On average, predicates are now at 71.79% of their original sizes. [2018-09-19 06:12:51,411 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:12:52,121 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:12:52,124 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:12:52,124 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:12:52,124 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:12:52,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:12:52,126 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:12:52,126 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:12:52,126 INFO L87 Difference]: Start difference. First operand 1920 states and 2831 transitions. Second operand 10 states. [2018-09-19 06:13:11,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:13:11,836 INFO L93 Difference]: Finished difference Result 3841 states and 6447 transitions. [2018-09-19 06:13:11,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-19 06:13:11,836 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 165 [2018-09-19 06:13:11,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:13:11,852 INFO L225 Difference]: With dead ends: 3841 [2018-09-19 06:13:11,853 INFO L226 Difference]: Without dead ends: 2731 [2018-09-19 06:13:11,858 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 171 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 06:13:11,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2731 states. [2018-09-19 06:13:11,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2731 to 2726. [2018-09-19 06:13:11,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2726 states. [2018-09-19 06:13:11,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2726 states to 2726 states and 3662 transitions. [2018-09-19 06:13:11,920 INFO L78 Accepts]: Start accepts. Automaton has 2726 states and 3662 transitions. Word has length 165 [2018-09-19 06:13:11,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:13:11,921 INFO L480 AbstractCegarLoop]: Abstraction has 2726 states and 3662 transitions. [2018-09-19 06:13:11,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:13:11,922 INFO L276 IsEmpty]: Start isEmpty. Operand 2726 states and 3662 transitions. [2018-09-19 06:13:11,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-09-19 06:13:11,927 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:13:11,927 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] [2018-09-19 06:13:11,927 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:13:11,928 INFO L82 PathProgramCache]: Analyzing trace with hash -275756727, now seen corresponding path program 1 times [2018-09-19 06:13:11,928 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:13:11,928 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 195 with the following transitions: [2018-09-19 06:13:11,929 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2699], [2707], [2715], [2723], [2731], [2739], [2747], [2755], [2763], [2771], [2779], [2787], [2795], [2803], [2811], [2819], [2827], [2835], [2843], [2851], [2859], [2867], [2875], [2883], [2891], [2899], [2907], [2915], [2923], [2931], [2939], [2947], [2955], [2963], [2971], [2979], [2987], [2995], [3003], [3011], [3019], [3027], [3035], [3039], [3041], [3044], [3052], [3060], [3068], [3076], [3084], [3092], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [3152], [3156], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [3222], [3226], [3230], [3234], [3238], [3242], [3246], [3250], [3254], [3258], [3262], [3266], [3270], [3274], [3278], [3282], [3286], [3290], [3294], [3305], [3309], [3313], [3317], [3321], [3325], [3329], [3333], [3344], [3355], [3366], [3370], [3374], [3378], [3382], [3386], [3390], [3394], [3398], [3402], [3406], [3409], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-09-19 06:13:11,934 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:13:11,934 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:13:12,042 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:13:12,212 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:13:12,212 INFO L272 AbstractInterpreter]: Visited 137 different actions 398 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-09-19 06:13:12,252 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:13:12,478 INFO L232 lantSequenceWeakener]: Weakened 191 states. On average, predicates are now at 71.65% of their original sizes. [2018-09-19 06:13:12,480 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:13:13,064 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:13:13,065 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:13:13,065 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:13:13,065 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:13:13,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:13:13,066 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:13:13,067 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:13:13,067 INFO L87 Difference]: Start difference. First operand 2726 states and 3662 transitions. Second operand 10 states. [2018-09-19 06:13:33,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:13:33,973 INFO L93 Difference]: Finished difference Result 4658 states and 7291 transitions. [2018-09-19 06:13:33,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-19 06:13:33,975 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 194 [2018-09-19 06:13:33,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:13:33,991 INFO L225 Difference]: With dead ends: 4658 [2018-09-19 06:13:33,992 INFO L226 Difference]: Without dead ends: 3548 [2018-09-19 06:13:33,996 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 200 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 06:13:33,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3548 states. [2018-09-19 06:13:34,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3548 to 3542. [2018-09-19 06:13:34,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3542 states. [2018-09-19 06:13:34,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3542 states to 3542 states and 4500 transitions. [2018-09-19 06:13:34,075 INFO L78 Accepts]: Start accepts. Automaton has 3542 states and 4500 transitions. Word has length 194 [2018-09-19 06:13:34,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:13:34,076 INFO L480 AbstractCegarLoop]: Abstraction has 3542 states and 4500 transitions. [2018-09-19 06:13:34,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:13:34,078 INFO L276 IsEmpty]: Start isEmpty. Operand 3542 states and 4500 transitions. [2018-09-19 06:13:34,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-09-19 06:13:34,084 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:13:34,085 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 06:13:34,085 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:13:34,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1084648564, now seen corresponding path program 1 times [2018-09-19 06:13:34,085 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:13:34,086 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 260 with the following transitions: [2018-09-19 06:13:34,086 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2699], [2707], [2715], [2723], [2731], [2739], [2747], [2755], [2763], [2771], [2779], [2787], [2795], [2803], [2811], [2819], [2827], [2835], [2843], [2851], [2859], [2867], [2875], [2883], [2891], [2899], [2907], [2915], [2923], [2931], [2939], [2947], [2955], [2963], [2971], [2979], [2987], [2995], [3003], [3011], [3019], [3027], [3035], [3039], [3041], [3044], [3052], [3060], [3068], [3076], [3084], [3092], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [3152], [3156], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [3222], [3226], [3230], [3234], [3237], [3238], [3242], [3246], [3250], [3254], [3258], [3262], [3265], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-09-19 06:13:34,095 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:13:34,096 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:13:34,213 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:13:34,338 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:13:34,338 INFO L272 AbstractInterpreter]: Visited 109 different actions 423 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 26 variables. [2018-09-19 06:13:34,357 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:13:34,583 INFO L232 lantSequenceWeakener]: Weakened 256 states. On average, predicates are now at 71.47% of their original sizes. [2018-09-19 06:13:34,583 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:13:34,829 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:13:34,830 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:13:34,830 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:13:34,830 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:13:34,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:13:34,831 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:13:34,831 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:13:34,832 INFO L87 Difference]: Start difference. First operand 3542 states and 4500 transitions. Second operand 10 states. [2018-09-19 06:13:53,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:13:53,046 INFO L93 Difference]: Finished difference Result 6286 states and 8969 transitions. [2018-09-19 06:13:53,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-19 06:13:53,047 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 259 [2018-09-19 06:13:53,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:13:53,067 INFO L225 Difference]: With dead ends: 6286 [2018-09-19 06:13:53,067 INFO L226 Difference]: Without dead ends: 4360 [2018-09-19 06:13:53,074 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 265 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 06:13:53,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4360 states. [2018-09-19 06:13:53,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4360 to 4349. [2018-09-19 06:13:53,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4349 states. [2018-09-19 06:13:53,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4349 states to 4349 states and 5346 transitions. [2018-09-19 06:13:53,190 INFO L78 Accepts]: Start accepts. Automaton has 4349 states and 5346 transitions. Word has length 259 [2018-09-19 06:13:53,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:13:53,191 INFO L480 AbstractCegarLoop]: Abstraction has 4349 states and 5346 transitions. [2018-09-19 06:13:53,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:13:53,192 INFO L276 IsEmpty]: Start isEmpty. Operand 4349 states and 5346 transitions. [2018-09-19 06:13:53,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-09-19 06:13:53,197 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:13:53,197 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 06:13:53,197 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:13:53,198 INFO L82 PathProgramCache]: Analyzing trace with hash 109329268, now seen corresponding path program 1 times [2018-09-19 06:13:53,198 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:13:53,198 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 272 with the following transitions: [2018-09-19 06:13:53,200 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2699], [2707], [2715], [2723], [2731], [2739], [2747], [2755], [2763], [2771], [2779], [2787], [2795], [2803], [2811], [2819], [2827], [2835], [2843], [2851], [2859], [2867], [2875], [2883], [2891], [2899], [2907], [2915], [2923], [2931], [2939], [2947], [2955], [2963], [2971], [2979], [2987], [2995], [3003], [3011], [3019], [3027], [3035], [3039], [3041], [3044], [3052], [3060], [3068], [3076], [3084], [3092], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [3152], [3156], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [3222], [3226], [3230], [3234], [3238], [3242], [3246], [3250], [3254], [3258], [3262], [3265], [3266], [3270], [3274], [3278], [3282], [3285], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-09-19 06:13:53,206 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:13:53,207 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:13:53,351 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:13:53,530 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:13:53,531 INFO L272 AbstractInterpreter]: Visited 114 different actions 554 times. Merged at 7 different actions 28 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 26 variables. [2018-09-19 06:13:53,566 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:13:53,802 INFO L232 lantSequenceWeakener]: Weakened 268 states. On average, predicates are now at 71.45% of their original sizes. [2018-09-19 06:13:53,803 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:13:54,046 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:13:54,047 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:13:54,047 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:13:54,047 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:13:54,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:13:54,048 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:13:54,048 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:13:54,049 INFO L87 Difference]: Start difference. First operand 4349 states and 5346 transitions. Second operand 10 states. [2018-09-19 06:14:14,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:14:14,655 INFO L93 Difference]: Finished difference Result 7122 states and 9858 transitions. [2018-09-19 06:14:14,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:14:14,657 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 271 [2018-09-19 06:14:14,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:14:14,675 INFO L225 Difference]: With dead ends: 7122 [2018-09-19 06:14:14,675 INFO L226 Difference]: Without dead ends: 5196 [2018-09-19 06:14:14,682 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 278 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:14:14,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5196 states. [2018-09-19 06:14:14,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5196 to 5172. [2018-09-19 06:14:14,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5172 states. [2018-09-19 06:14:14,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5172 states to 5172 states and 6295 transitions. [2018-09-19 06:14:14,768 INFO L78 Accepts]: Start accepts. Automaton has 5172 states and 6295 transitions. Word has length 271 [2018-09-19 06:14:14,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:14:14,769 INFO L480 AbstractCegarLoop]: Abstraction has 5172 states and 6295 transitions. [2018-09-19 06:14:14,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:14:14,769 INFO L276 IsEmpty]: Start isEmpty. Operand 5172 states and 6295 transitions. [2018-09-19 06:14:14,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-09-19 06:14:14,774 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:14:14,775 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:14:14,775 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:14:14,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1427921068, now seen corresponding path program 1 times [2018-09-19 06:14:14,776 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:14:14,776 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 288 with the following transitions: [2018-09-19 06:14:14,776 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2699], [2707], [2715], [2723], [2731], [2739], [2747], [2755], [2763], [2771], [2779], [2787], [2795], [2803], [2811], [2819], [2827], [2835], [2843], [2851], [2859], [2867], [2875], [2883], [2891], [2899], [2907], [2915], [2923], [2931], [2939], [2947], [2955], [2963], [2971], [2979], [2987], [2995], [3003], [3011], [3019], [3027], [3035], [3039], [3041], [3044], [3052], [3060], [3068], [3076], [3084], [3092], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [3152], [3156], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [3222], [3226], [3230], [3234], [3238], [3242], [3246], [3250], [3254], [3258], [3262], [3266], [3270], [3274], [3278], [3282], [3286], [3290], [3294], [3305], [3309], [3313], [3317], [3321], [3325], [3329], [3333], [3344], [3355], [3366], [3370], [3374], [3378], [3382], [3386], [3390], [3394], [3398], [3402], [3406], [3410], [3414], [3425], [3429], [3440], [3451], [3455], [3459], [3463], [3467], [3471], [3475], [3479], [3483], [3487], [3498], [3502], [3506], [3517], [3521], [3525], [3529], [3533], [3537], [3541], [3545], [3556], [3560], [3564], [3568], [3572], [3576], [3580], [3591], [3595], [3599], [3603], [3614], [3618], [3622], [3626], [3630], [3634], [3638], [3642], [3646], [3650], [3654], [3658], [3662], [3666], [3670], [3674], [3678], [3682], [3686], [3690], [3694], [3698], [3709], [3713], [3717], [3721], [3725], [3729], [3733], [3737], [3741], [3745], [3749], [3753], [3757], [3768], [3772], [3776], [3780], [3784], [3788], [3792], [3796], [3800], [3804], [3815], [3819], [3823], [3827], [3831], [3835], [3839], [3843], [3847], [3851], [3862], [3865], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-09-19 06:14:14,782 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:14:14,782 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:14:14,950 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:14:15,194 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:14:15,194 INFO L272 AbstractInterpreter]: Visited 230 different actions 677 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-09-19 06:14:15,204 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:14:15,437 INFO L232 lantSequenceWeakener]: Weakened 284 states. On average, predicates are now at 71.38% of their original sizes. [2018-09-19 06:14:15,437 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:14:15,534 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:14:15,534 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:14:15,535 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:14:15,535 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:14:15,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:14:15,536 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:14:15,536 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:14:15,536 INFO L87 Difference]: Start difference. First operand 5172 states and 6295 transitions. Second operand 10 states. [2018-09-19 06:14:27,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:14:27,118 INFO L93 Difference]: Finished difference Result 9555 states and 12535 transitions. [2018-09-19 06:14:27,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-19 06:14:27,120 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 287 [2018-09-19 06:14:27,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:14:27,143 INFO L225 Difference]: With dead ends: 9555 [2018-09-19 06:14:27,143 INFO L226 Difference]: Without dead ends: 6805 [2018-09-19 06:14:27,152 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 293 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 06:14:27,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6805 states. [2018-09-19 06:14:27,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6805 to 6799. [2018-09-19 06:14:27,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6799 states. [2018-09-19 06:14:27,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6799 states to 6799 states and 7958 transitions. [2018-09-19 06:14:27,267 INFO L78 Accepts]: Start accepts. Automaton has 6799 states and 7958 transitions. Word has length 287 [2018-09-19 06:14:27,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:14:27,267 INFO L480 AbstractCegarLoop]: Abstraction has 6799 states and 7958 transitions. [2018-09-19 06:14:27,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:14:27,268 INFO L276 IsEmpty]: Start isEmpty. Operand 6799 states and 7958 transitions. [2018-09-19 06:14:27,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-09-19 06:14:27,273 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:14:27,273 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 06:14:27,274 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:14:27,274 INFO L82 PathProgramCache]: Analyzing trace with hash -654485283, now seen corresponding path program 1 times [2018-09-19 06:14:27,274 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:14:27,274 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 296 with the following transitions: [2018-09-19 06:14:27,275 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2699], [2707], [2715], [2723], [2731], [2739], [2747], [2755], [2763], [2771], [2779], [2787], [2795], [2803], [2811], [2819], [2827], [2835], [2843], [2851], [2859], [2867], [2875], [2883], [2891], [2899], [2907], [2915], [2923], [2931], [2939], [2947], [2955], [2963], [2971], [2979], [2987], [2995], [3003], [3011], [3019], [3027], [3035], [3039], [3041], [3044], [3052], [3060], [3068], [3076], [3084], [3092], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [3152], [3156], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [3222], [3226], [3230], [3234], [3238], [3242], [3246], [3250], [3254], [3258], [3262], [3265], [3266], [3270], [3274], [3278], [3282], [3286], [3290], [3294], [3305], [3309], [3313], [3317], [3321], [3325], [3329], [3333], [3344], [3355], [3366], [3370], [3374], [3378], [3382], [3386], [3390], [3394], [3398], [3402], [3406], [3409], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-09-19 06:14:27,277 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:14:27,278 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:14:27,361 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:14:27,613 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:14:27,613 INFO L272 AbstractInterpreter]: Visited 138 different actions 675 times. Merged at 7 different actions 29 times. Never widened. Found 6 fixpoints after 1 different actions. Largest state had 26 variables. [2018-09-19 06:14:27,627 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:14:27,838 INFO L232 lantSequenceWeakener]: Weakened 292 states. On average, predicates are now at 71.4% of their original sizes. [2018-09-19 06:14:27,838 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:14:27,935 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:14:27,936 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:14:27,936 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:14:27,936 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:14:27,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:14:27,937 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:14:27,937 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:14:27,937 INFO L87 Difference]: Start difference. First operand 6799 states and 7958 transitions. Second operand 10 states. [2018-09-19 06:14:43,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:14:43,925 INFO L93 Difference]: Finished difference Result 12854 states and 16029 transitions. [2018-09-19 06:14:43,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:14:43,926 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 295 [2018-09-19 06:14:43,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:14:43,954 INFO L225 Difference]: With dead ends: 12854 [2018-09-19 06:14:43,954 INFO L226 Difference]: Without dead ends: 8477 [2018-09-19 06:14:43,964 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 302 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:14:43,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8477 states. [2018-09-19 06:14:44,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8477 to 8451. [2018-09-19 06:14:44,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8451 states. [2018-09-19 06:14:44,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8451 states to 8451 states and 9710 transitions. [2018-09-19 06:14:44,094 INFO L78 Accepts]: Start accepts. Automaton has 8451 states and 9710 transitions. Word has length 295 [2018-09-19 06:14:44,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:14:44,095 INFO L480 AbstractCegarLoop]: Abstraction has 8451 states and 9710 transitions. [2018-09-19 06:14:44,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:14:44,095 INFO L276 IsEmpty]: Start isEmpty. Operand 8451 states and 9710 transitions. [2018-09-19 06:14:44,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-09-19 06:14:44,103 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:14:44,104 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:14:44,104 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:14:44,104 INFO L82 PathProgramCache]: Analyzing trace with hash 85076024, now seen corresponding path program 1 times [2018-09-19 06:14:44,104 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:14:44,105 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 338 with the following transitions: [2018-09-19 06:14:44,105 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2699], [2707], [2715], [2723], [2731], [2739], [2747], [2755], [2763], [2771], [2779], [2787], [2795], [2803], [2811], [2819], [2827], [2835], [2843], [2851], [2859], [2867], [2875], [2883], [2891], [2899], [2907], [2915], [2923], [2931], [2939], [2947], [2955], [2963], [2971], [2979], [2987], [2995], [3003], [3011], [3019], [3027], [3035], [3039], [3041], [3044], [3052], [3060], [3068], [3076], [3084], [3092], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [3152], [3156], [3159], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [3222], [3226], [3230], [3234], [3237], [3238], [3242], [3246], [3250], [3254], [3258], [3262], [3265], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-09-19 06:14:44,107 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:14:44,107 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:14:44,204 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:14:45,421 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:14:45,421 INFO L272 AbstractInterpreter]: Visited 110 different actions 647 times. Merged at 8 different actions 42 times. Widened at 1 different actions 1 times. Found 10 fixpoints after 1 different actions. Largest state had 26 variables. [2018-09-19 06:14:45,460 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:14:45,858 INFO L232 lantSequenceWeakener]: Weakened 334 states. On average, predicates are now at 71.35% of their original sizes. [2018-09-19 06:14:45,858 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:14:46,030 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:14:46,030 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:14:46,031 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:14:46,031 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:14:46,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:14:46,031 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:14:46,031 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:14:46,032 INFO L87 Difference]: Start difference. First operand 8451 states and 9710 transitions. Second operand 10 states. [2018-09-19 06:15:04,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:15:04,209 INFO L93 Difference]: Finished difference Result 14497 states and 17710 transitions. [2018-09-19 06:15:04,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-19 06:15:04,210 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 337 [2018-09-19 06:15:04,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:15:04,229 INFO L225 Difference]: With dead ends: 14497 [2018-09-19 06:15:04,229 INFO L226 Difference]: Without dead ends: 9283 [2018-09-19 06:15:04,240 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 343 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 06:15:04,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9283 states. [2018-09-19 06:15:04,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9283 to 9260. [2018-09-19 06:15:04,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9260 states. [2018-09-19 06:15:04,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9260 states to 9260 states and 10588 transitions. [2018-09-19 06:15:04,367 INFO L78 Accepts]: Start accepts. Automaton has 9260 states and 10588 transitions. Word has length 337 [2018-09-19 06:15:04,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:15:04,368 INFO L480 AbstractCegarLoop]: Abstraction has 9260 states and 10588 transitions. [2018-09-19 06:15:04,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:15:04,368 INFO L276 IsEmpty]: Start isEmpty. Operand 9260 states and 10588 transitions. [2018-09-19 06:15:04,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-09-19 06:15:04,376 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:15:04,377 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:15:04,377 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:15:04,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1891702428, now seen corresponding path program 1 times [2018-09-19 06:15:04,377 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:15:04,377 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 348 with the following transitions: [2018-09-19 06:15:04,378 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2699], [2707], [2715], [2723], [2731], [2739], [2747], [2755], [2763], [2771], [2779], [2787], [2795], [2803], [2811], [2819], [2827], [2835], [2843], [2851], [2859], [2867], [2875], [2883], [2891], [2899], [2907], [2915], [2923], [2931], [2939], [2947], [2955], [2963], [2971], [2979], [2987], [2995], [3003], [3011], [3019], [3027], [3035], [3039], [3041], [3044], [3052], [3060], [3068], [3076], [3084], [3092], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [3151], [3152], [3156], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [3222], [3226], [3230], [3234], [3238], [3242], [3246], [3250], [3254], [3258], [3262], [3265], [3266], [3270], [3274], [3278], [3282], [3285], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-09-19 06:15:04,380 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:15:04,380 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:15:04,484 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:15:04,685 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:15:04,686 INFO L272 AbstractInterpreter]: Visited 115 different actions 675 times. Merged at 8 different actions 40 times. Widened at 1 different actions 1 times. Found 9 fixpoints after 1 different actions. Largest state had 26 variables. [2018-09-19 06:15:04,722 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:15:04,993 INFO L232 lantSequenceWeakener]: Weakened 344 states. On average, predicates are now at 71.33% of their original sizes. [2018-09-19 06:15:04,993 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:15:05,095 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:15:05,095 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:15:05,095 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:15:05,095 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:15:05,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:15:05,096 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:15:05,096 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:15:05,096 INFO L87 Difference]: Start difference. First operand 9260 states and 10588 transitions. Second operand 10 states. [2018-09-19 06:15:24,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:15:24,687 INFO L93 Difference]: Finished difference Result 16145 states and 19500 transitions. [2018-09-19 06:15:24,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:15:24,688 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 347 [2018-09-19 06:15:24,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:15:24,720 INFO L225 Difference]: With dead ends: 16145 [2018-09-19 06:15:24,720 INFO L226 Difference]: Without dead ends: 10118 [2018-09-19 06:15:24,732 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 354 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:15:24,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10118 states. [2018-09-19 06:15:24,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10118 to 10082. [2018-09-19 06:15:24,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10082 states. [2018-09-19 06:15:24,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10082 states to 10082 states and 11531 transitions. [2018-09-19 06:15:24,879 INFO L78 Accepts]: Start accepts. Automaton has 10082 states and 11531 transitions. Word has length 347 [2018-09-19 06:15:24,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:15:24,880 INFO L480 AbstractCegarLoop]: Abstraction has 10082 states and 11531 transitions. [2018-09-19 06:15:24,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:15:24,880 INFO L276 IsEmpty]: Start isEmpty. Operand 10082 states and 11531 transitions. [2018-09-19 06:15:24,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-09-19 06:15:24,889 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:15:24,889 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:15:24,890 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:15:24,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1205897427, now seen corresponding path program 1 times [2018-09-19 06:15:24,890 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:15:24,890 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 363 with the following transitions: [2018-09-19 06:15:24,891 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2699], [2707], [2715], [2723], [2731], [2739], [2747], [2755], [2763], [2771], [2779], [2787], [2795], [2803], [2811], [2819], [2827], [2835], [2843], [2851], [2859], [2867], [2875], [2883], [2891], [2899], [2907], [2915], [2923], [2931], [2939], [2947], [2955], [2963], [2971], [2979], [2987], [2995], [3003], [3011], [3019], [3027], [3035], [3039], [3041], [3044], [3052], [3060], [3068], [3076], [3084], [3092], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [3152], [3156], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3210], [3213], [3217], [3218], [3222], [3226], [3230], [3234], [3238], [3242], [3246], [3250], [3254], [3258], [3262], [3265], [3266], [3270], [3274], [3278], [3282], [3285], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-09-19 06:15:24,893 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:15:24,893 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:15:24,995 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:15:25,231 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:15:25,232 INFO L272 AbstractInterpreter]: Visited 117 different actions 679 times. Merged at 8 different actions 40 times. Widened at 1 different actions 1 times. Found 8 fixpoints after 2 different actions. Largest state had 26 variables. [2018-09-19 06:15:25,269 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:15:25,817 INFO L232 lantSequenceWeakener]: Weakened 359 states. On average, predicates are now at 71.37% of their original sizes. [2018-09-19 06:15:25,818 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:15:25,931 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:15:25,931 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:15:25,932 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-19 06:15:25,932 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:15:25,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-19 06:15:25,933 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-19 06:15:25,933 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-09-19 06:15:25,933 INFO L87 Difference]: Start difference. First operand 10082 states and 11531 transitions. Second operand 12 states. [2018-09-19 06:16:05,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:16:05,816 INFO L93 Difference]: Finished difference Result 20306 states and 26416 transitions. [2018-09-19 06:16:05,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-19 06:16:05,817 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 362 [2018-09-19 06:16:05,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:16:05,846 INFO L225 Difference]: With dead ends: 20306 [2018-09-19 06:16:05,847 INFO L226 Difference]: Without dead ends: 13457 [2018-09-19 06:16:05,860 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 387 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=1186, Unknown=0, NotChecked=0, Total=1406 [2018-09-19 06:16:05,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13457 states. [2018-09-19 06:16:06,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13457 to 13366. [2018-09-19 06:16:06,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13366 states. [2018-09-19 06:16:06,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13366 states to 13366 states and 15400 transitions. [2018-09-19 06:16:06,029 INFO L78 Accepts]: Start accepts. Automaton has 13366 states and 15400 transitions. Word has length 362 [2018-09-19 06:16:06,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:16:06,030 INFO L480 AbstractCegarLoop]: Abstraction has 13366 states and 15400 transitions. [2018-09-19 06:16:06,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-19 06:16:06,030 INFO L276 IsEmpty]: Start isEmpty. Operand 13366 states and 15400 transitions. [2018-09-19 06:16:06,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2018-09-19 06:16:06,040 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:16:06,040 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:16:06,041 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:16:06,041 INFO L82 PathProgramCache]: Analyzing trace with hash -964784320, now seen corresponding path program 1 times [2018-09-19 06:16:06,041 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:16:06,041 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 366 with the following transitions: [2018-09-19 06:16:06,042 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2699], [2707], [2715], [2723], [2731], [2739], [2747], [2755], [2763], [2771], [2779], [2787], [2795], [2803], [2811], [2819], [2827], [2835], [2843], [2851], [2859], [2867], [2875], [2883], [2891], [2899], [2907], [2915], [2923], [2931], [2939], [2947], [2955], [2963], [2971], [2979], [2987], [2995], [3003], [3011], [3019], [3027], [3035], [3039], [3041], [3044], [3052], [3060], [3068], [3076], [3084], [3092], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [3152], [3156], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [3222], [3226], [3230], [3234], [3237], [3238], [3242], [3246], [3250], [3254], [3258], [3262], [3265], [3266], [3270], [3274], [3278], [3282], [3285], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-09-19 06:16:06,044 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:16:06,044 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:16:06,137 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:16:06,316 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:16:06,316 INFO L272 AbstractInterpreter]: Visited 115 different actions 680 times. Merged at 8 different actions 45 times. Widened at 1 different actions 1 times. Found 11 fixpoints after 2 different actions. Largest state had 26 variables. [2018-09-19 06:16:06,322 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:16:06,579 INFO L232 lantSequenceWeakener]: Weakened 362 states. On average, predicates are now at 71.31% of their original sizes. [2018-09-19 06:16:06,579 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:16:06,671 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:16:06,671 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:16:06,671 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:16:06,671 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:16:06,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:16:06,672 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:16:06,672 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:16:06,672 INFO L87 Difference]: Start difference. First operand 13366 states and 15400 transitions. Second operand 10 states. [2018-09-19 06:16:19,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:16:19,311 INFO L93 Difference]: Finished difference Result 24386 states and 29201 transitions. [2018-09-19 06:16:19,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:16:19,311 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 365 [2018-09-19 06:16:19,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:16:19,337 INFO L225 Difference]: With dead ends: 24386 [2018-09-19 06:16:19,338 INFO L226 Difference]: Without dead ends: 14253 [2018-09-19 06:16:19,354 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 372 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:16:19,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14253 states. [2018-09-19 06:16:19,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14253 to 14197. [2018-09-19 06:16:19,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14197 states. [2018-09-19 06:16:19,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14197 states to 14197 states and 16436 transitions. [2018-09-19 06:16:19,522 INFO L78 Accepts]: Start accepts. Automaton has 14197 states and 16436 transitions. Word has length 365 [2018-09-19 06:16:19,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:16:19,523 INFO L480 AbstractCegarLoop]: Abstraction has 14197 states and 16436 transitions. [2018-09-19 06:16:19,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:16:19,523 INFO L276 IsEmpty]: Start isEmpty. Operand 14197 states and 16436 transitions. [2018-09-19 06:16:19,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2018-09-19 06:16:19,532 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:16:19,533 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:16:19,533 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:16:19,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1484727868, now seen corresponding path program 1 times [2018-09-19 06:16:19,534 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:16:19,534 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 368 with the following transitions: [2018-09-19 06:16:19,534 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2699], [2707], [2715], [2723], [2731], [2739], [2747], [2755], [2763], [2771], [2779], [2787], [2795], [2803], [2811], [2819], [2827], [2835], [2843], [2851], [2859], [2867], [2875], [2883], [2891], [2899], [2907], [2915], [2923], [2931], [2939], [2947], [2955], [2963], [2971], [2979], [2987], [2995], [3003], [3011], [3019], [3027], [3035], [3039], [3041], [3044], [3052], [3060], [3068], [3076], [3084], [3092], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [3152], [3156], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [3222], [3226], [3230], [3234], [3238], [3242], [3245], [3246], [3250], [3254], [3258], [3262], [3265], [3266], [3270], [3274], [3278], [3282], [3285], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-09-19 06:16:19,537 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:16:19,538 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:16:19,650 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:16:25,414 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-19 06:16:25,414 INFO L272 AbstractInterpreter]: Visited 116 different actions 677 times. Merged at 8 different actions 40 times. Widened at 1 different actions 1 times. Found 9 fixpoints after 1 different actions. Largest state had 26 variables. [2018-09-19 06:16:25,423 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 06:16:25,480 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 06:16:25,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 06:16:25 BoogieIcfgContainer [2018-09-19 06:16:25,480 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 06:16:25,481 INFO L168 Benchmark]: Toolchain (without parser) took 243290.85 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -999.8 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-09-19 06:16:25,483 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 06:16:25,484 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2717.16 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: 328.7 MB). Peak memory consumption was 328.7 MB. Max. memory is 7.1 GB. [2018-09-19 06:16:25,484 INFO L168 Benchmark]: Boogie Procedure Inliner took 277.96 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: 53.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 7.1 GB. [2018-09-19 06:16:25,485 INFO L168 Benchmark]: Boogie Preprocessor took 1231.75 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 988.8 MB). Free memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 174.3 MB. Max. memory is 7.1 GB. [2018-09-19 06:16:25,486 INFO L168 Benchmark]: RCFGBuilder took 10292.06 ms. Allocated memory was 2.5 GB in the beginning and 2.7 GB in the end (delta: 180.4 MB). Free memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: -53.0 MB). Peak memory consumption was 767.5 MB. Max. memory is 7.1 GB. [2018-09-19 06:16:25,487 INFO L168 Benchmark]: TraceAbstraction took 228765.14 ms. Allocated memory was 2.7 GB in the beginning and 4.0 GB in the end (delta: 1.4 GB). Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: -17.9 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2018-09-19 06:16:25,492 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.31 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2717.16 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: 328.7 MB). Peak memory consumption was 328.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 277.96 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: 53.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 1231.75 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 988.8 MB). Free memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 174.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 10292.06 ms. Allocated memory was 2.5 GB in the beginning and 2.7 GB in the end (delta: 180.4 MB). Free memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: -53.0 MB). Peak memory consumption was 767.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 228765.14 ms. Allocated memory was 2.7 GB in the beginning and 4.0 GB in the end (delta: 1.4 GB). Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: -17.9 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 183]: 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 TRUE ((a26==1) && ((((((input == 6) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )) && !(a13==1)) && (a19==9)) && (a1==2)) && ((178 < a12) && (395 >= a12)) )) [L437] a23 = (((a23 + 74530) * 5) * 1) [L438] a19 = 10 [L440] RET return 22; [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, 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 TRUE ( ((178 < a12) && (395 >= a12)) && ((a19==10) && ( ((264 < a23) && (476 >= a23)) && (((!(a13==1) && (input == 3)) && (a26==1)) && (a1==2))))) [L470] a12 = (((a12 + 17844) / 5) + -3206) [L471] a23 = ((((a23 / -5) - 10205) + 138848) * -4) [L472] a19 = 9 [L473] a13 = 1 [L475] RET return 24; [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, 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 TRUE ((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))) [L405] a12 = (((a12 / 5) - 387260) / 5) [L406] a23 = (((((((a23 * 9)/ 10) % 84)+ 179) * 5) % 84)- -100) [L407] a1 = 3 [L408] a19 = 13 [L410] RET return 24; [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 TRUE ((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1)) [L183] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 1120 locations, 1 error locations. UNKNOWN Result, 228.6s OverallTime, 12 OverallIterations, 4 TraceHistogramMax, 210.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 13182 SDtfs, 28678 SDslu, 11760 SDs, 0 SdLazy, 141146 SolverSat, 9952 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 180.6s Time, PredicateUnifierStatistics: 22 DeclaredPredicates, 3028 GetRequests, 2849 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 678 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14197occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 10.7s AbstIntTime, 12 AbstIntIterations, 11 AbstIntStrong, 0.997514159444981 AbsIntWeakeningRatio, 0.10017035775127768 AbsIntAvgWeakeningVarsNumRemoved, 21.34139693356048 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 286 StatesRemovedByMinimization, 11 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_label13_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INT-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_06-16-25-508.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem13_label13_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INT-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_06-16-25-508.csv Received shutdown request...