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/Problem10_label43_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 10:05:02,677 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 10:05:02,685 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 10:05:02,704 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 10:05:02,704 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 10:05:02,706 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 10:05:02,708 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 10:05:02,713 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 10:05:02,715 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 10:05:02,715 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 10:05:02,718 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 10:05:02,719 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 10:05:02,720 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 10:05:02,721 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 10:05:02,724 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 10:05:02,725 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 10:05:02,726 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 10:05:02,729 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 10:05:02,734 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 10:05:02,741 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 10:05:02,742 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 10:05:02,745 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 10:05:02,751 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 10:05:02,752 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 10:05:02,752 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 10:05:02,753 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 10:05:02,755 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 10:05:02,756 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 10:05:02,756 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 10:05:02,757 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 10:05:02,757 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 10:05:02,758 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 10:05:02,758 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 10:05:02,758 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 10:05:02,759 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 10:05:02,762 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 10:05:02,762 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:05:02,778 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 10:05:02,778 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 10:05:02,779 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 10:05:02,780 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 10:05:02,780 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 10:05:02,780 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 10:05:02,780 INFO L133 SettingsManager]: * Congruence Domain=false [2018-09-19 10:05:02,780 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 10:05:02,781 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2018-09-19 10:05:02,781 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 10:05:02,781 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 10:05:02,781 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 10:05:02,781 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-19 10:05:02,782 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 10:05:02,782 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 10:05:02,783 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 10:05:02,783 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 10:05:02,783 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 10:05:02,783 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 10:05:02,784 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 10:05:02,784 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 10:05:02,784 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 10:05:02,784 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 10:05:02,784 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 10:05:02,785 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 10:05:02,785 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 10:05:02,785 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 10:05:02,785 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 10:05:02,785 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 10:05:02,786 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 10:05:02,786 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 10:05:02,786 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 10:05:02,786 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 10:05:02,786 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 10:05:02,787 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 10:05:02,841 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 10:05:02,857 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 10:05:02,863 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 10:05:02,865 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 10:05:02,866 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 10:05:02,867 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label43_true-unreach-call.c [2018-09-19 10:05:03,251 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62e80390a/1b9c5581e89b43a6bcb7381a0ed63b69/FLAG6ef1222fc [2018-09-19 10:05:03,583 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 10:05:03,585 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label43_true-unreach-call.c [2018-09-19 10:05:03,604 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62e80390a/1b9c5581e89b43a6bcb7381a0ed63b69/FLAG6ef1222fc [2018-09-19 10:05:03,632 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62e80390a/1b9c5581e89b43a6bcb7381a0ed63b69 [2018-09-19 10:05:03,647 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 10:05:03,653 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 10:05:03,655 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 10:05:03,655 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 10:05:03,666 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 10:05:03,667 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 10:05:03" (1/1) ... [2018-09-19 10:05:03,671 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f414e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:05:03, skipping insertion in model container [2018-09-19 10:05:03,672 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 10:05:03" (1/1) ... [2018-09-19 10:05:03,684 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 10:05:04,175 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 10:05:04,201 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 10:05:04,382 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 10:05:04,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:05:04 WrapperNode [2018-09-19 10:05:04,428 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 10:05:04,429 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 10:05:04,429 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 10:05:04,430 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 10:05:04,440 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:05:04" (1/1) ... [2018-09-19 10:05:04,468 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:05:04" (1/1) ... [2018-09-19 10:05:04,535 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 10:05:04,536 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 10:05:04,536 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 10:05:04,536 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 10:05:04,710 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:05:04" (1/1) ... [2018-09-19 10:05:04,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:05:04" (1/1) ... [2018-09-19 10:05:04,721 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:05:04" (1/1) ... [2018-09-19 10:05:04,721 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:05:04" (1/1) ... [2018-09-19 10:05:04,766 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:05:04" (1/1) ... [2018-09-19 10:05:04,780 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:05:04" (1/1) ... [2018-09-19 10:05:04,791 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:05:04" (1/1) ... [2018-09-19 10:05:04,806 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 10:05:04,807 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 10:05:04,807 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 10:05:04,809 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 10:05:04,811 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:05:04" (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:05:04,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 10:05:04,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 10:05:04,890 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 10:05:04,890 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 10:05:04,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 10:05:04,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 10:05:04,893 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 10:05:04,893 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 10:05:08,034 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 10:05:08,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 10:05:08 BoogieIcfgContainer [2018-09-19 10:05:08,035 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 10:05:08,037 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 10:05:08,038 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 10:05:08,041 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 10:05:08,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 10:05:03" (1/3) ... [2018-09-19 10:05:08,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f809498 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 10:05:08, skipping insertion in model container [2018-09-19 10:05:08,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 10:05:04" (2/3) ... [2018-09-19 10:05:08,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f809498 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 10:05:08, skipping insertion in model container [2018-09-19 10:05:08,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 10:05:08" (3/3) ... [2018-09-19 10:05:08,046 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label43_true-unreach-call.c [2018-09-19 10:05:08,054 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 10:05:08,063 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 10:05:08,117 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 10:05:08,118 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 10:05:08,119 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 10:05:08,119 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 10:05:08,119 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 10:05:08,119 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 10:05:08,121 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 10:05:08,121 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 10:05:08,121 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 10:05:08,151 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-19 10:05:08,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-19 10:05:08,160 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:05:08,162 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:05:08,163 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:05:08,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1430816948, now seen corresponding path program 1 times [2018-09-19 10:05:08,171 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:05:08,172 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 43 with the following transitions: [2018-09-19 10:05:08,174 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], [796], [800], [806], [810], [817], [818], [819], [821] [2018-09-19 10:05:08,238 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:05:08,239 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:05:09,364 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:05:09,366 INFO L272 AbstractInterpreter]: Visited 41 different actions 41 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-19 10:05:09,383 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:05:10,019 INFO L232 lantSequenceWeakener]: Weakened 40 states. On average, predicates are now at 75.31% of their original sizes. [2018-09-19 10:05:10,019 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:05:10,336 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:05:10,338 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:05:10,340 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 10:05:10,341 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:05:10,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 10:05:10,355 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 10:05:10,355 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 10:05:10,358 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 6 states. [2018-09-19 10:05:13,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:05:13,669 INFO L93 Difference]: Finished difference Result 576 states and 995 transitions. [2018-09-19 10:05:13,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 10:05:13,673 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-09-19 10:05:13,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:05:13,692 INFO L225 Difference]: With dead ends: 576 [2018-09-19 10:05:13,693 INFO L226 Difference]: Without dead ends: 358 [2018-09-19 10:05:13,700 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 41 GetRequests, 37 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 10:05:13,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-09-19 10:05:13,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-09-19 10:05:13,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-19 10:05:13,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2018-09-19 10:05:13,777 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 42 [2018-09-19 10:05:13,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:05:13,778 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2018-09-19 10:05:13,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 10:05:13,779 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2018-09-19 10:05:13,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-09-19 10:05:13,785 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:05:13,785 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] [2018-09-19 10:05:13,785 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:05:13,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1958223005, now seen corresponding path program 1 times [2018-09-19 10:05:13,786 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:05:13,786 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 114 with the following transitions: [2018-09-19 10:05:13,787 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], [498], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 10:05:13,795 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:05:13,795 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:05:15,257 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:05:18,372 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:05:18,373 INFO L272 AbstractInterpreter]: Visited 78 different actions 221 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 10:05:18,384 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:05:19,276 INFO L232 lantSequenceWeakener]: Weakened 111 states. On average, predicates are now at 73.74% of their original sizes. [2018-09-19 10:05:19,277 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:05:19,875 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:05:19,876 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:05:19,876 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 10:05:19,876 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:05:19,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 10:05:19,878 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 10:05:19,878 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 10:05:19,879 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand 10 states. [2018-09-19 10:05:28,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:05:28,059 INFO L93 Difference]: Finished difference Result 717 states and 1132 transitions. [2018-09-19 10:05:28,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 10:05:28,063 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 113 [2018-09-19 10:05:28,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:05:28,071 INFO L225 Difference]: With dead ends: 717 [2018-09-19 10:05:28,071 INFO L226 Difference]: Without dead ends: 511 [2018-09-19 10:05:28,076 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 119 GetRequests, 104 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 10:05:28,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-09-19 10:05:28,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 505. [2018-09-19 10:05:28,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2018-09-19 10:05:28,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 669 transitions. [2018-09-19 10:05:28,133 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 669 transitions. Word has length 113 [2018-09-19 10:05:28,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:05:28,134 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 669 transitions. [2018-09-19 10:05:28,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 10:05:28,135 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 669 transitions. [2018-09-19 10:05:28,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-09-19 10:05:28,139 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:05:28,139 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] [2018-09-19 10:05:28,140 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:05:28,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1479974744, now seen corresponding path program 1 times [2018-09-19 10:05:28,140 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:05:28,140 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 123 with the following transitions: [2018-09-19 10:05:28,141 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], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 10:05:28,145 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:05:28,146 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:05:31,833 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:05:33,633 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:05:33,633 INFO L272 AbstractInterpreter]: Visited 87 different actions 248 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 10:05:33,640 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:05:34,397 INFO L232 lantSequenceWeakener]: Weakened 120 states. On average, predicates are now at 73.67% of their original sizes. [2018-09-19 10:05:34,398 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:05:35,205 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:05:35,205 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:05:35,206 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-19 10:05:35,206 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:05:35,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-19 10:05:35,207 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-19 10:05:35,207 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-09-19 10:05:35,207 INFO L87 Difference]: Start difference. First operand 505 states and 669 transitions. Second operand 13 states. [2018-09-19 10:05:47,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:05:47,093 INFO L93 Difference]: Finished difference Result 1333 states and 2096 transitions. [2018-09-19 10:05:47,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-19 10:05:47,095 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 122 [2018-09-19 10:05:47,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:05:47,108 INFO L225 Difference]: With dead ends: 1333 [2018-09-19 10:05:47,108 INFO L226 Difference]: Without dead ends: 978 [2018-09-19 10:05:47,111 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 136 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=164, Invalid=592, Unknown=0, NotChecked=0, Total=756 [2018-09-19 10:05:47,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2018-09-19 10:05:47,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 762. [2018-09-19 10:05:47,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2018-09-19 10:05:47,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 953 transitions. [2018-09-19 10:05:47,156 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 953 transitions. Word has length 122 [2018-09-19 10:05:47,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:05:47,156 INFO L480 AbstractCegarLoop]: Abstraction has 762 states and 953 transitions. [2018-09-19 10:05:47,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-19 10:05:47,157 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 953 transitions. [2018-09-19 10:05:47,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-09-19 10:05:47,160 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:05:47,161 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] [2018-09-19 10:05:47,161 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:05:47,161 INFO L82 PathProgramCache]: Analyzing trace with hash -2055571680, now seen corresponding path program 1 times [2018-09-19 10:05:47,161 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:05:47,162 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 159 with the following transitions: [2018-09-19 10:05:47,162 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], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 10:05:47,167 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:05:47,168 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:05:49,684 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:05:55,752 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:05:55,752 INFO L272 AbstractInterpreter]: Visited 123 different actions 356 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 10:05:55,755 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:05:56,553 INFO L232 lantSequenceWeakener]: Weakened 156 states. On average, predicates are now at 73.45% of their original sizes. [2018-09-19 10:05:56,554 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:05:56,944 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:05:56,944 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:05:56,944 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-19 10:05:56,944 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:05:56,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-19 10:05:56,945 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-19 10:05:56,945 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-09-19 10:05:56,946 INFO L87 Difference]: Start difference. First operand 762 states and 953 transitions. Second operand 12 states. [2018-09-19 10:06:03,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:06:03,872 INFO L93 Difference]: Finished difference Result 1677 states and 2220 transitions. [2018-09-19 10:06:03,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 10:06:03,873 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 158 [2018-09-19 10:06:03,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:06:03,879 INFO L225 Difference]: With dead ends: 1677 [2018-09-19 10:06:03,879 INFO L226 Difference]: Without dead ends: 1067 [2018-09-19 10:06:03,882 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 166 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2018-09-19 10:06:03,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2018-09-19 10:06:03,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1056. [2018-09-19 10:06:03,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1056 states. [2018-09-19 10:06:03,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1287 transitions. [2018-09-19 10:06:03,922 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1287 transitions. Word has length 158 [2018-09-19 10:06:03,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:06:03,922 INFO L480 AbstractCegarLoop]: Abstraction has 1056 states and 1287 transitions. [2018-09-19 10:06:03,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-19 10:06:03,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1287 transitions. [2018-09-19 10:06:03,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-09-19 10:06:03,926 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:06:03,926 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] [2018-09-19 10:06:03,927 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:06:03,927 INFO L82 PathProgramCache]: Analyzing trace with hash 2070095587, now seen corresponding path program 1 times [2018-09-19 10:06:03,927 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:06:03,927 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 178 with the following transitions: [2018-09-19 10:06:03,928 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], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [754], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 10:06:03,932 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:06:03,933 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:06:13,365 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:06:13,366 INFO L272 AbstractInterpreter]: Visited 142 different actions 413 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 10:06:13,374 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:06:14,233 INFO L232 lantSequenceWeakener]: Weakened 175 states. On average, predicates are now at 73.37% of their original sizes. [2018-09-19 10:06:14,233 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:06:14,600 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:06:14,600 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:06:14,601 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-19 10:06:14,601 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:06:14,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-19 10:06:14,601 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-19 10:06:14,602 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-09-19 10:06:14,602 INFO L87 Difference]: Start difference. First operand 1056 states and 1287 transitions. Second operand 12 states. [2018-09-19 10:06:19,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:06:19,586 INFO L93 Difference]: Finished difference Result 2268 states and 2899 transitions. [2018-09-19 10:06:19,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-19 10:06:19,587 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 177 [2018-09-19 10:06:19,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:06:19,594 INFO L225 Difference]: With dead ends: 2268 [2018-09-19 10:06:19,595 INFO L226 Difference]: Without dead ends: 1364 [2018-09-19 10:06:19,598 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 186 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2018-09-19 10:06:19,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2018-09-19 10:06:19,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1352. [2018-09-19 10:06:19,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-09-19 10:06:19,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1615 transitions. [2018-09-19 10:06:19,650 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1615 transitions. Word has length 177 [2018-09-19 10:06:19,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:06:19,651 INFO L480 AbstractCegarLoop]: Abstraction has 1352 states and 1615 transitions. [2018-09-19 10:06:19,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-19 10:06:19,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1615 transitions. [2018-09-19 10:06:19,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-09-19 10:06:19,655 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:06:19,655 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 10:06:19,655 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:06:19,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1220148193, now seen corresponding path program 1 times [2018-09-19 10:06:19,656 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:06:19,656 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 190 with the following transitions: [2018-09-19 10:06:19,656 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], [498], [499], [503], [507], [511], [515], [518], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 10:06:19,659 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:06:19,659 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:06:21,127 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:06:26,301 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:06:26,302 INFO L272 AbstractInterpreter]: Visited 84 different actions 323 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 10:06:26,308 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:06:27,130 INFO L232 lantSequenceWeakener]: Weakened 187 states. On average, predicates are now at 73.38% of their original sizes. [2018-09-19 10:06:27,131 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:06:27,983 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:06:27,983 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:06:27,984 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 10:06:27,984 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:06:27,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 10:06:27,985 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 10:06:27,985 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 10:06:27,985 INFO L87 Difference]: Start difference. First operand 1352 states and 1615 transitions. Second operand 10 states. [2018-09-19 10:06:34,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:06:34,808 INFO L93 Difference]: Finished difference Result 2719 states and 3388 transitions. [2018-09-19 10:06:34,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 10:06:34,812 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 189 [2018-09-19 10:06:34,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:06:34,820 INFO L225 Difference]: With dead ends: 2719 [2018-09-19 10:06:34,820 INFO L226 Difference]: Without dead ends: 1521 [2018-09-19 10:06:34,824 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 196 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 10:06:34,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2018-09-19 10:06:34,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1503. [2018-09-19 10:06:34,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2018-09-19 10:06:34,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1792 transitions. [2018-09-19 10:06:34,882 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1792 transitions. Word has length 189 [2018-09-19 10:06:34,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:06:34,882 INFO L480 AbstractCegarLoop]: Abstraction has 1503 states and 1792 transitions. [2018-09-19 10:06:34,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 10:06:34,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1792 transitions. [2018-09-19 10:06:34,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-09-19 10:06:34,886 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:06:34,886 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 10:06:34,886 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:06:34,887 INFO L82 PathProgramCache]: Analyzing trace with hash 122826939, now seen corresponding path program 1 times [2018-09-19 10:06:34,887 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:06:34,887 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 192 with the following transitions: [2018-09-19 10:06:34,887 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], [498], [499], [503], [507], [511], [515], [519], [523], [526], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 10:06:34,890 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:06:34,890 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:06:36,240 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:06:42,034 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:06:42,034 INFO L272 AbstractInterpreter]: Visited 86 different actions 333 times. Merged at 7 different actions 22 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 10:06:42,061 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:06:42,833 INFO L232 lantSequenceWeakener]: Weakened 189 states. On average, predicates are now at 73.37% of their original sizes. [2018-09-19 10:06:42,834 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:06:43,111 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:06:43,111 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:06:43,112 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 10:06:43,112 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:06:43,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 10:06:43,112 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 10:06:43,112 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 10:06:43,113 INFO L87 Difference]: Start difference. First operand 1503 states and 1792 transitions. Second operand 10 states. [2018-09-19 10:06:50,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:06:50,037 INFO L93 Difference]: Finished difference Result 3020 states and 3751 transitions. [2018-09-19 10:06:50,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 10:06:50,040 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 191 [2018-09-19 10:06:50,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:06:50,049 INFO L225 Difference]: With dead ends: 3020 [2018-09-19 10:06:50,049 INFO L226 Difference]: Without dead ends: 1671 [2018-09-19 10:06:50,052 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 198 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 10:06:50,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-09-19 10:06:50,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1654. [2018-09-19 10:06:50,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1654 states. [2018-09-19 10:06:50,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 1988 transitions. [2018-09-19 10:06:50,119 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 1988 transitions. Word has length 191 [2018-09-19 10:06:50,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:06:50,119 INFO L480 AbstractCegarLoop]: Abstraction has 1654 states and 1988 transitions. [2018-09-19 10:06:50,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 10:06:50,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 1988 transitions. [2018-09-19 10:06:50,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-09-19 10:06:50,123 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:06:50,124 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, 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:06:50,124 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:06:50,124 INFO L82 PathProgramCache]: Analyzing trace with hash 80282099, now seen corresponding path program 1 times [2018-09-19 10:06:50,124 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:06:50,125 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 196 with the following transitions: [2018-09-19 10:06:50,125 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], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [542], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 10:06:50,128 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:06:50,128 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:06:51,606 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:06:57,393 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:06:57,393 INFO L272 AbstractInterpreter]: Visited 90 different actions 349 times. Merged at 7 different actions 22 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 10:06:57,401 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:06:58,209 INFO L232 lantSequenceWeakener]: Weakened 193 states. On average, predicates are now at 73.36% of their original sizes. [2018-09-19 10:06:58,210 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:06:58,473 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:06:58,473 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:06:58,473 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 10:06:58,473 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:06:58,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 10:06:58,474 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 10:06:58,474 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 10:06:58,474 INFO L87 Difference]: Start difference. First operand 1654 states and 1988 transitions. Second operand 10 states. [2018-09-19 10:07:06,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:07:06,330 INFO L93 Difference]: Finished difference Result 3477 states and 4328 transitions. [2018-09-19 10:07:06,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 10:07:06,337 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 195 [2018-09-19 10:07:06,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:07:06,349 INFO L225 Difference]: With dead ends: 3477 [2018-09-19 10:07:06,349 INFO L226 Difference]: Without dead ends: 1977 [2018-09-19 10:07:06,353 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 202 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 10:07:06,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2018-09-19 10:07:06,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1954. [2018-09-19 10:07:06,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1954 states. [2018-09-19 10:07:06,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2362 transitions. [2018-09-19 10:07:06,436 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2362 transitions. Word has length 195 [2018-09-19 10:07:06,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:07:06,436 INFO L480 AbstractCegarLoop]: Abstraction has 1954 states and 2362 transitions. [2018-09-19 10:07:06,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 10:07:06,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2362 transitions. [2018-09-19 10:07:06,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-09-19 10:07:06,441 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:07:06,441 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, 1, 1, 1, 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:07:06,441 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:07:06,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1320249287, now seen corresponding path program 1 times [2018-09-19 10:07:06,442 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:07:06,442 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 202 with the following transitions: [2018-09-19 10:07:06,442 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], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 10:07:06,446 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:07:06,446 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:07:08,093 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:07:17,945 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:07:17,946 INFO L272 AbstractInterpreter]: Visited 96 different actions 373 times. Merged at 7 different actions 22 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 10:07:17,952 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:07:18,877 INFO L232 lantSequenceWeakener]: Weakened 199 states. On average, predicates are now at 73.34% of their original sizes. [2018-09-19 10:07:18,877 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:07:19,164 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:07:19,164 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:07:19,164 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 10:07:19,165 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:07:19,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 10:07:19,165 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 10:07:19,165 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 10:07:19,166 INFO L87 Difference]: Start difference. First operand 1954 states and 2362 transitions. Second operand 10 states. [2018-09-19 10:07:26,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:07:26,701 INFO L93 Difference]: Finished difference Result 3932 states and 4909 transitions. [2018-09-19 10:07:26,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 10:07:26,703 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 201 [2018-09-19 10:07:26,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:07:26,713 INFO L225 Difference]: With dead ends: 3932 [2018-09-19 10:07:26,713 INFO L226 Difference]: Without dead ends: 2132 [2018-09-19 10:07:26,718 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 208 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 10:07:26,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2132 states. [2018-09-19 10:07:26,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2132 to 2109. [2018-09-19 10:07:26,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2109 states. [2018-09-19 10:07:26,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2109 states to 2109 states and 2577 transitions. [2018-09-19 10:07:26,803 INFO L78 Accepts]: Start accepts. Automaton has 2109 states and 2577 transitions. Word has length 201 [2018-09-19 10:07:26,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:07:26,804 INFO L480 AbstractCegarLoop]: Abstraction has 2109 states and 2577 transitions. [2018-09-19 10:07:26,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 10:07:26,804 INFO L276 IsEmpty]: Start isEmpty. Operand 2109 states and 2577 transitions. [2018-09-19 10:07:26,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-09-19 10:07:26,812 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:07:26,812 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:26,812 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:07:26,813 INFO L82 PathProgramCache]: Analyzing trace with hash -70391296, now seen corresponding path program 1 times [2018-09-19 10:07:26,813 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:07:26,813 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 211 with the following transitions: [2018-09-19 10:07:26,814 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], [498], [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], [602], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 10:07:26,816 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:07:26,817 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:07:28,198 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:07:38,558 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:07:38,559 INFO L272 AbstractInterpreter]: Visited 105 different actions 407 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 10:07:38,569 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:07:39,444 INFO L232 lantSequenceWeakener]: Weakened 208 states. On average, predicates are now at 73.31% of their original sizes. [2018-09-19 10:07:39,444 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:07:39,768 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:07:39,768 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:07:39,768 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-19 10:07:39,769 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:07:39,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-19 10:07:39,769 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-19 10:07:39,769 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-09-19 10:07:39,770 INFO L87 Difference]: Start difference. First operand 2109 states and 2577 transitions. Second operand 11 states. [2018-09-19 10:07:45,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:07:45,680 INFO L93 Difference]: Finished difference Result 4320 states and 5463 transitions. [2018-09-19 10:07:45,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 10:07:45,681 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 210 [2018-09-19 10:07:45,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:07:45,690 INFO L225 Difference]: With dead ends: 4320 [2018-09-19 10:07:45,690 INFO L226 Difference]: Without dead ends: 2365 [2018-09-19 10:07:45,695 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 218 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2018-09-19 10:07:45,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2365 states. [2018-09-19 10:07:45,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2365 to 2262. [2018-09-19 10:07:45,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2262 states. [2018-09-19 10:07:45,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 2262 states and 2792 transitions. [2018-09-19 10:07:45,771 INFO L78 Accepts]: Start accepts. Automaton has 2262 states and 2792 transitions. Word has length 210 [2018-09-19 10:07:45,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:07:45,772 INFO L480 AbstractCegarLoop]: Abstraction has 2262 states and 2792 transitions. [2018-09-19 10:07:45,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-19 10:07:45,772 INFO L276 IsEmpty]: Start isEmpty. Operand 2262 states and 2792 transitions. [2018-09-19 10:07:45,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-09-19 10:07:45,777 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:07:45,777 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:45,777 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:07:45,778 INFO L82 PathProgramCache]: Analyzing trace with hash 214731668, now seen corresponding path program 1 times [2018-09-19 10:07:45,778 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:07:45,778 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 217 with the following transitions: [2018-09-19 10:07:45,778 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], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [626], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 10:07:45,781 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:07:45,781 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:07:47,154 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:07:55,519 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:07:55,519 INFO L272 AbstractInterpreter]: Visited 111 different actions 433 times. Merged at 7 different actions 22 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 10:07:55,527 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:07:56,448 INFO L232 lantSequenceWeakener]: Weakened 214 states. On average, predicates are now at 73.3% of their original sizes. [2018-09-19 10:07:56,449 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:07:56,801 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:07:56,802 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:07:56,802 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-19 10:07:56,802 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:07:56,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-19 10:07:56,802 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-19 10:07:56,802 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-09-19 10:07:56,803 INFO L87 Difference]: Start difference. First operand 2262 states and 2792 transitions. Second operand 11 states. [2018-09-19 10:08:05,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:08:05,168 INFO L93 Difference]: Finished difference Result 4808 states and 6139 transitions. [2018-09-19 10:08:05,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-19 10:08:05,176 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 216 [2018-09-19 10:08:05,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:08:05,189 INFO L225 Difference]: With dead ends: 4808 [2018-09-19 10:08:05,190 INFO L226 Difference]: Without dead ends: 2700 [2018-09-19 10:08:05,196 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 224 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2018-09-19 10:08:05,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2700 states. [2018-09-19 10:08:05,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2700 to 2670. [2018-09-19 10:08:05,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2670 states. [2018-09-19 10:08:05,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2670 states to 2670 states and 3328 transitions. [2018-09-19 10:08:05,304 INFO L78 Accepts]: Start accepts. Automaton has 2670 states and 3328 transitions. Word has length 216 [2018-09-19 10:08:05,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:08:05,305 INFO L480 AbstractCegarLoop]: Abstraction has 2670 states and 3328 transitions. [2018-09-19 10:08:05,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-19 10:08:05,305 INFO L276 IsEmpty]: Start isEmpty. Operand 2670 states and 3328 transitions. [2018-09-19 10:08:05,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-09-19 10:08:05,310 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:08:05,311 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:05,311 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:08:05,312 INFO L82 PathProgramCache]: Analyzing trace with hash -849724805, now seen corresponding path program 1 times [2018-09-19 10:08:05,312 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:08:05,312 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 224 with the following transitions: [2018-09-19 10:08:05,312 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], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 10:08:05,316 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:08:05,316 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:08:07,092 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:08:16,373 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 10:08:16,373 INFO L272 AbstractInterpreter]: Visited 118 different actions 459 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 10:08:16,380 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 10:08:17,281 INFO L232 lantSequenceWeakener]: Weakened 221 states. On average, predicates are now at 73.28% of their original sizes. [2018-09-19 10:08:17,281 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 10:08:17,598 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 10:08:17,598 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 10:08:17,599 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-19 10:08:17,599 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 10:08:17,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-19 10:08:17,600 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-19 10:08:17,600 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-09-19 10:08:17,600 INFO L87 Difference]: Start difference. First operand 2670 states and 3328 transitions. Second operand 11 states. [2018-09-19 10:08:22,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 10:08:22,509 INFO L93 Difference]: Finished difference Result 5752 states and 7377 transitions. [2018-09-19 10:08:22,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 10:08:22,510 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 223 [2018-09-19 10:08:22,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 10:08:22,523 INFO L225 Difference]: With dead ends: 5752 [2018-09-19 10:08:22,523 INFO L226 Difference]: Without dead ends: 3236 [2018-09-19 10:08:22,529 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 231 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2018-09-19 10:08:22,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3236 states. [2018-09-19 10:08:22,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3236 to 3129. [2018-09-19 10:08:22,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2018-09-19 10:08:22,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 3930 transitions. [2018-09-19 10:08:22,641 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 3930 transitions. Word has length 223 [2018-09-19 10:08:22,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 10:08:22,642 INFO L480 AbstractCegarLoop]: Abstraction has 3129 states and 3930 transitions. [2018-09-19 10:08:22,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-19 10:08:22,642 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 3930 transitions. [2018-09-19 10:08:22,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-09-19 10:08:22,647 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 10:08:22,648 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:22,648 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 10:08:22,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1909425952, now seen corresponding path program 1 times [2018-09-19 10:08:22,651 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 10:08:22,651 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 227 with the following transitions: [2018-09-19 10:08:22,651 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], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 10:08:22,655 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-19 10:08:22,655 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 10:08:24,203 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 10:08:34,305 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-19 10:08:34,305 INFO L272 AbstractInterpreter]: Visited 122 different actions 472 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 10:08:34,307 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 10:08:34,348 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 10:08:34,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 10:08:34 BoogieIcfgContainer [2018-09-19 10:08:34,349 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 10:08:34,350 INFO L168 Benchmark]: Toolchain (without parser) took 210702.73 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 1.8 GB in the end (delta: -328.3 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-19 10:08:34,352 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 10:08:34,352 INFO L168 Benchmark]: CACSL2BoogieTranslator took 773.78 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-19 10:08:34,353 INFO L168 Benchmark]: Boogie Procedure Inliner took 106.44 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-19 10:08:34,354 INFO L168 Benchmark]: Boogie Preprocessor took 270.61 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 774.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -868.5 MB). Peak memory consumption was 29.1 MB. Max. memory is 7.1 GB. [2018-09-19 10:08:34,355 INFO L168 Benchmark]: RCFGBuilder took 3228.47 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 106.9 MB). Peak memory consumption was 106.9 MB. Max. memory is 7.1 GB. [2018-09-19 10:08:34,356 INFO L168 Benchmark]: TraceAbstraction took 206311.77 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.1 GB in the beginning and 1.8 GB in the end (delta: 380.4 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-09-19 10:08:34,360 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.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 773.78 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 106.44 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 270.61 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 774.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -868.5 MB). Peak memory consumption was 29.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3228.47 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 106.9 MB). Peak memory consumption was 106.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 206311.77 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.1 GB in the beginning and 1.8 GB in the end (delta: 380.4 MB). 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: 109]: 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 inputC = 3; [L8] int inputD = 4; [L9] int inputE = 5; [L10] int inputF = 6; [L11] int inputB = 2; [L14] int a1 = 23; [L15] int a19 = 9; [L16] int a10 = 0; [L17] int a12 = 0; [L18] int a4 = 14; [L579] int output = -1; [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND TRUE ((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0))) [L211] a1 = (((a1 + -15535) - 211896) / 5) [L212] a10 = 2 [L214] RET return 22; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L408] COND TRUE ((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2)))) [L409] a1 = ((((a1 % 299890)+ 300108) * 1) * 1) [L410] a10 = 0 [L411] a19 = 8 [L413] RET return -1; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND TRUE (((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)) [L109] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNKNOWN Result, 206.2s OverallTime, 13 OverallIterations, 3 TraceHistogramMax, 83.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2333 SDtfs, 8865 SDslu, 4387 SDs, 0 SdLazy, 22689 SolverSat, 2050 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 72.8s Time, PredicateUnifierStatistics: 24 DeclaredPredicates, 2125 GetRequests, 1923 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3129occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 106.1s AbstIntTime, 13 AbstIntIterations, 12 AbstIntStrong, 0.9937644561557598 AbsIntWeakeningRatio, 0.1362962962962963 AbsIntAvgWeakeningVarsNumRemoved, 874.5066666666667 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 12 MinimizatonAttempts, 568 StatesRemovedByMinimization, 12 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/Problem10_label43_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_10-08-34-378.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label43_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_10-08-34-378.csv Received shutdown request...