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_label53_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 06:04:54,441 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 06:04:54,443 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 06:04:54,460 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 06:04:54,460 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 06:04:54,462 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 06:04:54,464 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 06:04:54,467 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 06:04:54,470 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 06:04:54,471 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 06:04:54,479 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 06:04:54,480 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 06:04:54,481 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 06:04:54,484 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 06:04:54,485 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 06:04:54,486 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 06:04:54,489 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 06:04:54,491 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 06:04:54,495 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 06:04:54,497 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 06:04:54,501 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 06:04:54,503 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 06:04:54,508 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 06:04:54,508 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 06:04:54,508 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 06:04:54,509 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 06:04:54,511 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 06:04:54,512 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 06:04:54,513 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 06:04:54,514 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 06:04:54,514 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 06:04:54,515 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 06:04:54,515 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 06:04:54,515 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 06:04:54,518 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 06:04:54,520 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 06:04:54,520 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:04:54,546 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 06:04:54,547 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 06:04:54,548 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 06:04:54,548 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 06:04:54,548 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 06:04:54,548 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 06:04:54,548 INFO L133 SettingsManager]: * Congruence Domain=false [2018-09-19 06:04:54,549 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 06:04:54,549 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-19 06:04:54,549 INFO L133 SettingsManager]: * Abstract domain=IntervalDomain [2018-09-19 06:04:54,549 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 06:04:54,549 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 06:04:54,550 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 06:04:54,550 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 06:04:54,551 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 06:04:54,551 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 06:04:54,551 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 06:04:54,551 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 06:04:54,551 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 06:04:54,551 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 06:04:54,552 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 06:04:54,552 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 06:04:54,552 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 06:04:54,552 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 06:04:54,552 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 06:04:54,553 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 06:04:54,553 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 06:04:54,553 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 06:04:54,553 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 06:04:54,553 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 06:04:54,554 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 06:04:54,554 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 06:04:54,554 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 06:04:54,554 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 06:04:54,554 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 06:04:54,598 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 06:04:54,612 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 06:04:54,618 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 06:04:54,620 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 06:04:54,620 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 06:04:54,621 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label53_true-unreach-call.c [2018-09-19 06:04:55,009 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d1d69766/2a43c83e52d042e79cdbc190cafb5105/FLAG1ff8d4fea [2018-09-19 06:04:55,264 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 06:04:55,264 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label53_true-unreach-call.c [2018-09-19 06:04:55,277 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d1d69766/2a43c83e52d042e79cdbc190cafb5105/FLAG1ff8d4fea [2018-09-19 06:04:55,300 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d1d69766/2a43c83e52d042e79cdbc190cafb5105 [2018-09-19 06:04:55,314 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 06:04:55,319 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 06:04:55,322 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 06:04:55,322 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 06:04:55,330 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 06:04:55,331 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 06:04:55" (1/1) ... [2018-09-19 06:04:55,334 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c3139b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:04:55, skipping insertion in model container [2018-09-19 06:04:55,335 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 06:04:55" (1/1) ... [2018-09-19 06:04:55,347 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 06:04:55,848 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 06:04:55,869 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 06:04:55,999 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 06:04:56,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:04:56 WrapperNode [2018-09-19 06:04:56,058 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 06:04:56,059 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 06:04:56,059 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 06:04:56,059 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 06:04:56,069 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:04:56" (1/1) ... [2018-09-19 06:04:56,095 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:04:56" (1/1) ... [2018-09-19 06:04:56,152 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 06:04:56,152 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 06:04:56,152 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 06:04:56,152 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 06:04:56,300 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:04:56" (1/1) ... [2018-09-19 06:04:56,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:04:56" (1/1) ... [2018-09-19 06:04:56,308 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:04:56" (1/1) ... [2018-09-19 06:04:56,308 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:04:56" (1/1) ... [2018-09-19 06:04:56,334 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:04:56" (1/1) ... [2018-09-19 06:04:56,357 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:04:56" (1/1) ... [2018-09-19 06:04:56,366 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:04:56" (1/1) ... [2018-09-19 06:04:56,389 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 06:04:56,390 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 06:04:56,390 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 06:04:56,390 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 06:04:56,392 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:04:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 06:04:56,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 06:04:56,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 06:04:56,477 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 06:04:56,477 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 06:04:56,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 06:04:56,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 06:04:56,479 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 06:04:56,479 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 06:04:59,853 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 06:04:59,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 06:04:59 BoogieIcfgContainer [2018-09-19 06:04:59,854 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 06:04:59,855 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 06:04:59,855 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 06:04:59,859 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 06:04:59,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 06:04:55" (1/3) ... [2018-09-19 06:04:59,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@189a2dbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 06:04:59, skipping insertion in model container [2018-09-19 06:04:59,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:04:56" (2/3) ... [2018-09-19 06:04:59,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@189a2dbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 06:04:59, skipping insertion in model container [2018-09-19 06:04:59,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 06:04:59" (3/3) ... [2018-09-19 06:04:59,863 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label53_true-unreach-call.c [2018-09-19 06:04:59,873 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 06:04:59,882 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 06:04:59,937 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 06:04:59,938 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 06:04:59,938 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 06:04:59,939 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 06:04:59,939 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 06:04:59,939 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 06:04:59,939 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 06:04:59,939 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 06:04:59,940 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 06:04:59,967 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-19 06:04:59,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-09-19 06:04:59,979 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:04:59,980 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] [2018-09-19 06:04:59,981 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:04:59,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1566545735, now seen corresponding path program 1 times [2018-09-19 06:04:59,989 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:04:59,990 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 50 with the following transitions: [2018-09-19 06:04:59,993 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [293], [295], [796], [800], [806], [810], [817], [818], [819], [821] [2018-09-19 06:05:00,035 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:05:00,035 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:05:00,305 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:05:00,306 INFO L272 AbstractInterpreter]: Visited 48 different actions 48 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-19 06:05:00,355 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:05:00,524 INFO L232 lantSequenceWeakener]: Weakened 46 states. On average, predicates are now at 75.07% of their original sizes. [2018-09-19 06:05:00,524 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:05:00,772 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:05:00,774 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:05:00,775 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 06:05:00,775 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:05:00,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 06:05:00,790 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 06:05:00,791 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 06:05:00,794 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 6 states. [2018-09-19 06:05:03,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:05:03,818 INFO L93 Difference]: Finished difference Result 576 states and 995 transitions. [2018-09-19 06:05:03,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 06:05:03,820 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2018-09-19 06:05:03,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:05:03,839 INFO L225 Difference]: With dead ends: 576 [2018-09-19 06:05:03,839 INFO L226 Difference]: Without dead ends: 358 [2018-09-19 06:05:03,847 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 06:05:03,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-09-19 06:05:03,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-09-19 06:05:03,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-19 06:05:03,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2018-09-19 06:05:03,923 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 49 [2018-09-19 06:05:03,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:05:03,924 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2018-09-19 06:05:03,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 06:05:03,924 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2018-09-19 06:05:03,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-09-19 06:05:03,932 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:05:03,933 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:03,933 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:05:03,934 INFO L82 PathProgramCache]: Analyzing trace with hash 491983275, now seen corresponding path program 1 times [2018-09-19 06:05:03,934 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:05:03,934 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 121 with the following transitions: [2018-09-19 06:05:03,935 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], [293], [295], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:05:03,940 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:05:03,940 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:05:04,039 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:05:04,141 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:05:04,142 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:05:04,173 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:05:04,358 INFO L232 lantSequenceWeakener]: Weakened 117 states. On average, predicates are now at 73.73% of their original sizes. [2018-09-19 06:05:04,358 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:05:04,700 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:05:04,701 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:05:04,701 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:05:04,701 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:05:04,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:05:04,703 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:05:04,703 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:05:04,703 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand 10 states. [2018-09-19 06:05:07,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:05:07,642 INFO L93 Difference]: Finished difference Result 717 states and 1132 transitions. [2018-09-19 06:05:07,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 06:05:07,643 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 120 [2018-09-19 06:05:07,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:05:07,649 INFO L225 Difference]: With dead ends: 717 [2018-09-19 06:05:07,650 INFO L226 Difference]: Without dead ends: 511 [2018-09-19 06:05:07,654 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 126 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 06:05:07,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-09-19 06:05:07,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 505. [2018-09-19 06:05:07,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2018-09-19 06:05:07,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 669 transitions. [2018-09-19 06:05:07,688 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 669 transitions. Word has length 120 [2018-09-19 06:05:07,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:05:07,692 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 669 transitions. [2018-09-19 06:05:07,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:05:07,692 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 669 transitions. [2018-09-19 06:05:07,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-09-19 06:05:07,697 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:05:07,697 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:07,697 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:05:07,698 INFO L82 PathProgramCache]: Analyzing trace with hash -126115612, now seen corresponding path program 1 times [2018-09-19 06:05:07,698 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:05:07,698 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 130 with the following transitions: [2018-09-19 06:05:07,699 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], [293], [295], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:05:07,704 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:05:07,704 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:05:07,824 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:05:07,897 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:05:07,897 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:05:07,935 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:05:08,081 INFO L232 lantSequenceWeakener]: Weakened 126 states. On average, predicates are now at 73.66% of their original sizes. [2018-09-19 06:05:08,081 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:05:08,752 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:05:08,752 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:05:08,753 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:05:08,753 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:05:08,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:05:08,754 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:05:08,754 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:05:08,754 INFO L87 Difference]: Start difference. First operand 505 states and 669 transitions. Second operand 10 states. [2018-09-19 06:05:11,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:05:11,745 INFO L93 Difference]: Finished difference Result 1149 states and 1736 transitions. [2018-09-19 06:05:11,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:05:11,748 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 129 [2018-09-19 06:05:11,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:05:11,754 INFO L225 Difference]: With dead ends: 1149 [2018-09-19 06:05:11,755 INFO L226 Difference]: Without dead ends: 794 [2018-09-19 06:05:11,757 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 136 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:05:11,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2018-09-19 06:05:11,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 783. [2018-09-19 06:05:11,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2018-09-19 06:05:11,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1001 transitions. [2018-09-19 06:05:11,795 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1001 transitions. Word has length 129 [2018-09-19 06:05:11,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:05:11,796 INFO L480 AbstractCegarLoop]: Abstraction has 783 states and 1001 transitions. [2018-09-19 06:05:11,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:05:11,796 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1001 transitions. [2018-09-19 06:05:11,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-09-19 06:05:11,800 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:05:11,801 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:11,801 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:05:11,801 INFO L82 PathProgramCache]: Analyzing trace with hash -2004733972, now seen corresponding path program 1 times [2018-09-19 06:05:11,801 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:05:11,802 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 166 with the following transitions: [2018-09-19 06:05:11,802 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], [293], [295], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:05:11,807 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:05:11,807 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:05:11,886 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:05:12,021 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:05:12,021 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:05:12,067 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:05:12,229 INFO L232 lantSequenceWeakener]: Weakened 162 states. On average, predicates are now at 73.45% of their original sizes. [2018-09-19 06:05:12,229 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:05:12,412 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:05:12,413 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:05:12,413 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:05:12,413 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:05:12,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:05:12,415 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:05:12,415 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:05:12,416 INFO L87 Difference]: Start difference. First operand 783 states and 1001 transitions. Second operand 10 states. [2018-09-19 06:05:16,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:05:16,618 INFO L93 Difference]: Finished difference Result 1723 states and 2332 transitions. [2018-09-19 06:05:16,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 06:05:16,619 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 165 [2018-09-19 06:05:16,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:05:16,626 INFO L225 Difference]: With dead ends: 1723 [2018-09-19 06:05:16,626 INFO L226 Difference]: Without dead ends: 1090 [2018-09-19 06:05:16,628 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 171 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 06:05:16,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2018-09-19 06:05:16,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1081. [2018-09-19 06:05:16,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1081 states. [2018-09-19 06:05:16,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1351 transitions. [2018-09-19 06:05:16,659 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1351 transitions. Word has length 165 [2018-09-19 06:05:16,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:05:16,660 INFO L480 AbstractCegarLoop]: Abstraction has 1081 states and 1351 transitions. [2018-09-19 06:05:16,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:05:16,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1351 transitions. [2018-09-19 06:05:16,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-09-19 06:05:16,664 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:05:16,664 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:16,665 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:05:16,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1107798485, now seen corresponding path program 1 times [2018-09-19 06:05:16,665 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:05:16,665 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 185 with the following transitions: [2018-09-19 06:05:16,666 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], [293], [295], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [754], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:05:16,671 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:05:16,671 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:05:16,846 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:05:16,846 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:05:16,888 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:05:17,018 INFO L232 lantSequenceWeakener]: Weakened 181 states. On average, predicates are now at 73.37% of their original sizes. [2018-09-19 06:05:17,018 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:05:17,248 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:05:17,248 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:05:17,248 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:05:17,248 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:05:17,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:05:17,249 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:05:17,249 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:05:17,250 INFO L87 Difference]: Start difference. First operand 1081 states and 1351 transitions. Second operand 10 states. [2018-09-19 06:05:19,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:05:19,674 INFO L93 Difference]: Finished difference Result 2464 states and 3201 transitions. [2018-09-19 06:05:19,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 06:05:19,676 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 184 [2018-09-19 06:05:19,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:05:19,684 INFO L225 Difference]: With dead ends: 2464 [2018-09-19 06:05:19,684 INFO L226 Difference]: Without dead ends: 1533 [2018-09-19 06:05:19,687 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 190 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 06:05:19,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2018-09-19 06:05:19,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1521. [2018-09-19 06:05:19,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1521 states. [2018-09-19 06:05:19,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 1842 transitions. [2018-09-19 06:05:19,727 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 1842 transitions. Word has length 184 [2018-09-19 06:05:19,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:05:19,727 INFO L480 AbstractCegarLoop]: Abstraction has 1521 states and 1842 transitions. [2018-09-19 06:05:19,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:05:19,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 1842 transitions. [2018-09-19 06:05:19,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-09-19 06:05:19,731 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:05:19,731 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, 2, 2, 2, 2, 2, 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:05:19,732 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:05:19,732 INFO L82 PathProgramCache]: Analyzing trace with hash -2054425074, now seen corresponding path program 1 times [2018-09-19 06:05:19,732 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:05:19,733 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 197 with the following transitions: [2018-09-19 06:05:19,733 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], [293], [295], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [518], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:05:19,736 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:05:19,736 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:05:19,763 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:05:19,827 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:05:19,827 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:05:19,837 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:05:19,948 INFO L232 lantSequenceWeakener]: Weakened 193 states. On average, predicates are now at 73.38% of their original sizes. [2018-09-19 06:05:19,948 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:05:20,064 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:05:20,064 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:05:20,065 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:05:20,065 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:05:20,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:05:20,065 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:05:20,066 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:05:20,066 INFO L87 Difference]: Start difference. First operand 1521 states and 1842 transitions. Second operand 10 states. [2018-09-19 06:05:21,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:05:21,974 INFO L93 Difference]: Finished difference Result 3061 states and 3845 transitions. [2018-09-19 06:05:21,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:05:21,976 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 196 [2018-09-19 06:05:21,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:05:21,984 INFO L225 Difference]: With dead ends: 3061 [2018-09-19 06:05:21,985 INFO L226 Difference]: Without dead ends: 1690 [2018-09-19 06:05:21,989 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 203 GetRequests, 187 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:05:21,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2018-09-19 06:05:22,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1672. [2018-09-19 06:05:22,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2018-09-19 06:05:22,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2020 transitions. [2018-09-19 06:05:22,109 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2020 transitions. Word has length 196 [2018-09-19 06:05:22,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:05:22,110 INFO L480 AbstractCegarLoop]: Abstraction has 1672 states and 2020 transitions. [2018-09-19 06:05:22,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:05:22,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2020 transitions. [2018-09-19 06:05:22,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-09-19 06:05:22,114 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:05:22,114 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, 2, 2, 2, 2, 2, 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:05:22,115 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:05:22,116 INFO L82 PathProgramCache]: Analyzing trace with hash -929015310, now seen corresponding path program 1 times [2018-09-19 06:05:22,116 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:05:22,116 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 199 with the following transitions: [2018-09-19 06:05:22,116 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], [293], [295], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [526], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:05:22,120 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:05:22,121 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:05:22,147 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:05:22,237 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:05:22,237 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:05:22,280 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:05:22,398 INFO L232 lantSequenceWeakener]: Weakened 195 states. On average, predicates are now at 73.37% of their original sizes. [2018-09-19 06:05:22,399 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:05:22,663 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:05:22,663 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:05:22,663 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:05:22,663 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:05:22,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:05:22,664 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:05:22,664 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:05:22,665 INFO L87 Difference]: Start difference. First operand 1672 states and 2020 transitions. Second operand 10 states. [2018-09-19 06:05:25,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:05:25,005 INFO L93 Difference]: Finished difference Result 3362 states and 4211 transitions. [2018-09-19 06:05:25,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:05:25,011 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 198 [2018-09-19 06:05:25,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:05:25,021 INFO L225 Difference]: With dead ends: 3362 [2018-09-19 06:05:25,021 INFO L226 Difference]: Without dead ends: 1840 [2018-09-19 06:05:25,026 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 205 GetRequests, 189 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:05:25,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2018-09-19 06:05:25,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 1823. [2018-09-19 06:05:25,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1823 states. [2018-09-19 06:05:25,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1823 states to 1823 states and 2218 transitions. [2018-09-19 06:05:25,073 INFO L78 Accepts]: Start accepts. Automaton has 1823 states and 2218 transitions. Word has length 198 [2018-09-19 06:05:25,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:05:25,074 INFO L480 AbstractCegarLoop]: Abstraction has 1823 states and 2218 transitions. [2018-09-19 06:05:25,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:05:25,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1823 states and 2218 transitions. [2018-09-19 06:05:25,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-09-19 06:05:25,078 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:05:25,078 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, 2, 2, 2, 2, 2, 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:05:25,079 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:05:25,079 INFO L82 PathProgramCache]: Analyzing trace with hash 784968122, now seen corresponding path program 1 times [2018-09-19 06:05:25,079 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:05:25,079 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 203 with the following transitions: [2018-09-19 06:05:25,080 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], [293], [295], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [542], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:05:25,081 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:05:25,082 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:05:25,107 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:05:25,183 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:05:25,184 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:05:25,189 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:05:25,294 INFO L232 lantSequenceWeakener]: Weakened 199 states. On average, predicates are now at 73.36% of their original sizes. [2018-09-19 06:05:25,294 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:05:25,376 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:05:25,377 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:05:25,377 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:05:25,377 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:05:25,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:05:25,378 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:05:25,378 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:05:25,378 INFO L87 Difference]: Start difference. First operand 1823 states and 2218 transitions. Second operand 10 states. [2018-09-19 06:05:28,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:05:28,050 INFO L93 Difference]: Finished difference Result 3819 states and 4796 transitions. [2018-09-19 06:05:28,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:05:28,052 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 202 [2018-09-19 06:05:28,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:05:28,063 INFO L225 Difference]: With dead ends: 3819 [2018-09-19 06:05:28,063 INFO L226 Difference]: Without dead ends: 2146 [2018-09-19 06:05:28,068 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 209 GetRequests, 193 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:05:28,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2146 states. [2018-09-19 06:05:28,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2146 to 2123. [2018-09-19 06:05:28,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2123 states. [2018-09-19 06:05:28,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2123 states to 2123 states and 2596 transitions. [2018-09-19 06:05:28,130 INFO L78 Accepts]: Start accepts. Automaton has 2123 states and 2596 transitions. Word has length 202 [2018-09-19 06:05:28,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:05:28,130 INFO L480 AbstractCegarLoop]: Abstraction has 2123 states and 2596 transitions. [2018-09-19 06:05:28,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:05:28,131 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 2596 transitions. [2018-09-19 06:05:28,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-09-19 06:05:28,135 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:05:28,135 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, 2, 2, 2, 2, 2, 2, 2, 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:05:28,135 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:05:28,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1772945412, now seen corresponding path program 1 times [2018-09-19 06:05:28,136 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:05:28,136 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 203 with the following transitions: [2018-09-19 06:05:28,136 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], [293], [295], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:05:28,138 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:05:28,138 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:05:28,169 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:05:28,244 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:05:28,245 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:05:28,282 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:05:28,411 INFO L232 lantSequenceWeakener]: Weakened 199 states. On average, predicates are now at 73.36% of their original sizes. [2018-09-19 06:05:28,412 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:05:28,652 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:05:28,652 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:05:28,652 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:05:28,652 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:05:28,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:05:28,654 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:05:28,654 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:05:28,654 INFO L87 Difference]: Start difference. First operand 2123 states and 2596 transitions. Second operand 10 states. [2018-09-19 06:05:30,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:05:30,883 INFO L93 Difference]: Finished difference Result 4418 states and 5553 transitions. [2018-09-19 06:05:30,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:05:30,886 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 202 [2018-09-19 06:05:30,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:05:30,895 INFO L225 Difference]: With dead ends: 4418 [2018-09-19 06:05:30,895 INFO L226 Difference]: Without dead ends: 2445 [2018-09-19 06:05:30,900 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 209 GetRequests, 193 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:05:30,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2445 states. [2018-09-19 06:05:30,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2445 to 2411. [2018-09-19 06:05:30,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2411 states. [2018-09-19 06:05:30,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 2974 transitions. [2018-09-19 06:05:30,956 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 2974 transitions. Word has length 202 [2018-09-19 06:05:30,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:05:30,957 INFO L480 AbstractCegarLoop]: Abstraction has 2411 states and 2974 transitions. [2018-09-19 06:05:30,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:05:30,957 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 2974 transitions. [2018-09-19 06:05:30,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-09-19 06:05:30,961 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:05:30,962 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, 2, 2, 2, 2, 2, 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:05:30,962 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:05:30,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1761539430, now seen corresponding path program 1 times [2018-09-19 06:05:30,962 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:05:30,963 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 209 with the following transitions: [2018-09-19 06:05:30,963 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], [293], [295], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:05:30,965 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:05:30,965 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:05:30,989 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:05:33,405 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:05:33,405 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:05:33,412 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:05:33,961 INFO L232 lantSequenceWeakener]: Weakened 205 states. On average, predicates are now at 73.34% of their original sizes. [2018-09-19 06:05:33,962 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:05:34,054 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:05:34,054 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:05:34,054 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:05:34,055 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:05:34,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:05:34,055 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:05:34,055 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:05:34,056 INFO L87 Difference]: Start difference. First operand 2411 states and 2974 transitions. Second operand 10 states. [2018-09-19 06:05:35,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:05:35,943 INFO L93 Difference]: Finished difference Result 4850 states and 6141 transitions. [2018-09-19 06:05:35,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:05:35,945 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 208 [2018-09-19 06:05:35,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:05:35,954 INFO L225 Difference]: With dead ends: 4850 [2018-09-19 06:05:35,955 INFO L226 Difference]: Without dead ends: 2589 [2018-09-19 06:05:35,961 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 215 GetRequests, 199 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:05:35,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2589 states. [2018-09-19 06:05:36,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2589 to 2566. [2018-09-19 06:05:36,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2566 states. [2018-09-19 06:05:36,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2566 states to 2566 states and 3192 transitions. [2018-09-19 06:05:36,015 INFO L78 Accepts]: Start accepts. Automaton has 2566 states and 3192 transitions. Word has length 208 [2018-09-19 06:05:36,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:05:36,016 INFO L480 AbstractCegarLoop]: Abstraction has 2566 states and 3192 transitions. [2018-09-19 06:05:36,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:05:36,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 3192 transitions. [2018-09-19 06:05:36,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-09-19 06:05:36,021 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:05:36,021 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, 2, 2, 2, 2, 2, 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:05:36,021 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:05:36,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1506756301, now seen corresponding path program 1 times [2018-09-19 06:05:36,022 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:05:36,022 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 218 with the following transitions: [2018-09-19 06:05:36,022 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], [293], [295], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [602], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:05:36,025 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:05:36,025 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:05:36,048 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:05:36,683 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:05:36,683 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:05:36,720 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:05:36,930 INFO L232 lantSequenceWeakener]: Weakened 214 states. On average, predicates are now at 73.32% of their original sizes. [2018-09-19 06:05:36,930 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:05:37,019 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:05:37,019 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:05:37,019 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:05:37,020 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:05:37,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:05:37,020 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:05:37,020 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:05:37,021 INFO L87 Difference]: Start difference. First operand 2566 states and 3192 transitions. Second operand 10 states. [2018-09-19 06:05:38,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:05:38,690 INFO L93 Difference]: Finished difference Result 5163 states and 6584 transitions. [2018-09-19 06:05:38,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:05:38,698 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 217 [2018-09-19 06:05:38,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:05:38,708 INFO L225 Difference]: With dead ends: 5163 [2018-09-19 06:05:38,708 INFO L226 Difference]: Without dead ends: 2747 [2018-09-19 06:05:38,714 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 224 GetRequests, 208 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:05:38,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2747 states. [2018-09-19 06:05:38,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2747 to 2721. [2018-09-19 06:05:38,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2721 states. [2018-09-19 06:05:38,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2721 states to 2721 states and 3412 transitions. [2018-09-19 06:05:38,777 INFO L78 Accepts]: Start accepts. Automaton has 2721 states and 3412 transitions. Word has length 217 [2018-09-19 06:05:38,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:05:38,778 INFO L480 AbstractCegarLoop]: Abstraction has 2721 states and 3412 transitions. [2018-09-19 06:05:38,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:05:38,778 INFO L276 IsEmpty]: Start isEmpty. Operand 2721 states and 3412 transitions. [2018-09-19 06:05:38,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-09-19 06:05:38,785 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:05:38,785 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, 2, 2, 2, 2, 2, 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:05:38,785 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:05:38,786 INFO L82 PathProgramCache]: Analyzing trace with hash -885895495, now seen corresponding path program 1 times [2018-09-19 06:05:38,786 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:05:38,786 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 224 with the following transitions: [2018-09-19 06:05:38,786 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], [293], [295], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [626], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:05:38,788 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:05:38,789 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:05:38,813 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:05:38,942 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:05:38,942 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:05:38,948 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:05:39,104 INFO L232 lantSequenceWeakener]: Weakened 220 states. On average, predicates are now at 73.3% of their original sizes. [2018-09-19 06:05:39,104 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:05:39,187 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:05:39,187 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:05:39,187 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:05:39,187 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:05:39,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:05:39,188 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:05:39,188 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:05:39,188 INFO L87 Difference]: Start difference. First operand 2721 states and 3412 transitions. Second operand 10 states. [2018-09-19 06:05:41,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:05:41,567 INFO L93 Difference]: Finished difference Result 5472 states and 7022 transitions. [2018-09-19 06:05:41,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:05:41,568 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 223 [2018-09-19 06:05:41,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:05:41,579 INFO L225 Difference]: With dead ends: 5472 [2018-09-19 06:05:41,579 INFO L226 Difference]: Without dead ends: 2901 [2018-09-19 06:05:41,584 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 230 GetRequests, 214 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:05:41,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2018-09-19 06:05:41,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 2876. [2018-09-19 06:05:41,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2876 states. [2018-09-19 06:05:41,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2876 states to 2876 states and 3624 transitions. [2018-09-19 06:05:41,645 INFO L78 Accepts]: Start accepts. Automaton has 2876 states and 3624 transitions. Word has length 223 [2018-09-19 06:05:41,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:05:41,645 INFO L480 AbstractCegarLoop]: Abstraction has 2876 states and 3624 transitions. [2018-09-19 06:05:41,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:05:41,646 INFO L276 IsEmpty]: Start isEmpty. Operand 2876 states and 3624 transitions. [2018-09-19 06:05:41,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-09-19 06:05:41,654 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:05:41,654 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, 2, 2, 2, 2, 2, 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:05:41,654 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:05:41,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1899407310, now seen corresponding path program 1 times [2018-09-19 06:05:41,655 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:05:41,655 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 231 with the following transitions: [2018-09-19 06:05:41,655 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], [293], [295], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:05:41,660 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:05:41,660 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:05:41,684 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:05:41,819 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:05:41,820 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:05:41,839 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:05:41,969 INFO L232 lantSequenceWeakener]: Weakened 227 states. On average, predicates are now at 73.28% of their original sizes. [2018-09-19 06:05:41,970 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:05:42,080 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:05:42,080 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:05:42,080 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:05:42,080 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:05:42,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:05:42,081 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:05:42,081 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:05:42,082 INFO L87 Difference]: Start difference. First operand 2876 states and 3624 transitions. Second operand 10 states. [2018-09-19 06:05:44,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:05:44,812 INFO L93 Difference]: Finished difference Result 5959 states and 7691 transitions. [2018-09-19 06:05:44,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:05:44,812 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 230 [2018-09-19 06:05:44,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:05:44,822 INFO L225 Difference]: With dead ends: 5959 [2018-09-19 06:05:44,823 INFO L226 Difference]: Without dead ends: 3233 [2018-09-19 06:05:44,827 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 237 GetRequests, 221 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:05:44,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3233 states. [2018-09-19 06:05:44,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3233 to 3184. [2018-09-19 06:05:44,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3184 states. [2018-09-19 06:05:44,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3184 states to 3184 states and 4030 transitions. [2018-09-19 06:05:44,891 INFO L78 Accepts]: Start accepts. Automaton has 3184 states and 4030 transitions. Word has length 230 [2018-09-19 06:05:44,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:05:44,892 INFO L480 AbstractCegarLoop]: Abstraction has 3184 states and 4030 transitions. [2018-09-19 06:05:44,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:05:44,892 INFO L276 IsEmpty]: Start isEmpty. Operand 3184 states and 4030 transitions. [2018-09-19 06:05:44,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-09-19 06:05:44,899 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:05:44,900 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, 2, 2, 2, 2, 2, 2, 2, 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:05:44,900 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:05:44,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1625875972, now seen corresponding path program 1 times [2018-09-19 06:05:44,900 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:05:44,901 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 239 with the following transitions: [2018-09-19 06:05:44,901 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], [293], [295], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [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:05:44,903 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:05:44,903 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:05:44,952 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:05:45,122 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:05:45,122 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:05:45,161 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:05:45,325 INFO L232 lantSequenceWeakener]: Weakened 235 states. On average, predicates are now at 73.26% of their original sizes. [2018-09-19 06:05:45,325 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:05:45,991 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:05:45,991 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:05:45,991 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:05:45,991 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:05:45,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:05:45,992 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:05:45,992 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:05:45,992 INFO L87 Difference]: Start difference. First operand 3184 states and 4030 transitions. Second operand 10 states. [2018-09-19 06:05:48,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:05:48,894 INFO L93 Difference]: Finished difference Result 6547 states and 8487 transitions. [2018-09-19 06:05:48,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:05:48,902 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 238 [2018-09-19 06:05:48,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:05:48,912 INFO L225 Difference]: With dead ends: 6547 [2018-09-19 06:05:48,912 INFO L226 Difference]: Without dead ends: 3513 [2018-09-19 06:05:48,918 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 245 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:05:48,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3513 states. [2018-09-19 06:05:48,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3513 to 3486. [2018-09-19 06:05:48,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3486 states. [2018-09-19 06:05:48,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3486 states to 3486 states and 4452 transitions. [2018-09-19 06:05:48,982 INFO L78 Accepts]: Start accepts. Automaton has 3486 states and 4452 transitions. Word has length 238 [2018-09-19 06:05:48,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:05:48,983 INFO L480 AbstractCegarLoop]: Abstraction has 3486 states and 4452 transitions. [2018-09-19 06:05:48,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:05:48,983 INFO L276 IsEmpty]: Start isEmpty. Operand 3486 states and 4452 transitions. [2018-09-19 06:05:48,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-09-19 06:05:48,989 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:05:48,990 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, 2, 2, 2, 2, 2, 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:05:48,990 INFO L423 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:05:48,990 INFO L82 PathProgramCache]: Analyzing trace with hash 40920970, now seen corresponding path program 1 times [2018-09-19 06:05:48,991 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:05:48,991 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 243 with the following transitions: [2018-09-19 06:05:48,991 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], [293], [295], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [702], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:05:48,993 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:05:48,994 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:05:49,017 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:05:49,222 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:05:49,223 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:05:49,261 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:05:49,401 INFO L232 lantSequenceWeakener]: Weakened 239 states. On average, predicates are now at 73.26% of their original sizes. [2018-09-19 06:05:49,402 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:05:49,477 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:05:49,477 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:05:49,477 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:05:49,477 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:05:49,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:05:49,478 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:05:49,478 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:05:49,478 INFO L87 Difference]: Start difference. First operand 3486 states and 4452 transitions. Second operand 10 states. [2018-09-19 06:05:51,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:05:51,901 INFO L93 Difference]: Finished difference Result 7025 states and 9137 transitions. [2018-09-19 06:05:51,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:05:51,910 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 242 [2018-09-19 06:05:51,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:05:51,921 INFO L225 Difference]: With dead ends: 7025 [2018-09-19 06:05:51,921 INFO L226 Difference]: Without dead ends: 3689 [2018-09-19 06:05:51,927 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 249 GetRequests, 233 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:05:51,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3689 states. [2018-09-19 06:05:51,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3689 to 3649. [2018-09-19 06:05:51,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3649 states. [2018-09-19 06:05:51,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3649 states to 3649 states and 4696 transitions. [2018-09-19 06:05:51,988 INFO L78 Accepts]: Start accepts. Automaton has 3649 states and 4696 transitions. Word has length 242 [2018-09-19 06:05:51,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:05:51,989 INFO L480 AbstractCegarLoop]: Abstraction has 3649 states and 4696 transitions. [2018-09-19 06:05:51,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:05:51,989 INFO L276 IsEmpty]: Start isEmpty. Operand 3649 states and 4696 transitions. [2018-09-19 06:05:51,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-09-19 06:05:51,997 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:05:51,998 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:51,998 INFO L423 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:05:51,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1596847203, now seen corresponding path program 1 times [2018-09-19 06:05:51,998 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:05:51,999 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 258 with the following transitions: [2018-09-19 06:05:51,999 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], [293], [295], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [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:05:52,002 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:05:52,002 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:05:52,025 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:05:52,217 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:05:52,217 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:05:52,253 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:05:52,425 INFO L232 lantSequenceWeakener]: Weakened 254 states. On average, predicates are now at 73.22% of their original sizes. [2018-09-19 06:05:52,425 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:05:52,790 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:05:52,791 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:05:52,791 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:05:52,791 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:05:52,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:05:52,792 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:05:52,792 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:05:52,792 INFO L87 Difference]: Start difference. First operand 3649 states and 4696 transitions. Second operand 10 states. [2018-09-19 06:05:54,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:05:54,506 INFO L93 Difference]: Finished difference Result 7322 states and 9594 transitions. [2018-09-19 06:05:54,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:05:54,515 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 257 [2018-09-19 06:05:54,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:05:54,533 INFO L225 Difference]: With dead ends: 7322 [2018-09-19 06:05:54,534 INFO L226 Difference]: Without dead ends: 3823 [2018-09-19 06:05:54,540 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 264 GetRequests, 248 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:05:54,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3823 states. [2018-09-19 06:05:54,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3823 to 3806. [2018-09-19 06:05:54,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3806 states. [2018-09-19 06:05:54,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3806 states to 3806 states and 4906 transitions. [2018-09-19 06:05:54,605 INFO L78 Accepts]: Start accepts. Automaton has 3806 states and 4906 transitions. Word has length 257 [2018-09-19 06:05:54,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:05:54,605 INFO L480 AbstractCegarLoop]: Abstraction has 3806 states and 4906 transitions. [2018-09-19 06:05:54,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:05:54,605 INFO L276 IsEmpty]: Start isEmpty. Operand 3806 states and 4906 transitions. [2018-09-19 06:05:54,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-09-19 06:05:54,613 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:05:54,613 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:05:54,614 INFO L423 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:05:54,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1475788267, now seen corresponding path program 1 times [2018-09-19 06:05:54,614 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:05:54,614 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 272 with the following transitions: [2018-09-19 06:05:54,615 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], [293], [295], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [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:05:54,619 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:05:54,619 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:05:54,646 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:05:54,865 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-19 06:05:54,865 INFO L272 AbstractInterpreter]: Visited 151 different actions 588 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:05:54,903 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 06:05:54,952 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 06:05:54,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 06:05:54 BoogieIcfgContainer [2018-09-19 06:05:54,953 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 06:05:54,954 INFO L168 Benchmark]: Toolchain (without parser) took 59638.89 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -872.9 MB). Peak memory consumption was 792.3 MB. Max. memory is 7.1 GB. [2018-09-19 06:05:54,956 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:05:54,956 INFO L168 Benchmark]: CACSL2BoogieTranslator took 736.58 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:05:54,961 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.23 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:05:54,962 INFO L168 Benchmark]: Boogie Preprocessor took 237.47 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 777.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -868.6 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. [2018-09-19 06:05:54,962 INFO L168 Benchmark]: RCFGBuilder took 3464.44 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: 107.3 MB). Peak memory consumption was 107.3 MB. Max. memory is 7.1 GB. [2018-09-19 06:05:54,963 INFO L168 Benchmark]: TraceAbstraction took 55097.63 ms. Allocated memory was 2.3 GB in the beginning and 3.2 GB in the end (delta: 888.1 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -164.5 MB). Peak memory consumption was 723.7 MB. Max. memory is 7.1 GB. [2018-09-19 06:05:54,973 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 736.58 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 93.23 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 237.47 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 777.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -868.6 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3464.44 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: 107.3 MB). Peak memory consumption was 107.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 55097.63 ms. Allocated memory was 2.3 GB in the beginning and 3.2 GB in the end (delta: 888.1 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -164.5 MB). Peak memory consumption was 723.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 130]: 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 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 TRUE (((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0)) [L255] a1 = (((a1 / 5) + 110755) + 220746) [L256] a10 = 1 [L257] a19 = 8 [L259] 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, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L425] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) [L430] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) [L436] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) [L442] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) [L448] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) [L454] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) [L460] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0))))) [L465] COND FALSE !(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14))))) [L471] COND FALSE !(( 218 < a1 && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))) [L476] COND FALSE !((((a12==0) && ((a19==9) && (((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3))) [L481] COND FALSE !((((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10))) [L487] COND FALSE !((((a19==10) && ((a10==1) && ((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (input == 5))))) && (a4==14))) [L493] COND FALSE !(((((a10==1) && (((input == 5) && 218 < a1 ) && (a4==14))) && (a19==10)) && (a12==0))) [L499] COND FALSE !((((a4==14) && ((a19==9) && ((input == 2) && (((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 ))))) && (a12==0))) [L504] COND FALSE !((((a4==14) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 2))) && (a12==0))) && (a10==4))) [L509] COND FALSE !(((a4==14) && (((a19==9) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 6)) && (a10==3))) && (a12==0)))) [L514] COND FALSE !((((a4==14) && ((((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a12==0))) && (a10==0))) [L517] COND FALSE !(((a12==0) && ((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 2)) && (a19==10))))) [L523] COND FALSE !((((a12==0) && ((a19==9) && ((a10==2) && ((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))))) && (a4==14))) [L526] COND FALSE !(((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)))))) [L529] COND FALSE !(((a19==9) && (((a10==1) && ((a12==0) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a4==14)))) [L534] COND FALSE !(((a19==9) && ((a4==14) && ((a10==1) && (((input == 5) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a12==0)))))) [L540] COND FALSE !(((a12==0) && (((((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a19==9)) && (a4==14)) && (a10==0)))) [L545] COND FALSE !(((a4==14) && (((a12==0) && ((a19==9) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a10==4)))) [L548] COND FALSE !(((((( ((38 < a1) && (218 >= a1)) && (input == 3)) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10))) [L554] COND FALSE !((((a4==14) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 4)) && (a12==0)) && (a19==9))) && (a10==2))) [L557] COND TRUE ((a12==0) && ((( 218 < a1 && ((a19==9) && (input == 5))) && (a10==1)) && (a4==14))) [L558] a1 = ((((a1 * 9)/ 10) + 58620) - 603783) [L559] a10 = 4 [L560] a19 = 8 [L562] 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 TRUE (((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)) [L130] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNKNOWN Result, 55.0s OverallTime, 17 OverallIterations, 3 TraceHistogramMax, 40.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3092 SDtfs, 10164 SDslu, 4420 SDs, 0 SdLazy, 25096 SolverSat, 2535 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 33.0s Time, PredicateUnifierStatistics: 32 DeclaredPredicates, 3161 GetRequests, 2920 SyntacticMatches, 0 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3806occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 6.4s AbstIntTime, 17 AbstIntIterations, 16 AbstIntStrong, 0.9966649873008776 AbsIntWeakeningRatio, 0.12483574244415244 AbsIntAvgWeakeningVarsNumRemoved, 19.12516425755585 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 16 MinimizatonAttempts, 339 StatesRemovedByMinimization, 16 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_label53_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INT-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_06-05-54-999.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label53_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INT-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_06-05-54-999.csv Received shutdown request...