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_INTCON-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label17_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 12:40:04,667 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 12:40:04,671 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 12:40:04,686 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 12:40:04,687 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 12:40:04,688 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 12:40:04,690 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 12:40:04,692 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 12:40:04,694 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 12:40:04,696 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 12:40:04,697 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 12:40:04,697 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 12:40:04,699 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 12:40:04,706 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 12:40:04,708 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 12:40:04,709 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 12:40:04,713 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 12:40:04,717 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 12:40:04,719 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 12:40:04,720 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 12:40:04,724 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 12:40:04,725 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 12:40:04,728 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 12:40:04,729 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 12:40:04,729 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 12:40:04,730 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 12:40:04,731 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 12:40:04,732 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 12:40:04,733 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 12:40:04,734 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 12:40:04,734 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 12:40:04,736 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 12:40:04,737 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 12:40:04,737 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 12:40:04,738 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 12:40:04,739 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 12:40:04,740 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf [2018-09-19 12:40:04,761 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 12:40:04,762 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 12:40:04,762 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 12:40:04,763 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 12:40:04,763 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 12:40:04,763 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 12:40:04,763 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 12:40:04,763 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-19 12:40:04,764 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-19 12:40:04,764 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 12:40:04,764 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 12:40:04,764 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 12:40:04,765 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 12:40:04,765 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 12:40:04,765 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 12:40:04,765 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 12:40:04,765 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 12:40:04,766 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 12:40:04,766 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 12:40:04,766 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 12:40:04,766 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 12:40:04,766 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 12:40:04,767 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 12:40:04,767 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 12:40:04,767 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 12:40:04,767 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 12:40:04,767 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 12:40:04,768 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 12:40:04,768 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 12:40:04,768 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 12:40:04,768 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 12:40:04,768 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 12:40:04,768 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 12:40:04,769 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 12:40:04,818 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 12:40:04,832 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 12:40:04,835 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 12:40:04,839 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 12:40:04,840 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 12:40:04,841 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label17_true-unreach-call.c [2018-09-19 12:40:05,184 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c898b6c3b/f8823bca4d064918b0a719e3f2aae12b/FLAG8d134cd14 [2018-09-19 12:40:05,455 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 12:40:05,456 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label17_true-unreach-call.c [2018-09-19 12:40:05,473 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c898b6c3b/f8823bca4d064918b0a719e3f2aae12b/FLAG8d134cd14 [2018-09-19 12:40:05,496 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c898b6c3b/f8823bca4d064918b0a719e3f2aae12b [2018-09-19 12:40:05,508 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 12:40:05,512 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 12:40:05,513 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 12:40:05,513 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 12:40:05,520 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 12:40:05,521 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 12:40:05" (1/1) ... [2018-09-19 12:40:05,524 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a77e263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:40:05, skipping insertion in model container [2018-09-19 12:40:05,524 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 12:40:05" (1/1) ... [2018-09-19 12:40:05,536 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 12:40:06,039 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 12:40:06,059 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 12:40:06,231 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 12:40:06,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:40:06 WrapperNode [2018-09-19 12:40:06,290 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 12:40:06,291 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 12:40:06,291 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 12:40:06,292 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 12:40:06,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:40:06" (1/1) ... [2018-09-19 12:40:06,334 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:40:06" (1/1) ... [2018-09-19 12:40:06,421 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 12:40:06,421 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 12:40:06,422 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 12:40:06,422 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 12:40:06,432 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:40:06" (1/1) ... [2018-09-19 12:40:06,433 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:40:06" (1/1) ... [2018-09-19 12:40:06,441 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:40:06" (1/1) ... [2018-09-19 12:40:06,442 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:40:06" (1/1) ... [2018-09-19 12:40:06,625 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:40:06" (1/1) ... [2018-09-19 12:40:06,648 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:40:06" (1/1) ... [2018-09-19 12:40:06,656 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:40:06" (1/1) ... [2018-09-19 12:40:06,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 12:40:06,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 12:40:06,665 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 12:40:06,666 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 12:40:06,667 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:40:06" (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 12:40:06,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 12:40:06,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 12:40:06,737 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 12:40:06,737 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 12:40:06,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 12:40:06,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 12:40:06,738 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 12:40:06,738 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 12:40:09,762 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 12:40:09,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 12:40:09 BoogieIcfgContainer [2018-09-19 12:40:09,763 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 12:40:09,764 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 12:40:09,764 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 12:40:09,768 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 12:40:09,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 12:40:05" (1/3) ... [2018-09-19 12:40:09,769 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5afe8c46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 12:40:09, skipping insertion in model container [2018-09-19 12:40:09,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:40:06" (2/3) ... [2018-09-19 12:40:09,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5afe8c46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 12:40:09, skipping insertion in model container [2018-09-19 12:40:09,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 12:40:09" (3/3) ... [2018-09-19 12:40:09,773 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label17_true-unreach-call.c [2018-09-19 12:40:09,782 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 12:40:09,789 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 12:40:09,837 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 12:40:09,838 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 12:40:09,838 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 12:40:09,838 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 12:40:09,838 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 12:40:09,839 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 12:40:09,839 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 12:40:09,839 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 12:40:09,839 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 12:40:09,875 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-19 12:40:09,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-09-19 12:40:09,883 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:40:09,884 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] [2018-09-19 12:40:09,887 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:40:09,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1893194825, now seen corresponding path program 1 times [2018-09-19 12:40:09,894 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:40:09,895 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-09-19 12:40:09,897 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], [197], [199], [796], [800], [806], [810], [817], [818], [819], [821] [2018-09-19 12:40:09,936 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:40:09,937 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:40:10,216 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:40:10,218 INFO L272 AbstractInterpreter]: Visited 36 different actions 36 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-19 12:40:10,275 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:40:10,417 INFO L232 lantSequenceWeakener]: Weakened 34 states. On average, predicates are now at 74.3% of their original sizes. [2018-09-19 12:40:10,418 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:40:10,662 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:40:10,664 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:40:10,665 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 12:40:10,665 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:40:10,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 12:40:10,679 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 12:40:10,680 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 12:40:10,682 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 6 states. [2018-09-19 12:40:13,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:40:13,966 INFO L93 Difference]: Finished difference Result 576 states and 995 transitions. [2018-09-19 12:40:13,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 12:40:13,968 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-09-19 12:40:13,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:40:13,986 INFO L225 Difference]: With dead ends: 576 [2018-09-19 12:40:13,986 INFO L226 Difference]: Without dead ends: 358 [2018-09-19 12:40:13,993 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 36 GetRequests, 32 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 12:40:14,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-09-19 12:40:14,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-09-19 12:40:14,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-19 12:40:14,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2018-09-19 12:40:14,066 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 37 [2018-09-19 12:40:14,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:40:14,067 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2018-09-19 12:40:14,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 12:40:14,067 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2018-09-19 12:40:14,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-19 12:40:14,073 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:40:14,073 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:40:14,074 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:40:14,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1004761221, now seen corresponding path program 1 times [2018-09-19 12:40:14,074 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:40:14,075 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 109 with the following transitions: [2018-09-19 12:40:14,075 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], [197], [199], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:40:14,081 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:40:14,081 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:40:14,266 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:40:14,454 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:40:14,454 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 12:40:14,494 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:40:14,752 INFO L232 lantSequenceWeakener]: Weakened 105 states. On average, predicates are now at 73.32% of their original sizes. [2018-09-19 12:40:14,752 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:40:15,537 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:40:15,537 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:40:15,538 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:40:15,538 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:40:15,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:40:15,540 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:40:15,541 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:40:15,541 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand 10 states. [2018-09-19 12:40:19,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:40:19,375 INFO L93 Difference]: Finished difference Result 717 states and 1132 transitions. [2018-09-19 12:40:19,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 12:40:19,379 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 108 [2018-09-19 12:40:19,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:40:19,383 INFO L225 Difference]: With dead ends: 717 [2018-09-19 12:40:19,384 INFO L226 Difference]: Without dead ends: 511 [2018-09-19 12:40:19,386 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 114 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 12:40:19,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-09-19 12:40:19,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 505. [2018-09-19 12:40:19,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2018-09-19 12:40:19,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 659 transitions. [2018-09-19 12:40:19,416 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 659 transitions. Word has length 108 [2018-09-19 12:40:19,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:40:19,417 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 659 transitions. [2018-09-19 12:40:19,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:40:19,417 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 659 transitions. [2018-09-19 12:40:19,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-09-19 12:40:19,422 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:40:19,422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:40:19,423 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:40:19,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1446169164, now seen corresponding path program 1 times [2018-09-19 12:40:19,423 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:40:19,423 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 118 with the following transitions: [2018-09-19 12:40:19,424 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], [197], [199], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:40:19,428 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:40:19,428 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:40:19,505 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:40:19,609 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:40:19,610 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 12:40:19,635 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:40:19,795 INFO L232 lantSequenceWeakener]: Weakened 114 states. On average, predicates are now at 73.28% of their original sizes. [2018-09-19 12:40:19,795 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:40:20,257 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:40:20,258 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:40:20,258 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:40:20,258 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:40:20,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:40:20,265 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:40:20,265 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:40:20,266 INFO L87 Difference]: Start difference. First operand 505 states and 659 transitions. Second operand 10 states. [2018-09-19 12:40:23,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:40:23,340 INFO L93 Difference]: Finished difference Result 1149 states and 1716 transitions. [2018-09-19 12:40:23,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:40:23,341 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 117 [2018-09-19 12:40:23,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:40:23,346 INFO L225 Difference]: With dead ends: 1149 [2018-09-19 12:40:23,346 INFO L226 Difference]: Without dead ends: 794 [2018-09-19 12:40:23,348 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 124 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:40:23,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2018-09-19 12:40:23,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 783. [2018-09-19 12:40:23,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2018-09-19 12:40:23,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 991 transitions. [2018-09-19 12:40:23,384 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 991 transitions. Word has length 117 [2018-09-19 12:40:23,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:40:23,385 INFO L480 AbstractCegarLoop]: Abstraction has 783 states and 991 transitions. [2018-09-19 12:40:23,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:40:23,385 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 991 transitions. [2018-09-19 12:40:23,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-09-19 12:40:23,393 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:40:23,393 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:40:23,394 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:40:23,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1179733828, now seen corresponding path program 1 times [2018-09-19 12:40:23,394 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:40:23,394 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 154 with the following transitions: [2018-09-19 12:40:23,395 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], [197], [199], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:40:23,400 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:40:23,400 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:40:23,507 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:40:23,739 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:40:23,740 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 12:40:23,777 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:40:23,993 INFO L232 lantSequenceWeakener]: Weakened 150 states. On average, predicates are now at 73.14% of their original sizes. [2018-09-19 12:40:23,994 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:40:24,746 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:40:24,747 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:40:24,747 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:40:24,747 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:40:24,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:40:24,748 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:40:24,748 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:40:24,749 INFO L87 Difference]: Start difference. First operand 783 states and 991 transitions. Second operand 10 states. [2018-09-19 12:40:28,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:40:28,410 INFO L93 Difference]: Finished difference Result 1723 states and 2312 transitions. [2018-09-19 12:40:28,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 12:40:28,411 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 153 [2018-09-19 12:40:28,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:40:28,418 INFO L225 Difference]: With dead ends: 1723 [2018-09-19 12:40:28,418 INFO L226 Difference]: Without dead ends: 1090 [2018-09-19 12:40:28,420 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 159 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 12:40:28,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2018-09-19 12:40:28,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1081. [2018-09-19 12:40:28,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1081 states. [2018-09-19 12:40:28,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1341 transitions. [2018-09-19 12:40:28,455 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1341 transitions. Word has length 153 [2018-09-19 12:40:28,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:40:28,455 INFO L480 AbstractCegarLoop]: Abstraction has 1081 states and 1341 transitions. [2018-09-19 12:40:28,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:40:28,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1341 transitions. [2018-09-19 12:40:28,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-09-19 12:40:28,459 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:40:28,460 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:40:28,460 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:40:28,460 INFO L82 PathProgramCache]: Analyzing trace with hash 772445179, now seen corresponding path program 1 times [2018-09-19 12:40:28,460 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:40:28,461 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 173 with the following transitions: [2018-09-19 12:40:28,461 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], [197], [199], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [754], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:40:28,467 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:40:28,467 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:40:28,785 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:40:28,786 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 12:40:28,819 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:40:29,063 INFO L232 lantSequenceWeakener]: Weakened 169 states. On average, predicates are now at 73.1% of their original sizes. [2018-09-19 12:40:29,063 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:40:29,566 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:40:29,566 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:40:29,567 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:40:29,567 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:40:29,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:40:29,568 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:40:29,568 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:40:29,569 INFO L87 Difference]: Start difference. First operand 1081 states and 1341 transitions. Second operand 10 states. [2018-09-19 12:40:31,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:40:31,733 INFO L93 Difference]: Finished difference Result 2464 states and 3181 transitions. [2018-09-19 12:40:31,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 12:40:31,734 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 172 [2018-09-19 12:40:31,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:40:31,742 INFO L225 Difference]: With dead ends: 2464 [2018-09-19 12:40:31,743 INFO L226 Difference]: Without dead ends: 1533 [2018-09-19 12:40:31,746 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 178 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 12:40:31,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2018-09-19 12:40:31,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1521. [2018-09-19 12:40:31,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1521 states. [2018-09-19 12:40:31,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 1832 transitions. [2018-09-19 12:40:31,795 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 1832 transitions. Word has length 172 [2018-09-19 12:40:31,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:40:31,796 INFO L480 AbstractCegarLoop]: Abstraction has 1521 states and 1832 transitions. [2018-09-19 12:40:31,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:40:31,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 1832 transitions. [2018-09-19 12:40:31,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-09-19 12:40:31,800 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:40:31,800 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 12:40:31,800 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:40:31,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1478907618, now seen corresponding path program 1 times [2018-09-19 12:40:31,801 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:40:31,801 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 185 with the following transitions: [2018-09-19 12:40:31,801 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], [197], [199], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [518], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:40:31,808 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:40:31,808 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:40:31,864 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:40:31,995 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:40:31,995 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 12:40:32,034 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:40:32,247 INFO L232 lantSequenceWeakener]: Weakened 181 states. On average, predicates are now at 73.12% of their original sizes. [2018-09-19 12:40:32,248 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:40:32,522 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:40:32,522 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:40:32,523 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:40:32,523 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:40:32,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:40:32,525 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:40:32,525 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:40:32,526 INFO L87 Difference]: Start difference. First operand 1521 states and 1832 transitions. Second operand 10 states. [2018-09-19 12:40:35,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:40:35,335 INFO L93 Difference]: Finished difference Result 3061 states and 3823 transitions. [2018-09-19 12:40:35,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:40:35,340 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 184 [2018-09-19 12:40:35,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:40:35,348 INFO L225 Difference]: With dead ends: 3061 [2018-09-19 12:40:35,350 INFO L226 Difference]: Without dead ends: 1690 [2018-09-19 12:40:35,355 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 191 GetRequests, 175 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 12:40:35,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2018-09-19 12:40:35,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1672. [2018-09-19 12:40:35,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2018-09-19 12:40:35,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1998 transitions. [2018-09-19 12:40:35,407 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1998 transitions. Word has length 184 [2018-09-19 12:40:35,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:40:35,408 INFO L480 AbstractCegarLoop]: Abstraction has 1672 states and 1998 transitions. [2018-09-19 12:40:35,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:40:35,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1998 transitions. [2018-09-19 12:40:35,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-09-19 12:40:35,412 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:40:35,412 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 12:40:35,412 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:40:35,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1137838740, now seen corresponding path program 1 times [2018-09-19 12:40:35,413 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:40:35,413 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 191 with the following transitions: [2018-09-19 12:40:35,413 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], [197], [199], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:40:35,416 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:40:35,416 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:40:35,471 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:40:35,575 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:40:35,575 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 12:40:35,612 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:40:35,807 INFO L232 lantSequenceWeakener]: Weakened 187 states. On average, predicates are now at 73.11% of their original sizes. [2018-09-19 12:40:35,808 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:40:36,138 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:40:36,139 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:40:36,139 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:40:36,139 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:40:36,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:40:36,140 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:40:36,140 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:40:36,141 INFO L87 Difference]: Start difference. First operand 1672 states and 1998 transitions. Second operand 10 states. [2018-09-19 12:40:39,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:40:39,398 INFO L93 Difference]: Finished difference Result 3508 states and 4339 transitions. [2018-09-19 12:40:39,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:40:39,401 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 190 [2018-09-19 12:40:39,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:40:39,411 INFO L225 Difference]: With dead ends: 3508 [2018-09-19 12:40:39,411 INFO L226 Difference]: Without dead ends: 1986 [2018-09-19 12:40:39,415 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 197 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:40:39,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1986 states. [2018-09-19 12:40:39,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1986 to 1956. [2018-09-19 12:40:39,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1956 states. [2018-09-19 12:40:39,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1956 states to 1956 states and 2368 transitions. [2018-09-19 12:40:39,463 INFO L78 Accepts]: Start accepts. Automaton has 1956 states and 2368 transitions. Word has length 190 [2018-09-19 12:40:39,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:40:39,463 INFO L480 AbstractCegarLoop]: Abstraction has 1956 states and 2368 transitions. [2018-09-19 12:40:39,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:40:39,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1956 states and 2368 transitions. [2018-09-19 12:40:39,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-09-19 12:40:39,467 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:40:39,467 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 12:40:39,468 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:40:39,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1869592197, now seen corresponding path program 1 times [2018-09-19 12:40:39,468 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:40:39,468 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 196 with the following transitions: [2018-09-19 12:40:39,468 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], [197], [199], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:40:39,470 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:40:39,471 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:40:39,522 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:40:39,726 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:40:39,726 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 12:40:39,758 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:40:39,953 INFO L232 lantSequenceWeakener]: Weakened 192 states. On average, predicates are now at 73.1% of their original sizes. [2018-09-19 12:40:39,953 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:40:40,060 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:40:40,060 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:40:40,061 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:40:40,061 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:40:40,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:40:40,062 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:40:40,062 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:40:40,062 INFO L87 Difference]: Start difference. First operand 1956 states and 2368 transitions. Second operand 10 states. [2018-09-19 12:40:43,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:40:43,494 INFO L93 Difference]: Finished difference Result 4370 states and 5531 transitions. [2018-09-19 12:40:43,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:40:43,501 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 195 [2018-09-19 12:40:43,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:40:43,514 INFO L225 Difference]: With dead ends: 4370 [2018-09-19 12:40:43,514 INFO L226 Difference]: Without dead ends: 2564 [2018-09-19 12:40:43,519 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 202 GetRequests, 186 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 12:40:43,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2018-09-19 12:40:43,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 2527. [2018-09-19 12:40:43,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2527 states. [2018-09-19 12:40:43,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2527 states to 2527 states and 3089 transitions. [2018-09-19 12:40:43,595 INFO L78 Accepts]: Start accepts. Automaton has 2527 states and 3089 transitions. Word has length 195 [2018-09-19 12:40:43,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:40:43,596 INFO L480 AbstractCegarLoop]: Abstraction has 2527 states and 3089 transitions. [2018-09-19 12:40:43,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:40:43,596 INFO L276 IsEmpty]: Start isEmpty. Operand 2527 states and 3089 transitions. [2018-09-19 12:40:43,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-09-19 12:40:43,601 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:40:43,601 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 12:40:43,602 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:40:43,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1979654339, now seen corresponding path program 1 times [2018-09-19 12:40:43,602 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:40:43,602 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 200 with the following transitions: [2018-09-19 12:40:43,603 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], [197], [199], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [542], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:40:43,604 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:40:43,605 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:40:43,654 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:40:43,821 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:40:43,821 INFO L272 AbstractInterpreter]: Visited 90 different actions 434 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 12:40:43,859 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:40:44,055 INFO L232 lantSequenceWeakener]: Weakened 196 states. On average, predicates are now at 73.09% of their original sizes. [2018-09-19 12:40:44,055 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:40:44,347 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:40:44,347 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:40:44,347 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:40:44,348 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:40:44,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:40:44,348 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:40:44,348 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:40:44,348 INFO L87 Difference]: Start difference. First operand 2527 states and 3089 transitions. Second operand 10 states. [2018-09-19 12:40:47,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:40:47,513 INFO L93 Difference]: Finished difference Result 5813 states and 7415 transitions. [2018-09-19 12:40:47,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:40:47,514 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 199 [2018-09-19 12:40:47,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:40:47,525 INFO L225 Difference]: With dead ends: 5813 [2018-09-19 12:40:47,526 INFO L226 Difference]: Without dead ends: 3436 [2018-09-19 12:40:47,532 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 206 GetRequests, 190 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 12:40:47,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3436 states. [2018-09-19 12:40:47,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3436 to 3377. [2018-09-19 12:40:47,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3377 states. [2018-09-19 12:40:47,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3377 states to 3377 states and 4175 transitions. [2018-09-19 12:40:47,601 INFO L78 Accepts]: Start accepts. Automaton has 3377 states and 4175 transitions. Word has length 199 [2018-09-19 12:40:47,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:40:47,602 INFO L480 AbstractCegarLoop]: Abstraction has 3377 states and 4175 transitions. [2018-09-19 12:40:47,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:40:47,602 INFO L276 IsEmpty]: Start isEmpty. Operand 3377 states and 4175 transitions. [2018-09-19 12:40:47,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-09-19 12:40:47,606 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:40:47,606 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 12:40:47,606 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:40:47,607 INFO L82 PathProgramCache]: Analyzing trace with hash 58486703, now seen corresponding path program 1 times [2018-09-19 12:40:47,607 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:40:47,607 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 206 with the following transitions: [2018-09-19 12:40:47,607 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], [197], [199], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:40:47,609 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:40:47,609 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:40:47,656 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:40:52,726 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:40:52,727 INFO L272 AbstractInterpreter]: Visited 96 different actions 464 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 12:40:52,736 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:40:54,179 INFO L232 lantSequenceWeakener]: Weakened 202 states. On average, predicates are now at 73.08% of their original sizes. [2018-09-19 12:40:54,179 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:40:54,303 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:40:54,303 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:40:54,303 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:40:54,303 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:40:54,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:40:54,304 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:40:54,304 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:40:54,304 INFO L87 Difference]: Start difference. First operand 3377 states and 4175 transitions. Second operand 10 states. [2018-09-19 12:40:57,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:40:57,135 INFO L93 Difference]: Finished difference Result 8372 states and 10738 transitions. [2018-09-19 12:40:57,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:40:57,144 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 205 [2018-09-19 12:40:57,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:40:57,161 INFO L225 Difference]: With dead ends: 8372 [2018-09-19 12:40:57,161 INFO L226 Difference]: Without dead ends: 5145 [2018-09-19 12:40:57,169 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 212 GetRequests, 196 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 12:40:57,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5145 states. [2018-09-19 12:40:57,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5145 to 5045. [2018-09-19 12:40:57,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5045 states. [2018-09-19 12:40:57,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5045 states to 5045 states and 6270 transitions. [2018-09-19 12:40:57,276 INFO L78 Accepts]: Start accepts. Automaton has 5045 states and 6270 transitions. Word has length 205 [2018-09-19 12:40:57,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:40:57,277 INFO L480 AbstractCegarLoop]: Abstraction has 5045 states and 6270 transitions. [2018-09-19 12:40:57,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:40:57,277 INFO L276 IsEmpty]: Start isEmpty. Operand 5045 states and 6270 transitions. [2018-09-19 12:40:57,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-09-19 12:40:57,283 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:40:57,283 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 12:40:57,284 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:40:57,284 INFO L82 PathProgramCache]: Analyzing trace with hash 656383472, now seen corresponding path program 1 times [2018-09-19 12:40:57,284 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:40:57,284 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 221 with the following transitions: [2018-09-19 12:40:57,285 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], [197], [199], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [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 12:40:57,288 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:40:57,288 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:40:57,336 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:40:57,584 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:40:57,584 INFO L272 AbstractInterpreter]: Visited 111 different actions 539 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 12:40:57,611 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:40:57,829 INFO L232 lantSequenceWeakener]: Weakened 217 states. On average, predicates are now at 73.06% of their original sizes. [2018-09-19 12:40:57,829 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:40:57,994 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:40:57,994 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:40:57,995 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:40:57,995 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:40:57,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:40:57,995 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:40:57,996 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:40:57,996 INFO L87 Difference]: Start difference. First operand 5045 states and 6270 transitions. Second operand 10 states. [2018-09-19 12:41:01,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:41:01,191 INFO L93 Difference]: Finished difference Result 10399 states and 13068 transitions. [2018-09-19 12:41:01,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:41:01,197 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 220 [2018-09-19 12:41:01,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:41:01,212 INFO L225 Difference]: With dead ends: 10399 [2018-09-19 12:41:01,212 INFO L226 Difference]: Without dead ends: 5504 [2018-09-19 12:41:01,222 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 227 GetRequests, 211 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 12:41:01,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5504 states. [2018-09-19 12:41:01,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5504 to 5429. [2018-09-19 12:41:01,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5429 states. [2018-09-19 12:41:01,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5429 states to 5429 states and 6773 transitions. [2018-09-19 12:41:01,324 INFO L78 Accepts]: Start accepts. Automaton has 5429 states and 6773 transitions. Word has length 220 [2018-09-19 12:41:01,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:41:01,324 INFO L480 AbstractCegarLoop]: Abstraction has 5429 states and 6773 transitions. [2018-09-19 12:41:01,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:41:01,325 INFO L276 IsEmpty]: Start isEmpty. Operand 5429 states and 6773 transitions. [2018-09-19 12:41:01,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-09-19 12:41:01,330 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:41:01,330 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 12:41:01,331 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:41:01,331 INFO L82 PathProgramCache]: Analyzing trace with hash 608876684, now seen corresponding path program 1 times [2018-09-19 12:41:01,331 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:41:01,331 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 227 with the following transitions: [2018-09-19 12:41:01,332 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], [197], [199], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [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 12:41:01,334 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:41:01,334 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:41:01,413 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:41:01,626 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:41:01,626 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 12:41:01,667 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:41:01,922 INFO L232 lantSequenceWeakener]: Weakened 223 states. On average, predicates are now at 73.05% of their original sizes. [2018-09-19 12:41:01,923 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:41:02,029 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:41:02,029 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:41:02,029 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:41:02,029 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:41:02,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:41:02,030 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:41:02,030 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:41:02,030 INFO L87 Difference]: Start difference. First operand 5429 states and 6773 transitions. Second operand 10 states. [2018-09-19 12:41:04,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:41:04,326 INFO L93 Difference]: Finished difference Result 11196 states and 14212 transitions. [2018-09-19 12:41:04,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:41:04,332 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 226 [2018-09-19 12:41:04,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:41:04,350 INFO L225 Difference]: With dead ends: 11196 [2018-09-19 12:41:04,351 INFO L226 Difference]: Without dead ends: 5917 [2018-09-19 12:41:04,359 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 233 GetRequests, 217 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 12:41:04,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5917 states. [2018-09-19 12:41:04,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5917 to 5887. [2018-09-19 12:41:04,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5887 states. [2018-09-19 12:41:04,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5887 states to 5887 states and 7406 transitions. [2018-09-19 12:41:04,457 INFO L78 Accepts]: Start accepts. Automaton has 5887 states and 7406 transitions. Word has length 226 [2018-09-19 12:41:04,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:41:04,458 INFO L480 AbstractCegarLoop]: Abstraction has 5887 states and 7406 transitions. [2018-09-19 12:41:04,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:41:04,458 INFO L276 IsEmpty]: Start isEmpty. Operand 5887 states and 7406 transitions. [2018-09-19 12:41:04,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-09-19 12:41:04,464 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:41:04,465 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 12:41:04,465 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:41:04,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1839955013, now seen corresponding path program 1 times [2018-09-19 12:41:04,465 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:41:04,465 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 228 with the following transitions: [2018-09-19 12:41:04,466 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], [197], [199], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [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 12:41:04,468 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:41:04,468 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:41:04,510 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:41:04,783 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:41:04,783 INFO L272 AbstractInterpreter]: Visited 118 different actions 574 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 12:41:04,820 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:41:05,069 INFO L232 lantSequenceWeakener]: Weakened 224 states. On average, predicates are now at 73.05% of their original sizes. [2018-09-19 12:41:05,070 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:41:05,167 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:41:05,167 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:41:05,168 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:41:05,168 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:41:05,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:41:05,168 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:41:05,168 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:41:05,169 INFO L87 Difference]: Start difference. First operand 5887 states and 7406 transitions. Second operand 10 states. [2018-09-19 12:41:08,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:41:08,431 INFO L93 Difference]: Finished difference Result 13421 states and 17237 transitions. [2018-09-19 12:41:08,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:41:08,431 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 227 [2018-09-19 12:41:08,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:41:08,456 INFO L225 Difference]: With dead ends: 13421 [2018-09-19 12:41:08,457 INFO L226 Difference]: Without dead ends: 7684 [2018-09-19 12:41:08,469 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 234 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:41:08,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7684 states. [2018-09-19 12:41:08,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7684 to 7560. [2018-09-19 12:41:08,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7560 states. [2018-09-19 12:41:08,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7560 states to 7560 states and 9639 transitions. [2018-09-19 12:41:08,593 INFO L78 Accepts]: Start accepts. Automaton has 7560 states and 9639 transitions. Word has length 227 [2018-09-19 12:41:08,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:41:08,594 INFO L480 AbstractCegarLoop]: Abstraction has 7560 states and 9639 transitions. [2018-09-19 12:41:08,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:41:08,594 INFO L276 IsEmpty]: Start isEmpty. Operand 7560 states and 9639 transitions. [2018-09-19 12:41:08,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-09-19 12:41:08,606 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:41:08,606 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 12:41:08,606 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:41:08,607 INFO L82 PathProgramCache]: Analyzing trace with hash -561988101, now seen corresponding path program 1 times [2018-09-19 12:41:08,607 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:41:08,607 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 260 with the following transitions: [2018-09-19 12:41:08,607 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], [197], [199], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [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 12:41:08,610 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:41:08,610 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:41:08,651 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:41:08,965 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:41:08,966 INFO L272 AbstractInterpreter]: Visited 150 different actions 587 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 12:41:09,000 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:41:09,285 INFO L232 lantSequenceWeakener]: Weakened 256 states. On average, predicates are now at 73.01% of their original sizes. [2018-09-19 12:41:09,285 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:41:09,594 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:41:09,594 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:41:09,594 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:41:09,594 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:41:09,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:41:09,595 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:41:09,595 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:41:09,596 INFO L87 Difference]: Start difference. First operand 7560 states and 9639 transitions. Second operand 10 states. [2018-09-19 12:41:12,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:41:12,392 INFO L93 Difference]: Finished difference Result 16780 states and 21621 transitions. [2018-09-19 12:41:12,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:41:12,393 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 259 [2018-09-19 12:41:12,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:41:12,418 INFO L225 Difference]: With dead ends: 16780 [2018-09-19 12:41:12,419 INFO L226 Difference]: Without dead ends: 9370 [2018-09-19 12:41:12,432 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 266 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:41:12,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9370 states. [2018-09-19 12:41:12,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9370 to 9238. [2018-09-19 12:41:12,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9238 states. [2018-09-19 12:41:12,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9238 states to 9238 states and 11908 transitions. [2018-09-19 12:41:12,583 INFO L78 Accepts]: Start accepts. Automaton has 9238 states and 11908 transitions. Word has length 259 [2018-09-19 12:41:12,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:41:12,584 INFO L480 AbstractCegarLoop]: Abstraction has 9238 states and 11908 transitions. [2018-09-19 12:41:12,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:41:12,584 INFO L276 IsEmpty]: Start isEmpty. Operand 9238 states and 11908 transitions. [2018-09-19 12:41:12,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-09-19 12:41:12,596 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:41:12,596 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:41:12,597 INFO L423 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:41:12,597 INFO L82 PathProgramCache]: Analyzing trace with hash -792854867, now seen corresponding path program 1 times [2018-09-19 12:41:12,597 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:41:12,597 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 269 with the following transitions: [2018-09-19 12:41:12,598 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], [197], [199], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [526], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:41:12,601 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:41:12,601 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:41:12,645 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:41:12,818 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:41:12,818 INFO L272 AbstractInterpreter]: Visited 89 different actions 438 times. Merged at 8 different actions 37 times. Never widened. Found 9 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:41:12,849 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:41:13,116 INFO L232 lantSequenceWeakener]: Weakened 265 states. On average, predicates are now at 73.03% of their original sizes. [2018-09-19 12:41:13,117 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:41:13,414 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:41:13,414 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:41:13,414 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:41:13,414 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:41:13,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:41:13,415 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:41:13,415 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:41:13,415 INFO L87 Difference]: Start difference. First operand 9238 states and 11908 transitions. Second operand 10 states. [2018-09-19 12:41:16,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:41:16,407 INFO L93 Difference]: Finished difference Result 20530 states and 26690 transitions. [2018-09-19 12:41:16,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:41:16,408 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 268 [2018-09-19 12:41:16,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:41:16,437 INFO L225 Difference]: With dead ends: 20530 [2018-09-19 12:41:16,437 INFO L226 Difference]: Without dead ends: 11442 [2018-09-19 12:41:16,455 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 275 GetRequests, 259 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 12:41:16,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11442 states. [2018-09-19 12:41:16,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11442 to 11268. [2018-09-19 12:41:16,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11268 states. [2018-09-19 12:41:16,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11268 states to 11268 states and 14578 transitions. [2018-09-19 12:41:16,632 INFO L78 Accepts]: Start accepts. Automaton has 11268 states and 14578 transitions. Word has length 268 [2018-09-19 12:41:16,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:41:16,633 INFO L480 AbstractCegarLoop]: Abstraction has 11268 states and 14578 transitions. [2018-09-19 12:41:16,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:41:16,633 INFO L276 IsEmpty]: Start isEmpty. Operand 11268 states and 14578 transitions. [2018-09-19 12:41:16,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-09-19 12:41:16,647 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:41:16,648 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:41:16,648 INFO L423 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:41:16,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1777848003, now seen corresponding path program 1 times [2018-09-19 12:41:16,648 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:41:16,649 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 277 with the following transitions: [2018-09-19 12:41:16,649 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], [197], [199], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [534], [535], [538], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:41:16,651 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:41:16,651 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:41:16,692 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:41:16,867 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:41:16,868 INFO L272 AbstractInterpreter]: Visited 90 different actions 440 times. Merged at 8 different actions 34 times. Never widened. Found 8 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:41:16,905 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:41:17,160 INFO L232 lantSequenceWeakener]: Weakened 273 states. On average, predicates are now at 73.02% of their original sizes. [2018-09-19 12:41:17,160 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:41:17,261 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:41:17,261 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:41:17,261 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:41:17,261 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:41:17,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:41:17,262 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:41:17,262 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:41:17,262 INFO L87 Difference]: Start difference. First operand 11268 states and 14578 transitions. Second operand 10 states. [2018-09-19 12:41:21,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:41:21,019 INFO L93 Difference]: Finished difference Result 24169 states and 31450 transitions. [2018-09-19 12:41:21,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-19 12:41:21,026 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 276 [2018-09-19 12:41:21,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:41:21,052 INFO L225 Difference]: With dead ends: 24169 [2018-09-19 12:41:21,052 INFO L226 Difference]: Without dead ends: 13051 [2018-09-19 12:41:21,067 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 283 GetRequests, 267 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 12:41:21,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13051 states. [2018-09-19 12:41:21,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13051 to 12904. [2018-09-19 12:41:21,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12904 states. [2018-09-19 12:41:21,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12904 states to 12904 states and 16702 transitions. [2018-09-19 12:41:21,275 INFO L78 Accepts]: Start accepts. Automaton has 12904 states and 16702 transitions. Word has length 276 [2018-09-19 12:41:21,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:41:21,276 INFO L480 AbstractCegarLoop]: Abstraction has 12904 states and 16702 transitions. [2018-09-19 12:41:21,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:41:21,276 INFO L276 IsEmpty]: Start isEmpty. Operand 12904 states and 16702 transitions. [2018-09-19 12:41:21,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-09-19 12:41:21,293 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:41:21,293 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:41:21,293 INFO L423 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:41:21,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1799303929, now seen corresponding path program 1 times [2018-09-19 12:41:21,294 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:41:21,294 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 279 with the following transitions: [2018-09-19 12:41:21,294 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], [197], [199], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:41:21,296 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:41:21,296 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:41:21,339 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:41:26,588 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:41:26,589 INFO L272 AbstractInterpreter]: Visited 97 different actions 573 times. Merged at 8 different actions 46 times. Widened at 1 different actions 1 times. Found 11 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:41:26,603 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:41:28,367 INFO L232 lantSequenceWeakener]: Weakened 275 states. On average, predicates are now at 73.02% of their original sizes. [2018-09-19 12:41:28,367 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:41:28,457 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:41:28,457 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:41:28,457 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:41:28,457 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:41:28,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:41:28,458 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:41:28,458 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:41:28,458 INFO L87 Difference]: Start difference. First operand 12904 states and 16702 transitions. Second operand 10 states. [2018-09-19 12:41:32,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:41:32,234 INFO L93 Difference]: Finished difference Result 27274 states and 35434 transitions. [2018-09-19 12:41:32,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:41:32,242 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 278 [2018-09-19 12:41:32,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:41:32,264 INFO L225 Difference]: With dead ends: 27274 [2018-09-19 12:41:32,265 INFO L226 Difference]: Without dead ends: 14520 [2018-09-19 12:41:32,277 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 285 GetRequests, 269 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 12:41:32,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14520 states. [2018-09-19 12:41:32,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14520 to 14234. [2018-09-19 12:41:32,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14234 states. [2018-09-19 12:41:32,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14234 states to 14234 states and 18516 transitions. [2018-09-19 12:41:32,474 INFO L78 Accepts]: Start accepts. Automaton has 14234 states and 18516 transitions. Word has length 278 [2018-09-19 12:41:32,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:41:32,475 INFO L480 AbstractCegarLoop]: Abstraction has 14234 states and 18516 transitions. [2018-09-19 12:41:32,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:41:32,475 INFO L276 IsEmpty]: Start isEmpty. Operand 14234 states and 18516 transitions. [2018-09-19 12:41:32,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-09-19 12:41:32,489 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:41:32,489 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:41:32,490 INFO L423 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:41:32,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1668173440, now seen corresponding path program 1 times [2018-09-19 12:41:32,490 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:41:32,490 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 286 with the following transitions: [2018-09-19 12:41:32,491 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], [197], [199], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:41:32,493 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:41:32,493 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:41:32,531 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:41:32,698 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:41:32,698 INFO L272 AbstractInterpreter]: Visited 104 different actions 510 times. Merged at 8 different actions 34 times. Never widened. Found 8 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:41:32,705 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:41:32,936 INFO L232 lantSequenceWeakener]: Weakened 282 states. On average, predicates are now at 73.01% of their original sizes. [2018-09-19 12:41:32,936 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:41:33,046 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:41:33,046 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:41:33,047 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:41:33,047 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:41:33,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:41:33,047 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:41:33,047 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:41:33,048 INFO L87 Difference]: Start difference. First operand 14234 states and 18516 transitions. Second operand 10 states. [2018-09-19 12:41:35,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:41:35,627 INFO L93 Difference]: Finished difference Result 29317 states and 38295 transitions. [2018-09-19 12:41:35,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:41:35,628 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 285 [2018-09-19 12:41:35,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:41:35,657 INFO L225 Difference]: With dead ends: 29317 [2018-09-19 12:41:35,657 INFO L226 Difference]: Without dead ends: 15233 [2018-09-19 12:41:35,674 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 292 GetRequests, 276 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 12:41:35,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15233 states. [2018-09-19 12:41:35,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15233 to 15014. [2018-09-19 12:41:35,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15014 states. [2018-09-19 12:41:35,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15014 states to 15014 states and 19527 transitions. [2018-09-19 12:41:35,883 INFO L78 Accepts]: Start accepts. Automaton has 15014 states and 19527 transitions. Word has length 285 [2018-09-19 12:41:35,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:41:35,884 INFO L480 AbstractCegarLoop]: Abstraction has 15014 states and 19527 transitions. [2018-09-19 12:41:35,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:41:35,884 INFO L276 IsEmpty]: Start isEmpty. Operand 15014 states and 19527 transitions. [2018-09-19 12:41:35,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-09-19 12:41:35,896 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:41:35,896 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:41:35,896 INFO L423 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:41:35,897 INFO L82 PathProgramCache]: Analyzing trace with hash -737056979, now seen corresponding path program 1 times [2018-09-19 12:41:35,897 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:41:35,897 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 289 with the following transitions: [2018-09-19 12:41:35,897 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], [197], [199], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [546], [547], [551], [555], [559], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:41:35,899 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:41:35,899 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:41:36,089 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:41:41,337 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:41:41,337 INFO L272 AbstractInterpreter]: Visited 97 different actions 568 times. Merged at 8 different actions 41 times. Widened at 1 different actions 1 times. Found 9 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:41:41,347 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:41:42,988 INFO L232 lantSequenceWeakener]: Weakened 285 states. On average, predicates are now at 73.01% of their original sizes. [2018-09-19 12:41:42,988 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:41:43,310 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:41:43,310 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:41:43,311 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:41:43,311 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:41:43,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:41:43,311 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:41:43,311 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:41:43,312 INFO L87 Difference]: Start difference. First operand 15014 states and 19527 transitions. Second operand 10 states. [2018-09-19 12:41:46,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:41:46,332 INFO L93 Difference]: Finished difference Result 31248 states and 40901 transitions. [2018-09-19 12:41:46,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:41:46,333 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 288 [2018-09-19 12:41:46,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:41:46,364 INFO L225 Difference]: With dead ends: 31248 [2018-09-19 12:41:46,364 INFO L226 Difference]: Without dead ends: 16384 [2018-09-19 12:41:46,382 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 295 GetRequests, 279 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 12:41:46,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16384 states. [2018-09-19 12:41:46,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16384 to 16100. [2018-09-19 12:41:46,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16100 states. [2018-09-19 12:41:46,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16100 states to 16100 states and 21070 transitions. [2018-09-19 12:41:46,634 INFO L78 Accepts]: Start accepts. Automaton has 16100 states and 21070 transitions. Word has length 288 [2018-09-19 12:41:46,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:41:46,634 INFO L480 AbstractCegarLoop]: Abstraction has 16100 states and 21070 transitions. [2018-09-19 12:41:46,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:41:46,635 INFO L276 IsEmpty]: Start isEmpty. Operand 16100 states and 21070 transitions. [2018-09-19 12:41:46,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-09-19 12:41:46,645 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:41:46,646 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:41:46,646 INFO L423 AbstractCegarLoop]: === Iteration 20 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:41:46,646 INFO L82 PathProgramCache]: Analyzing trace with hash -186238347, now seen corresponding path program 1 times [2018-09-19 12:41:46,646 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:41:46,646 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 293 with the following transitions: [2018-09-19 12:41:46,646 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], [197], [199], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [562], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:41:46,648 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:41:46,649 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:41:46,689 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:41:53,025 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:41:53,026 INFO L272 AbstractInterpreter]: Visited 97 different actions 664 times. Merged at 8 different actions 51 times. Widened at 1 different actions 2 times. Found 11 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:41:53,034 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:41:54,803 INFO L232 lantSequenceWeakener]: Weakened 289 states. On average, predicates are now at 73.01% of their original sizes. [2018-09-19 12:41:54,803 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:41:54,937 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:41:54,937 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:41:54,937 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:41:54,938 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:41:54,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:41:54,938 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:41:54,938 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:41:54,938 INFO L87 Difference]: Start difference. First operand 16100 states and 21070 transitions. Second operand 10 states. [2018-09-19 12:41:58,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:41:58,273 INFO L93 Difference]: Finished difference Result 33283 states and 43657 transitions. [2018-09-19 12:41:58,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:41:58,273 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 292 [2018-09-19 12:41:58,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:41:58,307 INFO L225 Difference]: With dead ends: 33283 [2018-09-19 12:41:58,307 INFO L226 Difference]: Without dead ends: 17333 [2018-09-19 12:41:58,326 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 299 GetRequests, 283 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 12:41:58,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17333 states. [2018-09-19 12:41:58,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17333 to 17020. [2018-09-19 12:41:58,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17020 states. [2018-09-19 12:41:58,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17020 states to 17020 states and 22326 transitions. [2018-09-19 12:41:58,578 INFO L78 Accepts]: Start accepts. Automaton has 17020 states and 22326 transitions. Word has length 292 [2018-09-19 12:41:58,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:41:58,579 INFO L480 AbstractCegarLoop]: Abstraction has 17020 states and 22326 transitions. [2018-09-19 12:41:58,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:41:58,579 INFO L276 IsEmpty]: Start isEmpty. Operand 17020 states and 22326 transitions. [2018-09-19 12:41:58,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-09-19 12:41:58,593 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:41:58,593 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 12:41:58,594 INFO L423 AbstractCegarLoop]: === Iteration 21 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:41:58,594 INFO L82 PathProgramCache]: Analyzing trace with hash 61983491, now seen corresponding path program 1 times [2018-09-19 12:41:58,594 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:41:58,594 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 296 with the following transitions: [2018-09-19 12:41:58,595 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], [197], [199], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [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 12:41:58,598 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:41:58,598 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:41:58,669 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:41:58,949 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:41:58,949 INFO L272 AbstractInterpreter]: Visited 150 different actions 587 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 12:41:58,957 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:41:59,206 INFO L232 lantSequenceWeakener]: Weakened 292 states. On average, predicates are now at 72.97% of their original sizes. [2018-09-19 12:41:59,206 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:41:59,302 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:41:59,302 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:41:59,302 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:41:59,302 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:41:59,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:41:59,303 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:41:59,303 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:41:59,303 INFO L87 Difference]: Start difference. First operand 17020 states and 22326 transitions. Second operand 10 states. [2018-09-19 12:42:03,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:42:03,458 INFO L93 Difference]: Finished difference Result 35215 states and 46290 transitions. [2018-09-19 12:42:03,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:42:03,458 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 295 [2018-09-19 12:42:03,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:42:03,489 INFO L225 Difference]: With dead ends: 35215 [2018-09-19 12:42:03,489 INFO L226 Difference]: Without dead ends: 18345 [2018-09-19 12:42:03,508 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 302 GetRequests, 286 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 12:42:03,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18345 states. [2018-09-19 12:42:03,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18345 to 17954. [2018-09-19 12:42:03,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17954 states. [2018-09-19 12:42:03,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17954 states to 17954 states and 23579 transitions. [2018-09-19 12:42:03,761 INFO L78 Accepts]: Start accepts. Automaton has 17954 states and 23579 transitions. Word has length 295 [2018-09-19 12:42:03,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:42:03,762 INFO L480 AbstractCegarLoop]: Abstraction has 17954 states and 23579 transitions. [2018-09-19 12:42:03,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:42:03,762 INFO L276 IsEmpty]: Start isEmpty. Operand 17954 states and 23579 transitions. [2018-09-19 12:42:03,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-09-19 12:42:03,773 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:42:03,773 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:42:03,773 INFO L423 AbstractCegarLoop]: === Iteration 22 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:42:03,773 INFO L82 PathProgramCache]: Analyzing trace with hash -534164371, now seen corresponding path program 1 times [2018-09-19 12:42:03,773 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:42:03,774 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 301 with the following transitions: [2018-09-19 12:42:03,774 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], [197], [199], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [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], [654], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:42:03,776 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:42:03,776 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:42:03,812 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:42:04,038 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:42:04,038 INFO L272 AbstractInterpreter]: Visited 119 different actions 704 times. Merged at 8 different actions 45 times. Widened at 1 different actions 1 times. Found 11 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:42:04,047 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:42:04,257 INFO L232 lantSequenceWeakener]: Weakened 297 states. On average, predicates are now at 73% of their original sizes. [2018-09-19 12:42:04,257 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:42:04,341 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:42:04,342 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:42:04,342 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:42:04,342 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:42:04,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:42:04,343 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:42:04,343 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:42:04,343 INFO L87 Difference]: Start difference. First operand 17954 states and 23579 transitions. Second operand 10 states. [2018-09-19 12:42:08,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:42:08,022 INFO L93 Difference]: Finished difference Result 37767 states and 49724 transitions. [2018-09-19 12:42:08,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:42:08,023 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 300 [2018-09-19 12:42:08,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:42:08,053 INFO L225 Difference]: With dead ends: 37767 [2018-09-19 12:42:08,053 INFO L226 Difference]: Without dead ends: 19963 [2018-09-19 12:42:08,070 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 307 GetRequests, 291 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 12:42:08,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19963 states. [2018-09-19 12:42:08,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19963 to 19520. [2018-09-19 12:42:08,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19520 states. [2018-09-19 12:42:08,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19520 states to 19520 states and 25686 transitions. [2018-09-19 12:42:08,310 INFO L78 Accepts]: Start accepts. Automaton has 19520 states and 25686 transitions. Word has length 300 [2018-09-19 12:42:08,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:42:08,311 INFO L480 AbstractCegarLoop]: Abstraction has 19520 states and 25686 transitions. [2018-09-19 12:42:08,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:42:08,311 INFO L276 IsEmpty]: Start isEmpty. Operand 19520 states and 25686 transitions. [2018-09-19 12:42:08,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-09-19 12:42:08,321 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:42:08,322 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:42:08,322 INFO L423 AbstractCegarLoop]: === Iteration 23 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:42:08,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1390626583, now seen corresponding path program 1 times [2018-09-19 12:42:08,322 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:42:08,322 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 315 with the following transitions: [2018-09-19 12:42:08,323 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], [197], [199], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [562], [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 12:42:08,324 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:42:08,325 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:42:08,368 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:42:08,648 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:42:08,648 INFO L272 AbstractInterpreter]: Visited 119 different actions 819 times. Merged at 8 different actions 52 times. Widened at 1 different actions 2 times. Found 11 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:42:08,657 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:42:08,882 INFO L232 lantSequenceWeakener]: Weakened 311 states. On average, predicates are now at 72.99% of their original sizes. [2018-09-19 12:42:08,882 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:42:08,969 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:42:08,969 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:42:08,970 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:42:08,970 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:42:08,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:42:08,970 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:42:08,970 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:42:08,971 INFO L87 Difference]: Start difference. First operand 19520 states and 25686 transitions. Second operand 10 states. [2018-09-19 12:42:11,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:42:11,877 INFO L93 Difference]: Finished difference Result 40792 states and 53797 transitions. [2018-09-19 12:42:11,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:42:11,877 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 314 [2018-09-19 12:42:11,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:42:11,908 INFO L225 Difference]: With dead ends: 40792 [2018-09-19 12:42:11,908 INFO L226 Difference]: Without dead ends: 21422 [2018-09-19 12:42:11,926 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 321 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:42:11,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21422 states. [2018-09-19 12:42:12,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21422 to 21074. [2018-09-19 12:42:12,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21074 states. [2018-09-19 12:42:12,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21074 states to 21074 states and 27733 transitions. [2018-09-19 12:42:12,351 INFO L78 Accepts]: Start accepts. Automaton has 21074 states and 27733 transitions. Word has length 314 [2018-09-19 12:42:12,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:42:12,351 INFO L480 AbstractCegarLoop]: Abstraction has 21074 states and 27733 transitions. [2018-09-19 12:42:12,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:42:12,352 INFO L276 IsEmpty]: Start isEmpty. Operand 21074 states and 27733 transitions. [2018-09-19 12:42:12,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-09-19 12:42:12,362 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:42:12,362 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:42:12,362 INFO L423 AbstractCegarLoop]: === Iteration 24 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:42:12,362 INFO L82 PathProgramCache]: Analyzing trace with hash 788038838, now seen corresponding path program 1 times [2018-09-19 12:42:12,363 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:42:12,363 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 316 with the following transitions: [2018-09-19 12:42:12,363 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], [197], [199], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [526], [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], [694], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:42:12,365 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:42:12,365 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:42:12,407 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:42:12,671 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:42:12,671 INFO L272 AbstractInterpreter]: Visited 129 different actions 635 times. Merged at 8 different actions 34 times. Never widened. Found 8 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:42:12,681 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:42:12,925 INFO L232 lantSequenceWeakener]: Weakened 312 states. On average, predicates are now at 72.99% of their original sizes. [2018-09-19 12:42:12,925 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:42:13,013 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:42:13,013 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:42:13,014 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:42:13,014 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:42:13,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:42:13,014 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:42:13,014 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:42:13,015 INFO L87 Difference]: Start difference. First operand 21074 states and 27733 transitions. Second operand 10 states. [2018-09-19 12:42:16,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:42:16,117 INFO L93 Difference]: Finished difference Result 45130 states and 60382 transitions. [2018-09-19 12:42:16,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:42:16,118 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 315 [2018-09-19 12:42:16,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:42:16,156 INFO L225 Difference]: With dead ends: 45130 [2018-09-19 12:42:16,156 INFO L226 Difference]: Without dead ends: 24206 [2018-09-19 12:42:16,180 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 322 GetRequests, 306 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 12:42:16,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24206 states. [2018-09-19 12:42:16,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24206 to 23793. [2018-09-19 12:42:16,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23793 states. [2018-09-19 12:42:16,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23793 states to 23793 states and 31366 transitions. [2018-09-19 12:42:16,440 INFO L78 Accepts]: Start accepts. Automaton has 23793 states and 31366 transitions. Word has length 315 [2018-09-19 12:42:16,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:42:16,440 INFO L480 AbstractCegarLoop]: Abstraction has 23793 states and 31366 transitions. [2018-09-19 12:42:16,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:42:16,440 INFO L276 IsEmpty]: Start isEmpty. Operand 23793 states and 31366 transitions. [2018-09-19 12:42:16,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-09-19 12:42:16,450 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:42:16,450 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:42:16,450 INFO L423 AbstractCegarLoop]: === Iteration 25 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:42:16,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1067176517, now seen corresponding path program 1 times [2018-09-19 12:42:16,450 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:42:16,451 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 317 with the following transitions: [2018-09-19 12:42:16,451 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], [197], [199], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [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], [718], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:42:16,453 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:42:16,453 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:42:16,485 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:42:16,725 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-19 12:42:16,726 INFO L272 AbstractInterpreter]: Visited 136 different actions 666 times. Merged at 8 different actions 34 times. Never widened. Found 8 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:42:16,737 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 12:42:16,782 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 12:42:16,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 12:42:16 BoogieIcfgContainer [2018-09-19 12:42:16,784 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 12:42:16,786 INFO L168 Benchmark]: Toolchain (without parser) took 131276.28 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -918.7 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-09-19 12:42:16,788 INFO L168 Benchmark]: CDTParser took 0.19 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 12:42:16,789 INFO L168 Benchmark]: CACSL2BoogieTranslator took 777.98 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-19 12:42:16,789 INFO L168 Benchmark]: Boogie Procedure Inliner took 129.89 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-19 12:42:16,790 INFO L168 Benchmark]: Boogie Preprocessor took 243.38 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 791.7 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -885.5 MB). Peak memory consumption was 30.0 MB. Max. memory is 7.1 GB. [2018-09-19 12:42:16,792 INFO L168 Benchmark]: RCFGBuilder took 3098.00 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 105.3 MB). Peak memory consumption was 105.3 MB. Max. memory is 7.1 GB. [2018-09-19 12:42:16,793 INFO L168 Benchmark]: TraceAbstraction took 127020.77 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -191.3 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-09-19 12:42:16,798 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 777.98 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 129.89 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 243.38 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 791.7 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -885.5 MB). Peak memory consumption was 30.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3098.00 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 105.3 MB). Peak memory consumption was 105.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 127020.77 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -191.3 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 94]: 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 TRUE ((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14))))) [L222] a19 = 10 [L224] RET return 25; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, 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 TRUE (((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10)) [L482] a1 = ((((a1 * 10)/ -9) * 5) - 333686) [L483] a10 = 4 [L484] a19 = 6 [L486] 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 TRUE (((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6)) [L94] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNKNOWN Result, 126.9s OverallTime, 25 OverallIterations, 4 TraceHistogramMax, 77.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4088 SDtfs, 18289 SDslu, 8990 SDs, 0 SdLazy, 48499 SolverSat, 4921 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 62.1s Time, PredicateUnifierStatistics: 48 DeclaredPredicates, 5560 GetRequests, 5191 SyntacticMatches, 0 SemanticMatches, 369 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 917 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23793occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 28.7s AbstIntTime, 25 AbstIntIterations, 24 AbstIntStrong, 0.9965597857447744 AbsIntWeakeningRatio, 0.11935303959843838 AbsIntAvgWeakeningVarsNumRemoved, 21.468860382970814 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.5s AutomataMinimizationTime, 24 MinimizatonAttempts, 3663 StatesRemovedByMinimization, 24 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_label17_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_12-42-16-830.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label17_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_12-42-16-830.csv Received shutdown request...