java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem11_label47_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 10:14:53,994 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 10:14:53,997 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 10:14:54,013 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 10:14:54,014 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 10:14:54,015 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 10:14:54,017 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 10:14:54,019 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 10:14:54,021 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 10:14:54,022 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 10:14:54,024 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 10:14:54,025 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 10:14:54,026 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 10:14:54,029 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 10:14:54,032 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 10:14:54,033 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 10:14:54,034 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 10:14:54,038 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 10:14:54,040 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 10:14:54,048 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 10:14:54,049 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 10:14:54,054 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 10:14:54,057 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 10:14:54,057 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 10:14:54,057 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 10:14:54,059 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 10:14:54,060 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 10:14:54,061 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 10:14:54,061 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 10:14:54,063 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 10:14:54,063 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 10:14:54,063 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 10:14:54,064 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 10:14:54,064 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 10:14:54,065 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 10:14:54,065 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 10:14:54,066 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf [2018-09-19 10:14:54,092 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 10:14:54,093 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 10:14:54,094 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 10:14:54,094 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 10:14:54,095 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 10:14:54,095 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 10:14:54,095 INFO L133 SettingsManager]: * Congruence Domain=false [2018-09-19 10:14:54,095 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 10:14:54,095 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2018-09-19 10:14:54,096 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 10:14:54,096 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 10:14:54,096 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 10:14:54,096 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-19 10:14:54,097 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 10:14:54,097 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 10:14:54,097 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 10:14:54,098 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 10:14:54,099 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 10:14:54,099 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 10:14:54,099 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 10:14:54,099 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 10:14:54,099 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 10:14:54,100 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 10:14:54,100 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 10:14:54,100 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 10:14:54,100 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 10:14:54,101 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 10:14:54,102 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 10:14:54,102 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 10:14:54,102 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 10:14:54,102 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 10:14:54,102 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 10:14:54,103 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 10:14:54,103 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 10:14:54,103 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 10:14:54,152 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 10:14:54,170 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 10:14:54,177 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 10:14:54,179 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 10:14:54,179 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 10:14:54,180 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label47_true-unreach-call.c [2018-09-19 10:14:54,530 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4769d193/1b7e284de4d84e10a84511a507465f17/FLAG879cab670 [2018-09-19 10:14:54,848 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 10:14:54,848 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label47_true-unreach-call.c [2018-09-19 10:14:54,868 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4769d193/1b7e284de4d84e10a84511a507465f17/FLAG879cab670 [2018-09-19 10:14:54,891 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4769d193/1b7e284de4d84e10a84511a507465f17 [2018-09-19 10:14:54,903 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 10:14:54,906 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 10:14:54,907 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 10:14:54,907 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 10:14:54,916 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 10:14:54,917 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 10:14:54" (1/1) ... [2018-09-19 10:14:54,921 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1234d9d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:14:54, skipping insertion in model container [2018-09-19 10:14:54,921 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 10:14:54" (1/1) ... [2018-09-19 10:14:54,933 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 10:14:55,672 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 10:14:55,692 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 10:14:55,963 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 10:14:56,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:14:56 WrapperNode [2018-09-19 10:14:56,049 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 10:14:56,050 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 10:14:56,050 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 10:14:56,050 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 10:14:56,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:14:56" (1/1) ... [2018-09-19 10:14:56,114 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:14:56" (1/1) ... [2018-09-19 10:14:56,226 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 10:14:56,227 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 10:14:56,227 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 10:14:56,228 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 10:14:56,575 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:14:56" (1/1) ... [2018-09-19 10:14:56,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:14:56" (1/1) ... [2018-09-19 10:14:56,586 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:14:56" (1/1) ... [2018-09-19 10:14:56,587 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:14:56" (1/1) ... [2018-09-19 10:14:56,648 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:14:56" (1/1) ... [2018-09-19 10:14:56,667 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:14:56" (1/1) ... [2018-09-19 10:14:56,687 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:14:56" (1/1) ... [2018-09-19 10:14:56,707 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 10:14:56,708 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 10:14:56,709 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 10:14:56,709 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 10:14:56,714 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:14:56" (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 10:14:56,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 10:14:56,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 10:14:56,785 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 10:14:56,785 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 10:14:56,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 10:14:56,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 10:14:56,786 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 10:14:56,786 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 10:15:01,653 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 10:15:01,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 10:15:01 BoogieIcfgContainer [2018-09-19 10:15:01,654 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 10:15:01,655 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 10:15:01,655 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 10:15:01,659 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 10:15:01,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 10:14:54" (1/3) ... [2018-09-19 10:15:01,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65b7002e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 10:15:01, skipping insertion in model container [2018-09-19 10:15:01,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:14:56" (2/3) ... [2018-09-19 10:15:01,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65b7002e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 10:15:01, skipping insertion in model container [2018-09-19 10:15:01,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 10:15:01" (3/3) ... [2018-09-19 10:15:01,665 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label47_true-unreach-call.c [2018-09-19 10:15:01,676 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 10:15:01,688 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 10:15:01,741 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 10:15:01,742 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 10:15:01,742 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 10:15:01,743 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 10:15:01,743 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 10:15:01,743 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 10:15:01,743 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 10:15:01,743 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 10:15:01,743 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 10:15:01,774 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states. [2018-09-19 10:15:01,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-19 10:15:01,783 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:15:01,785 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] [2018-09-19 10:15:01,786 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:15:01,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1591725132, now seen corresponding path program 1 times [2018-09-19 10:15:01,795 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:15:01,796 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 43 with the following transitions: [2018-09-19 10:15:01,800 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [237], [239], [1088], [1092], [1098], [1102], [1109], [1110], [1111], [1113] [2018-09-19 10:15:01,863 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:15:01,864 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:15:03,839 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:15:03,840 INFO L272 AbstractInterpreter]: Visited 41 different actions 41 times. Never merged. Never widened. Never found a fixpoint. Largest state had 27 variables. [2018-09-19 10:15:03,857 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:15:04,617 INFO L232 lantSequenceWeakener]: Weakened 40 states. On average, predicates are now at 75.07% of their original sizes. [2018-09-19 10:15:04,618 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:15:04,920 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:15:04,922 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:15:04,922 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 10:15:04,922 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:15:04,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 10:15:04,936 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 10:15:04,937 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 10:15:04,939 INFO L87 Difference]: Start difference. First operand 293 states. Second operand 6 states. [2018-09-19 10:15:11,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:15:11,775 INFO L93 Difference]: Finished difference Result 776 states and 1363 transitions. [2018-09-19 10:15:11,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 10:15:11,778 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-09-19 10:15:11,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:15:11,798 INFO L225 Difference]: With dead ends: 776 [2018-09-19 10:15:11,799 INFO L226 Difference]: Without dead ends: 481 [2018-09-19 10:15:11,809 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 41 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 10:15:11,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2018-09-19 10:15:11,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 479. [2018-09-19 10:15:11,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-09-19 10:15:11,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 682 transitions. [2018-09-19 10:15:11,898 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 682 transitions. Word has length 42 [2018-09-19 10:15:11,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:15:11,899 INFO L480 AbstractCegarLoop]: Abstraction has 479 states and 682 transitions. [2018-09-19 10:15:11,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 10:15:11,899 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 682 transitions. [2018-09-19 10:15:11,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-09-19 10:15:11,908 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:15:11,909 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:15:11,909 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:15:11,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1117636099, now seen corresponding path program 1 times [2018-09-19 10:15:11,910 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:15:11,911 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 160 with the following transitions: [2018-09-19 10:15:11,911 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [237], [239], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [710], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-09-19 10:15:11,926 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:15:11,926 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:15:18,662 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:15:30,192 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:15:30,193 INFO L272 AbstractInterpreter]: Visited 124 different actions 359 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-09-19 10:15:30,199 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:15:31,984 INFO L232 lantSequenceWeakener]: Weakened 157 states. On average, predicates are now at 73.63% of their original sizes. [2018-09-19 10:15:31,988 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:15:33,006 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:15:33,007 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:15:33,007 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-19 10:15:33,007 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:15:33,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-19 10:15:33,009 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-19 10:15:33,009 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-09-19 10:15:33,010 INFO L87 Difference]: Start difference. First operand 479 states and 682 transitions. Second operand 11 states. [2018-09-19 10:15:48,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:15:48,835 INFO L93 Difference]: Finished difference Result 959 states and 1545 transitions. [2018-09-19 10:15:48,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-19 10:15:48,838 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 159 [2018-09-19 10:15:48,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:15:48,844 INFO L225 Difference]: With dead ends: 959 [2018-09-19 10:15:48,845 INFO L226 Difference]: Without dead ends: 676 [2018-09-19 10:15:48,848 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 166 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-09-19 10:15:48,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2018-09-19 10:15:48,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 672. [2018-09-19 10:15:48,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 672 states. [2018-09-19 10:15:48,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 895 transitions. [2018-09-19 10:15:48,891 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 895 transitions. Word has length 159 [2018-09-19 10:15:48,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:15:48,895 INFO L480 AbstractCegarLoop]: Abstraction has 672 states and 895 transitions. [2018-09-19 10:15:48,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-19 10:15:48,895 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 895 transitions. [2018-09-19 10:15:48,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-09-19 10:15:48,903 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:15:48,904 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:15:48,904 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:15:48,905 INFO L82 PathProgramCache]: Analyzing trace with hash -820039543, now seen corresponding path program 1 times [2018-09-19 10:15:48,905 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:15:48,905 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 170 with the following transitions: [2018-09-19 10:15:48,906 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [237], [239], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [750], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-09-19 10:15:48,914 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:15:48,914 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:16:00,015 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:16:06,513 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:16:06,513 INFO L272 AbstractInterpreter]: Visited 134 different actions 389 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-09-19 10:16:06,519 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:16:08,261 INFO L232 lantSequenceWeakener]: Weakened 167 states. On average, predicates are now at 73.6% of their original sizes. [2018-09-19 10:16:08,261 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:16:08,674 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:16:08,674 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:16:08,674 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-19 10:16:08,674 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:16:08,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-19 10:16:08,675 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-19 10:16:08,675 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-09-19 10:16:08,676 INFO L87 Difference]: Start difference. First operand 672 states and 895 transitions. Second operand 11 states. [2018-09-19 10:16:16,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:16:16,641 INFO L93 Difference]: Finished difference Result 1153 states and 1762 transitions. [2018-09-19 10:16:16,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-19 10:16:16,644 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 169 [2018-09-19 10:16:16,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:16:16,651 INFO L225 Difference]: With dead ends: 1153 [2018-09-19 10:16:16,652 INFO L226 Difference]: Without dead ends: 870 [2018-09-19 10:16:16,654 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 176 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-09-19 10:16:16,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2018-09-19 10:16:16,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 861. [2018-09-19 10:16:16,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 861 states. [2018-09-19 10:16:16,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1117 transitions. [2018-09-19 10:16:16,694 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1117 transitions. Word has length 169 [2018-09-19 10:16:16,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:16:16,695 INFO L480 AbstractCegarLoop]: Abstraction has 861 states and 1117 transitions. [2018-09-19 10:16:16,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-19 10:16:16,695 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1117 transitions. [2018-09-19 10:16:16,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-09-19 10:16:16,700 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:16:16,700 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:16:16,701 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:16:16,701 INFO L82 PathProgramCache]: Analyzing trace with hash 713476527, now seen corresponding path program 1 times [2018-09-19 10:16:16,701 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:16:16,701 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 175 with the following transitions: [2018-09-19 10:16:16,702 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [237], [239], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [769], [772], [776], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-09-19 10:16:16,708 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:16:16,709 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:16:29,390 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:16:36,357 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:16:36,357 INFO L272 AbstractInterpreter]: Visited 139 different actions 404 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-09-19 10:16:36,366 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:16:37,788 INFO L232 lantSequenceWeakener]: Weakened 172 states. On average, predicates are now at 73.65% of their original sizes. [2018-09-19 10:16:37,788 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:16:38,376 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:16:38,376 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:16:38,377 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-19 10:16:38,377 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:16:38,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-19 10:16:38,378 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-19 10:16:38,378 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-09-19 10:16:38,378 INFO L87 Difference]: Start difference. First operand 861 states and 1117 transitions. Second operand 13 states. [2018-09-19 10:17:04,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:17:04,821 INFO L93 Difference]: Finished difference Result 2024 states and 3287 transitions. [2018-09-19 10:17:04,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-19 10:17:04,823 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 174 [2018-09-19 10:17:04,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:17:04,839 INFO L225 Difference]: With dead ends: 2024 [2018-09-19 10:17:04,840 INFO L226 Difference]: Without dead ends: 1741 [2018-09-19 10:17:04,843 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 191 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=185, Invalid=745, Unknown=0, NotChecked=0, Total=930 [2018-09-19 10:17:04,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1741 states. [2018-09-19 10:17:04,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1741 to 1636. [2018-09-19 10:17:04,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1636 states. [2018-09-19 10:17:04,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 2042 transitions. [2018-09-19 10:17:04,904 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 2042 transitions. Word has length 174 [2018-09-19 10:17:04,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:17:04,904 INFO L480 AbstractCegarLoop]: Abstraction has 1636 states and 2042 transitions. [2018-09-19 10:17:04,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-19 10:17:04,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 2042 transitions. [2018-09-19 10:17:04,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-09-19 10:17:04,908 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:17:04,909 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:17:04,909 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:17:04,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1554478790, now seen corresponding path program 1 times [2018-09-19 10:17:04,909 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:17:04,910 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 191 with the following transitions: [2018-09-19 10:17:04,910 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [237], [239], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [777], [781], [785], [789], [793], [797], [808], [812], [816], [820], [824], [828], [832], [843], [847], [851], [862], [866], [869], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-09-19 10:17:04,917 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:17:04,917 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:17:27,157 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:17:27,157 INFO L272 AbstractInterpreter]: Visited 155 different actions 452 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-09-19 10:17:27,189 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:17:28,501 INFO L232 lantSequenceWeakener]: Weakened 188 states. On average, predicates are now at 73.54% of their original sizes. [2018-09-19 10:17:28,502 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:17:28,907 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:17:28,908 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:17:28,908 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-19 10:17:28,908 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:17:28,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-19 10:17:28,909 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-19 10:17:28,909 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-09-19 10:17:28,910 INFO L87 Difference]: Start difference. First operand 1636 states and 2042 transitions. Second operand 11 states. [2018-09-19 10:17:43,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:17:43,302 INFO L93 Difference]: Finished difference Result 3341 states and 4418 transitions. [2018-09-19 10:17:43,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 10:17:43,307 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 190 [2018-09-19 10:17:43,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:17:43,317 INFO L225 Difference]: With dead ends: 3341 [2018-09-19 10:17:43,317 INFO L226 Difference]: Without dead ends: 2095 [2018-09-19 10:17:43,320 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 198 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2018-09-19 10:17:43,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2095 states. [2018-09-19 10:17:43,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2095 to 2017. [2018-09-19 10:17:43,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2017 states. [2018-09-19 10:17:43,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 2017 states and 2472 transitions. [2018-09-19 10:17:43,390 INFO L78 Accepts]: Start accepts. Automaton has 2017 states and 2472 transitions. Word has length 190 [2018-09-19 10:17:43,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:17:43,391 INFO L480 AbstractCegarLoop]: Abstraction has 2017 states and 2472 transitions. [2018-09-19 10:17:43,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-19 10:17:43,391 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 2472 transitions. [2018-09-19 10:17:43,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-09-19 10:17:43,395 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:17:43,395 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 10:17:43,396 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:17:43,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1024372586, now seen corresponding path program 1 times [2018-09-19 10:17:43,396 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:17:43,396 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 241 with the following transitions: [2018-09-19 10:17:43,397 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [237], [239], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [538], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [710], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-09-19 10:17:43,401 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:17:43,402 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:17:48,020 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:18:16,150 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-19 10:18:16,150 INFO L272 AbstractInterpreter]: Visited 126 different actions 733 times. Merged at 7 different actions 34 times. Widened at 1 different actions 1 times. Found 6 fixpoints after 1 different actions. Largest state had 28 variables. [2018-09-19 10:18:16,165 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 10:18:16,206 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 10:18:16,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 10:18:16 BoogieIcfgContainer [2018-09-19 10:18:16,207 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 10:18:16,208 INFO L168 Benchmark]: Toolchain (without parser) took 201304.67 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 4.0 GB in the end (delta: -2.6 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-19 10:18:16,211 INFO L168 Benchmark]: CDTParser took 0.19 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 10:18:16,212 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1141.84 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2018-09-19 10:18:16,213 INFO L168 Benchmark]: Boogie Procedure Inliner took 177.13 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-19 10:18:16,214 INFO L168 Benchmark]: Boogie Preprocessor took 480.84 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 787.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -909.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. [2018-09-19 10:18:16,215 INFO L168 Benchmark]: RCFGBuilder took 4946.14 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 177.6 MB). Peak memory consumption was 177.6 MB. Max. memory is 7.1 GB. [2018-09-19 10:18:16,215 INFO L168 Benchmark]: TraceAbstraction took 194552.07 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.0 GB in the beginning and 4.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-09-19 10:18:16,221 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1141.84 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 177.13 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 480.84 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 787.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -909.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4946.14 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 177.6 MB). Peak memory consumption was 177.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 194552.07 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.0 GB in the beginning and 4.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 111]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L7] int inputA = 1; [L8] int inputD = 4; [L9] int inputB = 2; [L10] int inputE = 5; [L11] int inputF = 6; [L12] int inputC = 3; [L15] int a29 = 130; [L16] int a4 = 1; [L17] int a23 = 312; [L18] int a8 = 15; [L19] int a25 = 10; [L20] int a3 = 1; [L1031] int output = -1; [L1034] COND TRUE 1 [L1037] int input; [L1038] input = __VERIFIER_nondet_int() [L1039] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1042] CALL, EXPR calculate_output(input) [L23] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L26] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L29] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L32] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L35] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L38] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L41] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L44] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L47] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L50] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L53] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L56] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L59] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L62] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L65] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L68] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L71] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L74] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L77] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L80] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L83] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L86] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L89] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L92] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L95] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L98] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L101] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L104] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L107] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L110] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L113] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L116] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L119] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L122] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L125] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L128] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L131] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L134] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L137] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L140] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L143] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L146] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L149] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L152] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L155] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L158] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L161] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L164] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L167] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L170] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L173] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L176] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L179] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L182] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && 306 < a23 ) && (a8==15))) [L185] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L188] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L191] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L194] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L197] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L200] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L203] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L207] COND FALSE !((( ((140 < a29) && (245 >= a29)) && ((a25==12) && ( a23 <= -43 && ((a8==15) && ((input == 6) && (a3==1)))))) && !(a4==1))) [L214] COND FALSE !((!(a4==1) && (((a3==1) && ((((((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 4)) && a23 <= -43 )) && (a8==15)))) [L221] COND FALSE !(((a25==11) && (!(a4==1) && (((((input == 2) && (a3==1)) && a23 <= -43 ) && (a8==15)) && ((245 < a29) && (277 >= a29)) )))) [L227] COND FALSE !(((( a29 <= 140 && ((a3==1) && (((input == 5) && (a25==13)) && (a4==1)))) && (a8==15)) && 306 < a23 )) [L233] COND FALSE !((((a8==15) && (((((((a4==1) && 277 < a29 ) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 )) && (input == 6))) && (a3==1))) [L240] COND FALSE !(((((input == 4) && (( a23 <= -43 && ((a25==9) && (!(a4==1) && a29 <= 140 ))) || (((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && ((a25==13) && ( 277 < a29 && (a4==1))))))) && (a8==15)) && (a3==1))) [L247] COND FALSE !((((a3==1) && (!(a4==1) && (( a29 <= 140 && ((input == 1) && ((a25==12) || ((a25==10) || (a25==11))))) && ((-43 < a23) && (138 >= a23)) ))) && (a8==15))) [L254] COND FALSE !(((( ((245 < a29) && (277 >= a29)) && (( a23 <= -43 && (!(a4==1) && (input == 1))) && (a25==11))) && (a8==15)) && (a3==1))) [L260] COND FALSE !(((((a4==1) && (((input == 1) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))) && (a8==15))) && 306 < a23 ) && (a3==1))) [L265] COND FALSE !((( 277 < a29 && (((a8==15) && ( a23 <= -43 && ((input == 2) && (a3==1)))) && !(a4==1))) && (a25==13))) [L268] COND FALSE !(( a29 <= 140 && ((((a8==15) && ((a3==1) && ((input == 1) && ((a25==12) || (a25==13))))) && !(a4==1)) && a23 <= -43 ))) [L275] COND FALSE !((((a4==1) && ((a8==15) && (((a3==1) && (((a25==9) || (a25==10)) && (input == 5))) && ((140 < a29) && (245 >= a29)) ))) && 306 < a23 )) [L280] COND FALSE !(((a3==1) && (((((input == 5) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ( ((245 < a29) && (277 >= a29)) && (a25==9))))) && (a8==15)) && !(a4==1)) && a23 <= -43 ))) [L287] COND FALSE !(((a8==15) && ((((!(a4==1) && (((a25==12) || (a25==13)) && (input == 4))) && a23 <= -43 ) && a29 <= 140 ) && (a3==1)))) [L294] COND FALSE !(((a8==15) && (!(a4==1) && ( a23 <= -43 && ((a3==1) && ( 277 < a29 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 6)))))))) [L299] COND FALSE !(( 306 < a23 && (((a8==15) && ((a3==1) && ((a4==1) && (((a25==11) || (a25==12)) && (input == 6))))) && ((140 < a29) && (245 >= a29)) ))) [L305] COND FALSE !(((((a8==15) && ( a29 <= 140 && ( a23 <= -43 && ((input == 2) && ((a25==10) || (a25==11)))))) && !(a4==1)) && (a3==1))) [L310] COND FALSE !(((a3==1) && ( ((245 < a29) && (277 >= a29)) && (((a4==1) && ((a8==15) && ((((a25==11) || (a25==12)) || (a25==13)) && (input == 5)))) && 306 < a23 )))) [L317] COND FALSE !(((((a8==15) && (((a4==1) && ((input == 2) && ((a25==13) || ((a25==11) || (a25==12))))) && ((245 < a29) && (277 >= a29)) )) && 306 < a23 ) && (a3==1))) [L322] COND FALSE !((( 306 < a23 && ((a8==15) && ((((input == 6) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a4==1))) [L329] COND FALSE !(((((a8==15) && (((((a25==11) || (a25==12)) && (input == 4)) && 306 < a23 ) && (a3==1))) && (a4==1)) && ((140 < a29) && (245 >= a29)) )) [L334] COND FALSE !(( a23 <= -43 && ( ((140 < a29) && (245 >= a29)) && (((a8==15) && (((input == 4) && ((a25==11) || ((a25==9) || (a25==10)))) && !(a4==1))) && (a3==1))))) [L340] COND FALSE !((((((((((a25==12) && ((245 < a29) && (277 >= a29)) ) || ((a25==13) && ((245 < a29) && (277 >= a29)) )) || ( 277 < a29 && (a25==9))) && (input == 1)) && a23 <= -43 ) && (a8==15)) && !(a4==1)) && (a3==1))) [L346] COND FALSE !((!(a4==1) && ( a29 <= 140 && ((((((a25==12) || (a25==13)) && (input == 2)) && a23 <= -43 ) && (a3==1)) && (a8==15))))) [L353] COND FALSE !(((a8==15) && (( 306 < a23 && ((a3==1) && ((input == 4) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))))) && (a4==1)))) [L358] COND FALSE !(((((input == 3) && (( a23 <= -43 && ((!(a4==1) && a29 <= 140 ) && (a25==9))) || (( 306 < a23 && (( 277 < a29 && (a4==1)) && (a25==12))) || ((((a4==1) && 277 < a29 ) && (a25==13)) && 306 < a23 )))) && (a3==1)) && (a8==15))) [L365] COND FALSE !(( 306 < a23 && ((a4==1) && (((((((a25==11) || (a25==12)) || (a25==13)) && (input == 3)) && (a8==15)) && (a3==1)) && ((245 < a29) && (277 >= a29)) )))) [L370] COND FALSE !(( ((245 < a29) && (277 >= a29)) && (((((!(a4==1) && (input == 6)) && (a3==1)) && (a25==11)) && (a8==15)) && a23 <= -43 ))) [L377] COND FALSE !((( ((-43 < a23) && (138 >= a23)) && (((a8==15) && ((input == 2) && ((( a29 <= 140 && (a25==13)) || ( ((140 < a29) && (245 >= a29)) && (a25==9))) || ((a25==10) && ((140 < a29) && (245 >= a29)) )))) && (a3==1))) && !(a4==1))) [L384] COND FALSE !(( a29 <= 140 && ((a8==15) && ((((((a25==10) || (a25==11)) && (input == 3)) && a23 <= -43 ) && (a3==1)) && !(a4==1))))) [L391] COND FALSE !((((((a8==15) && (((input == 3) && (((a25==10) || (a25==11)) || (a25==12))) && (a3==1))) && a23 <= -43 ) && !(a4==1)) && 277 < a29 )) [L398] COND FALSE !(((!(a4==1) && ((a25==9) && ((a8==15) && ((a3==1) && ( ((-43 < a23) && (138 >= a23)) && (input == 1)))))) && a29 <= 140 )) [L411] COND FALSE !(((a8==15) && ((( 306 < a23 && (((((a25==11) || (a25==12)) || (a25==13)) && (input == 6)) && ((245 < a29) && (277 >= a29)) )) && (a4==1)) && (a3==1)))) [L417] COND FALSE !((((((!(a4==1) && ((a8==15) && (input == 2))) && (a3==1)) && ((140 < a29) && (245 >= a29)) ) && (a25==12)) && a23 <= -43 )) [L422] COND FALSE !(( a23 <= -43 && (( a29 <= 140 && ((a8==15) && (!(a4==1) && (((a25==12) || (a25==13)) && (input == 3))))) && (a3==1)))) [L429] COND FALSE !(((((((input == 6) && ((((a25==13) && a29 <= 140 ) || ( ((140 < a29) && (245 >= a29)) && (a25==9))) || ( ((140 < a29) && (245 >= a29)) && (a25==10)))) && (a8==15)) && (a3==1)) && !(a4==1)) && ((-43 < a23) && (138 >= a23)) )) [L436] COND FALSE !(((!(a4==1) && (((((a3==1) && (input == 4)) && (a25==11)) && ((245 < a29) && (277 >= a29)) ) && a23 <= -43 )) && (a8==15))) [L443] COND FALSE !(((a3==1) && ( ((140 < a29) && (245 >= a29)) && ( a23 <= -43 && ((a8==15) && (!(a4==1) && ((((a25==9) || (a25==10)) || (a25==11)) && (input == 3)))))))) [L450] COND FALSE !(((((!(a4==1) && (((((a25==10) || (a25==11)) || (a25==12)) && (input == 4)) && 277 < a29 )) && a23 <= -43 ) && (a8==15)) && (a3==1))) [L456] COND FALSE !(( ((140 < a29) && (245 >= a29)) && ((a8==15) && (((a25==12) && (!(a4==1) && ( a23 <= -43 && (input == 4)))) && (a3==1))))) [L463] COND FALSE !(((a3==1) && ((((((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || (((a25==9) && (!(a4==1) && a29 <= 140 )) && a23 <= -43 )) && (input == 2)) && (a8==15)))) [L470] COND FALSE !(((((input == 5) && (((((a25==12) && ((a4==1) && 277 < a29 )) && 306 < a23 ) || ((( 277 < a29 && (a4==1)) && (a25==13)) && 306 < a23 )) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 ))) && (a8==15)) && (a3==1))) [L477] COND FALSE !(((a25==12) && (((a3==1) && ((((input == 1) && a23 <= -43 ) && ((140 < a29) && (245 >= a29)) ) && !(a4==1))) && (a8==15)))) [L487] COND FALSE !((((a8==15) && (( ((-43 < a23) && (138 >= a23)) && ((input == 1) && (( ((140 < a29) && (245 >= a29)) && (a25==10)) || (((a25==13) && a29 <= 140 ) || ((a25==9) && ((140 < a29) && (245 >= a29)) ))))) && (a3==1))) && !(a4==1))) [L500] COND FALSE !(((a3==1) && ((a8==15) && (((((( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 3)) && !(a4==1)) && a23 <= -43 )))) [L507] COND FALSE !((( a29 <= 140 && ( ((-43 < a23) && (138 >= a23)) && ((a3==1) && ((a8==15) && (((a25==12) || ((a25==10) || (a25==11))) && (input == 2)))))) && !(a4==1))) [L514] COND FALSE !((((a4==1) && ( 306 < a23 && ((((input == 3) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a8==15))) [L526] COND TRUE ((a4==1) && ((((a3==1) && ( 306 < a23 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 4)))) && a29 <= 140 ) && (a8==15))) [L527] a29 = (((((a29 % 52)- -193) * 5) % 52)- -169) [L528] a25 = 12 [L530] RET return 26; [L1042] EXPR calculate_output(input) [L1042] output = calculate_output(input) [L1034] COND TRUE 1 [L1037] int input; [L1038] input = __VERIFIER_nondet_int() [L1039] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1042] CALL, EXPR calculate_output(input) [L23] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L26] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L29] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L32] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L35] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L38] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L41] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L44] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L47] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L50] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L53] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L56] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L59] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L62] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L65] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L68] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L71] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L74] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L77] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L80] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L83] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L86] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L89] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L92] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L95] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L98] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L101] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L104] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L107] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L110] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L113] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L116] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L119] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L122] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L125] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L128] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L131] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L134] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L137] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L140] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L143] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L146] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L149] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L152] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L155] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L158] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L161] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L164] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L167] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L170] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L173] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L176] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L179] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L182] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && 306 < a23 ) && (a8==15))) [L185] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L188] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L191] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L194] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L197] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L200] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L203] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L207] COND FALSE !((( ((140 < a29) && (245 >= a29)) && ((a25==12) && ( a23 <= -43 && ((a8==15) && ((input == 6) && (a3==1)))))) && !(a4==1))) [L214] COND FALSE !((!(a4==1) && (((a3==1) && ((((((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 4)) && a23 <= -43 )) && (a8==15)))) [L221] COND FALSE !(((a25==11) && (!(a4==1) && (((((input == 2) && (a3==1)) && a23 <= -43 ) && (a8==15)) && ((245 < a29) && (277 >= a29)) )))) [L227] COND FALSE !(((( a29 <= 140 && ((a3==1) && (((input == 5) && (a25==13)) && (a4==1)))) && (a8==15)) && 306 < a23 )) [L233] COND FALSE !((((a8==15) && (((((((a4==1) && 277 < a29 ) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 )) && (input == 6))) && (a3==1))) [L240] COND FALSE !(((((input == 4) && (( a23 <= -43 && ((a25==9) && (!(a4==1) && a29 <= 140 ))) || (((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && ((a25==13) && ( 277 < a29 && (a4==1))))))) && (a8==15)) && (a3==1))) [L247] COND FALSE !((((a3==1) && (!(a4==1) && (( a29 <= 140 && ((input == 1) && ((a25==12) || ((a25==10) || (a25==11))))) && ((-43 < a23) && (138 >= a23)) ))) && (a8==15))) [L254] COND FALSE !(((( ((245 < a29) && (277 >= a29)) && (( a23 <= -43 && (!(a4==1) && (input == 1))) && (a25==11))) && (a8==15)) && (a3==1))) [L260] COND FALSE !(((((a4==1) && (((input == 1) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))) && (a8==15))) && 306 < a23 ) && (a3==1))) [L265] COND FALSE !((( 277 < a29 && (((a8==15) && ( a23 <= -43 && ((input == 2) && (a3==1)))) && !(a4==1))) && (a25==13))) [L268] COND FALSE !(( a29 <= 140 && ((((a8==15) && ((a3==1) && ((input == 1) && ((a25==12) || (a25==13))))) && !(a4==1)) && a23 <= -43 ))) [L275] COND TRUE (((a4==1) && ((a8==15) && (((a3==1) && (((a25==9) || (a25==10)) && (input == 5))) && ((140 < a29) && (245 >= a29)) ))) && 306 < a23 ) [L276] a23 = ((((a23 * -2)/ 10) * 4) * 1) [L277] a25 = 13 [L279] RET return -1; [L1042] EXPR calculate_output(input) [L1042] output = calculate_output(input) [L1034] COND TRUE 1 [L1037] int input; [L1038] input = __VERIFIER_nondet_int() [L1039] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1042] CALL calculate_output(input) [L23] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L26] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L29] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L32] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L35] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L38] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L41] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L44] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L47] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L50] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L53] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L56] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L59] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L62] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L65] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L68] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L71] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L74] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L77] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L80] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L83] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L86] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L89] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L92] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L95] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L98] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L101] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L104] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L107] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L110] COND TRUE ((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15)) [L111] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 293 locations, 1 error locations. UNKNOWN Result, 194.4s OverallTime, 6 OverallIterations, 3 TraceHistogramMax, 71.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1490 SDtfs, 5337 SDslu, 2300 SDs, 0 SdLazy, 15924 SolverSat, 1300 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 64.0s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 772 GetRequests, 687 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2017occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 112.6s AbstIntTime, 6 AbstIntIterations, 5 AbstIntStrong, 0.9943260011847112 AbsIntWeakeningRatio, 0.1440329218106996 AbsIntAvgWeakeningVarsNumRemoved, 1218.4650205761318 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 198 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: No data available, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem11_label47_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_10-18-16-247.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem11_label47_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_10-18-16-247.csv Received shutdown request...