java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label54_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 12:43:29,644 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 12:43:29,646 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 12:43:29,658 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 12:43:29,659 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 12:43:29,660 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 12:43:29,661 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 12:43:29,663 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 12:43:29,665 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 12:43:29,665 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 12:43:29,666 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 12:43:29,667 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 12:43:29,668 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 12:43:29,669 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 12:43:29,670 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 12:43:29,671 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 12:43:29,671 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 12:43:29,673 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 12:43:29,676 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 12:43:29,677 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 12:43:29,678 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 12:43:29,680 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 12:43:29,683 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 12:43:29,683 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 12:43:29,684 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 12:43:29,685 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 12:43:29,686 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 12:43:29,687 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 12:43:29,688 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 12:43:29,689 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 12:43:29,689 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 12:43:29,690 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 12:43:29,690 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 12:43:29,691 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 12:43:29,692 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 12:43:29,693 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 12:43:29,693 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf [2018-09-19 12:43:29,709 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 12:43:29,710 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 12:43:29,711 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 12:43:29,711 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 12:43:29,711 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 12:43:29,712 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 12:43:29,712 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 12:43:29,712 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-19 12:43:29,712 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-19 12:43:29,713 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 12:43:29,713 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 12:43:29,713 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 12:43:29,716 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 12:43:29,716 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 12:43:29,716 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 12:43:29,717 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 12:43:29,717 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 12:43:29,717 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 12:43:29,717 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 12:43:29,718 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 12:43:29,718 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 12:43:29,718 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 12:43:29,718 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 12:43:29,720 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 12:43:29,720 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 12:43:29,721 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 12:43:29,721 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 12:43:29,721 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 12:43:29,721 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 12:43:29,721 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 12:43:29,722 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 12:43:29,722 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 12:43:29,722 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 12:43:29,722 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 12:43:29,798 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 12:43:29,817 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 12:43:29,824 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 12:43:29,826 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 12:43:29,826 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 12:43:29,828 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label54_true-unreach-call.c [2018-09-19 12:43:30,182 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6de9a2271/30a24ad8c3db4b728e0ad7d5c288b00d/FLAG9974dde85 [2018-09-19 12:43:30,494 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 12:43:30,495 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label54_true-unreach-call.c [2018-09-19 12:43:30,509 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6de9a2271/30a24ad8c3db4b728e0ad7d5c288b00d/FLAG9974dde85 [2018-09-19 12:43:30,524 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6de9a2271/30a24ad8c3db4b728e0ad7d5c288b00d [2018-09-19 12:43:30,535 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 12:43:30,538 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 12:43:30,540 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 12:43:30,540 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 12:43:30,547 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 12:43:30,548 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 12:43:30" (1/1) ... [2018-09-19 12:43:30,551 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58150d2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:43:30, skipping insertion in model container [2018-09-19 12:43:30,551 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 12:43:30" (1/1) ... [2018-09-19 12:43:30,563 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 12:43:31,090 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 12:43:31,109 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 12:43:31,276 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 12:43:31,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:43:31 WrapperNode [2018-09-19 12:43:31,331 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 12:43:31,332 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 12:43:31,332 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 12:43:31,332 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 12:43:31,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:43:31" (1/1) ... [2018-09-19 12:43:31,379 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:43:31" (1/1) ... [2018-09-19 12:43:31,450 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 12:43:31,451 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 12:43:31,451 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 12:43:31,451 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 12:43:31,606 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:43:31" (1/1) ... [2018-09-19 12:43:31,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:43:31" (1/1) ... [2018-09-19 12:43:31,617 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:43:31" (1/1) ... [2018-09-19 12:43:31,618 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:43:31" (1/1) ... [2018-09-19 12:43:31,653 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:43:31" (1/1) ... [2018-09-19 12:43:31,677 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:43:31" (1/1) ... [2018-09-19 12:43:31,694 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:43:31" (1/1) ... [2018-09-19 12:43:31,707 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 12:43:31,707 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 12:43:31,707 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 12:43:31,708 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 12:43:31,709 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:43: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 12:43:31,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 12:43:31,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 12:43:31,788 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 12:43:31,789 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 12:43:31,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 12:43:31,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 12:43:31,790 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 12:43:31,790 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 12:43:35,139 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 12:43:35,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 12:43:35 BoogieIcfgContainer [2018-09-19 12:43:35,140 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 12:43:35,141 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 12:43:35,142 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 12:43:35,145 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 12:43:35,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 12:43:30" (1/3) ... [2018-09-19 12:43:35,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f074424 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 12:43:35, skipping insertion in model container [2018-09-19 12:43:35,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:43:31" (2/3) ... [2018-09-19 12:43:35,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f074424 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 12:43:35, skipping insertion in model container [2018-09-19 12:43:35,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 12:43:35" (3/3) ... [2018-09-19 12:43:35,149 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label54_true-unreach-call.c [2018-09-19 12:43:35,159 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 12:43:35,168 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 12:43:35,227 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 12:43:35,228 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 12:43:35,228 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 12:43:35,228 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 12:43:35,228 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 12:43:35,229 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 12:43:35,229 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 12:43:35,229 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 12:43:35,229 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 12:43:35,268 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-19 12:43:35,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-09-19 12:43:35,292 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:43:35,293 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:43:35,295 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:43:35,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1787309367, now seen corresponding path program 1 times [2018-09-19 12:43:35,305 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:43:35,307 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 70 with the following transitions: [2018-09-19 12:43:35,311 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], [385], [393], [401], [409], [417], [425], [433], [441], [449], [453], [455], [796], [800], [806], [810], [817], [818], [819], [821] [2018-09-19 12:43:35,369 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:43:35,369 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:43:35,854 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:43:35,857 INFO L272 AbstractInterpreter]: Visited 68 different actions 68 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-19 12:43:35,921 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:43:36,300 INFO L232 lantSequenceWeakener]: Weakened 66 states. On average, predicates are now at 75.74% of their original sizes. [2018-09-19 12:43:36,300 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:43:36,550 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:43:36,551 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:43:36,552 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 12:43:36,552 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:43:36,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 12:43:36,568 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 12:43:36,569 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 12:43:36,571 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 6 states. [2018-09-19 12:43:39,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:43:39,396 INFO L93 Difference]: Finished difference Result 576 states and 995 transitions. [2018-09-19 12:43:39,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 12:43:39,400 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-09-19 12:43:39,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:43:39,418 INFO L225 Difference]: With dead ends: 576 [2018-09-19 12:43:39,418 INFO L226 Difference]: Without dead ends: 358 [2018-09-19 12:43:39,425 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 68 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 12:43:39,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-09-19 12:43:39,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-09-19 12:43:39,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-19 12:43:39,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2018-09-19 12:43:39,502 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 69 [2018-09-19 12:43:39,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:43:39,503 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2018-09-19 12:43:39,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 12:43:39,503 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2018-09-19 12:43:39,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-09-19 12:43:39,511 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:43:39,512 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:43:39,512 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:43:39,513 INFO L82 PathProgramCache]: Analyzing trace with hash -458145797, now seen corresponding path program 1 times [2018-09-19 12:43:39,513 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:43:39,513 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 141 with the following transitions: [2018-09-19 12:43:39,514 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], [385], [393], [401], [409], [417], [425], [433], [441], [449], [453], [455], [458], [466], [474], [482], [490], [495], [498], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:43:39,521 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:43:39,523 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:43:39,651 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:43:39,798 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:43:39,799 INFO L272 AbstractInterpreter]: Visited 78 different actions 221 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 12:43:39,843 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:43:40,211 INFO L232 lantSequenceWeakener]: Weakened 137 states. On average, predicates are now at 74.25% of their original sizes. [2018-09-19 12:43:40,211 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:43:40,519 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:43:40,520 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:43:40,520 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:43:40,520 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:43:40,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:43:40,522 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:43:40,522 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:43:40,523 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand 10 states. [2018-09-19 12:43:44,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:43:44,234 INFO L93 Difference]: Finished difference Result 717 states and 1132 transitions. [2018-09-19 12:43:44,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 12:43:44,237 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2018-09-19 12:43:44,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:43:44,242 INFO L225 Difference]: With dead ends: 717 [2018-09-19 12:43:44,242 INFO L226 Difference]: Without dead ends: 511 [2018-09-19 12:43:44,245 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 146 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 12:43:44,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-09-19 12:43:44,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 505. [2018-09-19 12:43:44,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2018-09-19 12:43:44,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 659 transitions. [2018-09-19 12:43:44,278 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 659 transitions. Word has length 140 [2018-09-19 12:43:44,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:43:44,279 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 659 transitions. [2018-09-19 12:43:44,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:43:44,280 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 659 transitions. [2018-09-19 12:43:44,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-09-19 12:43:44,284 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:43:44,285 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:43:44,285 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:43:44,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1321664972, now seen corresponding path program 1 times [2018-09-19 12:43:44,286 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:43:44,286 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 150 with the following transitions: [2018-09-19 12:43:44,286 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], [385], [393], [401], [409], [417], [425], [433], [441], [449], [453], [455], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:43:44,290 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:43:44,290 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:43:44,357 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:43:44,456 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:43:44,456 INFO L272 AbstractInterpreter]: Visited 87 different actions 248 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 12:43:44,492 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:43:44,687 INFO L232 lantSequenceWeakener]: Weakened 146 states. On average, predicates are now at 74.15% of their original sizes. [2018-09-19 12:43:44,687 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:43:45,061 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:43:45,062 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:43:45,062 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:43:45,062 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:43:45,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:43:45,063 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:43:45,063 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:43:45,064 INFO L87 Difference]: Start difference. First operand 505 states and 659 transitions. Second operand 10 states. [2018-09-19 12:43:48,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:43:48,374 INFO L93 Difference]: Finished difference Result 1149 states and 1716 transitions. [2018-09-19 12:43:48,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:43:48,374 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 149 [2018-09-19 12:43:48,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:43:48,381 INFO L225 Difference]: With dead ends: 1149 [2018-09-19 12:43:48,382 INFO L226 Difference]: Without dead ends: 794 [2018-09-19 12:43:48,384 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 156 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:43:48,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2018-09-19 12:43:48,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 783. [2018-09-19 12:43:48,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2018-09-19 12:43:48,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 991 transitions. [2018-09-19 12:43:48,425 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 991 transitions. Word has length 149 [2018-09-19 12:43:48,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:43:48,426 INFO L480 AbstractCegarLoop]: Abstraction has 783 states and 991 transitions. [2018-09-19 12:43:48,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:43:48,427 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 991 transitions. [2018-09-19 12:43:48,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-09-19 12:43:48,433 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:43:48,433 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, 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] [2018-09-19 12:43:48,434 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:43:48,434 INFO L82 PathProgramCache]: Analyzing trace with hash -429565636, now seen corresponding path program 1 times [2018-09-19 12:43:48,434 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:43:48,434 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 186 with the following transitions: [2018-09-19 12:43:48,435 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], [385], [393], [401], [409], [417], [425], [433], [441], [449], [453], [455], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:43:48,439 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:43:48,440 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:43:48,540 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:43:48,736 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:43:48,736 INFO L272 AbstractInterpreter]: Visited 123 different actions 356 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 12:43:48,772 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:43:49,091 INFO L232 lantSequenceWeakener]: Weakened 182 states. On average, predicates are now at 73.87% of their original sizes. [2018-09-19 12:43:49,092 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:43:49,596 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:43:49,596 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:43:49,596 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:43:49,596 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:43:49,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:43:49,598 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:43:49,598 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:43:49,598 INFO L87 Difference]: Start difference. First operand 783 states and 991 transitions. Second operand 10 states. [2018-09-19 12:43:53,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:43:53,436 INFO L93 Difference]: Finished difference Result 1723 states and 2312 transitions. [2018-09-19 12:43:53,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 12:43:53,436 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 185 [2018-09-19 12:43:53,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:43:53,444 INFO L225 Difference]: With dead ends: 1723 [2018-09-19 12:43:53,445 INFO L226 Difference]: Without dead ends: 1090 [2018-09-19 12:43:53,447 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 191 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 12:43:53,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2018-09-19 12:43:53,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1081. [2018-09-19 12:43:53,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1081 states. [2018-09-19 12:43:53,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1341 transitions. [2018-09-19 12:43:53,485 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1341 transitions. Word has length 185 [2018-09-19 12:43:53,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:43:53,486 INFO L480 AbstractCegarLoop]: Abstraction has 1081 states and 1341 transitions. [2018-09-19 12:43:53,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:43:53,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1341 transitions. [2018-09-19 12:43:53,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-09-19 12:43:53,490 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:43:53,491 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, 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] [2018-09-19 12:43:53,491 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:43:53,491 INFO L82 PathProgramCache]: Analyzing trace with hash -262323077, now seen corresponding path program 1 times [2018-09-19 12:43:53,491 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:43:53,492 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 205 with the following transitions: [2018-09-19 12:43:53,492 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], [385], [393], [401], [409], [417], [425], [433], [441], [449], [453], [455], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [754], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:43:53,497 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:43:53,498 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:43:53,731 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:43:53,731 INFO L272 AbstractInterpreter]: Visited 142 different actions 413 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 12:43:53,769 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:43:54,000 INFO L232 lantSequenceWeakener]: Weakened 201 states. On average, predicates are now at 73.76% of their original sizes. [2018-09-19 12:43:54,000 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:43:54,099 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:43:54,100 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:43:54,100 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:43:54,100 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:43:54,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:43:54,101 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:43:54,101 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:43:54,101 INFO L87 Difference]: Start difference. First operand 1081 states and 1341 transitions. Second operand 10 states. [2018-09-19 12:43:56,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:43:56,599 INFO L93 Difference]: Finished difference Result 2464 states and 3181 transitions. [2018-09-19 12:43:56,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 12:43:56,604 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 204 [2018-09-19 12:43:56,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:43:56,614 INFO L225 Difference]: With dead ends: 2464 [2018-09-19 12:43:56,614 INFO L226 Difference]: Without dead ends: 1533 [2018-09-19 12:43:56,617 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 210 GetRequests, 195 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 12:43:56,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2018-09-19 12:43:56,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1521. [2018-09-19 12:43:56,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1521 states. [2018-09-19 12:43:56,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 1832 transitions. [2018-09-19 12:43:56,672 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 1832 transitions. Word has length 204 [2018-09-19 12:43:56,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:43:56,673 INFO L480 AbstractCegarLoop]: Abstraction has 1521 states and 1832 transitions. [2018-09-19 12:43:56,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:43:56,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 1832 transitions. [2018-09-19 12:43:56,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-09-19 12:43:56,678 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:43:56,678 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:43:56,678 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:43:56,679 INFO L82 PathProgramCache]: Analyzing trace with hash 188173214, now seen corresponding path program 1 times [2018-09-19 12:43:56,679 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:43:56,679 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 217 with the following transitions: [2018-09-19 12:43:56,679 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], [385], [393], [401], [409], [417], [425], [433], [441], [449], [453], [455], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [518], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:43:56,687 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:43:56,688 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:43:56,733 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:43:56,839 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:43:56,839 INFO L272 AbstractInterpreter]: Visited 84 different actions 323 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 12:43:56,876 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:43:57,119 INFO L232 lantSequenceWeakener]: Weakened 213 states. On average, predicates are now at 73.75% of their original sizes. [2018-09-19 12:43:57,119 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:43:57,329 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:43:57,329 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:43:57,329 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:43:57,329 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:43:57,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:43:57,330 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:43:57,331 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:43:57,331 INFO L87 Difference]: Start difference. First operand 1521 states and 1832 transitions. Second operand 10 states. [2018-09-19 12:44:00,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:44:00,318 INFO L93 Difference]: Finished difference Result 3061 states and 3823 transitions. [2018-09-19 12:44:00,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:44:00,319 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 216 [2018-09-19 12:44:00,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:44:00,327 INFO L225 Difference]: With dead ends: 3061 [2018-09-19 12:44:00,327 INFO L226 Difference]: Without dead ends: 1690 [2018-09-19 12:44:00,335 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 223 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:44:00,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2018-09-19 12:44:00,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1672. [2018-09-19 12:44:00,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2018-09-19 12:44:00,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1998 transitions. [2018-09-19 12:44:00,381 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1998 transitions. Word has length 216 [2018-09-19 12:44:00,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:44:00,382 INFO L480 AbstractCegarLoop]: Abstraction has 1672 states and 1998 transitions. [2018-09-19 12:44:00,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:44:00,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1998 transitions. [2018-09-19 12:44:00,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-09-19 12:44:00,387 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:44:00,387 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:44:00,387 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:44:00,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1377494764, now seen corresponding path program 1 times [2018-09-19 12:44:00,388 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:44:00,388 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 223 with the following transitions: [2018-09-19 12:44:00,388 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], [385], [393], [401], [409], [417], [425], [433], [441], [449], [453], [455], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:44:00,391 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:44:00,391 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:44:00,436 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:44:00,537 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:44:00,537 INFO L272 AbstractInterpreter]: Visited 88 different actions 340 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:44:00,573 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:44:00,795 INFO L232 lantSequenceWeakener]: Weakened 219 states. On average, predicates are now at 73.72% of their original sizes. [2018-09-19 12:44:00,795 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:44:01,100 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:44:01,101 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:44:01,101 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:44:01,101 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:44:01,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:44:01,102 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:44:01,102 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:44:01,102 INFO L87 Difference]: Start difference. First operand 1672 states and 1998 transitions. Second operand 10 states. [2018-09-19 12:44:04,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:44:04,524 INFO L93 Difference]: Finished difference Result 3508 states and 4339 transitions. [2018-09-19 12:44:04,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:44:04,525 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 222 [2018-09-19 12:44:04,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:44:04,536 INFO L225 Difference]: With dead ends: 3508 [2018-09-19 12:44:04,537 INFO L226 Difference]: Without dead ends: 1986 [2018-09-19 12:44:04,541 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 229 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:44:04,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1986 states. [2018-09-19 12:44:04,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1986 to 1956. [2018-09-19 12:44:04,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1956 states. [2018-09-19 12:44:04,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1956 states to 1956 states and 2368 transitions. [2018-09-19 12:44:04,600 INFO L78 Accepts]: Start accepts. Automaton has 1956 states and 2368 transitions. Word has length 222 [2018-09-19 12:44:04,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:44:04,602 INFO L480 AbstractCegarLoop]: Abstraction has 1956 states and 2368 transitions. [2018-09-19 12:44:04,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:44:04,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1956 states and 2368 transitions. [2018-09-19 12:44:04,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-09-19 12:44:04,607 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:44:04,608 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:44:04,608 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:44:04,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1632996357, now seen corresponding path program 1 times [2018-09-19 12:44:04,608 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:44:04,609 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 228 with the following transitions: [2018-09-19 12:44:04,609 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], [385], [393], [401], [409], [417], [425], [433], [441], [449], [453], [455], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:44:04,611 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:44:04,611 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:44:04,660 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:44:04,885 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-19 12:44:04,885 INFO L272 AbstractInterpreter]: Visited 89 different actions 342 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:44:04,921 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 12:44:04,963 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 12:44:04,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 12:44:04 BoogieIcfgContainer [2018-09-19 12:44:04,964 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 12:44:04,965 INFO L168 Benchmark]: Toolchain (without parser) took 34429.18 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 925.6 MB. Max. memory is 7.1 GB. [2018-09-19 12:44:04,967 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 12:44:04,968 INFO L168 Benchmark]: CACSL2BoogieTranslator took 791.62 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-19 12:44:04,969 INFO L168 Benchmark]: Boogie Procedure Inliner took 118.44 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-19 12:44:04,969 INFO L168 Benchmark]: Boogie Preprocessor took 256.02 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 766.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -862.7 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. [2018-09-19 12:44:04,970 INFO L168 Benchmark]: RCFGBuilder took 3433.17 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 107.1 MB). Peak memory consumption was 107.1 MB. Max. memory is 7.1 GB. [2018-09-19 12:44:04,971 INFO L168 Benchmark]: TraceAbstraction took 29823.06 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 446.2 MB). Free memory was 2.1 GB in the beginning and 2.6 GB in the end (delta: -485.3 MB). Peak memory consumption was 861.9 MB. Max. memory is 7.1 GB. [2018-09-19 12:44:04,976 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.26 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 791.62 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 118.44 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 256.02 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 766.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -862.7 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3433.17 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 107.1 MB). Peak memory consumption was 107.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 29823.06 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 446.2 MB). Free memory was 2.1 GB in the beginning and 2.6 GB in the end (delta: -485.3 MB). Peak memory consumption was 861.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 190]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L7] int inputC = 3; [L8] int inputD = 4; [L9] int inputE = 5; [L10] int inputF = 6; [L11] int inputB = 2; [L14] int a1 = 23; [L15] int a19 = 9; [L16] int a10 = 0; [L17] int a12 = 0; [L18] int a4 = 14; [L579] int output = -1; [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND TRUE (((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0)) [L255] a1 = (((a1 / 5) + 110755) + 220746) [L256] a10 = 1 [L257] a19 = 8 [L259] RET return -1; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND TRUE (((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0)) [L245] a1 = (((((a1 % 25)- -13) - 42605) / 5) - -8517) [L246] a10 = 3 [L248] RET return 26; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND TRUE (((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)) [L190] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNKNOWN Result, 29.7s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 22.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1405 SDtfs, 3975 SDslu, 2133 SDs, 0 SdLazy, 11560 SolverSat, 1156 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.5s Time, PredicateUnifierStatistics: 14 DeclaredPredicates, 1223 GetRequests, 1126 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1956occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.4s AbstIntTime, 8 AbstIntIterations, 7 AbstIntStrong, 0.9970121577691525 AbsIntWeakeningRatio, 0.12393887945670629 AbsIntAvgWeakeningVarsNumRemoved, 21.092529711375214 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 88 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: No data available, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label54_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_12-44-04-992.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label54_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_12-44-04-992.csv Received shutdown request...