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_label04_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 06:05:30,005 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 06:05:30,007 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 06:05:30,019 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 06:05:30,019 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 06:05:30,020 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 06:05:30,022 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 06:05:30,023 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 06:05:30,025 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 06:05:30,026 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 06:05:30,027 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 06:05:30,027 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 06:05:30,028 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 06:05:30,029 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 06:05:30,031 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 06:05:30,032 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 06:05:30,032 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 06:05:30,034 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 06:05:30,037 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 06:05:30,038 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 06:05:30,040 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 06:05:30,041 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 06:05:30,043 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 06:05:30,044 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 06:05:30,044 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 06:05:30,045 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 06:05:30,046 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 06:05:30,047 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 06:05:30,048 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 06:05:30,049 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 06:05:30,049 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 06:05:30,050 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 06:05:30,050 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 06:05:30,050 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 06:05:30,052 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 06:05:30,052 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 06:05:30,053 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:05:30,086 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 06:05:30,086 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 06:05:30,088 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 06:05:30,088 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 06:05:30,088 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 06:05:30,088 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 06:05:30,088 INFO L133 SettingsManager]: * Congruence Domain=false [2018-09-19 06:05:30,089 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 06:05:30,089 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-19 06:05:30,089 INFO L133 SettingsManager]: * Abstract domain=IntervalDomain [2018-09-19 06:05:30,089 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 06:05:30,089 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 06:05:30,090 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 06:05:30,090 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 06:05:30,091 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 06:05:30,091 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 06:05:30,092 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 06:05:30,092 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 06:05:30,092 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 06:05:30,092 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 06:05:30,092 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 06:05:30,094 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 06:05:30,094 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 06:05:30,094 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 06:05:30,094 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 06:05:30,095 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 06:05:30,095 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 06:05:30,095 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 06:05:30,095 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 06:05:30,095 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 06:05:30,096 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 06:05:30,096 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 06:05:30,096 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 06:05:30,096 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 06:05:30,096 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 06:05:30,141 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 06:05:30,158 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 06:05:30,163 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 06:05:30,165 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 06:05:30,166 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 06:05:30,167 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label04_true-unreach-call.c [2018-09-19 06:05:30,517 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b00337be5/0e8562e88419431a936ff48c048347a5/FLAG882896a42 [2018-09-19 06:05:30,878 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 06:05:30,881 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label04_true-unreach-call.c [2018-09-19 06:05:30,902 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b00337be5/0e8562e88419431a936ff48c048347a5/FLAG882896a42 [2018-09-19 06:05:30,923 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b00337be5/0e8562e88419431a936ff48c048347a5 [2018-09-19 06:05:30,936 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 06:05:30,941 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 06:05:30,943 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 06:05:30,943 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 06:05:30,953 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 06:05:30,954 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 06:05:30" (1/1) ... [2018-09-19 06:05:30,957 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bf5491e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:05:30, skipping insertion in model container [2018-09-19 06:05:30,958 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 06:05:30" (1/1) ... [2018-09-19 06:05:30,970 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 06:05:31,583 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 06:05:31,607 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 06:05:31,802 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 06:05:31,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:05:31 WrapperNode [2018-09-19 06:05:31,881 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 06:05:31,882 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 06:05:31,882 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 06:05:31,883 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 06:05:31,893 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:05:31" (1/1) ... [2018-09-19 06:05:31,929 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:05:31" (1/1) ... [2018-09-19 06:05:32,048 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 06:05:32,048 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 06:05:32,049 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 06:05:32,049 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 06:05:32,294 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:05:31" (1/1) ... [2018-09-19 06:05:32,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:05:31" (1/1) ... [2018-09-19 06:05:32,303 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:05:31" (1/1) ... [2018-09-19 06:05:32,303 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:05:31" (1/1) ... [2018-09-19 06:05:32,342 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:05:31" (1/1) ... [2018-09-19 06:05:32,356 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:05:31" (1/1) ... [2018-09-19 06:05:32,381 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:05:31" (1/1) ... [2018-09-19 06:05:32,401 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 06:05:32,402 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 06:05:32,402 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 06:05:32,402 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 06:05:32,403 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:05:31" (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:05:32,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 06:05:32,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 06:05:32,476 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 06:05:32,477 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 06:05:32,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 06:05:32,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 06:05:32,477 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 06:05:32,478 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 06:05:37,604 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 06:05:37,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 06:05:37 BoogieIcfgContainer [2018-09-19 06:05:37,605 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 06:05:37,606 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 06:05:37,606 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 06:05:37,609 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 06:05:37,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 06:05:30" (1/3) ... [2018-09-19 06:05:37,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11e7109d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 06:05:37, skipping insertion in model container [2018-09-19 06:05:37,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:05:31" (2/3) ... [2018-09-19 06:05:37,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11e7109d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 06:05:37, skipping insertion in model container [2018-09-19 06:05:37,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 06:05:37" (3/3) ... [2018-09-19 06:05:37,614 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label04_true-unreach-call.c [2018-09-19 06:05:37,625 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 06:05:37,639 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 06:05:37,696 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 06:05:37,697 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 06:05:37,697 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 06:05:37,697 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 06:05:37,698 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 06:05:37,698 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 06:05:37,698 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 06:05:37,698 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 06:05:37,698 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 06:05:37,735 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states. [2018-09-19 06:05:37,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-19 06:05:37,745 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:05:37,746 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:05:37,747 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:05:37,753 INFO L82 PathProgramCache]: Analyzing trace with hash 244570780, now seen corresponding path program 1 times [2018-09-19 06:05:37,755 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:05:37,756 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 61 with the following transitions: [2018-09-19 06:05:37,759 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [381], [383], [1088], [1092], [1098], [1102], [1109], [1110], [1111], [1113] [2018-09-19 06:05:37,805 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:05:37,805 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:05:38,096 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:05:38,098 INFO L272 AbstractInterpreter]: Visited 59 different actions 59 times. Never merged. Never widened. Never found a fixpoint. Largest state had 27 variables. [2018-09-19 06:05:38,149 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:05:38,352 INFO L232 lantSequenceWeakener]: Weakened 57 states. On average, predicates are now at 75.22% of their original sizes. [2018-09-19 06:05:38,353 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:05:38,606 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:05:38,608 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:05:38,608 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 06:05:38,609 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:05:38,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 06:05:38,624 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 06:05:38,625 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 06:05:38,628 INFO L87 Difference]: Start difference. First operand 293 states. Second operand 6 states. [2018-09-19 06:05:41,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:05:41,860 INFO L93 Difference]: Finished difference Result 776 states and 1363 transitions. [2018-09-19 06:05:41,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 06:05:41,864 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-09-19 06:05:41,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:05:41,884 INFO L225 Difference]: With dead ends: 776 [2018-09-19 06:05:41,884 INFO L226 Difference]: Without dead ends: 481 [2018-09-19 06:05:41,893 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 06:05:41,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2018-09-19 06:05:41,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 479. [2018-09-19 06:05:41,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-09-19 06:05:41,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 682 transitions. [2018-09-19 06:05:41,974 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 682 transitions. Word has length 60 [2018-09-19 06:05:41,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:05:41,975 INFO L480 AbstractCegarLoop]: Abstraction has 479 states and 682 transitions. [2018-09-19 06:05:41,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 06:05:41,975 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 682 transitions. [2018-09-19 06:05:41,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-09-19 06:05:41,989 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:05:41,990 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 06:05:41,990 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:05:41,991 INFO L82 PathProgramCache]: Analyzing trace with hash -661330491, now seen corresponding path program 1 times [2018-09-19 06:05:41,991 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:05:41,992 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 178 with the following transitions: [2018-09-19 06:05:41,993 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [381], [383], [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:05:42,007 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:05:42,009 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:05:42,289 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:05:42,771 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:05:42,771 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:05:42,812 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:05:43,160 INFO L232 lantSequenceWeakener]: Weakened 174 states. On average, predicates are now at 73.82% of their original sizes. [2018-09-19 06:05:43,160 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:05:43,942 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:05:43,942 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:05:43,945 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:05:43,945 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:05:43,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:05:43,947 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:05:43,947 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:05:43,948 INFO L87 Difference]: Start difference. First operand 479 states and 682 transitions. Second operand 10 states. [2018-09-19 06:05:47,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:05:47,962 INFO L93 Difference]: Finished difference Result 960 states and 1546 transitions. [2018-09-19 06:05:47,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-19 06:05:47,962 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2018-09-19 06:05:47,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:05:47,968 INFO L225 Difference]: With dead ends: 960 [2018-09-19 06:05:47,968 INFO L226 Difference]: Without dead ends: 677 [2018-09-19 06:05:47,973 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 183 GetRequests, 168 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:05:47,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2018-09-19 06:05:48,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 673. [2018-09-19 06:05:48,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2018-09-19 06:05:48,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 896 transitions. [2018-09-19 06:05:48,011 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 896 transitions. Word has length 177 [2018-09-19 06:05:48,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:05:48,012 INFO L480 AbstractCegarLoop]: Abstraction has 673 states and 896 transitions. [2018-09-19 06:05:48,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:05:48,013 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 896 transitions. [2018-09-19 06:05:48,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-09-19 06:05:48,018 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:05:48,018 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:05:48,018 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:05:48,019 INFO L82 PathProgramCache]: Analyzing trace with hash -860231343, now seen corresponding path program 1 times [2018-09-19 06:05:48,019 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:05:48,019 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 188 with the following transitions: [2018-09-19 06:05:48,020 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [381], [383], [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:05:48,025 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:05:48,026 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:05:48,143 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:05:48,311 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:05:48,311 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:05:48,353 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:05:48,556 INFO L232 lantSequenceWeakener]: Weakened 184 states. On average, predicates are now at 73.78% of their original sizes. [2018-09-19 06:05:48,556 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:05:49,333 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:05:49,333 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:05:49,333 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:05:49,334 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:05:49,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:05:49,335 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:05:49,335 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:05:49,335 INFO L87 Difference]: Start difference. First operand 673 states and 896 transitions. Second operand 10 states. [2018-09-19 06:05:54,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:05:54,006 INFO L93 Difference]: Finished difference Result 1155 states and 1764 transitions. [2018-09-19 06:05:54,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-19 06:05:54,008 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 187 [2018-09-19 06:05:54,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:05:54,014 INFO L225 Difference]: With dead ends: 1155 [2018-09-19 06:05:54,015 INFO L226 Difference]: Without dead ends: 872 [2018-09-19 06:05:54,016 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 193 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 06:05:54,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2018-09-19 06:05:54,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 864. [2018-09-19 06:05:54,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2018-09-19 06:05:54,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1120 transitions. [2018-09-19 06:05:54,045 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1120 transitions. Word has length 187 [2018-09-19 06:05:54,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:05:54,046 INFO L480 AbstractCegarLoop]: Abstraction has 864 states and 1120 transitions. [2018-09-19 06:05:54,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:05:54,046 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1120 transitions. [2018-09-19 06:05:54,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-09-19 06:05:54,052 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:05:54,053 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 06:05:54,053 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:05:54,054 INFO L82 PathProgramCache]: Analyzing trace with hash 864779959, now seen corresponding path program 1 times [2018-09-19 06:05:54,054 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:05:54,054 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 193 with the following transitions: [2018-09-19 06:05:54,054 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [381], [383], [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:05:54,060 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:05:54,061 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:05:54,158 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:05:54,333 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:05:54,333 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:05:54,337 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:05:54,537 INFO L232 lantSequenceWeakener]: Weakened 189 states. On average, predicates are now at 73.82% of their original sizes. [2018-09-19 06:05:54,537 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:05:54,664 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:05:54,665 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:05:54,665 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-19 06:05:54,666 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:05:54,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-19 06:05:54,667 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-19 06:05:54,667 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-09-19 06:05:54,668 INFO L87 Difference]: Start difference. First operand 864 states and 1120 transitions. Second operand 12 states. [2018-09-19 06:06:02,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:06:02,765 INFO L93 Difference]: Finished difference Result 2155 states and 3386 transitions. [2018-09-19 06:06:02,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-19 06:06:02,777 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 192 [2018-09-19 06:06:02,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:06:02,788 INFO L225 Difference]: With dead ends: 2155 [2018-09-19 06:06:02,788 INFO L226 Difference]: Without dead ends: 1872 [2018-09-19 06:06:02,791 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 206 GetRequests, 181 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:06:02,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1872 states. [2018-09-19 06:06:02,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1872 to 1848. [2018-09-19 06:06:02,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2018-09-19 06:06:02,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2389 transitions. [2018-09-19 06:06:02,850 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2389 transitions. Word has length 192 [2018-09-19 06:06:02,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:06:02,851 INFO L480 AbstractCegarLoop]: Abstraction has 1848 states and 2389 transitions. [2018-09-19 06:06:02,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-19 06:06:02,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2389 transitions. [2018-09-19 06:06:02,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-09-19 06:06:02,855 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:06:02,855 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 06:06:02,855 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:06:02,856 INFO L82 PathProgramCache]: Analyzing trace with hash 696570242, now seen corresponding path program 1 times [2018-09-19 06:06:02,856 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:06:02,857 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 209 with the following transitions: [2018-09-19 06:06:02,858 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [381], [383], [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:06:02,865 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:06:02,872 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:06:02,979 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:06:03,117 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:06:03,118 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:06:03,120 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:06:03,291 INFO L232 lantSequenceWeakener]: Weakened 205 states. On average, predicates are now at 73.71% of their original sizes. [2018-09-19 06:06:03,291 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:06:03,444 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:06:03,445 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:06:03,445 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:06:03,445 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:06:03,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:06:03,446 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:06:03,446 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:06:03,446 INFO L87 Difference]: Start difference. First operand 1848 states and 2389 transitions. Second operand 10 states. [2018-09-19 06:06:07,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:06:07,843 INFO L93 Difference]: Finished difference Result 3701 states and 4980 transitions. [2018-09-19 06:06:07,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-19 06:06:07,844 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 208 [2018-09-19 06:06:07,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:06:07,855 INFO L225 Difference]: With dead ends: 3701 [2018-09-19 06:06:07,856 INFO L226 Difference]: Without dead ends: 2241 [2018-09-19 06:06:07,860 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 214 GetRequests, 199 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:06:07,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2241 states. [2018-09-19 06:06:07,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2241 to 2233. [2018-09-19 06:06:07,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2233 states. [2018-09-19 06:06:07,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2233 states to 2233 states and 2828 transitions. [2018-09-19 06:06:07,914 INFO L78 Accepts]: Start accepts. Automaton has 2233 states and 2828 transitions. Word has length 208 [2018-09-19 06:06:07,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:06:07,915 INFO L480 AbstractCegarLoop]: Abstraction has 2233 states and 2828 transitions. [2018-09-19 06:06:07,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:06:07,915 INFO L276 IsEmpty]: Start isEmpty. Operand 2233 states and 2828 transitions. [2018-09-19 06:06:07,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-09-19 06:06:07,921 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:06:07,921 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:07,921 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:06:07,922 INFO L82 PathProgramCache]: Analyzing trace with hash 233507026, now seen corresponding path program 1 times [2018-09-19 06:06:07,922 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:06:07,922 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 259 with the following transitions: [2018-09-19 06:06:07,922 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [381], [383], [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:06:07,926 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:06:07,926 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:06:07,999 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:06:08,243 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:06:08,243 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:06:08,252 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:06:08,481 INFO L232 lantSequenceWeakener]: Weakened 255 states. On average, predicates are now at 73.62% of their original sizes. [2018-09-19 06:06:08,482 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:06:08,618 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:06:08,619 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:06:08,619 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:06:08,619 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:06:08,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:06:08,620 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:06:08,620 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:06:08,620 INFO L87 Difference]: Start difference. First operand 2233 states and 2828 transitions. Second operand 10 states. [2018-09-19 06:06:12,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:06:12,799 INFO L93 Difference]: Finished difference Result 4110 states and 5580 transitions. [2018-09-19 06:06:12,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-19 06:06:12,805 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 258 [2018-09-19 06:06:12,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:06:12,825 INFO L225 Difference]: With dead ends: 4110 [2018-09-19 06:06:12,826 INFO L226 Difference]: Without dead ends: 3033 [2018-09-19 06:06:12,838 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 264 GetRequests, 249 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:06:12,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3033 states. [2018-09-19 06:06:12,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3033 to 3017. [2018-09-19 06:06:12,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3017 states. [2018-09-19 06:06:12,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3017 states to 3017 states and 3772 transitions. [2018-09-19 06:06:12,914 INFO L78 Accepts]: Start accepts. Automaton has 3017 states and 3772 transitions. Word has length 258 [2018-09-19 06:06:12,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:06:12,916 INFO L480 AbstractCegarLoop]: Abstraction has 3017 states and 3772 transitions. [2018-09-19 06:06:12,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:06:12,917 INFO L276 IsEmpty]: Start isEmpty. Operand 3017 states and 3772 transitions. [2018-09-19 06:06:12,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-09-19 06:06:12,922 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:06:12,923 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:12,923 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:06:12,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1800365174, now seen corresponding path program 1 times [2018-09-19 06:06:12,923 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:06:12,924 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 263 with the following transitions: [2018-09-19 06:06:12,924 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [381], [383], [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:06:12,927 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:06:12,927 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:06:13,000 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:06:13,420 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:06:13,420 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:06:13,423 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:06:13,648 INFO L232 lantSequenceWeakener]: Weakened 259 states. On average, predicates are now at 73.61% of their original sizes. [2018-09-19 06:06:13,648 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:06:13,756 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:06:13,756 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:06:13,756 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:06:13,757 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:06:13,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:06:13,757 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:06:13,757 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:06:13,758 INFO L87 Difference]: Start difference. First operand 3017 states and 3772 transitions. Second operand 10 states. [2018-09-19 06:06:17,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:06:17,315 INFO L93 Difference]: Finished difference Result 6606 states and 8928 transitions. [2018-09-19 06:06:17,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:06:17,317 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 262 [2018-09-19 06:06:17,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:06:17,339 INFO L225 Difference]: With dead ends: 6606 [2018-09-19 06:06:17,339 INFO L226 Difference]: Without dead ends: 4744 [2018-09-19 06:06:17,348 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 269 GetRequests, 253 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:06:17,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4744 states. [2018-09-19 06:06:17,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4744 to 4694. [2018-09-19 06:06:17,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4694 states. [2018-09-19 06:06:17,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4694 states to 4694 states and 5884 transitions. [2018-09-19 06:06:17,470 INFO L78 Accepts]: Start accepts. Automaton has 4694 states and 5884 transitions. Word has length 262 [2018-09-19 06:06:17,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:06:17,471 INFO L480 AbstractCegarLoop]: Abstraction has 4694 states and 5884 transitions. [2018-09-19 06:06:17,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:06:17,471 INFO L276 IsEmpty]: Start isEmpty. Operand 4694 states and 5884 transitions. [2018-09-19 06:06:17,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-09-19 06:06:17,478 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:06:17,479 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:06:17,479 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:06:17,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1247535021, now seen corresponding path program 1 times [2018-09-19 06:06:17,480 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:06:17,480 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 266 with the following transitions: [2018-09-19 06:06:17,480 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [381], [383], [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:06:17,484 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:06:17,484 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:06:17,568 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:06:17,797 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:06:17,798 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:06:17,837 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:06:18,051 INFO L232 lantSequenceWeakener]: Weakened 262 states. On average, predicates are now at 73.6% of their original sizes. [2018-09-19 06:06:18,052 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:06:18,155 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:06:18,155 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:06:18,156 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:06:18,156 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:06:18,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:06:18,157 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:06:18,157 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:06:18,157 INFO L87 Difference]: Start difference. First operand 4694 states and 5884 transitions. Second operand 10 states. [2018-09-19 06:06:21,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:06:21,531 INFO L93 Difference]: Finished difference Result 7516 states and 9723 transitions. [2018-09-19 06:06:21,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-19 06:06:21,532 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 265 [2018-09-19 06:06:21,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:06:21,554 INFO L225 Difference]: With dead ends: 7516 [2018-09-19 06:06:21,555 INFO L226 Difference]: Without dead ends: 5098 [2018-09-19 06:06:21,562 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 271 GetRequests, 256 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:06:21,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5098 states. [2018-09-19 06:06:21,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5098 to 5080. [2018-09-19 06:06:21,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5080 states. [2018-09-19 06:06:21,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5080 states to 5080 states and 6328 transitions. [2018-09-19 06:06:21,668 INFO L78 Accepts]: Start accepts. Automaton has 5080 states and 6328 transitions. Word has length 265 [2018-09-19 06:06:21,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:06:21,669 INFO L480 AbstractCegarLoop]: Abstraction has 5080 states and 6328 transitions. [2018-09-19 06:06:21,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:06:21,670 INFO L276 IsEmpty]: Start isEmpty. Operand 5080 states and 6328 transitions. [2018-09-19 06:06:21,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-09-19 06:06:21,676 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:06:21,676 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:06:21,677 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:06:21,677 INFO L82 PathProgramCache]: Analyzing trace with hash 641928770, now seen corresponding path program 1 times [2018-09-19 06:06:21,677 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:06:21,677 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 267 with the following transitions: [2018-09-19 06:06:21,678 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [381], [383], [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:06:21,680 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:06:21,681 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:06:21,772 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:06:22,147 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:06:22,147 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:06:22,177 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:06:22,457 INFO L232 lantSequenceWeakener]: Weakened 263 states. On average, predicates are now at 73.6% of their original sizes. [2018-09-19 06:06:22,457 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:06:22,705 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:06:22,705 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:06:22,705 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:06:22,705 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:06:22,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:06:22,706 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:06:22,706 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:06:22,706 INFO L87 Difference]: Start difference. First operand 5080 states and 6328 transitions. Second operand 10 states. [2018-09-19 06:06:26,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:06:26,752 INFO L93 Difference]: Finished difference Result 10216 states and 13294 transitions. [2018-09-19 06:06:26,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:06:26,752 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 266 [2018-09-19 06:06:26,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:06:26,789 INFO L225 Difference]: With dead ends: 10216 [2018-09-19 06:06:26,789 INFO L226 Difference]: Without dead ends: 7992 [2018-09-19 06:06:26,800 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 273 GetRequests, 257 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:06:26,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7992 states. [2018-09-19 06:06:27,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7992 to 7861. [2018-09-19 06:06:27,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7861 states. [2018-09-19 06:06:27,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7861 states to 7861 states and 10044 transitions. [2018-09-19 06:06:27,147 INFO L78 Accepts]: Start accepts. Automaton has 7861 states and 10044 transitions. Word has length 266 [2018-09-19 06:06:27,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:06:27,150 INFO L480 AbstractCegarLoop]: Abstraction has 7861 states and 10044 transitions. [2018-09-19 06:06:27,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:06:27,150 INFO L276 IsEmpty]: Start isEmpty. Operand 7861 states and 10044 transitions. [2018-09-19 06:06:27,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-09-19 06:06:27,158 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:06:27,158 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:27,158 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:06:27,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1684077623, now seen corresponding path program 1 times [2018-09-19 06:06:27,159 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:06:27,159 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 268 with the following transitions: [2018-09-19 06:06:27,160 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [381], [383], [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:06:27,163 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:06:27,163 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:06:27,233 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:06:27,498 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:06:27,498 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:06:27,534 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:06:27,751 INFO L232 lantSequenceWeakener]: Weakened 264 states. On average, predicates are now at 73.6% of their original sizes. [2018-09-19 06:06:27,751 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:06:28,066 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:06:28,066 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:06:28,066 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:06:28,066 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:06:28,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:06:28,067 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:06:28,067 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:06:28,068 INFO L87 Difference]: Start difference. First operand 7861 states and 10044 transitions. Second operand 10 states. [2018-09-19 06:06:30,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:06:30,400 INFO L93 Difference]: Finished difference Result 12733 states and 16772 transitions. [2018-09-19 06:06:30,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-19 06:06:30,401 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 267 [2018-09-19 06:06:30,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:06:30,433 INFO L225 Difference]: With dead ends: 12733 [2018-09-19 06:06:30,433 INFO L226 Difference]: Without dead ends: 8264 [2018-09-19 06:06:30,446 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 273 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 06:06:30,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8264 states. [2018-09-19 06:06:30,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8264 to 8247. [2018-09-19 06:06:30,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8247 states. [2018-09-19 06:06:30,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8247 states to 8247 states and 10527 transitions. [2018-09-19 06:06:30,575 INFO L78 Accepts]: Start accepts. Automaton has 8247 states and 10527 transitions. Word has length 267 [2018-09-19 06:06:30,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:06:30,576 INFO L480 AbstractCegarLoop]: Abstraction has 8247 states and 10527 transitions. [2018-09-19 06:06:30,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:06:30,576 INFO L276 IsEmpty]: Start isEmpty. Operand 8247 states and 10527 transitions. [2018-09-19 06:06:30,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-09-19 06:06:30,584 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:06:30,585 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:30,585 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:06:30,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1918210362, now seen corresponding path program 1 times [2018-09-19 06:06:30,585 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:06:30,586 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 269 with the following transitions: [2018-09-19 06:06:30,586 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [381], [383], [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:06:30,589 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:06:30,589 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:06:30,672 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:06:30,914 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:06:30,914 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:06:30,940 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:06:31,159 INFO L232 lantSequenceWeakener]: Weakened 265 states. On average, predicates are now at 73.6% of their original sizes. [2018-09-19 06:06:31,159 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:06:31,270 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:06:31,270 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:06:31,270 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:06:31,270 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:06:31,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:06:31,271 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:06:31,271 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:06:31,272 INFO L87 Difference]: Start difference. First operand 8247 states and 10527 transitions. Second operand 10 states. [2018-09-19 06:06:36,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:06:36,179 INFO L93 Difference]: Finished difference Result 15574 states and 20619 transitions. [2018-09-19 06:06:36,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:06:36,181 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 268 [2018-09-19 06:06:36,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:06:36,214 INFO L225 Difference]: With dead ends: 15574 [2018-09-19 06:06:36,215 INFO L226 Difference]: Without dead ends: 11105 [2018-09-19 06:06:36,230 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 275 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:06:36,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11105 states. [2018-09-19 06:06:36,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11105 to 10982. [2018-09-19 06:06:36,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10982 states. [2018-09-19 06:06:36,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10982 states to 10982 states and 13778 transitions. [2018-09-19 06:06:36,411 INFO L78 Accepts]: Start accepts. Automaton has 10982 states and 13778 transitions. Word has length 268 [2018-09-19 06:06:36,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:06:36,411 INFO L480 AbstractCegarLoop]: Abstraction has 10982 states and 13778 transitions. [2018-09-19 06:06:36,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:06:36,412 INFO L276 IsEmpty]: Start isEmpty. Operand 10982 states and 13778 transitions. [2018-09-19 06:06:36,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-09-19 06:06:36,421 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:06:36,421 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:06:36,421 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:06:36,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1775720410, now seen corresponding path program 1 times [2018-09-19 06:06:36,422 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:06:36,422 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 275 with the following transitions: [2018-09-19 06:06:36,422 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [381], [383], [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], [562], [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:06:36,426 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:06:36,427 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:06:36,510 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:06:36,872 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:06:36,873 INFO L272 AbstractInterpreter]: Visited 135 different actions 658 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:06:36,912 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:06:37,161 INFO L232 lantSequenceWeakener]: Weakened 271 states. On average, predicates are now at 73.58% of their original sizes. [2018-09-19 06:06:37,161 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:06:37,353 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:06:37,353 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:06:37,353 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:06:37,353 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:06:37,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:06:37,354 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:06:37,354 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:06:37,354 INFO L87 Difference]: Start difference. First operand 10982 states and 13778 transitions. Second operand 10 states. [2018-09-19 06:06:42,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:06:42,629 INFO L93 Difference]: Finished difference Result 21756 states and 27765 transitions. [2018-09-19 06:06:42,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:06:42,630 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 274 [2018-09-19 06:06:42,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:06:42,680 INFO L225 Difference]: With dead ends: 21756 [2018-09-19 06:06:42,680 INFO L226 Difference]: Without dead ends: 14552 [2018-09-19 06:06:42,701 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 281 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:06:42,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14552 states. [2018-09-19 06:06:43,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14552 to 14369. [2018-09-19 06:06:43,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14369 states. [2018-09-19 06:06:43,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14369 states to 14369 states and 18137 transitions. [2018-09-19 06:06:43,110 INFO L78 Accepts]: Start accepts. Automaton has 14369 states and 18137 transitions. Word has length 274 [2018-09-19 06:06:43,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:06:43,111 INFO L480 AbstractCegarLoop]: Abstraction has 14369 states and 18137 transitions. [2018-09-19 06:06:43,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:06:43,112 INFO L276 IsEmpty]: Start isEmpty. Operand 14369 states and 18137 transitions. [2018-09-19 06:06:43,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-09-19 06:06:43,124 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:06:43,125 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:06:43,125 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:06:43,125 INFO L82 PathProgramCache]: Analyzing trace with hash -939048906, now seen corresponding path program 1 times [2018-09-19 06:06:43,125 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:06:43,125 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 277 with the following transitions: [2018-09-19 06:06:43,126 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [381], [383], [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], [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:06:43,131 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:06:43,131 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:06:43,212 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:06:43,546 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:06:43,546 INFO L272 AbstractInterpreter]: Visited 135 different actions 658 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:06:43,573 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:06:43,781 INFO L232 lantSequenceWeakener]: Weakened 273 states. On average, predicates are now at 73.58% of their original sizes. [2018-09-19 06:06:43,781 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:06:43,874 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:06:43,874 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:06:43,874 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:06:43,874 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:06:43,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:06:43,875 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:06:43,875 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:06:43,875 INFO L87 Difference]: Start difference. First operand 14369 states and 18137 transitions. Second operand 10 states. [2018-09-19 06:06:48,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:06:48,760 INFO L93 Difference]: Finished difference Result 27539 states and 35252 transitions. [2018-09-19 06:06:48,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:06:48,761 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 276 [2018-09-19 06:06:48,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:06:48,797 INFO L225 Difference]: With dead ends: 27539 [2018-09-19 06:06:48,798 INFO L226 Difference]: Without dead ends: 16948 [2018-09-19 06:06:48,823 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 283 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:06:48,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16948 states. [2018-09-19 06:06:49,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16948 to 16835. [2018-09-19 06:06:49,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16835 states. [2018-09-19 06:06:49,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16835 states to 16835 states and 21366 transitions. [2018-09-19 06:06:49,058 INFO L78 Accepts]: Start accepts. Automaton has 16835 states and 21366 transitions. Word has length 276 [2018-09-19 06:06:49,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:06:49,059 INFO L480 AbstractCegarLoop]: Abstraction has 16835 states and 21366 transitions. [2018-09-19 06:06:49,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:06:49,059 INFO L276 IsEmpty]: Start isEmpty. Operand 16835 states and 21366 transitions. [2018-09-19 06:06:49,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-09-19 06:06:49,070 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:06:49,070 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:06:49,070 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:06:49,071 INFO L82 PathProgramCache]: Analyzing trace with hash -622996311, now seen corresponding path program 1 times [2018-09-19 06:06:49,071 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:06:49,071 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 284 with the following transitions: [2018-09-19 06:06:49,071 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [381], [383], [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], [598], [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:06:49,074 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:06:49,074 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:06:49,150 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:06:49,331 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:06:49,332 INFO L272 AbstractInterpreter]: Visited 135 different actions 528 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 28 variables. [2018-09-19 06:06:49,369 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:06:49,571 INFO L232 lantSequenceWeakener]: Weakened 280 states. On average, predicates are now at 73.57% of their original sizes. [2018-09-19 06:06:49,571 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:06:49,649 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:06:49,650 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:06:49,650 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:06:49,650 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:06:49,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:06:49,651 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:06:49,651 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:06:49,651 INFO L87 Difference]: Start difference. First operand 16835 states and 21366 transitions. Second operand 10 states. [2018-09-19 06:06:52,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:06:52,313 INFO L93 Difference]: Finished difference Result 29928 states and 38463 transitions. [2018-09-19 06:06:52,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-19 06:06:52,314 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 283 [2018-09-19 06:06:52,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:06:52,348 INFO L225 Difference]: With dead ends: 29928 [2018-09-19 06:06:52,348 INFO L226 Difference]: Without dead ends: 17064 [2018-09-19 06:06:52,369 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 289 GetRequests, 274 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:06:52,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17064 states. [2018-09-19 06:06:52,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17064 to 17035. [2018-09-19 06:06:52,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17035 states. [2018-09-19 06:06:52,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17035 states to 17035 states and 21627 transitions. [2018-09-19 06:06:52,585 INFO L78 Accepts]: Start accepts. Automaton has 17035 states and 21627 transitions. Word has length 283 [2018-09-19 06:06:52,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:06:52,586 INFO L480 AbstractCegarLoop]: Abstraction has 17035 states and 21627 transitions. [2018-09-19 06:06:52,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:06:52,586 INFO L276 IsEmpty]: Start isEmpty. Operand 17035 states and 21627 transitions. [2018-09-19 06:06:52,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-09-19 06:06:52,597 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:06:52,597 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:52,597 INFO L423 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:06:52,598 INFO L82 PathProgramCache]: Analyzing trace with hash 588670167, now seen corresponding path program 1 times [2018-09-19 06:06:52,598 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:06:52,598 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 285 with the following transitions: [2018-09-19 06:06:52,598 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [381], [383], [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], [582], [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:06:52,601 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:06:52,601 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:06:52,682 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:06:53,013 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:06:53,013 INFO L272 AbstractInterpreter]: Visited 140 different actions 683 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:06:53,020 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:06:53,237 INFO L232 lantSequenceWeakener]: Weakened 281 states. On average, predicates are now at 73.61% of their original sizes. [2018-09-19 06:06:53,237 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:06:53,354 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:06:53,355 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:06:53,355 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-19 06:06:53,355 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:06:53,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-19 06:06:53,355 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-19 06:06:53,355 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-09-19 06:06:53,356 INFO L87 Difference]: Start difference. First operand 17035 states and 21627 transitions. Second operand 12 states. [2018-09-19 06:07:03,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:07:03,172 INFO L93 Difference]: Finished difference Result 35471 states and 46443 transitions. [2018-09-19 06:07:03,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-19 06:07:03,174 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 284 [2018-09-19 06:07:03,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:07:03,226 INFO L225 Difference]: With dead ends: 35471 [2018-09-19 06:07:03,226 INFO L226 Difference]: Without dead ends: 22607 [2018-09-19 06:07:03,247 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 302 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=762, Unknown=0, NotChecked=0, Total=930 [2018-09-19 06:07:03,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22607 states. [2018-09-19 06:07:03,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22607 to 22432. [2018-09-19 06:07:03,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22432 states. [2018-09-19 06:07:03,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22432 states to 22432 states and 28934 transitions. [2018-09-19 06:07:03,574 INFO L78 Accepts]: Start accepts. Automaton has 22432 states and 28934 transitions. Word has length 284 [2018-09-19 06:07:03,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:07:03,575 INFO L480 AbstractCegarLoop]: Abstraction has 22432 states and 28934 transitions. [2018-09-19 06:07:03,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-19 06:07:03,575 INFO L276 IsEmpty]: Start isEmpty. Operand 22432 states and 28934 transitions. [2018-09-19 06:07:03,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-09-19 06:07:03,587 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:07:03,588 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03,588 INFO L423 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:07:03,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1263690723, now seen corresponding path program 1 times [2018-09-19 06:07:03,588 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:07:03,589 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 290 with the following transitions: [2018-09-19 06:07:03,589 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [381], [383], [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], [629], [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:03,592 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:07:03,592 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:07:03,676 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:07:04,141 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:07:04,142 INFO L272 AbstractInterpreter]: Visited 135 different actions 528 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 28 variables. [2018-09-19 06:07:04,181 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:07:04,489 INFO L232 lantSequenceWeakener]: Weakened 286 states. On average, predicates are now at 73.56% of their original sizes. [2018-09-19 06:07:04,489 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:07:04,633 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:07:04,633 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:07:04,633 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:07:04,633 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:07:04,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:07:04,634 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:07:04,634 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:07:04,634 INFO L87 Difference]: Start difference. First operand 22432 states and 28934 transitions. Second operand 10 states. [2018-09-19 06:07:09,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:07:09,489 INFO L93 Difference]: Finished difference Result 55578 states and 72493 transitions. [2018-09-19 06:07:09,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:07:09,496 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 289 [2018-09-19 06:07:09,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:07:09,584 INFO L225 Difference]: With dead ends: 55578 [2018-09-19 06:07:09,584 INFO L226 Difference]: Without dead ends: 35470 [2018-09-19 06:07:09,622 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 296 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:07:09,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35470 states. [2018-09-19 06:07:10,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35470 to 35214. [2018-09-19 06:07:10,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35214 states. [2018-09-19 06:07:10,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35214 states to 35214 states and 45176 transitions. [2018-09-19 06:07:10,380 INFO L78 Accepts]: Start accepts. Automaton has 35214 states and 45176 transitions. Word has length 289 [2018-09-19 06:07:10,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:07:10,381 INFO L480 AbstractCegarLoop]: Abstraction has 35214 states and 45176 transitions. [2018-09-19 06:07:10,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:07:10,381 INFO L276 IsEmpty]: Start isEmpty. Operand 35214 states and 45176 transitions. [2018-09-19 06:07:10,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-09-19 06:07:10,394 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:07:10,394 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10,394 INFO L423 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:07:10,395 INFO L82 PathProgramCache]: Analyzing trace with hash 641849013, now seen corresponding path program 1 times [2018-09-19 06:07:10,395 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:07:10,395 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 290 with the following transitions: [2018-09-19 06:07:10,395 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [381], [383], [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], [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:10,398 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:07:10,399 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:07:10,490 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:07:10,760 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-19 06:07:10,760 INFO L272 AbstractInterpreter]: Visited 157 different actions 613 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:10,791 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 06:07:10,833 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 06:07:10,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 06:07:10 BoogieIcfgContainer [2018-09-19 06:07:10,833 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 06:07:10,835 INFO L168 Benchmark]: Toolchain (without parser) took 99898.16 ms. Allocated memory was 1.5 GB in the beginning and 3.7 GB in the end (delta: 2.1 GB). Free memory was 1.4 GB in the beginning and 2.9 GB in the end (delta: -1.5 GB). Peak memory consumption was 629.7 MB. Max. memory is 7.1 GB. [2018-09-19 06:07:10,836 INFO L168 Benchmark]: CDTParser took 0.27 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:10,837 INFO L168 Benchmark]: CACSL2BoogieTranslator took 938.59 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2018-09-19 06:07:10,838 INFO L168 Benchmark]: Boogie Procedure Inliner took 166.07 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-19 06:07:10,838 INFO L168 Benchmark]: Boogie Preprocessor took 353.09 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 829.4 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -956.7 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2018-09-19 06:07:10,839 INFO L168 Benchmark]: RCFGBuilder took 5203.02 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 181.3 MB). Peak memory consumption was 181.3 MB. Max. memory is 7.1 GB. [2018-09-19 06:07:10,840 INFO L168 Benchmark]: TraceAbstraction took 93227.75 ms. Allocated memory was 2.4 GB in the beginning and 3.7 GB in the end (delta: 1.3 GB). Free memory was 2.1 GB in the beginning and 2.9 GB in the end (delta: -819.7 MB). Peak memory consumption was 480.5 MB. Max. memory is 7.1 GB. [2018-09-19 06:07:10,845 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.27 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 938.59 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 166.07 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 353.09 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 829.4 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -956.7 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5203.02 ms. Allocated memory is still 2.4 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 181.3 MB). Peak memory consumption was 181.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 93227.75 ms. Allocated memory was 2.4 GB in the beginning and 3.7 GB in the end (delta: 1.3 GB). Free memory was 2.1 GB in the beginning and 2.9 GB in the end (delta: -819.7 MB). Peak memory consumption was 480.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 165]: 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 FALSE !(((a8==15) && ((((a3==1) && (((((a25==10) || (a25==11)) || (a25==12)) && (input == 3)) && (a4==1))) && 306 < a23 ) && a29 <= 140 ))) [L586] COND FALSE !((( ((-43 < a23) && (138 >= a23)) && ((a3==1) && (!(a4==1) && ((input == 4) && (((a25==10) && ((140 < a29) && (245 >= a29)) ) || (((a25==13) && a29 <= 140 ) || ( ((140 < a29) && (245 >= a29)) && (a25==9)))))))) && (a8==15))) [L598] COND FALSE !(((((a8==15) && ((!(a4==1) && (((a25==11) || ((a25==9) || (a25==10))) && (input == 6))) && (a3==1))) && a23 <= -43 ) && ((140 < a29) && (245 >= a29)) )) [L603] COND FALSE !(( a29 <= 140 && (((a4==1) && ((a8==15) && (((input == 6) && (((a25==10) || (a25==11)) || (a25==12))) && 306 < a23 ))) && (a3==1)))) [L615] COND FALSE !(((((((a3==1) && ((input == 5) && ((a25==11) || (a25==12)))) && (a4==1)) && 306 < a23 ) && ((140 < a29) && (245 >= a29)) ) && (a8==15))) [L621] COND FALSE !(((((a4==1) && ( 306 < a23 && ((a8==15) && (((a25==11) || (a25==12)) && (input == 2))))) && ((140 < a29) && (245 >= a29)) ) && (a3==1))) [L628] COND FALSE !(((((a8==15) && ( a23 <= -43 && (!(a4==1) && ((a25==11) && (input == 5))))) && (a3==1)) && ((245 < a29) && (277 >= a29)) )) [L635] COND FALSE !((((((((input == 2) && ((a25==9) || (a25==10))) && (a8==15)) && ((140 < a29) && (245 >= a29)) ) && 306 < a23 ) && (a3==1)) && (a4==1))) [L642] COND FALSE !(((a8==15) && (((( 277 < a29 && ((input == 2) && ((a25==11) || ((a25==9) || (a25==10))))) && (a4==1)) && (a3==1)) && 306 < a23 ))) [L647] COND FALSE !(((((( ((-43 < a23) && (138 >= a23)) && ((input == 3) && ((a25==12) || ((a25==10) || (a25==11))))) && !(a4==1)) && (a8==15)) && a29 <= 140 ) && (a3==1))) [L658] COND FALSE !((((!(a4==1) && ((((input == 6) && ((a25==12) || ((a25==10) || (a25==11)))) && (a8==15)) && ((-43 < a23) && (138 >= a23)) )) && (a3==1)) && a29 <= 140 )) [L663] COND FALSE !(((a25==9) && (( a29 <= 140 && ((a3==1) && (!(a4==1) && ( ((-43 < a23) && (138 >= a23)) && (input == 2))))) && (a8==15)))) [L670] COND FALSE !((!(a4==1) && ( a23 <= -43 && (((a8==15) && (((((a25==12) && ((245 < a29) && (277 >= a29)) ) || ( ((245 < a29) && (277 >= a29)) && (a25==13))) || ((a25==9) && 277 < a29 )) && (input == 3))) && (a3==1))))) [L675] COND FALSE !((((!(a4==1) && ((a3==1) && ((input == 5) && ((( ((245 < a29) && (277 >= a29)) && (a25==12)) || ((a25==13) && ((245 < a29) && (277 >= a29)) )) || ((a25==9) && 277 < a29 ))))) && a23 <= -43 ) && (a8==15))) [L681] COND FALSE !(( a23 <= -43 && (!(a4==1) && ( ((245 < a29) && (277 >= a29)) && ((a8==15) && ((a25==11) && ((a3==1) && (input == 3)))))))) [L688] COND FALSE !(((((a8==15) && ( 306 < a23 && ( ((140 < a29) && (245 >= a29)) && ((input == 1) && ((a25==9) || (a25==10)))))) && (a4==1)) && (a3==1))) [L694] COND FALSE !((!(a4==1) && (((((a3==1) && ((input == 2) && (((a25==9) || (a25==10)) || (a25==11)))) && ((140 < a29) && (245 >= a29)) ) && a23 <= -43 ) && (a8==15)))) [L706] COND FALSE !(((((((( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) ))) && (input == 6)) && (a3==1)) && 306 < a23 ) && (a4==1)) && (a8==15))) [L712] COND FALSE !(( 306 < a23 && ((a8==15) && ( 277 < a29 && ((a4==1) && ((a3==1) && ((((a25==9) || (a25==10)) || (a25==11)) && (input == 5)))))))) [L717] COND FALSE !(((( 277 < a29 && ((a8==15) && (((input == 6) && a23 <= -43 ) && (a25==13)))) && !(a4==1)) && (a3==1))) [L731] COND FALSE !(((a3==1) && (((!(a4==1) && ((( ((140 < a29) && (245 >= a29)) && (a25==10)) || (( a29 <= 140 && (a25==13)) || ((a25==9) && ((140 < a29) && (245 >= a29)) ))) && (input == 3))) && ((-43 < a23) && (138 >= a23)) ) && (a8==15)))) [L738] COND TRUE ((a3==1) && (( 306 < a23 && (((a4==1) && (((a25==12) || ((a25==10) || (a25==11))) && (input == 1))) && a29 <= 140 )) && (a8==15))) [L739] a29 = ((((a29 + 161077) + -91920) % 299861)- -300138) [L740] a25 = 9 [L742] RET return 26; [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 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 TRUE ((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15)) [L165] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 293 locations, 1 error locations. UNKNOWN Result, 93.1s OverallTime, 17 OverallIterations, 3 TraceHistogramMax, 75.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4508 SDtfs, 16283 SDslu, 7575 SDs, 0 SdLazy, 47115 SolverSat, 3992 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 61.7s Time, PredicateUnifierStatistics: 32 DeclaredPredicates, 3931 GetRequests, 3672 SyntacticMatches, 0 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35214occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 7.1s AbstIntTime, 17 AbstIntIterations, 16 AbstIntStrong, 0.9977250262408189 AbsIntWeakeningRatio, 0.10894736842105263 AbsIntAvgWeakeningVarsNumRemoved, 22.77657894736842 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 1157 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: No data available, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem11_label04_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INT-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_06-07-10-860.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem11_label04_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INT-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_06-07-10-860.csv Received shutdown request...