java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_INT-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label23_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 06:02:49,162 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 06:02:49,164 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 06:02:49,179 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 06:02:49,179 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 06:02:49,180 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 06:02:49,182 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 06:02:49,183 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 06:02:49,185 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 06:02:49,186 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 06:02:49,187 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 06:02:49,187 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 06:02:49,188 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 06:02:49,189 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 06:02:49,190 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 06:02:49,191 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 06:02:49,191 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 06:02:49,193 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 06:02:49,196 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 06:02:49,197 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 06:02:49,198 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 06:02:49,200 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 06:02:49,202 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 06:02:49,202 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 06:02:49,202 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 06:02:49,203 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 06:02:49,204 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 06:02:49,205 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 06:02:49,206 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 06:02:49,207 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 06:02:49,208 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 06:02:49,208 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 06:02:49,208 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 06:02:49,209 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 06:02:49,210 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 06:02:49,210 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 06:02:49,211 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_INT-OldIcfg.epf [2018-09-19 06:02:49,237 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 06:02:49,237 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 06:02:49,238 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 06:02:49,238 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 06:02:49,238 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 06:02:49,239 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 06:02:49,239 INFO L133 SettingsManager]: * Congruence Domain=false [2018-09-19 06:02:49,239 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 06:02:49,239 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-19 06:02:49,240 INFO L133 SettingsManager]: * Abstract domain=IntervalDomain [2018-09-19 06:02:49,240 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 06:02:49,240 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 06:02:49,240 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 06:02:49,241 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 06:02:49,241 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 06:02:49,241 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 06:02:49,242 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 06:02:49,242 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 06:02:49,242 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 06:02:49,242 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 06:02:49,244 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 06:02:49,244 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 06:02:49,245 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 06:02:49,245 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 06:02:49,245 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 06:02:49,245 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 06:02:49,245 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 06:02:49,246 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 06:02:49,246 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 06:02:49,246 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 06:02:49,246 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 06:02:49,246 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 06:02:49,246 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 06:02:49,247 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 06:02:49,247 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 06:02:49,302 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 06:02:49,314 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 06:02:49,319 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 06:02:49,321 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 06:02:49,321 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 06:02:49,322 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label23_true-unreach-call.c [2018-09-19 06:02:49,710 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97dc38eb4/c8a3a29dc51146caafc68079f0e5df25/FLAG0a021cde4 [2018-09-19 06:02:50,001 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 06:02:50,002 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label23_true-unreach-call.c [2018-09-19 06:02:50,018 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97dc38eb4/c8a3a29dc51146caafc68079f0e5df25/FLAG0a021cde4 [2018-09-19 06:02:50,046 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97dc38eb4/c8a3a29dc51146caafc68079f0e5df25 [2018-09-19 06:02:50,059 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 06:02:50,063 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 06:02:50,064 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 06:02:50,065 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 06:02:50,076 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 06:02:50,077 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 06:02:50" (1/1) ... [2018-09-19 06:02:50,080 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@719bd2be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:02:50, skipping insertion in model container [2018-09-19 06:02:50,080 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 06:02:50" (1/1) ... [2018-09-19 06:02:50,094 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 06:02:50,593 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 06:02:50,612 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 06:02:50,748 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 06:02:50,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:02:50 WrapperNode [2018-09-19 06:02:50,801 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 06:02:50,802 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 06:02:50,802 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 06:02:50,802 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 06:02:50,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:02:50" (1/1) ... [2018-09-19 06:02:50,845 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:02:50" (1/1) ... [2018-09-19 06:02:50,924 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 06:02:50,924 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 06:02:50,924 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 06:02:50,925 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 06:02:50,937 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:02:50" (1/1) ... [2018-09-19 06:02:50,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:02:50" (1/1) ... [2018-09-19 06:02:50,950 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:02:50" (1/1) ... [2018-09-19 06:02:50,952 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:02:50" (1/1) ... [2018-09-19 06:02:51,134 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:02:50" (1/1) ... [2018-09-19 06:02:51,151 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:02:50" (1/1) ... [2018-09-19 06:02:51,168 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:02:50" (1/1) ... [2018-09-19 06:02:51,186 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 06:02:51,186 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 06:02:51,190 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 06:02:51,190 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 06:02:51,191 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:02:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 06:02:51,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 06:02:51,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 06:02:51,267 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 06:02:51,267 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 06:02:51,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 06:02:51,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 06:02:51,267 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 06:02:51,268 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 06:02:54,534 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 06:02:54,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 06:02:54 BoogieIcfgContainer [2018-09-19 06:02:54,535 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 06:02:54,537 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 06:02:54,538 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 06:02:54,541 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 06:02:54,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 06:02:50" (1/3) ... [2018-09-19 06:02:54,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e220b14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 06:02:54, skipping insertion in model container [2018-09-19 06:02:54,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:02:50" (2/3) ... [2018-09-19 06:02:54,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e220b14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 06:02:54, skipping insertion in model container [2018-09-19 06:02:54,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 06:02:54" (3/3) ... [2018-09-19 06:02:54,549 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label23_true-unreach-call.c [2018-09-19 06:02:54,561 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 06:02:54,571 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 06:02:54,649 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 06:02:54,650 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 06:02:54,650 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 06:02:54,650 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 06:02:54,651 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 06:02:54,651 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 06:02:54,651 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 06:02:54,651 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 06:02:54,652 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 06:02:54,696 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-19 06:02:54,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-09-19 06:02:54,710 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:02:54,712 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:02:54,713 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:02:54,722 INFO L82 PathProgramCache]: Analyzing trace with hash 508483465, now seen corresponding path program 1 times [2018-09-19 06:02:54,725 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:02:54,726 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-09-19 06:02:54,729 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [325], [327], [796], [800], [806], [810], [817], [818], [819], [821] [2018-09-19 06:02:54,787 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:02:54,788 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:02:55,049 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:02:55,051 INFO L272 AbstractInterpreter]: Visited 52 different actions 52 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-19 06:02:55,075 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:02:55,189 INFO L232 lantSequenceWeakener]: Weakened 50 states. On average, predicates are now at 75.25% of their original sizes. [2018-09-19 06:02:55,190 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:02:55,323 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:02:55,325 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:02:55,325 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 06:02:55,325 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:02:55,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 06:02:55,339 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 06:02:55,340 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 06:02:55,342 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 6 states. [2018-09-19 06:02:57,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:02:57,870 INFO L93 Difference]: Finished difference Result 576 states and 995 transitions. [2018-09-19 06:02:57,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 06:02:57,874 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-09-19 06:02:57,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:02:57,892 INFO L225 Difference]: With dead ends: 576 [2018-09-19 06:02:57,893 INFO L226 Difference]: Without dead ends: 358 [2018-09-19 06:02:57,899 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 52 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 06:02:57,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-09-19 06:02:57,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-09-19 06:02:57,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-19 06:02:57,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2018-09-19 06:02:57,978 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 53 [2018-09-19 06:02:57,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:02:57,979 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2018-09-19 06:02:57,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 06:02:57,979 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2018-09-19 06:02:57,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-09-19 06:02:57,992 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:02:57,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, 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] [2018-09-19 06:02:57,992 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:02:57,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1413814341, now seen corresponding path program 1 times [2018-09-19 06:02:57,993 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:02:57,993 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 125 with the following transitions: [2018-09-19 06:02:57,994 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [325], [327], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:02:58,005 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:02:58,005 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:02:58,145 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:02:58,284 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:02:58,285 INFO L272 AbstractInterpreter]: Visited 78 different actions 221 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 06:02:58,326 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:02:58,489 INFO L232 lantSequenceWeakener]: Weakened 121 states. On average, predicates are now at 73.85% of their original sizes. [2018-09-19 06:02:58,489 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:02:59,009 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:02:59,009 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:02:59,009 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:02:59,009 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:02:59,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:02:59,011 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:02:59,011 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:02:59,012 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand 10 states. [2018-09-19 06:03:02,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:03:02,803 INFO L93 Difference]: Finished difference Result 717 states and 1132 transitions. [2018-09-19 06:03:02,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 06:03:02,805 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 124 [2018-09-19 06:03:02,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:03:02,812 INFO L225 Difference]: With dead ends: 717 [2018-09-19 06:03:02,812 INFO L226 Difference]: Without dead ends: 511 [2018-09-19 06:03:02,815 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 130 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 06:03:02,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-09-19 06:03:02,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 505. [2018-09-19 06:03:02,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2018-09-19 06:03:02,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 669 transitions. [2018-09-19 06:03:02,868 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 669 transitions. Word has length 124 [2018-09-19 06:03:02,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:03:02,869 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 669 transitions. [2018-09-19 06:03:02,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:03:02,869 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 669 transitions. [2018-09-19 06:03:02,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-09-19 06:03:02,875 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:03:02,875 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:03:02,875 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:03:02,879 INFO L82 PathProgramCache]: Analyzing trace with hash 958601716, now seen corresponding path program 1 times [2018-09-19 06:03:02,879 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:03:02,879 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 134 with the following transitions: [2018-09-19 06:03:02,880 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [325], [327], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:03:02,885 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:03:02,885 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:03:02,954 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:03:03,080 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:03:03,081 INFO L272 AbstractInterpreter]: Visited 87 different actions 248 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 06:03:03,107 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:03:03,217 INFO L232 lantSequenceWeakener]: Weakened 130 states. On average, predicates are now at 73.77% of their original sizes. [2018-09-19 06:03:03,217 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:03:03,986 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:03:03,987 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:03:03,987 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:03:03,987 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:03:03,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:03:03,988 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:03:03,988 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:03:03,989 INFO L87 Difference]: Start difference. First operand 505 states and 669 transitions. Second operand 10 states. [2018-09-19 06:03:08,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:03:08,119 INFO L93 Difference]: Finished difference Result 1149 states and 1736 transitions. [2018-09-19 06:03:08,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:03:08,121 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 133 [2018-09-19 06:03:08,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:03:08,127 INFO L225 Difference]: With dead ends: 1149 [2018-09-19 06:03:08,127 INFO L226 Difference]: Without dead ends: 794 [2018-09-19 06:03:08,129 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 140 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:03:08,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2018-09-19 06:03:08,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 783. [2018-09-19 06:03:08,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2018-09-19 06:03:08,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1001 transitions. [2018-09-19 06:03:08,158 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1001 transitions. Word has length 133 [2018-09-19 06:03:08,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:03:08,159 INFO L480 AbstractCegarLoop]: Abstraction has 783 states and 1001 transitions. [2018-09-19 06:03:08,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:03:08,159 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1001 transitions. [2018-09-19 06:03:08,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-09-19 06:03:08,162 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:03:08,163 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:03:08,163 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:03:08,163 INFO L82 PathProgramCache]: Analyzing trace with hash 404358396, now seen corresponding path program 1 times [2018-09-19 06:03:08,163 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:03:08,164 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 170 with the following transitions: [2018-09-19 06:03:08,164 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [325], [327], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:03:08,168 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:03:08,168 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:03:08,248 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:03:08,386 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:03:08,386 INFO L272 AbstractInterpreter]: Visited 123 different actions 356 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 06:03:08,416 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:03:08,581 INFO L232 lantSequenceWeakener]: Weakened 166 states. On average, predicates are now at 73.54% of their original sizes. [2018-09-19 06:03:08,581 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:03:08,785 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:03:08,785 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:03:08,786 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:03:08,786 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:03:08,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:03:08,787 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:03:08,787 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:03:08,788 INFO L87 Difference]: Start difference. First operand 783 states and 1001 transitions. Second operand 10 states. [2018-09-19 06:03:12,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:03:12,360 INFO L93 Difference]: Finished difference Result 1723 states and 2332 transitions. [2018-09-19 06:03:12,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 06:03:12,361 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 169 [2018-09-19 06:03:12,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:03:12,367 INFO L225 Difference]: With dead ends: 1723 [2018-09-19 06:03:12,368 INFO L226 Difference]: Without dead ends: 1090 [2018-09-19 06:03:12,371 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 175 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 06:03:12,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2018-09-19 06:03:12,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1081. [2018-09-19 06:03:12,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1081 states. [2018-09-19 06:03:12,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1351 transitions. [2018-09-19 06:03:12,405 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1351 transitions. Word has length 169 [2018-09-19 06:03:12,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:03:12,406 INFO L480 AbstractCegarLoop]: Abstraction has 1081 states and 1351 transitions. [2018-09-19 06:03:12,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:03:12,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1351 transitions. [2018-09-19 06:03:12,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-09-19 06:03:12,410 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:03:12,410 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:03:12,410 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:03:12,411 INFO L82 PathProgramCache]: Analyzing trace with hash 898100283, now seen corresponding path program 1 times [2018-09-19 06:03:12,411 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:03:12,411 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 189 with the following transitions: [2018-09-19 06:03:12,412 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [325], [327], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [754], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:03:12,416 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:03:12,416 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:03:12,656 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:03:12,657 INFO L272 AbstractInterpreter]: Visited 142 different actions 413 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 06:03:12,692 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:03:12,818 INFO L232 lantSequenceWeakener]: Weakened 185 states. On average, predicates are now at 73.46% of their original sizes. [2018-09-19 06:03:12,818 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:03:12,905 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:03:12,905 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:03:12,906 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:03:12,906 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:03:12,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:03:12,907 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:03:12,907 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:03:12,907 INFO L87 Difference]: Start difference. First operand 1081 states and 1351 transitions. Second operand 10 states. [2018-09-19 06:03:15,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:03:15,174 INFO L93 Difference]: Finished difference Result 2464 states and 3201 transitions. [2018-09-19 06:03:15,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 06:03:15,177 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 188 [2018-09-19 06:03:15,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:03:15,186 INFO L225 Difference]: With dead ends: 2464 [2018-09-19 06:03:15,186 INFO L226 Difference]: Without dead ends: 1533 [2018-09-19 06:03:15,189 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 194 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 06:03:15,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2018-09-19 06:03:15,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1521. [2018-09-19 06:03:15,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1521 states. [2018-09-19 06:03:15,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 1842 transitions. [2018-09-19 06:03:15,238 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 1842 transitions. Word has length 188 [2018-09-19 06:03:15,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:03:15,239 INFO L480 AbstractCegarLoop]: Abstraction has 1521 states and 1842 transitions. [2018-09-19 06:03:15,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:03:15,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 1842 transitions. [2018-09-19 06:03:15,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-09-19 06:03:15,243 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:03:15,243 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:03:15,244 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:03:15,244 INFO L82 PathProgramCache]: Analyzing trace with hash -924485026, now seen corresponding path program 1 times [2018-09-19 06:03:15,244 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:03:15,244 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 201 with the following transitions: [2018-09-19 06:03:15,245 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [325], [327], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [518], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:03:15,252 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:03:15,252 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:03:15,290 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:03:15,366 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:03:15,366 INFO L272 AbstractInterpreter]: Visited 84 different actions 323 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 06:03:15,396 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:03:15,514 INFO L232 lantSequenceWeakener]: Weakened 197 states. On average, predicates are now at 73.46% of their original sizes. [2018-09-19 06:03:15,514 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:03:15,750 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:03:15,750 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:03:15,750 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:03:15,751 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:03:15,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:03:15,751 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:03:15,752 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:03:15,752 INFO L87 Difference]: Start difference. First operand 1521 states and 1842 transitions. Second operand 10 states. [2018-09-19 06:03:18,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:03:18,000 INFO L93 Difference]: Finished difference Result 3061 states and 3845 transitions. [2018-09-19 06:03:18,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:03:18,001 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 200 [2018-09-19 06:03:18,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:03:18,010 INFO L225 Difference]: With dead ends: 3061 [2018-09-19 06:03:18,010 INFO L226 Difference]: Without dead ends: 1690 [2018-09-19 06:03:18,015 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 207 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:03:18,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2018-09-19 06:03:18,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1672. [2018-09-19 06:03:18,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2018-09-19 06:03:18,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2020 transitions. [2018-09-19 06:03:18,066 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2020 transitions. Word has length 200 [2018-09-19 06:03:18,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:03:18,066 INFO L480 AbstractCegarLoop]: Abstraction has 1672 states and 2020 transitions. [2018-09-19 06:03:18,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:03:18,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2020 transitions. [2018-09-19 06:03:18,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-09-19 06:03:18,071 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:03:18,071 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:03:18,071 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:03:18,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1379185598, now seen corresponding path program 1 times [2018-09-19 06:03:18,072 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:03:18,072 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 203 with the following transitions: [2018-09-19 06:03:18,073 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [325], [327], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [526], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:03:18,075 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:03:18,075 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:03:18,114 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:03:18,233 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:03:18,233 INFO L272 AbstractInterpreter]: Visited 86 different actions 332 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 06:03:18,367 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:03:18,495 INFO L232 lantSequenceWeakener]: Weakened 199 states. On average, predicates are now at 73.45% of their original sizes. [2018-09-19 06:03:18,495 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:03:18,983 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:03:18,983 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:03:18,983 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:03:18,984 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:03:18,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:03:18,984 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:03:18,985 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:03:18,985 INFO L87 Difference]: Start difference. First operand 1672 states and 2020 transitions. Second operand 10 states. [2018-09-19 06:03:21,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:03:21,330 INFO L93 Difference]: Finished difference Result 3362 states and 4211 transitions. [2018-09-19 06:03:21,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:03:21,334 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 202 [2018-09-19 06:03:21,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:03:21,344 INFO L225 Difference]: With dead ends: 3362 [2018-09-19 06:03:21,344 INFO L226 Difference]: Without dead ends: 1840 [2018-09-19 06:03:21,348 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 209 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:03:21,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2018-09-19 06:03:21,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 1823. [2018-09-19 06:03:21,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1823 states. [2018-09-19 06:03:21,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1823 states to 1823 states and 2218 transitions. [2018-09-19 06:03:21,392 INFO L78 Accepts]: Start accepts. Automaton has 1823 states and 2218 transitions. Word has length 202 [2018-09-19 06:03:21,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:03:21,393 INFO L480 AbstractCegarLoop]: Abstraction has 1823 states and 2218 transitions. [2018-09-19 06:03:21,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:03:21,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1823 states and 2218 transitions. [2018-09-19 06:03:21,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-09-19 06:03:21,397 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:03:21,397 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:03:21,398 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:03:21,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1181517814, now seen corresponding path program 1 times [2018-09-19 06:03:21,398 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:03:21,398 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 207 with the following transitions: [2018-09-19 06:03:21,399 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [325], [327], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [542], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:03:21,401 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:03:21,401 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:03:21,427 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:03:21,508 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:03:21,509 INFO L272 AbstractInterpreter]: Visited 90 different actions 348 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 06:03:21,536 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:03:21,657 INFO L232 lantSequenceWeakener]: Weakened 203 states. On average, predicates are now at 73.44% of their original sizes. [2018-09-19 06:03:21,657 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:03:21,862 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:03:21,863 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:03:21,863 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:03:21,863 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:03:21,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:03:21,864 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:03:21,864 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:03:21,864 INFO L87 Difference]: Start difference. First operand 1823 states and 2218 transitions. Second operand 10 states. [2018-09-19 06:03:24,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:03:24,445 INFO L93 Difference]: Finished difference Result 3819 states and 4796 transitions. [2018-09-19 06:03:24,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:03:24,453 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 206 [2018-09-19 06:03:24,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:03:24,463 INFO L225 Difference]: With dead ends: 3819 [2018-09-19 06:03:24,464 INFO L226 Difference]: Without dead ends: 2146 [2018-09-19 06:03:24,468 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 213 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:03:24,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2146 states. [2018-09-19 06:03:24,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2146 to 2123. [2018-09-19 06:03:24,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2123 states. [2018-09-19 06:03:24,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2123 states to 2123 states and 2596 transitions. [2018-09-19 06:03:24,527 INFO L78 Accepts]: Start accepts. Automaton has 2123 states and 2596 transitions. Word has length 206 [2018-09-19 06:03:24,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:03:24,528 INFO L480 AbstractCegarLoop]: Abstraction has 2123 states and 2596 transitions. [2018-09-19 06:03:24,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:03:24,528 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 2596 transitions. [2018-09-19 06:03:24,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-09-19 06:03:24,534 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:03:24,534 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:03:24,534 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:03:24,535 INFO L82 PathProgramCache]: Analyzing trace with hash -162623020, now seen corresponding path program 1 times [2018-09-19 06:03:24,535 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:03:24,535 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 207 with the following transitions: [2018-09-19 06:03:24,535 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [325], [327], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:03:24,537 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:03:24,537 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:03:24,571 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:03:24,650 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:03:24,651 INFO L272 AbstractInterpreter]: Visited 88 different actions 340 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 06:03:24,688 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:03:24,937 INFO L232 lantSequenceWeakener]: Weakened 203 states. On average, predicates are now at 73.44% of their original sizes. [2018-09-19 06:03:24,937 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:03:25,087 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:03:25,088 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:03:25,088 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:03:25,088 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:03:25,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:03:25,089 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:03:25,089 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:03:25,089 INFO L87 Difference]: Start difference. First operand 2123 states and 2596 transitions. Second operand 10 states. [2018-09-19 06:03:28,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:03:28,044 INFO L93 Difference]: Finished difference Result 4418 states and 5553 transitions. [2018-09-19 06:03:28,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:03:28,046 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 206 [2018-09-19 06:03:28,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:03:28,055 INFO L225 Difference]: With dead ends: 4418 [2018-09-19 06:03:28,055 INFO L226 Difference]: Without dead ends: 2445 [2018-09-19 06:03:28,060 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 213 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:03:28,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2445 states. [2018-09-19 06:03:28,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2445 to 2411. [2018-09-19 06:03:28,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2411 states. [2018-09-19 06:03:28,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 2974 transitions. [2018-09-19 06:03:28,117 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 2974 transitions. Word has length 206 [2018-09-19 06:03:28,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:03:28,118 INFO L480 AbstractCegarLoop]: Abstraction has 2411 states and 2974 transitions. [2018-09-19 06:03:28,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:03:28,118 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 2974 transitions. [2018-09-19 06:03:28,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-09-19 06:03:28,123 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:03:28,123 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:03:28,123 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:03:28,123 INFO L82 PathProgramCache]: Analyzing trace with hash 372051382, now seen corresponding path program 1 times [2018-09-19 06:03:28,124 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:03:28,124 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 213 with the following transitions: [2018-09-19 06:03:28,124 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [325], [327], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:03:28,126 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:03:28,126 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:03:28,152 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:03:30,973 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:03:30,974 INFO L272 AbstractInterpreter]: Visited 96 different actions 372 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 06:03:30,979 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:03:31,558 INFO L232 lantSequenceWeakener]: Weakened 209 states. On average, predicates are now at 73.42% of their original sizes. [2018-09-19 06:03:31,558 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:03:31,639 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:03:31,640 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:03:31,640 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:03:31,640 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:03:31,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:03:31,641 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:03:31,641 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:03:31,641 INFO L87 Difference]: Start difference. First operand 2411 states and 2974 transitions. Second operand 10 states. [2018-09-19 06:03:33,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:03:33,665 INFO L93 Difference]: Finished difference Result 4850 states and 6141 transitions. [2018-09-19 06:03:33,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:03:33,665 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 212 [2018-09-19 06:03:33,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:03:33,676 INFO L225 Difference]: With dead ends: 4850 [2018-09-19 06:03:33,676 INFO L226 Difference]: Without dead ends: 2589 [2018-09-19 06:03:33,681 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 219 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:03:33,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2589 states. [2018-09-19 06:03:33,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2589 to 2566. [2018-09-19 06:03:33,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2566 states. [2018-09-19 06:03:33,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2566 states to 2566 states and 3192 transitions. [2018-09-19 06:03:33,735 INFO L78 Accepts]: Start accepts. Automaton has 2566 states and 3192 transitions. Word has length 212 [2018-09-19 06:03:33,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:03:33,735 INFO L480 AbstractCegarLoop]: Abstraction has 2566 states and 3192 transitions. [2018-09-19 06:03:33,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:03:33,736 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 3192 transitions. [2018-09-19 06:03:33,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-09-19 06:03:33,741 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:03:33,741 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:03:33,741 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:03:33,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1226425245, now seen corresponding path program 1 times [2018-09-19 06:03:33,742 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:03:33,742 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 222 with the following transitions: [2018-09-19 06:03:33,742 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [325], [327], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [602], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:03:33,744 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:03:33,744 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:03:33,770 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:03:34,318 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:03:34,319 INFO L272 AbstractInterpreter]: Visited 105 different actions 407 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 06:03:34,325 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:03:34,533 INFO L232 lantSequenceWeakener]: Weakened 218 states. On average, predicates are now at 73.39% of their original sizes. [2018-09-19 06:03:34,533 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:03:34,703 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:03:34,704 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:03:34,704 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:03:34,704 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:03:34,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:03:34,705 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:03:34,705 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:03:34,705 INFO L87 Difference]: Start difference. First operand 2566 states and 3192 transitions. Second operand 10 states. [2018-09-19 06:03:36,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:03:36,338 INFO L93 Difference]: Finished difference Result 5163 states and 6584 transitions. [2018-09-19 06:03:36,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:03:36,345 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 221 [2018-09-19 06:03:36,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:03:36,355 INFO L225 Difference]: With dead ends: 5163 [2018-09-19 06:03:36,355 INFO L226 Difference]: Without dead ends: 2747 [2018-09-19 06:03:36,360 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 228 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:03:36,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2747 states. [2018-09-19 06:03:36,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2747 to 2721. [2018-09-19 06:03:36,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2721 states. [2018-09-19 06:03:36,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2721 states to 2721 states and 3412 transitions. [2018-09-19 06:03:36,418 INFO L78 Accepts]: Start accepts. Automaton has 2721 states and 3412 transitions. Word has length 221 [2018-09-19 06:03:36,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:03:36,419 INFO L480 AbstractCegarLoop]: Abstraction has 2721 states and 3412 transitions. [2018-09-19 06:03:36,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:03:36,419 INFO L276 IsEmpty]: Start isEmpty. Operand 2721 states and 3412 transitions. [2018-09-19 06:03:36,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-09-19 06:03:36,424 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:03:36,425 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:03:36,425 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:03:36,425 INFO L82 PathProgramCache]: Analyzing trace with hash 13956489, now seen corresponding path program 1 times [2018-09-19 06:03:36,425 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:03:36,426 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 228 with the following transitions: [2018-09-19 06:03:36,426 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [325], [327], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [626], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:03:36,428 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:03:36,428 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:03:36,452 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:03:36,565 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:03:36,565 INFO L272 AbstractInterpreter]: Visited 111 different actions 432 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 06:03:36,577 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:03:36,696 INFO L232 lantSequenceWeakener]: Weakened 224 states. On average, predicates are now at 73.37% of their original sizes. [2018-09-19 06:03:36,696 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:03:36,779 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:03:36,779 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:03:36,779 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:03:36,779 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:03:36,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:03:36,780 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:03:36,780 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:03:36,780 INFO L87 Difference]: Start difference. First operand 2721 states and 3412 transitions. Second operand 10 states. [2018-09-19 06:03:39,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:03:39,694 INFO L93 Difference]: Finished difference Result 5472 states and 7022 transitions. [2018-09-19 06:03:39,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:03:39,694 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 227 [2018-09-19 06:03:39,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:03:39,705 INFO L225 Difference]: With dead ends: 5472 [2018-09-19 06:03:39,705 INFO L226 Difference]: Without dead ends: 2901 [2018-09-19 06:03:39,710 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 234 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:03:39,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2018-09-19 06:03:39,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 2876. [2018-09-19 06:03:39,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2876 states. [2018-09-19 06:03:39,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2876 states to 2876 states and 3624 transitions. [2018-09-19 06:03:39,782 INFO L78 Accepts]: Start accepts. Automaton has 2876 states and 3624 transitions. Word has length 227 [2018-09-19 06:03:39,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:03:39,782 INFO L480 AbstractCegarLoop]: Abstraction has 2876 states and 3624 transitions. [2018-09-19 06:03:39,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:03:39,783 INFO L276 IsEmpty]: Start isEmpty. Operand 2876 states and 3624 transitions. [2018-09-19 06:03:39,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-09-19 06:03:39,789 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:03:39,790 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:03:39,790 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:03:39,790 INFO L82 PathProgramCache]: Analyzing trace with hash -2052380030, now seen corresponding path program 1 times [2018-09-19 06:03:39,790 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:03:39,791 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 235 with the following transitions: [2018-09-19 06:03:39,791 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [325], [327], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:03:39,793 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:03:39,794 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:03:39,826 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:03:40,062 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:03:40,063 INFO L272 AbstractInterpreter]: Visited 118 different actions 459 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 06:03:40,090 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:03:40,244 INFO L232 lantSequenceWeakener]: Weakened 231 states. On average, predicates are now at 73.35% of their original sizes. [2018-09-19 06:03:40,245 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:03:40,654 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:03:40,655 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:03:40,655 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:03:40,655 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:03:40,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:03:40,656 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:03:40,656 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:03:40,656 INFO L87 Difference]: Start difference. First operand 2876 states and 3624 transitions. Second operand 10 states. [2018-09-19 06:03:42,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:03:42,550 INFO L93 Difference]: Finished difference Result 5959 states and 7691 transitions. [2018-09-19 06:03:42,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:03:42,551 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 234 [2018-09-19 06:03:42,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:03:42,560 INFO L225 Difference]: With dead ends: 5959 [2018-09-19 06:03:42,560 INFO L226 Difference]: Without dead ends: 3233 [2018-09-19 06:03:42,564 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 241 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:03:42,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3233 states. [2018-09-19 06:03:42,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3233 to 3184. [2018-09-19 06:03:42,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3184 states. [2018-09-19 06:03:42,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3184 states to 3184 states and 4030 transitions. [2018-09-19 06:03:42,631 INFO L78 Accepts]: Start accepts. Automaton has 3184 states and 4030 transitions. Word has length 234 [2018-09-19 06:03:42,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:03:42,632 INFO L480 AbstractCegarLoop]: Abstraction has 3184 states and 4030 transitions. [2018-09-19 06:03:42,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:03:42,632 INFO L276 IsEmpty]: Start isEmpty. Operand 3184 states and 4030 transitions. [2018-09-19 06:03:42,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-09-19 06:03:42,639 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:03:42,639 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:03:42,639 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:03:42,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1001402420, now seen corresponding path program 1 times [2018-09-19 06:03:42,640 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:03:42,640 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 243 with the following transitions: [2018-09-19 06:03:42,640 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [325], [327], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:03:42,642 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:03:42,643 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:03:42,695 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:03:42,887 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:03:42,887 INFO L272 AbstractInterpreter]: Visited 124 different actions 483 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 06:03:42,923 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:03:43,088 INFO L232 lantSequenceWeakener]: Weakened 239 states. On average, predicates are now at 73.33% of their original sizes. [2018-09-19 06:03:43,088 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:03:43,279 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:03:43,279 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:03:43,279 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:03:43,279 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:03:43,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:03:43,280 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:03:43,280 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:03:43,280 INFO L87 Difference]: Start difference. First operand 3184 states and 4030 transitions. Second operand 10 states. [2018-09-19 06:03:45,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:03:45,047 INFO L93 Difference]: Finished difference Result 6547 states and 8487 transitions. [2018-09-19 06:03:45,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:03:45,056 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 242 [2018-09-19 06:03:45,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:03:45,075 INFO L225 Difference]: With dead ends: 6547 [2018-09-19 06:03:45,076 INFO L226 Difference]: Without dead ends: 3513 [2018-09-19 06:03:45,088 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 249 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:03:45,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3513 states. [2018-09-19 06:03:45,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3513 to 3486. [2018-09-19 06:03:45,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3486 states. [2018-09-19 06:03:45,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3486 states to 3486 states and 4452 transitions. [2018-09-19 06:03:45,166 INFO L78 Accepts]: Start accepts. Automaton has 3486 states and 4452 transitions. Word has length 242 [2018-09-19 06:03:45,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:03:45,167 INFO L480 AbstractCegarLoop]: Abstraction has 3486 states and 4452 transitions. [2018-09-19 06:03:45,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:03:45,167 INFO L276 IsEmpty]: Start isEmpty. Operand 3486 states and 4452 transitions. [2018-09-19 06:03:45,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-09-19 06:03:45,173 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:03:45,173 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2018-09-19 06:03:45,173 INFO L423 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:03:45,174 INFO L82 PathProgramCache]: Analyzing trace with hash -442577446, now seen corresponding path program 1 times [2018-09-19 06:03:45,174 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:03:45,174 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 247 with the following transitions: [2018-09-19 06:03:45,174 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [325], [327], [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], [679], [683], [687], [691], [695], [699], [702], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:03:45,177 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:03:45,177 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:03:45,201 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:03:45,439 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:03:45,439 INFO L272 AbstractInterpreter]: Visited 130 different actions 634 times. Merged at 7 different actions 28 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 06:03:45,457 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:03:45,592 INFO L232 lantSequenceWeakener]: Weakened 243 states. On average, predicates are now at 73.32% of their original sizes. [2018-09-19 06:03:45,592 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:03:45,681 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:03:45,681 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:03:45,681 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:03:45,681 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:03:45,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:03:45,682 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:03:45,682 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:03:45,682 INFO L87 Difference]: Start difference. First operand 3486 states and 4452 transitions. Second operand 10 states. [2018-09-19 06:03:50,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:03:50,664 INFO L93 Difference]: Finished difference Result 7025 states and 9137 transitions. [2018-09-19 06:03:50,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:03:50,672 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 246 [2018-09-19 06:03:50,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:03:50,693 INFO L225 Difference]: With dead ends: 7025 [2018-09-19 06:03:50,693 INFO L226 Difference]: Without dead ends: 3689 [2018-09-19 06:03:50,702 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 253 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:03:50,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3689 states. [2018-09-19 06:03:50,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3689 to 3649. [2018-09-19 06:03:50,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3649 states. [2018-09-19 06:03:50,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3649 states to 3649 states and 4696 transitions. [2018-09-19 06:03:50,764 INFO L78 Accepts]: Start accepts. Automaton has 3649 states and 4696 transitions. Word has length 246 [2018-09-19 06:03:50,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:03:50,764 INFO L480 AbstractCegarLoop]: Abstraction has 3649 states and 4696 transitions. [2018-09-19 06:03:50,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:03:50,764 INFO L276 IsEmpty]: Start isEmpty. Operand 3649 states and 4696 transitions. [2018-09-19 06:03:50,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-09-19 06:03:50,771 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:03:50,771 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2018-09-19 06:03:50,772 INFO L423 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:03:50,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1460297619, now seen corresponding path program 1 times [2018-09-19 06:03:50,772 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:03:50,772 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 262 with the following transitions: [2018-09-19 06:03:50,773 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [325], [327], [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], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [762], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:03:50,775 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:03:50,776 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:03:50,800 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:03:50,989 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:03:50,989 INFO L272 AbstractInterpreter]: Visited 145 different actions 567 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 06:03:50,993 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:03:51,105 INFO L232 lantSequenceWeakener]: Weakened 258 states. On average, predicates are now at 73.29% of their original sizes. [2018-09-19 06:03:51,106 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:03:51,187 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:03:51,187 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:03:51,187 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:03:51,187 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:03:51,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:03:51,188 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:03:51,188 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:03:51,188 INFO L87 Difference]: Start difference. First operand 3649 states and 4696 transitions. Second operand 10 states. [2018-09-19 06:03:53,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:03:53,663 INFO L93 Difference]: Finished difference Result 7322 states and 9594 transitions. [2018-09-19 06:03:53,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:03:53,672 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 261 [2018-09-19 06:03:53,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:03:53,683 INFO L225 Difference]: With dead ends: 7322 [2018-09-19 06:03:53,683 INFO L226 Difference]: Without dead ends: 3823 [2018-09-19 06:03:53,690 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 268 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:03:53,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3823 states. [2018-09-19 06:03:53,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3823 to 3806. [2018-09-19 06:03:53,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3806 states. [2018-09-19 06:03:53,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3806 states to 3806 states and 4906 transitions. [2018-09-19 06:03:53,754 INFO L78 Accepts]: Start accepts. Automaton has 3806 states and 4906 transitions. Word has length 261 [2018-09-19 06:03:53,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:03:53,754 INFO L480 AbstractCegarLoop]: Abstraction has 3806 states and 4906 transitions. [2018-09-19 06:03:53,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:03:53,755 INFO L276 IsEmpty]: Start isEmpty. Operand 3806 states and 4906 transitions. [2018-09-19 06:03:53,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-09-19 06:03:53,762 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:03:53,763 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 06:03:53,763 INFO L423 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:03:53,763 INFO L82 PathProgramCache]: Analyzing trace with hash 939905851, now seen corresponding path program 1 times [2018-09-19 06:03:53,763 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:03:53,764 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 276 with the following transitions: [2018-09-19 06:03:53,764 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [325], [327], [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], [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], [767], [771], [775], [779], [782], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:03:53,767 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:03:53,767 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:03:53,796 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:03:54,014 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:03:54,014 INFO L272 AbstractInterpreter]: Visited 150 different actions 587 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 06:03:54,019 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:03:54,178 INFO L232 lantSequenceWeakener]: Weakened 272 states. On average, predicates are now at 73.26% of their original sizes. [2018-09-19 06:03:54,178 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:03:54,260 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:03:54,260 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:03:54,261 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:03:54,261 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:03:54,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:03:54,261 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:03:54,261 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:03:54,262 INFO L87 Difference]: Start difference. First operand 3806 states and 4906 transitions. Second operand 10 states. [2018-09-19 06:03:57,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:03:57,433 INFO L93 Difference]: Finished difference Result 8367 states and 11098 transitions. [2018-09-19 06:03:57,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:03:57,441 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 275 [2018-09-19 06:03:57,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:03:57,454 INFO L225 Difference]: With dead ends: 8367 [2018-09-19 06:03:57,455 INFO L226 Difference]: Without dead ends: 4711 [2018-09-19 06:03:57,463 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 282 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:03:57,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4711 states. [2018-09-19 06:03:57,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4711 to 4649. [2018-09-19 06:03:57,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4649 states. [2018-09-19 06:03:57,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4649 states to 4649 states and 6018 transitions. [2018-09-19 06:03:57,558 INFO L78 Accepts]: Start accepts. Automaton has 4649 states and 6018 transitions. Word has length 275 [2018-09-19 06:03:57,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:03:57,559 INFO L480 AbstractCegarLoop]: Abstraction has 4649 states and 6018 transitions. [2018-09-19 06:03:57,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:03:57,559 INFO L276 IsEmpty]: Start isEmpty. Operand 4649 states and 6018 transitions. [2018-09-19 06:03:57,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-09-19 06:03:57,569 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:03:57,569 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:03:57,570 INFO L423 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:03:57,570 INFO L82 PathProgramCache]: Analyzing trace with hash 169029846, now seen corresponding path program 1 times [2018-09-19 06:03:57,570 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:03:57,570 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 284 with the following transitions: [2018-09-19 06:03:57,571 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [325], [327], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [535], [538], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:03:57,572 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:03:57,572 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:03:57,598 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:03:57,756 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:03:57,756 INFO L272 AbstractInterpreter]: Visited 90 different actions 438 times. Merged at 8 different actions 32 times. Never widened. Found 7 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 06:03:57,787 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:03:58,146 INFO L232 lantSequenceWeakener]: Weakened 280 states. On average, predicates are now at 73.28% of their original sizes. [2018-09-19 06:03:58,146 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:03:58,213 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:03:58,213 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:03:58,213 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:03:58,213 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:03:58,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:03:58,214 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:03:58,214 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:03:58,214 INFO L87 Difference]: Start difference. First operand 4649 states and 6018 transitions. Second operand 10 states. [2018-09-19 06:04:00,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:04:00,070 INFO L93 Difference]: Finished difference Result 9531 states and 12530 transitions. [2018-09-19 06:04:00,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:04:00,078 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 283 [2018-09-19 06:04:00,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:04:00,093 INFO L225 Difference]: With dead ends: 9531 [2018-09-19 06:04:00,094 INFO L226 Difference]: Without dead ends: 5032 [2018-09-19 06:04:00,103 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 290 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:04:00,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5032 states. [2018-09-19 06:04:00,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5032 to 4977. [2018-09-19 06:04:00,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4977 states. [2018-09-19 06:04:00,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4977 states to 4977 states and 6473 transitions. [2018-09-19 06:04:00,201 INFO L78 Accepts]: Start accepts. Automaton has 4977 states and 6473 transitions. Word has length 283 [2018-09-19 06:04:00,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:04:00,202 INFO L480 AbstractCegarLoop]: Abstraction has 4977 states and 6473 transitions. [2018-09-19 06:04:00,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:04:00,202 INFO L276 IsEmpty]: Start isEmpty. Operand 4977 states and 6473 transitions. [2018-09-19 06:04:00,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-09-19 06:04:00,213 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:04:00,214 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:04:00,214 INFO L423 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:04:00,214 INFO L82 PathProgramCache]: Analyzing trace with hash -529844210, now seen corresponding path program 1 times [2018-09-19 06:04:00,215 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:04:00,215 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 300 with the following transitions: [2018-09-19 06:04:00,215 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [325], [327], [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], [562], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:04:00,217 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:04:00,217 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:04:00,244 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:04:04,973 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:04:04,973 INFO L272 AbstractInterpreter]: Visited 97 different actions 569 times. Merged at 8 different actions 42 times. Widened at 1 different actions 1 times. Found 9 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 06:04:04,984 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:04:06,444 INFO L232 lantSequenceWeakener]: Weakened 296 states. On average, predicates are now at 73.25% of their original sizes. [2018-09-19 06:04:06,444 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:04:06,779 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:04:06,780 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:04:06,780 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:04:06,780 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:04:06,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:04:06,780 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:04:06,781 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:04:06,781 INFO L87 Difference]: Start difference. First operand 4977 states and 6473 transitions. Second operand 10 states. [2018-09-19 06:04:08,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:04:08,920 INFO L93 Difference]: Finished difference Result 10225 states and 13506 transitions. [2018-09-19 06:04:08,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-19 06:04:08,927 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 299 [2018-09-19 06:04:08,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:04:08,952 INFO L225 Difference]: With dead ends: 10225 [2018-09-19 06:04:08,952 INFO L226 Difference]: Without dead ends: 5398 [2018-09-19 06:04:08,962 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 306 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:04:08,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5398 states. [2018-09-19 06:04:09,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5398 to 5325. [2018-09-19 06:04:09,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5325 states. [2018-09-19 06:04:09,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5325 states to 5325 states and 6951 transitions. [2018-09-19 06:04:09,060 INFO L78 Accepts]: Start accepts. Automaton has 5325 states and 6951 transitions. Word has length 299 [2018-09-19 06:04:09,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:04:09,061 INFO L480 AbstractCegarLoop]: Abstraction has 5325 states and 6951 transitions. [2018-09-19 06:04:09,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:04:09,062 INFO L276 IsEmpty]: Start isEmpty. Operand 5325 states and 6951 transitions. [2018-09-19 06:04:09,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-09-19 06:04:09,075 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:04:09,075 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:04:09,076 INFO L423 AbstractCegarLoop]: === Iteration 20 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:04:09,076 INFO L82 PathProgramCache]: Analyzing trace with hash 941177434, now seen corresponding path program 1 times [2018-09-19 06:04:09,076 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:04:09,076 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 302 with the following transitions: [2018-09-19 06:04:09,077 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [325], [327], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [610], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:04:09,079 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:04:09,079 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:04:09,108 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:04:09,289 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-19 06:04:09,289 INFO L272 AbstractInterpreter]: Visited 109 different actions 529 times. Merged at 8 different actions 32 times. Never widened. Found 7 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 06:04:09,315 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 06:04:09,367 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 06:04:09,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 06:04:09 BoogieIcfgContainer [2018-09-19 06:04:09,367 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 06:04:09,368 INFO L168 Benchmark]: Toolchain (without parser) took 79309.03 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 927.5 MB. Max. memory is 7.1 GB. [2018-09-19 06:04:09,370 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 06:04:09,371 INFO L168 Benchmark]: CACSL2BoogieTranslator took 737.08 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-19 06:04:09,373 INFO L168 Benchmark]: Boogie Procedure Inliner took 121.93 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-19 06:04:09,374 INFO L168 Benchmark]: Boogie Preprocessor took 261.71 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 769.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -861.7 MB). Peak memory consumption was 30.1 MB. Max. memory is 7.1 GB. [2018-09-19 06:04:09,376 INFO L168 Benchmark]: RCFGBuilder took 3350.29 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: 108.4 MB). Peak memory consumption was 108.4 MB. Max. memory is 7.1 GB. [2018-09-19 06:04:09,377 INFO L168 Benchmark]: TraceAbstraction took 74829.92 ms. Allocated memory was 2.3 GB in the beginning and 3.5 GB in the end (delta: 1.2 GB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -360.2 MB). Peak memory consumption was 858.8 MB. Max. memory is 7.1 GB. [2018-09-19 06:04:09,386 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 737.08 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 121.93 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 261.71 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 769.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -861.7 MB). Peak memory consumption was 30.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3350.29 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: 108.4 MB). Peak memory consumption was 108.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 74829.92 ms. Allocated memory was 2.3 GB in the beginning and 3.5 GB in the end (delta: 1.2 GB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -360.2 MB). Peak memory consumption was 858.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 142]: 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 TRUE (((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0)) [L245] a1 = (((((a1 % 25)- -13) - 42605) / 5) - -8517) [L246] a10 = 3 [L248] RET return 26; [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 TRUE (((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14)) [L346] a1 = ((((a1 - 287698) - 189392) % 89)+ 206) [L347] a10 = 2 [L348] a19 = 7 [L350] RET return -1; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND 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 TRUE (((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7)) [L142] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNKNOWN Result, 74.7s OverallTime, 20 OverallIterations, 4 TraceHistogramMax, 51.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3592 SDtfs, 11585 SDslu, 5836 SDs, 0 SdLazy, 32037 SolverSat, 3229 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 41.5s Time, PredicateUnifierStatistics: 38 DeclaredPredicates, 4103 GetRequests, 3814 SyntacticMatches, 0 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5325occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 12.3s AbstIntTime, 20 AbstIntIterations, 19 AbstIntStrong, 0.9967418762641846 AbsIntWeakeningRatio, 0.11862695608278648 AbsIntAvgWeakeningVarsNumRemoved, 19.169863705199393 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 529 StatesRemovedByMinimization, 19 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_label23_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INT-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_06-04-09-399.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label23_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INT-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_06-04-09-399.csv Received shutdown request...