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_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label32_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dace188-m [2018-09-15 11:22:20,652 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-15 11:22:20,654 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-15 11:22:20,670 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-15 11:22:20,671 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-15 11:22:20,672 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-15 11:22:20,673 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-15 11:22:20,675 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-15 11:22:20,677 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-15 11:22:20,678 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-15 11:22:20,679 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-15 11:22:20,679 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-15 11:22:20,680 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-15 11:22:20,681 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-15 11:22:20,682 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-15 11:22:20,683 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-15 11:22:20,684 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-15 11:22:20,686 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-15 11:22:20,688 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-15 11:22:20,689 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-15 11:22:20,690 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-15 11:22:20,691 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-15 11:22:20,694 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-15 11:22:20,694 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-15 11:22:20,694 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-15 11:22:20,695 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-15 11:22:20,696 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-15 11:22:20,697 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-15 11:22:20,698 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-15 11:22:20,699 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-15 11:22:20,699 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-15 11:22:20,700 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-15 11:22:20,700 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-15 11:22:20,701 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-15 11:22:20,702 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-15 11:22:20,702 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-15 11:22:20,703 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf [2018-09-15 11:22:20,729 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-15 11:22:20,729 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-15 11:22:20,730 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-15 11:22:20,730 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-15 11:22:20,730 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-15 11:22:20,730 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-15 11:22:20,731 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-15 11:22:20,731 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-15 11:22:20,731 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-15 11:22:20,731 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-15 11:22:20,732 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-15 11:22:20,733 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-15 11:22:20,733 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-15 11:22:20,733 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-15 11:22:20,733 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-15 11:22:20,733 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-15 11:22:20,733 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-15 11:22:20,734 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-15 11:22:20,734 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-15 11:22:20,734 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-15 11:22:20,734 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-15 11:22:20,735 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-15 11:22:20,735 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-15 11:22:20,735 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-15 11:22:20,735 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-15 11:22:20,735 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-15 11:22:20,735 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-15 11:22:20,736 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-15 11:22:20,736 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-15 11:22:20,736 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-15 11:22:20,736 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-15 11:22:20,738 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-15 11:22:20,738 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-15 11:22:20,804 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-15 11:22:20,821 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-15 11:22:20,828 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-15 11:22:20,830 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-15 11:22:20,830 INFO L276 PluginConnector]: CDTParser initialized [2018-09-15 11:22:20,831 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label32_true-unreach-call.c [2018-09-15 11:22:21,189 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/727252ef1/96e57d2967464880bb675812a125de9e/FLAG044830b74 [2018-09-15 11:22:21,516 INFO L277 CDTParser]: Found 1 translation units. [2018-09-15 11:22:21,517 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label32_true-unreach-call.c [2018-09-15 11:22:21,530 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/727252ef1/96e57d2967464880bb675812a125de9e/FLAG044830b74 [2018-09-15 11:22:21,549 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/727252ef1/96e57d2967464880bb675812a125de9e [2018-09-15 11:22:21,566 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-15 11:22:21,573 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-15 11:22:21,574 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-15 11:22:21,574 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-15 11:22:21,584 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-15 11:22:21,586 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 11:22:21" (1/1) ... [2018-09-15 11:22:21,590 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75d6e4c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:22:21, skipping insertion in model container [2018-09-15 11:22:21,590 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 11:22:21" (1/1) ... [2018-09-15 11:22:21,603 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-15 11:22:22,146 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 11:22:22,164 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-15 11:22:22,364 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 11:22:22,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:22:22 WrapperNode [2018-09-15 11:22:22,419 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-15 11:22:22,420 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-15 11:22:22,420 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-15 11:22:22,420 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-15 11:22:22,431 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:22:22" (1/1) ... [2018-09-15 11:22:22,467 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:22:22" (1/1) ... [2018-09-15 11:22:22,551 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-15 11:22:22,552 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-15 11:22:22,552 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-15 11:22:22,552 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-15 11:22:22,705 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:22:22" (1/1) ... [2018-09-15 11:22:22,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:22:22" (1/1) ... [2018-09-15 11:22:22,711 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:22:22" (1/1) ... [2018-09-15 11:22:22,711 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:22:22" (1/1) ... [2018-09-15 11:22:22,736 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:22:22" (1/1) ... [2018-09-15 11:22:22,763 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:22:22" (1/1) ... [2018-09-15 11:22:22,780 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:22:22" (1/1) ... [2018-09-15 11:22:22,802 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-15 11:22:22,803 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-15 11:22:22,803 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-15 11:22:22,803 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-15 11:22:22,806 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:22:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-15 11:22:22,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-15 11:22:22,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-15 11:22:22,882 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-15 11:22:22,882 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-15 11:22:22,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-15 11:22:22,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-15 11:22:22,883 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-15 11:22:22,883 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-15 11:22:26,062 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-15 11:22:26,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 11:22:26 BoogieIcfgContainer [2018-09-15 11:22:26,063 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-15 11:22:26,066 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-15 11:22:26,066 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-15 11:22:26,072 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-15 11:22:26,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 11:22:21" (1/3) ... [2018-09-15 11:22:26,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e96fdfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 11:22:26, skipping insertion in model container [2018-09-15 11:22:26,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:22:22" (2/3) ... [2018-09-15 11:22:26,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e96fdfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 11:22:26, skipping insertion in model container [2018-09-15 11:22:26,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 11:22:26" (3/3) ... [2018-09-15 11:22:26,077 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label32_true-unreach-call.c [2018-09-15 11:22:26,090 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-15 11:22:26,102 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-15 11:22:26,151 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-15 11:22:26,152 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-15 11:22:26,152 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-15 11:22:26,152 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-15 11:22:26,152 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-15 11:22:26,153 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-15 11:22:26,153 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-15 11:22:26,153 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-15 11:22:26,153 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-15 11:22:26,179 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-15 11:22:26,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-15 11:22:26,187 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 11:22:26,188 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] [2018-09-15 11:22:26,189 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 11:22:26,195 INFO L82 PathProgramCache]: Analyzing trace with hash 550514796, now seen corresponding path program 1 times [2018-09-15 11:22:26,198 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 11:22:26,199 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-09-15 11:22:26,201 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], [157], [159], [796], [800], [806], [810], [817], [818], [819], [821] [2018-09-15 11:22:26,261 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 11:22:26,261 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 11:22:27,273 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 11:22:27,275 INFO L272 AbstractInterpreter]: Visited 31 different actions 31 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-15 11:22:27,289 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 11:22:27,793 INFO L232 lantSequenceWeakener]: Weakened 30 states. On average, predicates are now at 74.66% of their original sizes. [2018-09-15 11:22:27,793 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 11:22:28,115 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 11:22:28,117 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 11:22:28,118 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-15 11:22:28,118 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 11:22:28,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-15 11:22:28,132 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-15 11:22:28,133 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-15 11:22:28,135 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 6 states. [2018-09-15 11:22:32,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 11:22:32,864 INFO L93 Difference]: Finished difference Result 576 states and 995 transitions. [2018-09-15 11:22:32,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-15 11:22:32,866 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-09-15 11:22:32,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 11:22:32,882 INFO L225 Difference]: With dead ends: 576 [2018-09-15 11:22:32,883 INFO L226 Difference]: Without dead ends: 358 [2018-09-15 11:22:32,890 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 31 GetRequests, 27 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-15 11:22:32,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-09-15 11:22:32,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-09-15 11:22:32,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-15 11:22:32,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2018-09-15 11:22:32,966 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 32 [2018-09-15 11:22:32,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 11:22:32,966 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2018-09-15 11:22:32,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-15 11:22:32,967 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2018-09-15 11:22:32,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-09-15 11:22:32,974 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 11:22:32,974 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 11:22:32,975 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 11:22:32,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1935342277, now seen corresponding path program 1 times [2018-09-15 11:22:32,975 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 11:22:32,976 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 104 with the following transitions: [2018-09-15 11:22:32,976 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], [157], [159], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [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-15 11:22:32,984 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 11:22:32,984 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 11:22:35,025 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 11:22:41,358 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 11:22:41,358 INFO L272 AbstractInterpreter]: Visited 78 different actions 150 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-15 11:22:41,407 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 11:22:44,154 INFO L232 lantSequenceWeakener]: Weakened 101 states. On average, predicates are now at 73.43% of their original sizes. [2018-09-15 11:22:44,154 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 11:22:45,843 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 11:22:45,844 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 11:22:45,844 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-15 11:22:45,844 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 11:22:45,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-15 11:22:45,845 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-15 11:22:45,846 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-15 11:22:45,846 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand 10 states. [2018-09-15 11:22:55,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 11:22:55,938 INFO L93 Difference]: Finished difference Result 711 states and 1126 transitions. [2018-09-15 11:22:55,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-15 11:22:55,938 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 103 [2018-09-15 11:22:55,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 11:22:55,943 INFO L225 Difference]: With dead ends: 711 [2018-09-15 11:22:55,944 INFO L226 Difference]: Without dead ends: 505 [2018-09-15 11:22:55,947 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 109 GetRequests, 74 SyntacticMatches, 20 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-15 11:22:55,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-09-15 11:22:55,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 502. [2018-09-15 11:22:55,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2018-09-15 11:22:55,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 655 transitions. [2018-09-15 11:22:55,987 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 655 transitions. Word has length 103 [2018-09-15 11:22:55,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 11:22:55,988 INFO L480 AbstractCegarLoop]: Abstraction has 502 states and 655 transitions. [2018-09-15 11:22:55,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-15 11:22:55,988 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 655 transitions. [2018-09-15 11:22:55,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-09-15 11:22:55,991 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 11:22:55,992 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 11:22:55,992 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 11:22:55,993 INFO L82 PathProgramCache]: Analyzing trace with hash 904247808, now seen corresponding path program 1 times [2018-09-15 11:22:55,993 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 11:22:55,993 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 113 with the following transitions: [2018-09-15 11:22:55,993 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], [157], [159], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [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-15 11:22:55,999 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 11:22:55,999 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 11:23:02,091 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 11:23:02,091 INFO L272 AbstractInterpreter]: Visited 87 different actions 167 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-15 11:23:02,102 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 11:23:04,277 INFO L232 lantSequenceWeakener]: Weakened 110 states. On average, predicates are now at 73.38% of their original sizes. [2018-09-15 11:23:04,277 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 11:23:05,776 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 11:23:05,777 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 11:23:05,777 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-15 11:23:05,777 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 11:23:05,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-15 11:23:05,778 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-15 11:23:05,779 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-09-15 11:23:05,779 INFO L87 Difference]: Start difference. First operand 502 states and 655 transitions. Second operand 11 states. [2018-09-15 11:23:13,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 11:23:13,040 INFO L93 Difference]: Finished difference Result 1002 states and 1569 transitions. [2018-09-15 11:23:13,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-15 11:23:13,041 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 112 [2018-09-15 11:23:13,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 11:23:13,046 INFO L225 Difference]: With dead ends: 1002 [2018-09-15 11:23:13,046 INFO L226 Difference]: Without dead ends: 796 [2018-09-15 11:23:13,048 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 118 GetRequests, 82 SyntacticMatches, 20 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-15 11:23:13,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2018-09-15 11:23:13,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 793. [2018-09-15 11:23:13,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2018-09-15 11:23:13,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 962 transitions. [2018-09-15 11:23:13,102 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 962 transitions. Word has length 112 [2018-09-15 11:23:13,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 11:23:13,103 INFO L480 AbstractCegarLoop]: Abstraction has 793 states and 962 transitions. [2018-09-15 11:23:13,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-15 11:23:13,106 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 962 transitions. [2018-09-15 11:23:13,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-09-15 11:23:13,114 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 11:23:13,118 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 11:23:13,119 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 11:23:13,119 INFO L82 PathProgramCache]: Analyzing trace with hash -940689800, now seen corresponding path program 1 times [2018-09-15 11:23:13,119 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 11:23:13,119 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 149 with the following transitions: [2018-09-15 11:23:13,120 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], [157], [159], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [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-15 11:23:13,130 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 11:23:13,130 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 11:23:16,267 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 11:23:28,285 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 11:23:28,285 INFO L272 AbstractInterpreter]: Visited 123 different actions 240 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-15 11:23:28,290 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 11:23:31,569 INFO L232 lantSequenceWeakener]: Weakened 146 states. On average, predicates are now at 73.22% of their original sizes. [2018-09-15 11:23:31,570 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 11:23:32,845 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 11:23:32,846 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 11:23:32,846 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-15 11:23:32,846 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 11:23:32,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-15 11:23:32,847 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-15 11:23:32,848 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-09-15 11:23:32,848 INFO L87 Difference]: Start difference. First operand 793 states and 962 transitions. Second operand 12 states. [2018-09-15 11:23:46,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 11:23:46,509 INFO L93 Difference]: Finished difference Result 1150 states and 1593 transitions. [2018-09-15 11:23:46,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-15 11:23:46,510 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 148 [2018-09-15 11:23:46,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 11:23:46,517 INFO L225 Difference]: With dead ends: 1150 [2018-09-15 11:23:46,517 INFO L226 Difference]: Without dead ends: 944 [2018-09-15 11:23:46,522 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 156 GetRequests, 117 SyntacticMatches, 20 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2018-09-15 11:23:46,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2018-09-15 11:23:46,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 939. [2018-09-15 11:23:46,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 939 states. [2018-09-15 11:23:46,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1120 transitions. [2018-09-15 11:23:46,571 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1120 transitions. Word has length 148 [2018-09-15 11:23:46,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 11:23:46,572 INFO L480 AbstractCegarLoop]: Abstraction has 939 states and 1120 transitions. [2018-09-15 11:23:46,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-15 11:23:46,572 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1120 transitions. [2018-09-15 11:23:46,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-09-15 11:23:46,576 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 11:23:46,576 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 11:23:46,579 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 11:23:46,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1649125563, now seen corresponding path program 1 times [2018-09-15 11:23:46,579 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 11:23:46,579 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 168 with the following transitions: [2018-09-15 11:23:46,580 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], [157], [159], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [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-15 11:23:46,593 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 11:23:46,593 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 11:24:12,249 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 11:24:12,249 INFO L272 AbstractInterpreter]: Visited 142 different actions 549 times. Merged at 5 different actions 14 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-15 11:24:12,256 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 11:24:14,006 INFO L232 lantSequenceWeakener]: Weakened 165 states. On average, predicates are now at 73.16% of their original sizes. [2018-09-15 11:24:14,007 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 11:24:14,897 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 11:24:14,897 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 11:24:14,897 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-09-15 11:24:14,898 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 11:24:14,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-15 11:24:14,898 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-15 11:24:14,899 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-09-15 11:24:14,899 INFO L87 Difference]: Start difference. First operand 939 states and 1120 transitions. Second operand 15 states. [2018-09-15 11:24:23,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 11:24:23,192 INFO L93 Difference]: Finished difference Result 1301 states and 1760 transitions. [2018-09-15 11:24:23,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-15 11:24:23,193 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 167 [2018-09-15 11:24:23,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 11:24:23,200 INFO L225 Difference]: With dead ends: 1301 [2018-09-15 11:24:23,200 INFO L226 Difference]: Without dead ends: 1095 [2018-09-15 11:24:23,202 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 178 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2018-09-15 11:24:23,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2018-09-15 11:24:23,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 1089. [2018-09-15 11:24:23,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1089 states. [2018-09-15 11:24:23,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 1286 transitions. [2018-09-15 11:24:23,267 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 1286 transitions. Word has length 167 [2018-09-15 11:24:23,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 11:24:23,268 INFO L480 AbstractCegarLoop]: Abstraction has 1089 states and 1286 transitions. [2018-09-15 11:24:23,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-15 11:24:23,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1286 transitions. [2018-09-15 11:24:23,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-09-15 11:24:23,271 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 11:24:23,271 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 11:24:23,271 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 11:24:23,272 INFO L82 PathProgramCache]: Analyzing trace with hash -946069652, now seen corresponding path program 1 times [2018-09-15 11:24:23,272 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 11:24:23,272 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 171 with the following transitions: [2018-09-15 11:24:23,273 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], [157], [159], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [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], [755], [759], [763], [766], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 11:24:23,283 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 11:24:23,283 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 11:24:40,613 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 11:24:40,613 INFO L272 AbstractInterpreter]: Visited 145 different actions 284 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-15 11:24:40,620 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 11:24:43,860 INFO L232 lantSequenceWeakener]: Weakened 168 states. On average, predicates are now at 73.15% of their original sizes. [2018-09-15 11:24:43,861 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 11:24:45,248 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 11:24:45,248 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 11:24:45,249 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-15 11:24:45,249 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 11:24:45,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-15 11:24:45,250 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-15 11:24:45,250 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-09-15 11:24:45,251 INFO L87 Difference]: Start difference. First operand 1089 states and 1286 transitions. Second operand 14 states. [2018-09-15 11:24:56,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 11:24:56,978 INFO L93 Difference]: Finished difference Result 1594 states and 2078 transitions. [2018-09-15 11:24:56,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-15 11:24:56,980 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 170 [2018-09-15 11:24:56,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 11:24:56,987 INFO L225 Difference]: With dead ends: 1594 [2018-09-15 11:24:56,987 INFO L226 Difference]: Without dead ends: 1238 [2018-09-15 11:24:56,989 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 181 GetRequests, 137 SyntacticMatches, 20 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2018-09-15 11:24:56,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2018-09-15 11:24:57,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1235. [2018-09-15 11:24:57,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1235 states. [2018-09-15 11:24:57,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1444 transitions. [2018-09-15 11:24:57,044 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1444 transitions. Word has length 170 [2018-09-15 11:24:57,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 11:24:57,044 INFO L480 AbstractCegarLoop]: Abstraction has 1235 states and 1444 transitions. [2018-09-15 11:24:57,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-15 11:24:57,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1444 transitions. [2018-09-15 11:24:57,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-09-15 11:24:57,056 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 11:24:57,056 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-15 11:24:57,057 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 11:24:57,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1149694359, now seen corresponding path program 1 times [2018-09-15 11:24:57,057 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 11:24:57,058 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 180 with the following transitions: [2018-09-15 11:24:57,058 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], [157], [159], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [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-15 11:24:57,061 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 11:24:57,061 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 11:24:58,516 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 11:25:11,114 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 11:25:11,114 INFO L272 AbstractInterpreter]: Visited 84 different actions 244 times. Merged at 7 different actions 14 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-15 11:25:11,120 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 11:25:14,371 INFO L232 lantSequenceWeakener]: Weakened 177 states. On average, predicates are now at 73.19% of their original sizes. [2018-09-15 11:25:14,372 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 11:25:15,265 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 11:25:15,266 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 11:25:15,266 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-15 11:25:15,266 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 11:25:15,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-15 11:25:15,267 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-15 11:25:15,268 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-15 11:25:15,268 INFO L87 Difference]: Start difference. First operand 1235 states and 1444 transitions. Second operand 10 states. [2018-09-15 11:25:24,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 11:25:24,915 INFO L93 Difference]: Finished difference Result 1749 states and 2252 transitions. [2018-09-15 11:25:24,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-15 11:25:24,916 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 179 [2018-09-15 11:25:24,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 11:25:24,923 INFO L225 Difference]: With dead ends: 1749 [2018-09-15 11:25:24,924 INFO L226 Difference]: Without dead ends: 1393 [2018-09-15 11:25:24,926 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 186 GetRequests, 150 SyntacticMatches, 20 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-15 11:25:24,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2018-09-15 11:25:24,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1383. [2018-09-15 11:25:24,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1383 states. [2018-09-15 11:25:24,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 1610 transitions. [2018-09-15 11:25:24,993 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 1610 transitions. Word has length 179 [2018-09-15 11:25:24,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 11:25:24,994 INFO L480 AbstractCegarLoop]: Abstraction has 1383 states and 1610 transitions. [2018-09-15 11:25:24,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-15 11:25:24,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 1610 transitions. [2018-09-15 11:25:24,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-09-15 11:25:24,998 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 11:25:24,998 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-15 11:25:24,999 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 11:25:24,999 INFO L82 PathProgramCache]: Analyzing trace with hash -686876465, now seen corresponding path program 1 times [2018-09-15 11:25:24,999 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 11:25:24,999 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 184 with the following transitions: [2018-09-15 11:25:25,000 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], [157], [159], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [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], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 11:25:25,002 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 11:25:25,003 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 11:25:26,701 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 11:25:46,998 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 11:25:46,999 INFO L272 AbstractInterpreter]: Visited 88 different actions 510 times. Merged at 7 different actions 37 times. Widened at 1 different actions 1 times. Found 7 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-15 11:25:47,005 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 11:25:48,237 INFO L232 lantSequenceWeakener]: Weakened 181 states. On average, predicates are now at 73.15% of their original sizes. [2018-09-15 11:25:48,238 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 11:25:49,133 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 11:25:49,133 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 11:25:49,134 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-15 11:25:49,134 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 11:25:49,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-15 11:25:49,135 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-15 11:25:49,135 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-09-15 11:25:49,135 INFO L87 Difference]: Start difference. First operand 1383 states and 1610 transitions. Second operand 14 states. [2018-09-15 11:25:58,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 11:25:58,609 INFO L93 Difference]: Finished difference Result 2694 states and 3600 transitions. [2018-09-15 11:25:58,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-15 11:25:58,615 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 183 [2018-09-15 11:25:58,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 11:25:58,626 INFO L225 Difference]: With dead ends: 2694 [2018-09-15 11:25:58,626 INFO L226 Difference]: Without dead ends: 2190 [2018-09-15 11:25:58,630 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 195 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2018-09-15 11:25:58,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2190 states. [2018-09-15 11:25:58,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2190 to 2090. [2018-09-15 11:25:58,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2090 states. [2018-09-15 11:25:58,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 2462 transitions. [2018-09-15 11:25:58,728 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 2462 transitions. Word has length 183 [2018-09-15 11:25:58,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 11:25:58,729 INFO L480 AbstractCegarLoop]: Abstraction has 2090 states and 2462 transitions. [2018-09-15 11:25:58,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-15 11:25:58,729 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 2462 transitions. [2018-09-15 11:25:58,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-09-15 11:25:58,733 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 11:25:58,734 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-15 11:25:58,734 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 11:25:58,734 INFO L82 PathProgramCache]: Analyzing trace with hash 946117528, now seen corresponding path program 1 times [2018-09-15 11:25:58,734 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 11:25:58,735 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 217 with the following transitions: [2018-09-15 11:25:58,735 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], [157], [159], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [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-15 11:25:58,739 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 11:25:58,739 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 11:26:00,102 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 11:26:25,255 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 11:26:25,255 INFO L272 AbstractInterpreter]: Visited 121 different actions 589 times. Merged at 7 different actions 28 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-15 11:26:25,262 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 11:26:26,685 INFO L232 lantSequenceWeakener]: Weakened 214 states. On average, predicates are now at 73.11% of their original sizes. [2018-09-15 11:26:26,686 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 11:26:27,425 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 11:26:27,425 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 11:26:27,426 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-15 11:26:27,426 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 11:26:27,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-15 11:26:27,426 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-15 11:26:27,427 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-09-15 11:26:27,427 INFO L87 Difference]: Start difference. First operand 2090 states and 2462 transitions. Second operand 13 states. [2018-09-15 11:26:38,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 11:26:38,953 INFO L93 Difference]: Finished difference Result 3912 states and 5020 transitions. [2018-09-15 11:26:38,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-15 11:26:38,955 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 216 [2018-09-15 11:26:38,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 11:26:38,965 INFO L225 Difference]: With dead ends: 3912 [2018-09-15 11:26:38,965 INFO L226 Difference]: Without dead ends: 2701 [2018-09-15 11:26:38,970 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 228 GetRequests, 192 SyntacticMatches, 12 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2018-09-15 11:26:38,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2701 states. [2018-09-15 11:26:39,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2701 to 2605. [2018-09-15 11:26:39,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2605 states. [2018-09-15 11:26:39,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2605 states to 2605 states and 3086 transitions. [2018-09-15 11:26:39,077 INFO L78 Accepts]: Start accepts. Automaton has 2605 states and 3086 transitions. Word has length 216 [2018-09-15 11:26:39,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 11:26:39,078 INFO L480 AbstractCegarLoop]: Abstraction has 2605 states and 3086 transitions. [2018-09-15 11:26:39,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-15 11:26:39,078 INFO L276 IsEmpty]: Start isEmpty. Operand 2605 states and 3086 transitions. [2018-09-15 11:26:39,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-09-15 11:26:39,083 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 11:26:39,084 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-15 11:26:39,084 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 11:26:39,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1291098567, now seen corresponding path program 1 times [2018-09-15 11:26:39,084 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 11:26:39,085 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 220 with the following transitions: [2018-09-15 11:26:39,085 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], [157], [159], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [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], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 11:26:39,088 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 11:26:39,088 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 11:26:40,484 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. Received shutdown request... [2018-09-15 11:26:41,662 WARN L572 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-09-15 11:26:41,663 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-09-15 11:26:41,664 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-15 11:26:41,695 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-15 11:26:41,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.09 11:26:41 BoogieIcfgContainer [2018-09-15 11:26:41,695 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-15 11:26:41,696 INFO L168 Benchmark]: Toolchain (without parser) took 260130.15 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 3.9 GB in the end (delta: -2.5 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-15 11:26:41,698 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-15 11:26:41,699 INFO L168 Benchmark]: CACSL2BoogieTranslator took 845.21 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-15 11:26:41,699 INFO L168 Benchmark]: Boogie Procedure Inliner took 131.99 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-15 11:26:41,700 INFO L168 Benchmark]: Boogie Preprocessor took 250.18 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -843.5 MB). Peak memory consumption was 29.1 MB. Max. memory is 7.1 GB. [2018-09-15 11:26:41,701 INFO L168 Benchmark]: RCFGBuilder took 3260.66 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.5 MB). Peak memory consumption was 106.5 MB. Max. memory is 7.1 GB. [2018-09-15 11:26:41,702 INFO L168 Benchmark]: TraceAbstraction took 255629.87 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 3.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-15 11:26:41,707 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 845.21 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 131.99 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 250.18 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -843.5 MB). Peak memory consumption was 29.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3260.66 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.5 MB). Peak memory consumption was 106.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 255629.87 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 3.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 79]: 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 FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L425] COND TRUE ((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0)) [L426] a1 = ((((a1 / 5) * 5) / 5) + 505228) [L427] a10 = 1 [L429] RET return 25; [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 TRUE (((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)) [L79] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNKNOWN Result, 255.5s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 86.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1843 SDtfs, 8390 SDslu, 3849 SDs, 0 SdLazy, 19449 SolverSat, 1862 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 76.1s Time, PredicateUnifierStatistics: 18 DeclaredPredicates, 1382 GetRequests, 1102 SyntacticMatches, 112 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1503 ImplicationChecksByTransitivity, 13.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2605occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 139.0s AbstIntTime, 10 AbstIntIterations, 9 AbstIntStrong, 0.9932102244245073 AbsIntWeakeningRatio, 0.14757878554957723 AbsIntAvgWeakeningVarsNumRemoved, 302.99461952344353 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 228 StatesRemovedByMinimization, 9 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_label32_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-15_11-26-41-721.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label32_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-15_11-26-41-721.csv Completed graceful shutdown