java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_INT-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label43_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 06:04:23,848 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 06:04:23,850 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 06:04:23,862 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 06:04:23,862 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 06:04:23,863 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 06:04:23,864 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 06:04:23,866 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 06:04:23,868 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 06:04:23,869 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 06:04:23,869 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 06:04:23,870 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 06:04:23,871 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 06:04:23,872 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 06:04:23,873 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 06:04:23,874 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 06:04:23,875 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 06:04:23,876 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 06:04:23,878 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 06:04:23,880 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 06:04:23,881 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 06:04:23,882 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 06:04:23,885 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 06:04:23,885 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 06:04:23,885 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 06:04:23,886 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 06:04:23,887 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 06:04:23,888 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 06:04:23,889 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 06:04:23,890 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 06:04:23,890 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 06:04:23,891 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 06:04:23,891 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 06:04:23,892 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 06:04:23,893 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 06:04:23,893 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 06:04:23,894 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_INT-OldIcfg.epf [2018-09-19 06:04:23,909 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 06:04:23,909 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 06:04:23,910 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 06:04:23,910 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 06:04:23,911 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 06:04:23,911 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 06:04:23,911 INFO L133 SettingsManager]: * Congruence Domain=false [2018-09-19 06:04:23,911 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 06:04:23,911 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-19 06:04:23,912 INFO L133 SettingsManager]: * Abstract domain=IntervalDomain [2018-09-19 06:04:23,912 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 06:04:23,912 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 06:04:23,912 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 06:04:23,913 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 06:04:23,913 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 06:04:23,913 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 06:04:23,913 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 06:04:23,914 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 06:04:23,914 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 06:04:23,914 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 06:04:23,914 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 06:04:23,914 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 06:04:23,915 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 06:04:23,915 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 06:04:23,915 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 06:04:23,915 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 06:04:23,915 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 06:04:23,916 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 06:04:23,916 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 06:04:23,916 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 06:04:23,916 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 06:04:23,916 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 06:04:23,917 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 06:04:23,917 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 06:04:23,917 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 06:04:23,977 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 06:04:23,989 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 06:04:23,995 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 06:04:23,996 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 06:04:23,997 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 06:04:23,997 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label43_true-unreach-call.c [2018-09-19 06:04:24,353 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30831a168/b3280fc8b38c4586b42a8eda24a03a38/FLAGaf5fba50e [2018-09-19 06:04:24,588 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 06:04:24,589 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label43_true-unreach-call.c [2018-09-19 06:04:24,611 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30831a168/b3280fc8b38c4586b42a8eda24a03a38/FLAGaf5fba50e [2018-09-19 06:04:24,641 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30831a168/b3280fc8b38c4586b42a8eda24a03a38 [2018-09-19 06:04:24,654 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 06:04:24,658 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 06:04:24,662 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 06:04:24,663 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 06:04:24,671 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 06:04:24,672 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 06:04:24" (1/1) ... [2018-09-19 06:04:24,676 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@537cd63d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:04:24, skipping insertion in model container [2018-09-19 06:04:24,676 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 06:04:24" (1/1) ... [2018-09-19 06:04:24,688 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 06:04:25,205 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 06:04:25,231 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 06:04:25,405 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 06:04:25,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:04:25 WrapperNode [2018-09-19 06:04:25,456 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 06:04:25,457 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 06:04:25,457 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 06:04:25,457 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 06:04:25,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:04:25" (1/1) ... [2018-09-19 06:04:25,504 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:04:25" (1/1) ... [2018-09-19 06:04:25,568 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 06:04:25,569 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 06:04:25,569 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 06:04:25,569 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 06:04:25,581 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:04:25" (1/1) ... [2018-09-19 06:04:25,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:04:25" (1/1) ... [2018-09-19 06:04:25,587 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:04:25" (1/1) ... [2018-09-19 06:04:25,587 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:04:25" (1/1) ... [2018-09-19 06:04:25,774 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:04:25" (1/1) ... [2018-09-19 06:04:25,795 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:04:25" (1/1) ... [2018-09-19 06:04:25,806 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:04:25" (1/1) ... [2018-09-19 06:04:25,823 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 06:04:25,824 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 06:04:25,824 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 06:04:25,824 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 06:04:25,825 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:04:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 06:04:25,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 06:04:25,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 06:04:25,903 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 06:04:25,904 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 06:04:25,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 06:04:25,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 06:04:25,904 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 06:04:25,904 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 06:04:29,092 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 06:04:29,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 06:04:29 BoogieIcfgContainer [2018-09-19 06:04:29,093 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 06:04:29,094 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 06:04:29,094 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 06:04:29,098 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 06:04:29,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 06:04:24" (1/3) ... [2018-09-19 06:04:29,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dc38e7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 06:04:29, skipping insertion in model container [2018-09-19 06:04:29,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:04:25" (2/3) ... [2018-09-19 06:04:29,100 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dc38e7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 06:04:29, skipping insertion in model container [2018-09-19 06:04:29,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 06:04:29" (3/3) ... [2018-09-19 06:04:29,102 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label43_true-unreach-call.c [2018-09-19 06:04:29,111 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 06:04:29,119 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 06:04:29,171 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 06:04:29,172 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 06:04:29,172 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 06:04:29,172 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 06:04:29,173 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 06:04:29,173 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 06:04:29,173 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 06:04:29,173 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 06:04:29,173 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 06:04:29,205 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-19 06:04:29,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-19 06:04:29,214 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:04:29,215 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:04:29,216 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:04:29,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1430816948, now seen corresponding path program 1 times [2018-09-19 06:04:29,223 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:04:29,224 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 43 with the following transitions: [2018-09-19 06:04:29,226 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [237], [239], [796], [800], [806], [810], [817], [818], [819], [821] [2018-09-19 06:04:29,271 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:04:29,271 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:04:29,525 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:04:29,528 INFO L272 AbstractInterpreter]: Visited 41 different actions 41 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-19 06:04:29,573 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:04:29,717 INFO L232 lantSequenceWeakener]: Weakened 39 states. On average, predicates are now at 74.68% of their original sizes. [2018-09-19 06:04:29,717 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:04:29,974 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:04:29,975 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:04:29,976 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 06:04:29,976 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:04:29,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 06:04:29,992 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 06:04:29,993 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 06:04:29,996 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 6 states. [2018-09-19 06:04:31,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:04:31,909 INFO L93 Difference]: Finished difference Result 576 states and 995 transitions. [2018-09-19 06:04:31,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 06:04:31,913 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-09-19 06:04:31,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:04:31,933 INFO L225 Difference]: With dead ends: 576 [2018-09-19 06:04:31,934 INFO L226 Difference]: Without dead ends: 358 [2018-09-19 06:04:31,941 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 41 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 06:04:31,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-09-19 06:04:32,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-09-19 06:04:32,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-19 06:04:32,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2018-09-19 06:04:32,020 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 42 [2018-09-19 06:04:32,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:04:32,021 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2018-09-19 06:04:32,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 06:04:32,022 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2018-09-19 06:04:32,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-09-19 06:04:32,031 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:04:32,031 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:04:32,034 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:04:32,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1958223005, now seen corresponding path program 1 times [2018-09-19 06:04:32,035 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:04:32,035 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 114 with the following transitions: [2018-09-19 06:04:32,036 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [237], [239], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:04:32,042 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:04:32,042 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:04:32,148 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:04:32,305 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:04:32,306 INFO L272 AbstractInterpreter]: Visited 78 different actions 221 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 06:04:32,340 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:04:32,535 INFO L232 lantSequenceWeakener]: Weakened 110 states. On average, predicates are now at 73.5% of their original sizes. [2018-09-19 06:04:32,535 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:04:33,326 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:04:33,326 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:04:33,326 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:04:33,327 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:04:33,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:04:33,328 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:04:33,328 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:04:33,329 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand 10 states. [2018-09-19 06:04:37,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:04:37,999 INFO L93 Difference]: Finished difference Result 717 states and 1132 transitions. [2018-09-19 06:04:38,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 06:04:38,002 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 113 [2018-09-19 06:04:38,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:04:38,006 INFO L225 Difference]: With dead ends: 717 [2018-09-19 06:04:38,007 INFO L226 Difference]: Without dead ends: 511 [2018-09-19 06:04:38,010 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 119 GetRequests, 104 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 06:04:38,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-09-19 06:04:38,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 505. [2018-09-19 06:04:38,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2018-09-19 06:04:38,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 669 transitions. [2018-09-19 06:04:38,051 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 669 transitions. Word has length 113 [2018-09-19 06:04:38,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:04:38,052 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 669 transitions. [2018-09-19 06:04:38,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:04:38,052 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 669 transitions. [2018-09-19 06:04:38,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-09-19 06:04:38,056 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:04:38,056 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:04:38,057 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:04:38,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1479974744, now seen corresponding path program 1 times [2018-09-19 06:04:38,057 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:04:38,057 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 123 with the following transitions: [2018-09-19 06:04:38,058 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [237], [239], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:04:38,063 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:04:38,063 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:04:38,122 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:04:38,204 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:04:38,204 INFO L272 AbstractInterpreter]: Visited 87 different actions 248 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 06:04:38,242 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:04:38,382 INFO L232 lantSequenceWeakener]: Weakened 119 states. On average, predicates are now at 73.44% of their original sizes. [2018-09-19 06:04:38,382 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:04:38,864 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:04:38,865 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:04:38,865 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:04:38,865 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:04:38,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:04:38,866 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:04:38,866 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:04:38,867 INFO L87 Difference]: Start difference. First operand 505 states and 669 transitions. Second operand 10 states. [2018-09-19 06:04:42,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:04:42,658 INFO L93 Difference]: Finished difference Result 1149 states and 1736 transitions. [2018-09-19 06:04:42,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:04:42,660 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 122 [2018-09-19 06:04:42,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:04:42,665 INFO L225 Difference]: With dead ends: 1149 [2018-09-19 06:04:42,666 INFO L226 Difference]: Without dead ends: 794 [2018-09-19 06:04:42,668 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 129 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:04:42,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2018-09-19 06:04:42,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 783. [2018-09-19 06:04:42,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2018-09-19 06:04:42,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1001 transitions. [2018-09-19 06:04:42,704 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1001 transitions. Word has length 122 [2018-09-19 06:04:42,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:04:42,705 INFO L480 AbstractCegarLoop]: Abstraction has 783 states and 1001 transitions. [2018-09-19 06:04:42,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:04:42,705 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1001 transitions. [2018-09-19 06:04:42,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-09-19 06:04:42,710 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:04:42,710 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:04:42,711 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:04:42,711 INFO L82 PathProgramCache]: Analyzing trace with hash -2055571680, now seen corresponding path program 1 times [2018-09-19 06:04:42,711 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:04:42,711 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 159 with the following transitions: [2018-09-19 06:04:42,712 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [237], [239], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:04:42,716 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:04:42,717 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:04:42,788 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:04:42,931 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:04:42,931 INFO L272 AbstractInterpreter]: Visited 123 different actions 356 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 06:04:42,969 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:04:43,115 INFO L232 lantSequenceWeakener]: Weakened 155 states. On average, predicates are now at 73.28% of their original sizes. [2018-09-19 06:04:43,116 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:04:43,848 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:04:43,849 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:04:43,849 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:04:43,849 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:04:43,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:04:43,850 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:04:43,850 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:04:43,850 INFO L87 Difference]: Start difference. First operand 783 states and 1001 transitions. Second operand 10 states. [2018-09-19 06:04:48,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:04:48,758 INFO L93 Difference]: Finished difference Result 1723 states and 2332 transitions. [2018-09-19 06:04:48,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 06:04:48,759 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 158 [2018-09-19 06:04:48,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:04:48,765 INFO L225 Difference]: With dead ends: 1723 [2018-09-19 06:04:48,765 INFO L226 Difference]: Without dead ends: 1090 [2018-09-19 06:04:48,768 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 164 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 06:04:48,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2018-09-19 06:04:48,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1081. [2018-09-19 06:04:48,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1081 states. [2018-09-19 06:04:48,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1351 transitions. [2018-09-19 06:04:48,803 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1351 transitions. Word has length 158 [2018-09-19 06:04:48,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:04:48,803 INFO L480 AbstractCegarLoop]: Abstraction has 1081 states and 1351 transitions. [2018-09-19 06:04:48,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:04:48,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1351 transitions. [2018-09-19 06:04:48,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-09-19 06:04:48,808 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:04:48,808 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:04:48,808 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:04:48,809 INFO L82 PathProgramCache]: Analyzing trace with hash 2070095587, now seen corresponding path program 1 times [2018-09-19 06:04:48,809 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:04:48,809 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 178 with the following transitions: [2018-09-19 06:04:48,810 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [237], [239], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [754], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:04:48,815 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:04:48,815 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:04:49,017 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:04:49,017 INFO L272 AbstractInterpreter]: Visited 142 different actions 413 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 06:04:49,057 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:04:49,218 INFO L232 lantSequenceWeakener]: Weakened 174 states. On average, predicates are now at 73.22% of their original sizes. [2018-09-19 06:04:49,218 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:04:49,368 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:04:49,368 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:04:49,368 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:04:49,368 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:04:49,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:04:49,369 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:04:49,369 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:04:49,370 INFO L87 Difference]: Start difference. First operand 1081 states and 1351 transitions. Second operand 10 states. [2018-09-19 06:04:51,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:04:51,984 INFO L93 Difference]: Finished difference Result 2464 states and 3201 transitions. [2018-09-19 06:04:51,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 06:04:51,987 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2018-09-19 06:04:51,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:04:51,994 INFO L225 Difference]: With dead ends: 2464 [2018-09-19 06:04:51,995 INFO L226 Difference]: Without dead ends: 1533 [2018-09-19 06:04:51,998 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 183 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 06:04:52,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2018-09-19 06:04:52,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1521. [2018-09-19 06:04:52,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1521 states. [2018-09-19 06:04:52,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 1842 transitions. [2018-09-19 06:04:52,041 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 1842 transitions. Word has length 177 [2018-09-19 06:04:52,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:04:52,041 INFO L480 AbstractCegarLoop]: Abstraction has 1521 states and 1842 transitions. [2018-09-19 06:04:52,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:04:52,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 1842 transitions. [2018-09-19 06:04:52,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-09-19 06:04:52,045 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:04:52,046 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:04:52,046 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:04:52,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1220148193, now seen corresponding path program 1 times [2018-09-19 06:04:52,047 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:04:52,047 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 190 with the following transitions: [2018-09-19 06:04:52,047 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [237], [239], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [518], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:04:52,050 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:04:52,051 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:04:52,081 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:04:52,152 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:04:52,152 INFO L272 AbstractInterpreter]: Visited 84 different actions 323 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 06:04:52,196 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:04:52,313 INFO L232 lantSequenceWeakener]: Weakened 186 states. On average, predicates are now at 73.24% of their original sizes. [2018-09-19 06:04:52,313 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:04:52,452 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:04:52,453 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:04:52,453 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:04:52,453 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:04:52,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:04:52,454 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:04:52,454 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:04:52,454 INFO L87 Difference]: Start difference. First operand 1521 states and 1842 transitions. Second operand 10 states. [2018-09-19 06:04:55,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:04:55,043 INFO L93 Difference]: Finished difference Result 3061 states and 3845 transitions. [2018-09-19 06:04:55,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:04:55,044 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 189 [2018-09-19 06:04:55,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:04:55,058 INFO L225 Difference]: With dead ends: 3061 [2018-09-19 06:04:55,058 INFO L226 Difference]: Without dead ends: 1690 [2018-09-19 06:04:55,063 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 196 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:04:55,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2018-09-19 06:04:55,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1672. [2018-09-19 06:04:55,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2018-09-19 06:04:55,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2020 transitions. [2018-09-19 06:04:55,121 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2020 transitions. Word has length 189 [2018-09-19 06:04:55,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:04:55,121 INFO L480 AbstractCegarLoop]: Abstraction has 1672 states and 2020 transitions. [2018-09-19 06:04:55,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:04:55,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2020 transitions. [2018-09-19 06:04:55,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-09-19 06:04:55,125 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:04:55,125 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:04:55,125 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:04:55,126 INFO L82 PathProgramCache]: Analyzing trace with hash 122826939, now seen corresponding path program 1 times [2018-09-19 06:04:55,126 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:04:55,126 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 192 with the following transitions: [2018-09-19 06:04:55,126 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [237], [239], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [526], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:04:55,128 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:04:55,129 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:04:55,167 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:04:55,266 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:04:55,266 INFO L272 AbstractInterpreter]: Visited 86 different actions 332 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 06:04:55,299 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:04:55,416 INFO L232 lantSequenceWeakener]: Weakened 188 states. On average, predicates are now at 73.23% of their original sizes. [2018-09-19 06:04:55,416 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:04:55,649 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:04:55,650 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:04:55,650 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:04:55,650 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:04:55,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:04:55,651 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:04:55,651 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:04:55,651 INFO L87 Difference]: Start difference. First operand 1672 states and 2020 transitions. Second operand 10 states. [2018-09-19 06:04:58,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:04:58,177 INFO L93 Difference]: Finished difference Result 3362 states and 4211 transitions. [2018-09-19 06:04:58,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:04:58,184 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 191 [2018-09-19 06:04:58,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:04:58,192 INFO L225 Difference]: With dead ends: 3362 [2018-09-19 06:04:58,193 INFO L226 Difference]: Without dead ends: 1840 [2018-09-19 06:04:58,197 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 198 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:04:58,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2018-09-19 06:04:58,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 1823. [2018-09-19 06:04:58,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1823 states. [2018-09-19 06:04:58,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1823 states to 1823 states and 2218 transitions. [2018-09-19 06:04:58,245 INFO L78 Accepts]: Start accepts. Automaton has 1823 states and 2218 transitions. Word has length 191 [2018-09-19 06:04:58,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:04:58,246 INFO L480 AbstractCegarLoop]: Abstraction has 1823 states and 2218 transitions. [2018-09-19 06:04:58,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:04:58,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1823 states and 2218 transitions. [2018-09-19 06:04:58,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-09-19 06:04:58,250 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:04:58,250 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:04:58,251 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:04:58,251 INFO L82 PathProgramCache]: Analyzing trace with hash 80282099, now seen corresponding path program 1 times [2018-09-19 06:04:58,251 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:04:58,251 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 196 with the following transitions: [2018-09-19 06:04:58,252 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [237], [239], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [542], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:04:58,253 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:04:58,254 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:04:58,283 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:04:58,364 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:04:58,364 INFO L272 AbstractInterpreter]: Visited 90 different actions 348 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 06:04:58,388 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:04:58,504 INFO L232 lantSequenceWeakener]: Weakened 192 states. On average, predicates are now at 73.22% of their original sizes. [2018-09-19 06:04:58,504 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:04:58,734 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:04:58,735 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:04:58,735 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:04:58,735 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:04:58,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:04:58,736 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:04:58,736 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:04:58,736 INFO L87 Difference]: Start difference. First operand 1823 states and 2218 transitions. Second operand 10 states. [2018-09-19 06:05:01,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:05:01,292 INFO L93 Difference]: Finished difference Result 3819 states and 4796 transitions. [2018-09-19 06:05:01,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:05:01,299 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 195 [2018-09-19 06:05:01,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:05:01,309 INFO L225 Difference]: With dead ends: 3819 [2018-09-19 06:05:01,309 INFO L226 Difference]: Without dead ends: 2146 [2018-09-19 06:05:01,313 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 202 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:05:01,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2146 states. [2018-09-19 06:05:01,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2146 to 2123. [2018-09-19 06:05:01,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2123 states. [2018-09-19 06:05:01,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2123 states to 2123 states and 2596 transitions. [2018-09-19 06:05:01,373 INFO L78 Accepts]: Start accepts. Automaton has 2123 states and 2596 transitions. Word has length 195 [2018-09-19 06:05:01,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:05:01,375 INFO L480 AbstractCegarLoop]: Abstraction has 2123 states and 2596 transitions. [2018-09-19 06:05:01,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:05:01,375 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 2596 transitions. [2018-09-19 06:05:01,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-09-19 06:05:01,379 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:05:01,379 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:05:01,380 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:05:01,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1444570101, now seen corresponding path program 1 times [2018-09-19 06:05:01,380 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:05:01,380 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 196 with the following transitions: [2018-09-19 06:05:01,381 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [237], [239], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:05:01,383 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:05:01,383 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:05:01,417 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:05:01,496 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:05:01,496 INFO L272 AbstractInterpreter]: Visited 88 different actions 340 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 06:05:01,521 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:05:01,649 INFO L232 lantSequenceWeakener]: Weakened 192 states. On average, predicates are now at 73.22% of their original sizes. [2018-09-19 06:05:01,649 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:05:01,873 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:05:01,873 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:05:01,873 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:05:01,873 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:05:01,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:05:01,874 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:05:01,874 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:05:01,874 INFO L87 Difference]: Start difference. First operand 2123 states and 2596 transitions. Second operand 10 states. [2018-09-19 06:05:05,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:05:05,034 INFO L93 Difference]: Finished difference Result 4418 states and 5553 transitions. [2018-09-19 06:05:05,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:05:05,035 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 195 [2018-09-19 06:05:05,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:05:05,044 INFO L225 Difference]: With dead ends: 4418 [2018-09-19 06:05:05,044 INFO L226 Difference]: Without dead ends: 2445 [2018-09-19 06:05:05,049 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 202 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:05:05,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2445 states. [2018-09-19 06:05:05,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2445 to 2411. [2018-09-19 06:05:05,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2411 states. [2018-09-19 06:05:05,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 2974 transitions. [2018-09-19 06:05:05,110 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 2974 transitions. Word has length 195 [2018-09-19 06:05:05,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:05:05,111 INFO L480 AbstractCegarLoop]: Abstraction has 2411 states and 2974 transitions. [2018-09-19 06:05:05,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:05:05,111 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 2974 transitions. [2018-09-19 06:05:05,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-09-19 06:05:05,115 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:05:05,116 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:05:05,116 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:05:05,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1320249287, now seen corresponding path program 1 times [2018-09-19 06:05:05,116 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:05:05,117 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 202 with the following transitions: [2018-09-19 06:05:05,117 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [237], [239], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:05:05,119 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:05:05,119 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:05:05,145 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:05:07,761 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:05:07,761 INFO L272 AbstractInterpreter]: Visited 96 different actions 372 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 06:05:07,800 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:05:08,385 INFO L232 lantSequenceWeakener]: Weakened 198 states. On average, predicates are now at 73.2% of their original sizes. [2018-09-19 06:05:08,385 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:05:08,476 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:05:08,476 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:05:08,476 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:05:08,476 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:05:08,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:05:08,477 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:05:08,477 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:05:08,477 INFO L87 Difference]: Start difference. First operand 2411 states and 2974 transitions. Second operand 10 states. [2018-09-19 06:05:10,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:05:10,868 INFO L93 Difference]: Finished difference Result 4850 states and 6141 transitions. [2018-09-19 06:05:10,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:05:10,869 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 201 [2018-09-19 06:05:10,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:05:10,878 INFO L225 Difference]: With dead ends: 4850 [2018-09-19 06:05:10,878 INFO L226 Difference]: Without dead ends: 2589 [2018-09-19 06:05:10,883 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 208 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:05:10,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2589 states. [2018-09-19 06:05:10,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2589 to 2566. [2018-09-19 06:05:10,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2566 states. [2018-09-19 06:05:10,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2566 states to 2566 states and 3192 transitions. [2018-09-19 06:05:10,939 INFO L78 Accepts]: Start accepts. Automaton has 2566 states and 3192 transitions. Word has length 201 [2018-09-19 06:05:10,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:05:10,939 INFO L480 AbstractCegarLoop]: Abstraction has 2566 states and 3192 transitions. [2018-09-19 06:05:10,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:05:10,940 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 3192 transitions. [2018-09-19 06:05:10,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-09-19 06:05:10,944 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:05:10,944 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:05:10,945 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:05:10,945 INFO L82 PathProgramCache]: Analyzing trace with hash -70391296, now seen corresponding path program 1 times [2018-09-19 06:05:10,945 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:05:10,945 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 211 with the following transitions: [2018-09-19 06:05:10,946 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [237], [239], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [602], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:05:10,948 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:05:10,948 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:05:10,976 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:05:11,529 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:05:11,529 INFO L272 AbstractInterpreter]: Visited 105 different actions 407 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 06:05:11,567 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:05:11,821 INFO L232 lantSequenceWeakener]: Weakened 207 states. On average, predicates are now at 73.18% of their original sizes. [2018-09-19 06:05:11,821 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:05:12,033 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:05:12,033 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:05:12,033 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:05:12,033 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:05:12,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:05:12,034 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:05:12,034 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:05:12,034 INFO L87 Difference]: Start difference. First operand 2566 states and 3192 transitions. Second operand 10 states. [2018-09-19 06:05:13,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:05:13,856 INFO L93 Difference]: Finished difference Result 5163 states and 6584 transitions. [2018-09-19 06:05:13,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:05:13,858 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 210 [2018-09-19 06:05:13,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:05:13,867 INFO L225 Difference]: With dead ends: 5163 [2018-09-19 06:05:13,868 INFO L226 Difference]: Without dead ends: 2747 [2018-09-19 06:05:13,872 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 217 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:05:13,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2747 states. [2018-09-19 06:05:13,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2747 to 2721. [2018-09-19 06:05:13,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2721 states. [2018-09-19 06:05:13,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2721 states to 2721 states and 3412 transitions. [2018-09-19 06:05:13,929 INFO L78 Accepts]: Start accepts. Automaton has 2721 states and 3412 transitions. Word has length 210 [2018-09-19 06:05:13,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:05:13,930 INFO L480 AbstractCegarLoop]: Abstraction has 2721 states and 3412 transitions. [2018-09-19 06:05:13,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:05:13,930 INFO L276 IsEmpty]: Start isEmpty. Operand 2721 states and 3412 transitions. [2018-09-19 06:05:13,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-09-19 06:05:13,935 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:05:13,935 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:05:13,936 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:05:13,936 INFO L82 PathProgramCache]: Analyzing trace with hash 214731668, now seen corresponding path program 1 times [2018-09-19 06:05:13,936 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:05:13,936 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 217 with the following transitions: [2018-09-19 06:05:13,937 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [237], [239], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [626], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:05:13,939 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:05:13,939 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:05:13,963 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:05:14,134 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:05:14,134 INFO L272 AbstractInterpreter]: Visited 111 different actions 432 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 06:05:14,160 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:05:14,321 INFO L232 lantSequenceWeakener]: Weakened 213 states. On average, predicates are now at 73.17% of their original sizes. [2018-09-19 06:05:14,321 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:05:14,465 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:05:14,466 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:05:14,466 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:05:14,466 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:05:14,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:05:14,467 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:05:14,467 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:05:14,538 INFO L87 Difference]: Start difference. First operand 2721 states and 3412 transitions. Second operand 10 states. [2018-09-19 06:05:17,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:05:17,398 INFO L93 Difference]: Finished difference Result 5472 states and 7022 transitions. [2018-09-19 06:05:17,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:05:17,399 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 216 [2018-09-19 06:05:17,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:05:17,409 INFO L225 Difference]: With dead ends: 5472 [2018-09-19 06:05:17,409 INFO L226 Difference]: Without dead ends: 2901 [2018-09-19 06:05:17,414 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 223 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:05:17,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2018-09-19 06:05:17,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 2876. [2018-09-19 06:05:17,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2876 states. [2018-09-19 06:05:17,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2876 states to 2876 states and 3624 transitions. [2018-09-19 06:05:17,477 INFO L78 Accepts]: Start accepts. Automaton has 2876 states and 3624 transitions. Word has length 216 [2018-09-19 06:05:17,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:05:17,477 INFO L480 AbstractCegarLoop]: Abstraction has 2876 states and 3624 transitions. [2018-09-19 06:05:17,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:05:17,478 INFO L276 IsEmpty]: Start isEmpty. Operand 2876 states and 3624 transitions. [2018-09-19 06:05:17,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-09-19 06:05:17,483 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:05:17,483 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:05:17,486 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:05:17,486 INFO L82 PathProgramCache]: Analyzing trace with hash -849724805, now seen corresponding path program 1 times [2018-09-19 06:05:17,487 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:05:17,487 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 224 with the following transitions: [2018-09-19 06:05:17,487 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [237], [239], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:05:17,489 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:05:17,490 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:05:17,517 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:05:17,654 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:05:17,654 INFO L272 AbstractInterpreter]: Visited 118 different actions 459 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 06:05:17,662 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:05:17,789 INFO L232 lantSequenceWeakener]: Weakened 220 states. On average, predicates are now at 73.16% of their original sizes. [2018-09-19 06:05:17,789 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:05:17,875 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:05:17,875 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:05:17,875 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:05:17,875 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:05:17,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:05:17,876 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:05:17,876 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:05:17,877 INFO L87 Difference]: Start difference. First operand 2876 states and 3624 transitions. Second operand 10 states. [2018-09-19 06:05:19,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:05:19,807 INFO L93 Difference]: Finished difference Result 5959 states and 7691 transitions. [2018-09-19 06:05:19,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:05:19,807 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 223 [2018-09-19 06:05:19,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:05:19,818 INFO L225 Difference]: With dead ends: 5959 [2018-09-19 06:05:19,818 INFO L226 Difference]: Without dead ends: 3233 [2018-09-19 06:05:19,823 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 230 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:05:19,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3233 states. [2018-09-19 06:05:19,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3233 to 3184. [2018-09-19 06:05:19,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3184 states. [2018-09-19 06:05:19,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3184 states to 3184 states and 4030 transitions. [2018-09-19 06:05:19,896 INFO L78 Accepts]: Start accepts. Automaton has 3184 states and 4030 transitions. Word has length 223 [2018-09-19 06:05:19,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:05:19,896 INFO L480 AbstractCegarLoop]: Abstraction has 3184 states and 4030 transitions. [2018-09-19 06:05:19,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:05:19,896 INFO L276 IsEmpty]: Start isEmpty. Operand 3184 states and 4030 transitions. [2018-09-19 06:05:19,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-09-19 06:05:19,903 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:05:19,904 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:05:19,904 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:05:19,904 INFO L82 PathProgramCache]: Analyzing trace with hash -978187117, now seen corresponding path program 1 times [2018-09-19 06:05:19,904 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:05:19,905 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 232 with the following transitions: [2018-09-19 06:05:19,905 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [237], [239], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:05:19,907 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:05:19,907 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:05:19,960 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:05:20,089 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:05:20,089 INFO L272 AbstractInterpreter]: Visited 124 different actions 483 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 06:05:20,103 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:05:20,238 INFO L232 lantSequenceWeakener]: Weakened 228 states. On average, predicates are now at 73.14% of their original sizes. [2018-09-19 06:05:20,238 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:05:20,436 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:05:20,437 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:05:20,437 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:05:20,437 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:05:20,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:05:20,438 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:05:20,438 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:05:20,438 INFO L87 Difference]: Start difference. First operand 3184 states and 4030 transitions. Second operand 10 states. [2018-09-19 06:05:23,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:05:23,496 INFO L93 Difference]: Finished difference Result 6547 states and 8487 transitions. [2018-09-19 06:05:23,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:05:23,503 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 231 [2018-09-19 06:05:23,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:05:23,515 INFO L225 Difference]: With dead ends: 6547 [2018-09-19 06:05:23,515 INFO L226 Difference]: Without dead ends: 3513 [2018-09-19 06:05:23,521 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 238 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:05:23,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3513 states. [2018-09-19 06:05:23,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3513 to 3486. [2018-09-19 06:05:23,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3486 states. [2018-09-19 06:05:23,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3486 states to 3486 states and 4452 transitions. [2018-09-19 06:05:23,593 INFO L78 Accepts]: Start accepts. Automaton has 3486 states and 4452 transitions. Word has length 231 [2018-09-19 06:05:23,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:05:23,593 INFO L480 AbstractCegarLoop]: Abstraction has 3486 states and 4452 transitions. [2018-09-19 06:05:23,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:05:23,594 INFO L276 IsEmpty]: Start isEmpty. Operand 3486 states and 4452 transitions. [2018-09-19 06:05:23,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-09-19 06:05:23,601 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:05:23,602 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:05:23,602 INFO L423 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:05:23,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1391431203, now seen corresponding path program 1 times [2018-09-19 06:05:23,603 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:05:23,603 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 236 with the following transitions: [2018-09-19 06:05:23,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], [201], [209], [217], [225], [233], [237], [239], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [702], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:05:23,606 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:05:23,606 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:05:23,632 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:05:23,891 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:05:23,891 INFO L272 AbstractInterpreter]: Visited 130 different actions 634 times. Merged at 7 different actions 28 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 06:05:23,929 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:05:24,089 INFO L232 lantSequenceWeakener]: Weakened 232 states. On average, predicates are now at 73.13% of their original sizes. [2018-09-19 06:05:24,090 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:05:24,245 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:05:24,246 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:05:24,246 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:05:24,246 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:05:24,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:05:24,247 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:05:24,247 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:05:24,247 INFO L87 Difference]: Start difference. First operand 3486 states and 4452 transitions. Second operand 10 states. [2018-09-19 06:05:26,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:05:26,083 INFO L93 Difference]: Finished difference Result 7025 states and 9137 transitions. [2018-09-19 06:05:26,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:05:26,089 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 235 [2018-09-19 06:05:26,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:05:26,111 INFO L225 Difference]: With dead ends: 7025 [2018-09-19 06:05:26,112 INFO L226 Difference]: Without dead ends: 3689 [2018-09-19 06:05:26,120 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 242 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:05:26,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3689 states. [2018-09-19 06:05:26,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3689 to 3649. [2018-09-19 06:05:26,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3649 states. [2018-09-19 06:05:26,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3649 states to 3649 states and 4696 transitions. [2018-09-19 06:05:26,194 INFO L78 Accepts]: Start accepts. Automaton has 3649 states and 4696 transitions. Word has length 235 [2018-09-19 06:05:26,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:05:26,195 INFO L480 AbstractCegarLoop]: Abstraction has 3649 states and 4696 transitions. [2018-09-19 06:05:26,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:05:26,195 INFO L276 IsEmpty]: Start isEmpty. Operand 3649 states and 4696 transitions. [2018-09-19 06:05:26,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-09-19 06:05:26,203 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:05:26,204 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:05:26,204 INFO L423 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:05:26,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1320783664, now seen corresponding path program 1 times [2018-09-19 06:05:26,204 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:05:26,204 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 251 with the following transitions: [2018-09-19 06:05:26,205 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [237], [239], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [762], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:05:26,212 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:05:26,212 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:05:26,236 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:05:26,415 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-19 06:05:26,415 INFO L272 AbstractInterpreter]: Visited 146 different actions 568 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 06:05:26,421 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 06:05:26,460 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 06:05:26,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 06:05:26 BoogieIcfgContainer [2018-09-19 06:05:26,461 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 06:05:26,462 INFO L168 Benchmark]: Toolchain (without parser) took 61806.18 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.6 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -799.6 MB). Peak memory consumption was 800.6 MB. Max. memory is 7.1 GB. [2018-09-19 06:05:26,465 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 06:05:26,465 INFO L168 Benchmark]: CACSL2BoogieTranslator took 793.84 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-19 06:05:26,466 INFO L168 Benchmark]: Boogie Procedure Inliner took 111.75 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-19 06:05:26,467 INFO L168 Benchmark]: Boogie Preprocessor took 254.68 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 764.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -863.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 7.1 GB. [2018-09-19 06:05:26,468 INFO L168 Benchmark]: RCFGBuilder took 3269.47 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 95.9 MB). Peak memory consumption was 95.9 MB. Max. memory is 7.1 GB. [2018-09-19 06:05:26,472 INFO L168 Benchmark]: TraceAbstraction took 57366.69 ms. Allocated memory was 2.3 GB in the beginning and 3.1 GB in the end (delta: 835.7 MB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -98.9 MB). Peak memory consumption was 736.8 MB. Max. memory is 7.1 GB. [2018-09-19 06:05:26,482 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.20 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 793.84 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 111.75 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 254.68 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 764.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -863.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3269.47 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 95.9 MB). Peak memory consumption was 95.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 57366.69 ms. Allocated memory was 2.3 GB in the beginning and 3.1 GB in the end (delta: 835.7 MB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -98.9 MB). Peak memory consumption was 736.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 109]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L7] int inputC = 3; [L8] int inputD = 4; [L9] int inputE = 5; [L10] int inputF = 6; [L11] int inputB = 2; [L14] int a1 = 23; [L15] int a19 = 9; [L16] int a10 = 0; [L17] int a12 = 0; [L18] int a4 = 14; [L579] int output = -1; [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND TRUE ((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0))) [L211] a1 = (((a1 + -15535) - 211896) / 5) [L212] a10 = 2 [L214] RET return 22; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L425] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) [L430] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) [L436] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) [L442] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) [L448] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) [L454] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) [L460] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0))))) [L465] COND FALSE !(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14))))) [L471] COND FALSE !(( 218 < a1 && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))) [L476] COND FALSE !((((a12==0) && ((a19==9) && (((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3))) [L481] COND FALSE !((((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10))) [L487] COND FALSE !((((a19==10) && ((a10==1) && ((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (input == 5))))) && (a4==14))) [L493] COND FALSE !(((((a10==1) && (((input == 5) && 218 < a1 ) && (a4==14))) && (a19==10)) && (a12==0))) [L499] COND FALSE !((((a4==14) && ((a19==9) && ((input == 2) && (((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 ))))) && (a12==0))) [L504] COND FALSE !((((a4==14) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 2))) && (a12==0))) && (a10==4))) [L509] COND FALSE !(((a4==14) && (((a19==9) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 6)) && (a10==3))) && (a12==0)))) [L514] COND FALSE !((((a4==14) && ((((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a12==0))) && (a10==0))) [L517] COND FALSE !(((a12==0) && ((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 2)) && (a19==10))))) [L523] COND FALSE !((((a12==0) && ((a19==9) && ((a10==2) && ((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))))) && (a4==14))) [L526] COND FALSE !(((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)))))) [L529] COND FALSE !(((a19==9) && (((a10==1) && ((a12==0) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a4==14)))) [L534] COND TRUE ((a19==9) && ((a4==14) && ((a10==1) && (((input == 5) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a12==0))))) [L535] a1 = (((a1 + -438195) * 1) * 1) [L536] a10 = 2 [L537] a19 = 8 [L539] RET return -1; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND TRUE (((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)) [L109] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNKNOWN Result, 57.2s OverallTime, 16 OverallIterations, 3 TraceHistogramMax, 42.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2899 SDtfs, 8612 SDslu, 6018 SDs, 0 SdLazy, 29714 SolverSat, 2291 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 34.6s Time, PredicateUnifierStatistics: 30 DeclaredPredicates, 2792 GetRequests, 2567 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3649occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 6.3s AbstIntTime, 16 AbstIntIterations, 15 AbstIntStrong, 0.9964909136788442 AbsIntWeakeningRatio, 0.1319418561311964 AbsIntAvgWeakeningVarsNumRemoved, 18.982482295937384 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 15 MinimizatonAttempts, 322 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: No data available, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label43_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INT-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_06-05-26-496.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label43_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INT-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_06-05-26-496.csv Received shutdown request...