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/Problem11_label33_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 06:06:56,934 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 06:06:56,936 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 06:06:56,950 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 06:06:56,950 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 06:06:56,951 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 06:06:56,952 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 06:06:56,954 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 06:06:56,956 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 06:06:56,956 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 06:06:56,957 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 06:06:56,958 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 06:06:56,959 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 06:06:56,960 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 06:06:56,961 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 06:06:56,962 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 06:06:56,963 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 06:06:56,965 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 06:06:56,967 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 06:06:56,968 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 06:06:56,969 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 06:06:56,971 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 06:06:56,973 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 06:06:56,974 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 06:06:56,974 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 06:06:56,975 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 06:06:56,976 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 06:06:56,977 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 06:06:56,978 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 06:06:56,979 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 06:06:56,979 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 06:06:56,980 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 06:06:56,980 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 06:06:56,980 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 06:06:56,981 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 06:06:56,982 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 06:06:56,983 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:06:57,005 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 06:06:57,006 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 06:06:57,007 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 06:06:57,007 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 06:06:57,007 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 06:06:57,007 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 06:06:57,007 INFO L133 SettingsManager]: * Congruence Domain=false [2018-09-19 06:06:57,008 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 06:06:57,008 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-19 06:06:57,008 INFO L133 SettingsManager]: * Abstract domain=IntervalDomain [2018-09-19 06:06:57,008 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 06:06:57,008 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 06:06:57,009 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 06:06:57,009 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 06:06:57,009 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 06:06:57,010 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 06:06:57,010 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 06:06:57,010 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 06:06:57,010 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 06:06:57,010 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 06:06:57,011 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 06:06:57,011 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 06:06:57,011 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 06:06:57,011 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 06:06:57,011 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 06:06:57,012 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 06:06:57,012 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 06:06:57,012 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 06:06:57,012 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 06:06:57,012 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 06:06:57,013 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 06:06:57,013 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 06:06:57,013 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 06:06:57,013 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 06:06:57,013 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 06:06:57,056 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 06:06:57,069 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 06:06:57,075 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 06:06:57,077 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 06:06:57,077 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 06:06:57,078 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label33_true-unreach-call.c [2018-09-19 06:06:57,421 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0aa8a4a36/f2d2d253645343b7ae6395fda06137ce/FLAG14fa98fa5 [2018-09-19 06:06:57,684 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 06:06:57,685 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label33_true-unreach-call.c [2018-09-19 06:06:57,702 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0aa8a4a36/f2d2d253645343b7ae6395fda06137ce/FLAG14fa98fa5 [2018-09-19 06:06:57,725 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0aa8a4a36/f2d2d253645343b7ae6395fda06137ce [2018-09-19 06:06:57,736 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 06:06:57,740 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 06:06:57,741 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 06:06:57,741 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 06:06:57,748 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 06:06:57,749 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 06:06:57" (1/1) ... [2018-09-19 06:06:57,752 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11a614e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:06:57, skipping insertion in model container [2018-09-19 06:06:57,753 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 06:06:57" (1/1) ... [2018-09-19 06:06:57,765 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 06:06:58,488 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 06:06:58,521 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 06:06:58,805 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 06:06:58,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:06:58 WrapperNode [2018-09-19 06:06:58,880 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 06:06:58,881 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 06:06:58,882 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 06:06:58,882 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 06:06:58,894 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:06:58" (1/1) ... [2018-09-19 06:06:58,933 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:06:58" (1/1) ... [2018-09-19 06:06:59,030 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 06:06:59,031 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 06:06:59,031 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 06:06:59,031 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 06:06:59,299 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:06:58" (1/1) ... [2018-09-19 06:06:59,300 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:06:58" (1/1) ... [2018-09-19 06:06:59,314 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:06:58" (1/1) ... [2018-09-19 06:06:59,315 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:06:58" (1/1) ... [2018-09-19 06:06:59,395 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:06:58" (1/1) ... [2018-09-19 06:06:59,419 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:06:58" (1/1) ... [2018-09-19 06:06:59,450 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:06:58" (1/1) ... [2018-09-19 06:06:59,472 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 06:06:59,473 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 06:06:59,473 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 06:06:59,473 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 06:06:59,474 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:06:58" (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:06:59,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 06:06:59,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 06:06:59,547 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 06:06:59,547 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 06:06:59,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 06:06:59,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 06:06:59,548 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 06:06:59,548 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 06:07:04,117 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 06:07:04,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 06:07:04 BoogieIcfgContainer [2018-09-19 06:07:04,117 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 06:07:04,120 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 06:07:04,121 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 06:07:04,124 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 06:07:04,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 06:06:57" (1/3) ... [2018-09-19 06:07:04,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a3cd9cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 06:07:04, skipping insertion in model container [2018-09-19 06:07:04,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:06:58" (2/3) ... [2018-09-19 06:07:04,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a3cd9cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 06:07:04, skipping insertion in model container [2018-09-19 06:07:04,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 06:07:04" (3/3) ... [2018-09-19 06:07:04,128 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label33_true-unreach-call.c [2018-09-19 06:07:04,137 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 06:07:04,145 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 06:07:04,198 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 06:07:04,199 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 06:07:04,199 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 06:07:04,200 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 06:07:04,200 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 06:07:04,200 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 06:07:04,200 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 06:07:04,200 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 06:07:04,200 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 06:07:04,230 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states. [2018-09-19 06:07:04,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-19 06:07:04,238 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:07:04,239 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] [2018-09-19 06:07:04,240 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:07:04,246 INFO L82 PathProgramCache]: Analyzing trace with hash 303379937, now seen corresponding path program 1 times [2018-09-19 06:07:04,249 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:07:04,250 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-09-19 06:07:04,253 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], [181], [183], [1088], [1092], [1098], [1102], [1109], [1110], [1111], [1113] [2018-09-19 06:07:04,290 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:07:04,290 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:07:04,542 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:07:04,544 INFO L272 AbstractInterpreter]: Visited 34 different actions 34 times. Never merged. Never widened. Never found a fixpoint. Largest state had 27 variables. [2018-09-19 06:07:04,599 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:07:04,753 INFO L232 lantSequenceWeakener]: Weakened 32 states. On average, predicates are now at 73.89% of their original sizes. [2018-09-19 06:07:04,753 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:07:05,011 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:07:05,012 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:07:05,013 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 06:07:05,013 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:07:05,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 06:07:05,026 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 06:07:05,027 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 06:07:05,030 INFO L87 Difference]: Start difference. First operand 293 states. Second operand 6 states. [2018-09-19 06:07:08,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:07:08,429 INFO L93 Difference]: Finished difference Result 776 states and 1363 transitions. [2018-09-19 06:07:08,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 06:07:08,433 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-09-19 06:07:08,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:07:08,454 INFO L225 Difference]: With dead ends: 776 [2018-09-19 06:07:08,454 INFO L226 Difference]: Without dead ends: 481 [2018-09-19 06:07:08,467 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 34 GetRequests, 30 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:07:08,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2018-09-19 06:07:08,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 479. [2018-09-19 06:07:08,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-09-19 06:07:08,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 682 transitions. [2018-09-19 06:07:08,555 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 682 transitions. Word has length 35 [2018-09-19 06:07:08,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:07:08,555 INFO L480 AbstractCegarLoop]: Abstraction has 479 states and 682 transitions. [2018-09-19 06:07:08,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 06:07:08,556 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 682 transitions. [2018-09-19 06:07:08,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-09-19 06:07:08,564 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:07:08,564 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:08,564 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:07:08,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1702344025, now seen corresponding path program 1 times [2018-09-19 06:07:08,565 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:07:08,565 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 153 with the following transitions: [2018-09-19 06:07:08,566 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], [181], [183], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [710], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-09-19 06:07:08,576 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:07:08,576 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:07:08,802 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:07:09,178 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:07:09,178 INFO L272 AbstractInterpreter]: Visited 124 different actions 359 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-09-19 06:07:09,217 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:07:09,530 INFO L232 lantSequenceWeakener]: Weakened 149 states. On average, predicates are now at 73.3% of their original sizes. [2018-09-19 06:07:09,530 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:07:10,330 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:07:10,330 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:07:10,330 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:07:10,331 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:07:10,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:07:10,332 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:07:10,333 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:07:10,333 INFO L87 Difference]: Start difference. First operand 479 states and 682 transitions. Second operand 10 states. [2018-09-19 06:07:15,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:07:15,236 INFO L93 Difference]: Finished difference Result 960 states and 1546 transitions. [2018-09-19 06:07:15,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-19 06:07:15,238 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 152 [2018-09-19 06:07:15,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:07:15,245 INFO L225 Difference]: With dead ends: 960 [2018-09-19 06:07:15,245 INFO L226 Difference]: Without dead ends: 677 [2018-09-19 06:07:15,248 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 158 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 06:07:15,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2018-09-19 06:07:15,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 673. [2018-09-19 06:07:15,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2018-09-19 06:07:15,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 896 transitions. [2018-09-19 06:07:15,294 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 896 transitions. Word has length 152 [2018-09-19 06:07:15,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:07:15,295 INFO L480 AbstractCegarLoop]: Abstraction has 673 states and 896 transitions. [2018-09-19 06:07:15,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:07:15,296 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 896 transitions. [2018-09-19 06:07:15,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-09-19 06:07:15,306 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:07:15,307 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:15,307 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:07:15,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1026813709, now seen corresponding path program 1 times [2018-09-19 06:07:15,308 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:07:15,308 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 163 with the following transitions: [2018-09-19 06:07:15,308 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], [181], [183], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [750], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-09-19 06:07:15,320 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:07:15,320 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:07:15,453 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:07:15,633 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:07:15,633 INFO L272 AbstractInterpreter]: Visited 134 different actions 389 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-09-19 06:07:15,670 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:07:15,863 INFO L232 lantSequenceWeakener]: Weakened 159 states. On average, predicates are now at 73.29% of their original sizes. [2018-09-19 06:07:15,863 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:07:16,408 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:07:16,409 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:07:16,409 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:07:16,409 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:07:16,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:07:16,410 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:07:16,410 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:07:16,410 INFO L87 Difference]: Start difference. First operand 673 states and 896 transitions. Second operand 10 states. [2018-09-19 06:07:19,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:07:19,491 INFO L93 Difference]: Finished difference Result 1155 states and 1764 transitions. [2018-09-19 06:07:19,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-19 06:07:19,492 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 162 [2018-09-19 06:07:19,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:07:19,497 INFO L225 Difference]: With dead ends: 1155 [2018-09-19 06:07:19,498 INFO L226 Difference]: Without dead ends: 872 [2018-09-19 06:07:19,499 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 168 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 06:07:19,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2018-09-19 06:07:19,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 864. [2018-09-19 06:07:19,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2018-09-19 06:07:19,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1120 transitions. [2018-09-19 06:07:19,526 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1120 transitions. Word has length 162 [2018-09-19 06:07:19,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:07:19,527 INFO L480 AbstractCegarLoop]: Abstraction has 864 states and 1120 transitions. [2018-09-19 06:07:19,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:07:19,527 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1120 transitions. [2018-09-19 06:07:19,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-09-19 06:07:19,531 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:07:19,531 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:19,532 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:07:19,532 INFO L82 PathProgramCache]: Analyzing trace with hash 422545541, now seen corresponding path program 1 times [2018-09-19 06:07:19,532 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:07:19,532 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 168 with the following transitions: [2018-09-19 06:07:19,533 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], [181], [183], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [769], [772], [776], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-09-19 06:07:19,538 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:07:19,538 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:07:19,644 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:07:19,835 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:07:19,835 INFO L272 AbstractInterpreter]: Visited 139 different actions 404 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-09-19 06:07:19,876 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:07:20,058 INFO L232 lantSequenceWeakener]: Weakened 164 states. On average, predicates are now at 73.35% of their original sizes. [2018-09-19 06:07:20,058 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:07:20,213 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:07:20,214 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:07:20,214 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-19 06:07:20,214 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:07:20,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-19 06:07:20,215 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-19 06:07:20,215 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-09-19 06:07:20,216 INFO L87 Difference]: Start difference. First operand 864 states and 1120 transitions. Second operand 12 states. [2018-09-19 06:07:27,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:07:27,025 INFO L93 Difference]: Finished difference Result 2155 states and 3386 transitions. [2018-09-19 06:07:27,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-19 06:07:27,031 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 167 [2018-09-19 06:07:27,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:07:27,045 INFO L225 Difference]: With dead ends: 2155 [2018-09-19 06:07:27,045 INFO L226 Difference]: Without dead ends: 1872 [2018-09-19 06:07:27,048 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 181 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2018-09-19 06:07:27,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1872 states. [2018-09-19 06:07:27,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1872 to 1848. [2018-09-19 06:07:27,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2018-09-19 06:07:27,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2389 transitions. [2018-09-19 06:07:27,113 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2389 transitions. Word has length 167 [2018-09-19 06:07:27,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:07:27,114 INFO L480 AbstractCegarLoop]: Abstraction has 1848 states and 2389 transitions. [2018-09-19 06:07:27,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-19 06:07:27,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2389 transitions. [2018-09-19 06:07:27,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-09-19 06:07:27,119 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:07:27,119 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:27,120 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:07:27,120 INFO L82 PathProgramCache]: Analyzing trace with hash 121700698, now seen corresponding path program 1 times [2018-09-19 06:07:27,120 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:07:27,120 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 184 with the following transitions: [2018-09-19 06:07:27,122 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], [181], [183], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [777], [781], [785], [789], [793], [797], [808], [812], [816], [820], [824], [828], [832], [843], [847], [851], [862], [866], [869], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-09-19 06:07:27,138 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:07:27,138 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:07:27,265 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:07:27,429 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:07:27,429 INFO L272 AbstractInterpreter]: Visited 155 different actions 452 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-09-19 06:07:27,435 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:07:27,593 INFO L232 lantSequenceWeakener]: Weakened 180 states. On average, predicates are now at 73.26% of their original sizes. [2018-09-19 06:07:27,593 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:07:27,709 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:07:27,709 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:07:27,709 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:07:27,710 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:07:27,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:07:27,710 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:07:27,711 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:07:27,711 INFO L87 Difference]: Start difference. First operand 1848 states and 2389 transitions. Second operand 10 states. [2018-09-19 06:07:32,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:07:32,016 INFO L93 Difference]: Finished difference Result 3701 states and 4980 transitions. [2018-09-19 06:07:32,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-19 06:07:32,016 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 183 [2018-09-19 06:07:32,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:07:32,028 INFO L225 Difference]: With dead ends: 3701 [2018-09-19 06:07:32,028 INFO L226 Difference]: Without dead ends: 2241 [2018-09-19 06:07:32,033 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 189 GetRequests, 174 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:07:32,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2241 states. [2018-09-19 06:07:32,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2241 to 2233. [2018-09-19 06:07:32,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2233 states. [2018-09-19 06:07:32,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2233 states to 2233 states and 2828 transitions. [2018-09-19 06:07:32,088 INFO L78 Accepts]: Start accepts. Automaton has 2233 states and 2828 transitions. Word has length 183 [2018-09-19 06:07:32,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:07:32,089 INFO L480 AbstractCegarLoop]: Abstraction has 2233 states and 2828 transitions. [2018-09-19 06:07:32,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:07:32,089 INFO L276 IsEmpty]: Start isEmpty. Operand 2233 states and 2828 transitions. [2018-09-19 06:07:32,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-09-19 06:07:32,093 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:07:32,093 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 06:07:32,094 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:07:32,094 INFO L82 PathProgramCache]: Analyzing trace with hash 479327627, now seen corresponding path program 1 times [2018-09-19 06:07:32,094 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:07:32,095 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 234 with the following transitions: [2018-09-19 06:07:32,095 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], [181], [183], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [538], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [710], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-09-19 06:07:32,099 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:07:32,099 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:07:32,178 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:07:32,500 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:07:32,500 INFO L272 AbstractInterpreter]: Visited 125 different actions 487 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 28 variables. [2018-09-19 06:07:32,531 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:07:32,753 INFO L232 lantSequenceWeakener]: Weakened 230 states. On average, predicates are now at 73.26% of their original sizes. [2018-09-19 06:07:32,754 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:07:32,840 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:07:32,840 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:07:32,840 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:07:32,840 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:07:32,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:07:32,841 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:07:32,841 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:07:32,841 INFO L87 Difference]: Start difference. First operand 2233 states and 2828 transitions. Second operand 10 states. [2018-09-19 06:07:35,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:07:35,243 INFO L93 Difference]: Finished difference Result 4110 states and 5580 transitions. [2018-09-19 06:07:35,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-19 06:07:35,247 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 233 [2018-09-19 06:07:35,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:07:35,265 INFO L225 Difference]: With dead ends: 4110 [2018-09-19 06:07:35,265 INFO L226 Difference]: Without dead ends: 3033 [2018-09-19 06:07:35,280 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 239 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 06:07:35,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3033 states. [2018-09-19 06:07:35,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3033 to 3017. [2018-09-19 06:07:35,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3017 states. [2018-09-19 06:07:35,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3017 states to 3017 states and 3772 transitions. [2018-09-19 06:07:35,355 INFO L78 Accepts]: Start accepts. Automaton has 3017 states and 3772 transitions. Word has length 233 [2018-09-19 06:07:35,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:07:35,356 INFO L480 AbstractCegarLoop]: Abstraction has 3017 states and 3772 transitions. [2018-09-19 06:07:35,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:07:35,356 INFO L276 IsEmpty]: Start isEmpty. Operand 3017 states and 3772 transitions. [2018-09-19 06:07:35,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-09-19 06:07:35,363 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:07:35,364 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:07:35,364 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:07:35,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1140798419, now seen corresponding path program 1 times [2018-09-19 06:07:35,364 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:07:35,364 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 238 with the following transitions: [2018-09-19 06:07:35,365 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], [181], [183], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [554], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [710], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-09-19 06:07:35,368 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:07:35,368 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:07:35,444 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:07:35,836 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:07:35,836 INFO L272 AbstractInterpreter]: Visited 125 different actions 608 times. Merged at 7 different actions 27 times. Never widened. Found 5 fixpoints after 1 different actions. Largest state had 28 variables. [2018-09-19 06:07:35,862 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:07:36,080 INFO L232 lantSequenceWeakener]: Weakened 234 states. On average, predicates are now at 73.25% of their original sizes. [2018-09-19 06:07:36,081 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:07:36,171 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:07:36,171 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:07:36,171 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:07:36,171 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:07:36,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:07:36,172 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:07:36,172 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:07:36,173 INFO L87 Difference]: Start difference. First operand 3017 states and 3772 transitions. Second operand 10 states. [2018-09-19 06:07:40,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:07:40,302 INFO L93 Difference]: Finished difference Result 6606 states and 8928 transitions. [2018-09-19 06:07:40,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:07:40,310 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 237 [2018-09-19 06:07:40,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:07:40,329 INFO L225 Difference]: With dead ends: 6606 [2018-09-19 06:07:40,329 INFO L226 Difference]: Without dead ends: 4744 [2018-09-19 06:07:40,337 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 244 GetRequests, 228 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:07:40,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4744 states. [2018-09-19 06:07:40,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4744 to 4694. [2018-09-19 06:07:40,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4694 states. [2018-09-19 06:07:40,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4694 states to 4694 states and 5884 transitions. [2018-09-19 06:07:40,443 INFO L78 Accepts]: Start accepts. Automaton has 4694 states and 5884 transitions. Word has length 237 [2018-09-19 06:07:40,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:07:40,444 INFO L480 AbstractCegarLoop]: Abstraction has 4694 states and 5884 transitions. [2018-09-19 06:07:40,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:07:40,444 INFO L276 IsEmpty]: Start isEmpty. Operand 4694 states and 5884 transitions. [2018-09-19 06:07:40,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-09-19 06:07:40,449 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:07:40,449 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:07:40,450 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:07:40,450 INFO L82 PathProgramCache]: Analyzing trace with hash 460189648, now seen corresponding path program 1 times [2018-09-19 06:07:40,450 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:07:40,450 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 241 with the following transitions: [2018-09-19 06:07:40,451 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [181], [183], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [750], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-09-19 06:07:40,454 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:07:40,454 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:07:40,536 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:07:40,735 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:07:40,736 INFO L272 AbstractInterpreter]: Visited 135 different actions 527 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 28 variables. [2018-09-19 06:07:40,740 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:07:40,896 INFO L232 lantSequenceWeakener]: Weakened 237 states. On average, predicates are now at 73.25% of their original sizes. [2018-09-19 06:07:40,897 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:07:40,991 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:07:40,992 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:07:40,992 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:07:40,992 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:07:40,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:07:40,993 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:07:40,993 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:07:40,993 INFO L87 Difference]: Start difference. First operand 4694 states and 5884 transitions. Second operand 10 states. [2018-09-19 06:07:44,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:07:44,387 INFO L93 Difference]: Finished difference Result 7516 states and 9723 transitions. [2018-09-19 06:07:44,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-19 06:07:44,389 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 240 [2018-09-19 06:07:44,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:07:44,408 INFO L225 Difference]: With dead ends: 7516 [2018-09-19 06:07:44,408 INFO L226 Difference]: Without dead ends: 5098 [2018-09-19 06:07:44,415 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 246 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 06:07:44,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5098 states. [2018-09-19 06:07:44,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5098 to 5080. [2018-09-19 06:07:44,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5080 states. [2018-09-19 06:07:44,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5080 states to 5080 states and 6328 transitions. [2018-09-19 06:07:44,524 INFO L78 Accepts]: Start accepts. Automaton has 5080 states and 6328 transitions. Word has length 240 [2018-09-19 06:07:44,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:07:44,525 INFO L480 AbstractCegarLoop]: Abstraction has 5080 states and 6328 transitions. [2018-09-19 06:07:44,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:07:44,525 INFO L276 IsEmpty]: Start isEmpty. Operand 5080 states and 6328 transitions. [2018-09-19 06:07:44,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-09-19 06:07:44,532 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:07:44,533 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:07:44,533 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:07:44,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1148480997, now seen corresponding path program 1 times [2018-09-19 06:07:44,533 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:07:44,534 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 242 with the following transitions: [2018-09-19 06:07:44,534 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], [181], [183], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [570], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [710], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-09-19 06:07:44,537 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:07:44,537 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:07:44,618 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:07:45,138 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:07:45,138 INFO L272 AbstractInterpreter]: Visited 125 different actions 608 times. Merged at 7 different actions 27 times. Never widened. Found 5 fixpoints after 1 different actions. Largest state had 28 variables. [2018-09-19 06:07:45,178 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:07:45,421 INFO L232 lantSequenceWeakener]: Weakened 238 states. On average, predicates are now at 73.25% of their original sizes. [2018-09-19 06:07:45,421 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:07:45,539 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:07:45,539 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:07:45,539 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:07:45,539 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:07:45,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:07:45,540 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:07:45,540 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:07:45,540 INFO L87 Difference]: Start difference. First operand 5080 states and 6328 transitions. Second operand 10 states. [2018-09-19 06:07:50,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:07:50,407 INFO L93 Difference]: Finished difference Result 10216 states and 13294 transitions. [2018-09-19 06:07:50,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:07:50,410 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 241 [2018-09-19 06:07:50,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:07:50,439 INFO L225 Difference]: With dead ends: 10216 [2018-09-19 06:07:50,439 INFO L226 Difference]: Without dead ends: 7992 [2018-09-19 06:07:50,447 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 248 GetRequests, 232 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:07:50,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7992 states. [2018-09-19 06:07:50,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7992 to 7861. [2018-09-19 06:07:50,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7861 states. [2018-09-19 06:07:50,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7861 states to 7861 states and 10044 transitions. [2018-09-19 06:07:50,599 INFO L78 Accepts]: Start accepts. Automaton has 7861 states and 10044 transitions. Word has length 241 [2018-09-19 06:07:50,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:07:50,600 INFO L480 AbstractCegarLoop]: Abstraction has 7861 states and 10044 transitions. [2018-09-19 06:07:50,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:07:50,600 INFO L276 IsEmpty]: Start isEmpty. Operand 7861 states and 10044 transitions. [2018-09-19 06:07:50,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-09-19 06:07:50,605 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:07:50,605 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 06:07:50,605 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:07:50,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1085980300, now seen corresponding path program 1 times [2018-09-19 06:07:50,606 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:07:50,606 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 243 with the following transitions: [2018-09-19 06:07:50,606 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], [181], [183], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [574], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [710], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-09-19 06:07:50,609 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:07:50,610 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:07:50,680 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:07:50,931 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:07:50,931 INFO L272 AbstractInterpreter]: Visited 125 different actions 608 times. Merged at 7 different actions 27 times. Never widened. Found 5 fixpoints after 1 different actions. Largest state had 28 variables. [2018-09-19 06:07:50,966 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:07:51,235 INFO L232 lantSequenceWeakener]: Weakened 239 states. On average, predicates are now at 73.25% of their original sizes. [2018-09-19 06:07:51,236 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:07:51,328 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:07:51,328 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:07:51,329 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:07:51,329 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:07:51,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:07:51,329 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:07:51,330 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:07:51,330 INFO L87 Difference]: Start difference. First operand 7861 states and 10044 transitions. Second operand 10 states. [2018-09-19 06:07:55,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:07:55,454 INFO L93 Difference]: Finished difference Result 12733 states and 16772 transitions. [2018-09-19 06:07:55,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-19 06:07:55,454 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 242 [2018-09-19 06:07:55,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:07:55,493 INFO L225 Difference]: With dead ends: 12733 [2018-09-19 06:07:55,493 INFO L226 Difference]: Without dead ends: 8264 [2018-09-19 06:07:55,505 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 248 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 06:07:55,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8264 states. [2018-09-19 06:07:55,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8264 to 8247. [2018-09-19 06:07:55,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8247 states. [2018-09-19 06:07:55,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8247 states to 8247 states and 10527 transitions. [2018-09-19 06:07:55,648 INFO L78 Accepts]: Start accepts. Automaton has 8247 states and 10527 transitions. Word has length 242 [2018-09-19 06:07:55,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:07:55,649 INFO L480 AbstractCegarLoop]: Abstraction has 8247 states and 10527 transitions. [2018-09-19 06:07:55,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:07:55,649 INFO L276 IsEmpty]: Start isEmpty. Operand 8247 states and 10527 transitions. [2018-09-19 06:07:55,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-09-19 06:07:55,655 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:07:55,656 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 06:07:55,656 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:07:55,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1773501015, now seen corresponding path program 1 times [2018-09-19 06:07:55,657 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:07:55,657 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 244 with the following transitions: [2018-09-19 06:07:55,657 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], [181], [183], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [538], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [750], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-09-19 06:07:55,660 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:07:55,661 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:07:55,744 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:07:56,020 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-19 06:07:56,021 INFO L272 AbstractInterpreter]: Visited 136 different actions 529 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 28 variables. [2018-09-19 06:07:56,062 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 06:07:56,120 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 06:07:56,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 06:07:56 BoogieIcfgContainer [2018-09-19 06:07:56,120 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 06:07:56,121 INFO L168 Benchmark]: Toolchain (without parser) took 58384.34 ms. Allocated memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: 1.5 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -690.0 MB). Peak memory consumption was 774.9 MB. Max. memory is 7.1 GB. [2018-09-19 06:07:56,124 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:07:56,124 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1139.76 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2018-09-19 06:07:56,125 INFO L168 Benchmark]: Boogie Procedure Inliner took 148.85 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-19 06:07:56,126 INFO L168 Benchmark]: Boogie Preprocessor took 441.53 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 814.2 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -937.2 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2018-09-19 06:07:56,128 INFO L168 Benchmark]: RCFGBuilder took 4644.89 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 173.4 MB). Peak memory consumption was 173.4 MB. Max. memory is 7.1 GB. [2018-09-19 06:07:56,129 INFO L168 Benchmark]: TraceAbstraction took 52000.02 ms. Allocated memory was 2.3 GB in the beginning and 3.0 GB in the end (delta: 650.6 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: -21.3 MB). Peak memory consumption was 629.3 MB. Max. memory is 7.1 GB. [2018-09-19 06:07:56,137 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 1139.76 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 148.85 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 441.53 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 814.2 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -937.2 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4644.89 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 173.4 MB). Peak memory consumption was 173.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 52000.02 ms. Allocated memory was 2.3 GB in the beginning and 3.0 GB in the end (delta: 650.6 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: -21.3 MB). Peak memory consumption was 629.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 90]: 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 inputA = 1; [L8] int inputD = 4; [L9] int inputB = 2; [L10] int inputE = 5; [L11] int inputF = 6; [L12] int inputC = 3; [L15] int a29 = 130; [L16] int a4 = 1; [L17] int a23 = 312; [L18] int a8 = 15; [L19] int a25 = 10; [L20] int a3 = 1; [L1031] int output = -1; [L1034] COND TRUE 1 [L1037] int input; [L1038] input = __VERIFIER_nondet_int() [L1039] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1042] CALL, EXPR calculate_output(input) [L23] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L26] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L29] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L32] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L35] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L38] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L41] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L44] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L47] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L50] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L53] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L56] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L59] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L62] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L65] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L68] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L71] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L74] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L77] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L80] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L83] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L86] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L89] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L92] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L95] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L98] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L101] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L104] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L107] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L110] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L113] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L116] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L119] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L122] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L125] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L128] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L131] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L134] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L137] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L140] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L143] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L146] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L149] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L152] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L155] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L158] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L161] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L164] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L167] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L170] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L173] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L176] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L179] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L182] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && 306 < a23 ) && (a8==15))) [L185] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L188] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L191] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L194] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L197] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L200] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L203] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L207] COND FALSE !((( ((140 < a29) && (245 >= a29)) && ((a25==12) && ( a23 <= -43 && ((a8==15) && ((input == 6) && (a3==1)))))) && !(a4==1))) [L214] COND FALSE !((!(a4==1) && (((a3==1) && ((((((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 4)) && a23 <= -43 )) && (a8==15)))) [L221] COND FALSE !(((a25==11) && (!(a4==1) && (((((input == 2) && (a3==1)) && a23 <= -43 ) && (a8==15)) && ((245 < a29) && (277 >= a29)) )))) [L227] COND FALSE !(((( a29 <= 140 && ((a3==1) && (((input == 5) && (a25==13)) && (a4==1)))) && (a8==15)) && 306 < a23 )) [L233] COND FALSE !((((a8==15) && (((((((a4==1) && 277 < a29 ) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 )) && (input == 6))) && (a3==1))) [L240] COND FALSE !(((((input == 4) && (( a23 <= -43 && ((a25==9) && (!(a4==1) && a29 <= 140 ))) || (((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && ((a25==13) && ( 277 < a29 && (a4==1))))))) && (a8==15)) && (a3==1))) [L247] COND FALSE !((((a3==1) && (!(a4==1) && (( a29 <= 140 && ((input == 1) && ((a25==12) || ((a25==10) || (a25==11))))) && ((-43 < a23) && (138 >= a23)) ))) && (a8==15))) [L254] COND FALSE !(((( ((245 < a29) && (277 >= a29)) && (( a23 <= -43 && (!(a4==1) && (input == 1))) && (a25==11))) && (a8==15)) && (a3==1))) [L260] COND FALSE !(((((a4==1) && (((input == 1) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))) && (a8==15))) && 306 < a23 ) && (a3==1))) [L265] COND FALSE !((( 277 < a29 && (((a8==15) && ( a23 <= -43 && ((input == 2) && (a3==1)))) && !(a4==1))) && (a25==13))) [L268] COND FALSE !(( a29 <= 140 && ((((a8==15) && ((a3==1) && ((input == 1) && ((a25==12) || (a25==13))))) && !(a4==1)) && a23 <= -43 ))) [L275] COND FALSE !((((a4==1) && ((a8==15) && (((a3==1) && (((a25==9) || (a25==10)) && (input == 5))) && ((140 < a29) && (245 >= a29)) ))) && 306 < a23 )) [L280] COND FALSE !(((a3==1) && (((((input == 5) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ( ((245 < a29) && (277 >= a29)) && (a25==9))))) && (a8==15)) && !(a4==1)) && a23 <= -43 ))) [L287] COND FALSE !(((a8==15) && ((((!(a4==1) && (((a25==12) || (a25==13)) && (input == 4))) && a23 <= -43 ) && a29 <= 140 ) && (a3==1)))) [L294] COND FALSE !(((a8==15) && (!(a4==1) && ( a23 <= -43 && ((a3==1) && ( 277 < a29 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 6)))))))) [L299] COND FALSE !(( 306 < a23 && (((a8==15) && ((a3==1) && ((a4==1) && (((a25==11) || (a25==12)) && (input == 6))))) && ((140 < a29) && (245 >= a29)) ))) [L305] COND FALSE !(((((a8==15) && ( a29 <= 140 && ( a23 <= -43 && ((input == 2) && ((a25==10) || (a25==11)))))) && !(a4==1)) && (a3==1))) [L310] COND FALSE !(((a3==1) && ( ((245 < a29) && (277 >= a29)) && (((a4==1) && ((a8==15) && ((((a25==11) || (a25==12)) || (a25==13)) && (input == 5)))) && 306 < a23 )))) [L317] COND FALSE !(((((a8==15) && (((a4==1) && ((input == 2) && ((a25==13) || ((a25==11) || (a25==12))))) && ((245 < a29) && (277 >= a29)) )) && 306 < a23 ) && (a3==1))) [L322] COND FALSE !((( 306 < a23 && ((a8==15) && ((((input == 6) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a4==1))) [L329] COND FALSE !(((((a8==15) && (((((a25==11) || (a25==12)) && (input == 4)) && 306 < a23 ) && (a3==1))) && (a4==1)) && ((140 < a29) && (245 >= a29)) )) [L334] COND FALSE !(( a23 <= -43 && ( ((140 < a29) && (245 >= a29)) && (((a8==15) && (((input == 4) && ((a25==11) || ((a25==9) || (a25==10)))) && !(a4==1))) && (a3==1))))) [L340] COND FALSE !((((((((((a25==12) && ((245 < a29) && (277 >= a29)) ) || ((a25==13) && ((245 < a29) && (277 >= a29)) )) || ( 277 < a29 && (a25==9))) && (input == 1)) && a23 <= -43 ) && (a8==15)) && !(a4==1)) && (a3==1))) [L346] COND FALSE !((!(a4==1) && ( a29 <= 140 && ((((((a25==12) || (a25==13)) && (input == 2)) && a23 <= -43 ) && (a3==1)) && (a8==15))))) [L353] COND FALSE !(((a8==15) && (( 306 < a23 && ((a3==1) && ((input == 4) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))))) && (a4==1)))) [L358] COND FALSE !(((((input == 3) && (( a23 <= -43 && ((!(a4==1) && a29 <= 140 ) && (a25==9))) || (( 306 < a23 && (( 277 < a29 && (a4==1)) && (a25==12))) || ((((a4==1) && 277 < a29 ) && (a25==13)) && 306 < a23 )))) && (a3==1)) && (a8==15))) [L365] COND FALSE !(( 306 < a23 && ((a4==1) && (((((((a25==11) || (a25==12)) || (a25==13)) && (input == 3)) && (a8==15)) && (a3==1)) && ((245 < a29) && (277 >= a29)) )))) [L370] COND FALSE !(( ((245 < a29) && (277 >= a29)) && (((((!(a4==1) && (input == 6)) && (a3==1)) && (a25==11)) && (a8==15)) && a23 <= -43 ))) [L377] COND FALSE !((( ((-43 < a23) && (138 >= a23)) && (((a8==15) && ((input == 2) && ((( a29 <= 140 && (a25==13)) || ( ((140 < a29) && (245 >= a29)) && (a25==9))) || ((a25==10) && ((140 < a29) && (245 >= a29)) )))) && (a3==1))) && !(a4==1))) [L384] COND FALSE !(( a29 <= 140 && ((a8==15) && ((((((a25==10) || (a25==11)) && (input == 3)) && a23 <= -43 ) && (a3==1)) && !(a4==1))))) [L391] COND FALSE !((((((a8==15) && (((input == 3) && (((a25==10) || (a25==11)) || (a25==12))) && (a3==1))) && a23 <= -43 ) && !(a4==1)) && 277 < a29 )) [L398] COND FALSE !(((!(a4==1) && ((a25==9) && ((a8==15) && ((a3==1) && ( ((-43 < a23) && (138 >= a23)) && (input == 1)))))) && a29 <= 140 )) [L411] COND FALSE !(((a8==15) && ((( 306 < a23 && (((((a25==11) || (a25==12)) || (a25==13)) && (input == 6)) && ((245 < a29) && (277 >= a29)) )) && (a4==1)) && (a3==1)))) [L417] COND FALSE !((((((!(a4==1) && ((a8==15) && (input == 2))) && (a3==1)) && ((140 < a29) && (245 >= a29)) ) && (a25==12)) && a23 <= -43 )) [L422] COND FALSE !(( a23 <= -43 && (( a29 <= 140 && ((a8==15) && (!(a4==1) && (((a25==12) || (a25==13)) && (input == 3))))) && (a3==1)))) [L429] COND FALSE !(((((((input == 6) && ((((a25==13) && a29 <= 140 ) || ( ((140 < a29) && (245 >= a29)) && (a25==9))) || ( ((140 < a29) && (245 >= a29)) && (a25==10)))) && (a8==15)) && (a3==1)) && !(a4==1)) && ((-43 < a23) && (138 >= a23)) )) [L436] COND FALSE !(((!(a4==1) && (((((a3==1) && (input == 4)) && (a25==11)) && ((245 < a29) && (277 >= a29)) ) && a23 <= -43 )) && (a8==15))) [L443] COND FALSE !(((a3==1) && ( ((140 < a29) && (245 >= a29)) && ( a23 <= -43 && ((a8==15) && (!(a4==1) && ((((a25==9) || (a25==10)) || (a25==11)) && (input == 3)))))))) [L450] COND FALSE !(((((!(a4==1) && (((((a25==10) || (a25==11)) || (a25==12)) && (input == 4)) && 277 < a29 )) && a23 <= -43 ) && (a8==15)) && (a3==1))) [L456] COND FALSE !(( ((140 < a29) && (245 >= a29)) && ((a8==15) && (((a25==12) && (!(a4==1) && ( a23 <= -43 && (input == 4)))) && (a3==1))))) [L463] COND FALSE !(((a3==1) && ((((((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || (((a25==9) && (!(a4==1) && a29 <= 140 )) && a23 <= -43 )) && (input == 2)) && (a8==15)))) [L470] COND FALSE !(((((input == 5) && (((((a25==12) && ((a4==1) && 277 < a29 )) && 306 < a23 ) || ((( 277 < a29 && (a4==1)) && (a25==13)) && 306 < a23 )) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 ))) && (a8==15)) && (a3==1))) [L477] COND FALSE !(((a25==12) && (((a3==1) && ((((input == 1) && a23 <= -43 ) && ((140 < a29) && (245 >= a29)) ) && !(a4==1))) && (a8==15)))) [L487] COND FALSE !((((a8==15) && (( ((-43 < a23) && (138 >= a23)) && ((input == 1) && (( ((140 < a29) && (245 >= a29)) && (a25==10)) || (((a25==13) && a29 <= 140 ) || ((a25==9) && ((140 < a29) && (245 >= a29)) ))))) && (a3==1))) && !(a4==1))) [L500] COND FALSE !(((a3==1) && ((a8==15) && (((((( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 3)) && !(a4==1)) && a23 <= -43 )))) [L507] COND FALSE !((( a29 <= 140 && ( ((-43 < a23) && (138 >= a23)) && ((a3==1) && ((a8==15) && (((a25==12) || ((a25==10) || (a25==11))) && (input == 2)))))) && !(a4==1))) [L514] COND FALSE !((((a4==1) && ( 306 < a23 && ((((input == 3) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a8==15))) [L526] COND FALSE !(((a4==1) && ((((a3==1) && ( 306 < a23 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 4)))) && a29 <= 140 ) && (a8==15)))) [L531] COND FALSE !((((( ((-43 < a23) && (138 >= a23)) && ((!(a4==1) && (input == 5)) && (a3==1))) && (a25==9)) && a29 <= 140 ) && (a8==15))) [L537] COND FALSE !(( 306 < a23 && (((a8==15) && ((((input == 1) && ((a25==11) || (a25==12))) && (a4==1)) && (a3==1))) && ((140 < a29) && (245 >= a29)) ))) [L542] COND FALSE !(((((a8==15) && ( a23 <= -43 && (((input == 1) && ((a25==10) || (a25==11))) && a29 <= 140 ))) && !(a4==1)) && (a3==1))) [L549] COND FALSE !(((( a23 <= -43 && (!(a4==1) && ((a3==1) && (((a25==11) || ((a25==9) || (a25==10))) && (input == 5))))) && (a8==15)) && ((140 < a29) && (245 >= a29)) )) [L555] COND FALSE !(((a3==1) && ( ((-43 < a23) && (138 >= a23)) && ((a8==15) && ((((((a25==10) || (a25==11)) || (a25==12)) && (input == 5)) && a29 <= 140 ) && !(a4==1)))))) [L561] COND FALSE !(( 306 < a23 && (((a3==1) && ( 277 < a29 && (((input == 4) && (((a25==9) || (a25==10)) || (a25==11))) && (a8==15)))) && (a4==1)))) [L566] COND FALSE !((!(a4==1) && ( a23 <= -43 && ((a8==15) && (((((a25==12) || ((a25==10) || (a25==11))) && (input == 1)) && (a3==1)) && 277 < a29 ))))) [L572] COND FALSE !(( 277 < a29 && (((a25==13) && ( a23 <= -43 && (!(a4==1) && ((input == 1) && (a3==1))))) && (a8==15)))) [L575] COND FALSE !(((( ((-43 < a23) && (138 >= a23)) && (((a25==9) && ((input == 4) && !(a4==1))) && a29 <= 140 )) && (a3==1)) && (a8==15))) [L581] COND TRUE ((a8==15) && ((((a3==1) && (((((a25==10) || (a25==11)) || (a25==12)) && (input == 3)) && (a4==1))) && 306 < a23 ) && a29 <= 140 )) [L582] a29 = (((((a29 - 0) % 15)+ 262) + 241270) + -241271) [L583] a25 = 12 [L585] RET return 24; [L1042] EXPR calculate_output(input) [L1042] output = calculate_output(input) [L1034] COND TRUE 1 [L1037] int input; [L1038] input = __VERIFIER_nondet_int() [L1039] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1042] CALL, EXPR calculate_output(input) [L23] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L26] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L29] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L32] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L35] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L38] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L41] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L44] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L47] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L50] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L53] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L56] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L59] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L62] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L65] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L68] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L71] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L74] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L77] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L80] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L83] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L86] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L89] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L92] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L95] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L98] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L101] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L104] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L107] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L110] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L113] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L116] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L119] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L122] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L125] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L128] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L131] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L134] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L137] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L140] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L143] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L146] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L149] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L152] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L155] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L158] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L161] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L164] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L167] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L170] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L173] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L176] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L179] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L182] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && 306 < a23 ) && (a8==15))) [L185] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L188] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L191] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L194] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L197] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L200] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L203] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L207] COND FALSE !((( ((140 < a29) && (245 >= a29)) && ((a25==12) && ( a23 <= -43 && ((a8==15) && ((input == 6) && (a3==1)))))) && !(a4==1))) [L214] COND FALSE !((!(a4==1) && (((a3==1) && ((((((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 4)) && a23 <= -43 )) && (a8==15)))) [L221] COND FALSE !(((a25==11) && (!(a4==1) && (((((input == 2) && (a3==1)) && a23 <= -43 ) && (a8==15)) && ((245 < a29) && (277 >= a29)) )))) [L227] COND FALSE !(((( a29 <= 140 && ((a3==1) && (((input == 5) && (a25==13)) && (a4==1)))) && (a8==15)) && 306 < a23 )) [L233] COND FALSE !((((a8==15) && (((((((a4==1) && 277 < a29 ) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 )) && (input == 6))) && (a3==1))) [L240] COND FALSE !(((((input == 4) && (( a23 <= -43 && ((a25==9) && (!(a4==1) && a29 <= 140 ))) || (((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && ((a25==13) && ( 277 < a29 && (a4==1))))))) && (a8==15)) && (a3==1))) [L247] COND FALSE !((((a3==1) && (!(a4==1) && (( a29 <= 140 && ((input == 1) && ((a25==12) || ((a25==10) || (a25==11))))) && ((-43 < a23) && (138 >= a23)) ))) && (a8==15))) [L254] COND FALSE !(((( ((245 < a29) && (277 >= a29)) && (( a23 <= -43 && (!(a4==1) && (input == 1))) && (a25==11))) && (a8==15)) && (a3==1))) [L260] COND FALSE !(((((a4==1) && (((input == 1) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))) && (a8==15))) && 306 < a23 ) && (a3==1))) [L265] COND FALSE !((( 277 < a29 && (((a8==15) && ( a23 <= -43 && ((input == 2) && (a3==1)))) && !(a4==1))) && (a25==13))) [L268] COND FALSE !(( a29 <= 140 && ((((a8==15) && ((a3==1) && ((input == 1) && ((a25==12) || (a25==13))))) && !(a4==1)) && a23 <= -43 ))) [L275] COND TRUE (((a4==1) && ((a8==15) && (((a3==1) && (((a25==9) || (a25==10)) && (input == 5))) && ((140 < a29) && (245 >= a29)) ))) && 306 < a23 ) [L276] a23 = ((((a23 * -2)/ 10) * 4) * 1) [L277] a25 = 13 [L279] RET return -1; [L1042] EXPR calculate_output(input) [L1042] output = calculate_output(input) [L1034] COND TRUE 1 [L1037] int input; [L1038] input = __VERIFIER_nondet_int() [L1039] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1042] CALL calculate_output(input) [L23] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L26] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L29] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L32] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L35] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L38] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L41] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L44] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L47] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L50] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L53] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L56] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L59] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L62] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L65] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L68] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L71] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L74] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L77] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L80] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L83] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L86] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L89] COND TRUE ((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15)) [L90] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 293 locations, 1 error locations. UNKNOWN Result, 51.9s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 41.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2822 SDtfs, 9488 SDslu, 4210 SDs, 0 SdLazy, 25669 SolverSat, 2366 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 34.3s Time, PredicateUnifierStatistics: 20 DeclaredPredicates, 1955 GetRequests, 1804 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8247occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.6s AbstIntTime, 11 AbstIntIterations, 10 AbstIntStrong, 0.9974103593497874 AbsIntWeakeningRatio, 0.1301806588735388 AbsIntAvgWeakeningVarsNumRemoved, 22.22635494155154 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 10 MinimizatonAttempts, 278 StatesRemovedByMinimization, 10 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/Problem11_label33_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INT-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_06-07-56-168.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem11_label33_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INT-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_06-07-56-168.csv Received shutdown request...