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_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label27_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 03:27:31,740 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 03:27:31,742 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 03:27:31,758 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 03:27:31,759 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 03:27:31,760 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 03:27:31,761 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 03:27:31,764 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 03:27:31,766 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 03:27:31,773 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 03:27:31,778 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 03:27:31,778 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 03:27:31,779 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 03:27:31,780 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 03:27:31,782 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 03:27:31,782 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 03:27:31,783 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 03:27:31,785 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 03:27:31,787 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 03:27:31,789 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 03:27:31,790 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 03:27:31,791 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 03:27:31,794 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 03:27:31,794 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 03:27:31,794 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 03:27:31,795 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 03:27:31,796 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 03:27:31,796 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 03:27:31,797 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 03:27:31,798 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 03:27:31,798 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 03:27:31,799 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 03:27:31,799 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 03:27:31,799 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 03:27:31,800 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 03:27:31,801 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 03:27:31,801 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf [2018-09-19 03:27:31,819 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 03:27:31,819 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 03:27:31,820 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 03:27:31,821 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 03:27:31,821 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 03:27:31,821 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 03:27:31,821 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 03:27:31,822 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-19 03:27:31,822 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 03:27:31,822 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 03:27:31,822 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 03:27:31,823 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-19 03:27:31,824 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 03:27:31,824 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 03:27:31,824 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 03:27:31,825 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 03:27:31,825 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 03:27:31,825 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 03:27:31,825 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 03:27:31,825 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 03:27:31,826 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 03:27:31,826 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 03:27:31,826 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 03:27:31,826 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 03:27:31,827 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 03:27:31,828 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 03:27:31,828 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 03:27:31,828 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 03:27:31,828 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 03:27:31,828 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 03:27:31,829 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 03:27:31,829 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 03:27:31,829 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 03:27:31,829 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 03:27:31,898 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 03:27:31,916 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 03:27:31,924 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 03:27:31,926 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 03:27:31,926 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 03:27:31,927 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label27_true-unreach-call.c [2018-09-19 03:27:32,312 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dabfaf8ce/8a3efb6bf9bb44e69179d9f4e63ae80c/FLAGb37d8d673 [2018-09-19 03:27:32,621 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 03:27:32,623 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label27_true-unreach-call.c [2018-09-19 03:27:32,641 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dabfaf8ce/8a3efb6bf9bb44e69179d9f4e63ae80c/FLAGb37d8d673 [2018-09-19 03:27:32,665 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dabfaf8ce/8a3efb6bf9bb44e69179d9f4e63ae80c [2018-09-19 03:27:32,681 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 03:27:32,684 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 03:27:32,686 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 03:27:32,686 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 03:27:32,696 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 03:27:32,698 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:27:32" (1/1) ... [2018-09-19 03:27:32,701 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23cf82e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:27:32, skipping insertion in model container [2018-09-19 03:27:32,701 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:27:32" (1/1) ... [2018-09-19 03:27:32,714 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 03:27:33,204 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 03:27:33,225 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 03:27:33,362 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 03:27:33,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:27:33 WrapperNode [2018-09-19 03:27:33,415 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 03:27:33,416 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 03:27:33,416 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 03:27:33,417 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 03:27:33,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:27:33" (1/1) ... [2018-09-19 03:27:33,454 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:27:33" (1/1) ... [2018-09-19 03:27:33,537 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 03:27:33,538 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 03:27:33,538 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 03:27:33,538 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 03:27:33,718 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:27:33" (1/1) ... [2018-09-19 03:27:33,719 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:27:33" (1/1) ... [2018-09-19 03:27:33,734 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:27:33" (1/1) ... [2018-09-19 03:27:33,734 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:27:33" (1/1) ... [2018-09-19 03:27:33,772 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:27:33" (1/1) ... [2018-09-19 03:27:33,799 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:27:33" (1/1) ... [2018-09-19 03:27:33,812 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:27:33" (1/1) ... [2018-09-19 03:27:33,822 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 03:27:33,822 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 03:27:33,823 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 03:27:33,823 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 03:27:33,824 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:27:33" (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 03:27:33,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 03:27:33,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 03:27:33,905 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 03:27:33,906 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 03:27:33,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 03:27:33,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 03:27:33,906 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 03:27:33,906 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 03:27:37,007 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 03:27:37,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:27:37 BoogieIcfgContainer [2018-09-19 03:27:37,008 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 03:27:37,009 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 03:27:37,009 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 03:27:37,013 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 03:27:37,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 03:27:32" (1/3) ... [2018-09-19 03:27:37,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49abebb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:27:37, skipping insertion in model container [2018-09-19 03:27:37,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:27:33" (2/3) ... [2018-09-19 03:27:37,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49abebb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:27:37, skipping insertion in model container [2018-09-19 03:27:37,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:27:37" (3/3) ... [2018-09-19 03:27:37,017 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label27_true-unreach-call.c [2018-09-19 03:27:37,027 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 03:27:37,037 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 03:27:37,094 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 03:27:37,095 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 03:27:37,095 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 03:27:37,095 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 03:27:37,095 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 03:27:37,096 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 03:27:37,096 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 03:27:37,096 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 03:27:37,096 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 03:27:37,132 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-19 03:27:37,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-09-19 03:27:37,149 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:27:37,150 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] [2018-09-19 03:27:37,151 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:27:37,156 INFO L82 PathProgramCache]: Analyzing trace with hash 51771233, now seen corresponding path program 1 times [2018-09-19 03:27:37,158 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:27:37,159 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 68 with the following transitions: [2018-09-19 03:27:37,162 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], [437], [439], [796], [800], [806], [810], [817], [818], [819], [821] [2018-09-19 03:27:37,232 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:27:37,232 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:27:39,046 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:27:39,048 INFO L272 AbstractInterpreter]: Visited 66 different actions 66 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-19 03:27:39,085 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:27:40,021 INFO L232 lantSequenceWeakener]: Weakened 65 states. On average, predicates are now at 76.07% of their original sizes. [2018-09-19 03:27:40,021 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:27:40,316 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:27:40,318 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:27:40,318 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 03:27:40,318 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:27:40,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 03:27:40,335 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 03:27:40,336 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 03:27:40,339 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 6 states. [2018-09-19 03:27:43,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:27:43,592 INFO L93 Difference]: Finished difference Result 576 states and 995 transitions. [2018-09-19 03:27:43,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 03:27:43,595 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-09-19 03:27:43,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:27:43,620 INFO L225 Difference]: With dead ends: 576 [2018-09-19 03:27:43,620 INFO L226 Difference]: Without dead ends: 358 [2018-09-19 03:27:43,630 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 66 GetRequests, 62 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 03:27:43,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-09-19 03:27:43,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-09-19 03:27:43,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-19 03:27:43,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2018-09-19 03:27:43,736 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 67 [2018-09-19 03:27:43,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:27:43,737 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2018-09-19 03:27:43,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 03:27:43,737 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2018-09-19 03:27:43,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-09-19 03:27:43,744 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:27:43,745 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 03:27:43,745 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:27:43,746 INFO L82 PathProgramCache]: Analyzing trace with hash -316431117, now seen corresponding path program 1 times [2018-09-19 03:27:43,746 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:27:43,746 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 139 with the following transitions: [2018-09-19 03:27:43,746 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], [437], [439], [442], [450], [458], [466], [474], [482], [490], [495], [498], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:27:43,752 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:27:43,753 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:27:45,601 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:27:48,606 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:27:48,606 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 03:27:48,613 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:27:49,671 INFO L232 lantSequenceWeakener]: Weakened 136 states. On average, predicates are now at 74.39% of their original sizes. [2018-09-19 03:27:49,671 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:27:50,168 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:27:50,168 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:27:50,168 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 03:27:50,168 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:27:50,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 03:27:50,170 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 03:27:50,170 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 03:27:50,171 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand 10 states. [2018-09-19 03:27:58,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:27:58,517 INFO L93 Difference]: Finished difference Result 717 states and 1132 transitions. [2018-09-19 03:27:58,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 03:27:58,526 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 138 [2018-09-19 03:27:58,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:27:58,536 INFO L225 Difference]: With dead ends: 717 [2018-09-19 03:27:58,537 INFO L226 Difference]: Without dead ends: 511 [2018-09-19 03:27:58,541 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 144 GetRequests, 129 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 03:27:58,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-09-19 03:27:58,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 505. [2018-09-19 03:27:58,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2018-09-19 03:27:58,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 659 transitions. [2018-09-19 03:27:58,588 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 659 transitions. Word has length 138 [2018-09-19 03:27:58,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:27:58,590 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 659 transitions. [2018-09-19 03:27:58,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 03:27:58,590 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 659 transitions. [2018-09-19 03:27:58,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-09-19 03:27:58,598 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:27:58,598 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, 1, 1, 1, 1, 1, 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 03:27:58,599 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:27:58,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1486602668, now seen corresponding path program 1 times [2018-09-19 03:27:58,599 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:27:58,599 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 148 with the following transitions: [2018-09-19 03:27:58,600 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], [437], [439], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:27:58,609 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:27:58,609 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:28:04,176 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:28:06,165 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:28:06,166 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 03:28:06,172 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:28:07,415 INFO L232 lantSequenceWeakener]: Weakened 145 states. On average, predicates are now at 74.29% of their original sizes. [2018-09-19 03:28:07,415 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:28:08,582 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:28:08,583 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:28:08,583 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-19 03:28:08,583 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:28:08,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-19 03:28:08,584 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-19 03:28:08,584 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-09-19 03:28:08,584 INFO L87 Difference]: Start difference. First operand 505 states and 659 transitions. Second operand 13 states. [2018-09-19 03:28:17,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:28:17,320 INFO L93 Difference]: Finished difference Result 1333 states and 2076 transitions. [2018-09-19 03:28:17,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-19 03:28:17,322 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 147 [2018-09-19 03:28:17,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:28:17,333 INFO L225 Difference]: With dead ends: 1333 [2018-09-19 03:28:17,333 INFO L226 Difference]: Without dead ends: 978 [2018-09-19 03:28:17,336 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 161 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=164, Invalid=592, Unknown=0, NotChecked=0, Total=756 [2018-09-19 03:28:17,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2018-09-19 03:28:17,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 762. [2018-09-19 03:28:17,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2018-09-19 03:28:17,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 943 transitions. [2018-09-19 03:28:17,380 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 943 transitions. Word has length 147 [2018-09-19 03:28:17,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:28:17,381 INFO L480 AbstractCegarLoop]: Abstraction has 762 states and 943 transitions. [2018-09-19 03:28:17,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-19 03:28:17,381 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 943 transitions. [2018-09-19 03:28:17,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-09-19 03:28:17,385 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:28:17,385 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:28:17,385 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:28:17,386 INFO L82 PathProgramCache]: Analyzing trace with hash -62017868, now seen corresponding path program 1 times [2018-09-19 03:28:17,386 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:28:17,386 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 184 with the following transitions: [2018-09-19 03:28:17,387 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], [437], [439], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:28:17,392 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:28:17,392 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:28:19,944 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:28:25,882 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:28:25,883 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 03:28:25,922 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:28:27,274 INFO L232 lantSequenceWeakener]: Weakened 181 states. On average, predicates are now at 73.98% of their original sizes. [2018-09-19 03:28:27,274 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:28:27,762 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:28:27,763 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:28:27,763 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-19 03:28:27,763 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:28:27,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-19 03:28:27,764 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-19 03:28:27,764 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-09-19 03:28:27,765 INFO L87 Difference]: Start difference. First operand 762 states and 943 transitions. Second operand 12 states. [2018-09-19 03:28:36,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:28:36,240 INFO L93 Difference]: Finished difference Result 1677 states and 2200 transitions. [2018-09-19 03:28:36,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 03:28:36,241 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 183 [2018-09-19 03:28:36,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:28:36,247 INFO L225 Difference]: With dead ends: 1677 [2018-09-19 03:28:36,248 INFO L226 Difference]: Without dead ends: 1067 [2018-09-19 03:28:36,250 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 191 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2018-09-19 03:28:36,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2018-09-19 03:28:36,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1056. [2018-09-19 03:28:36,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1056 states. [2018-09-19 03:28:36,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1277 transitions. [2018-09-19 03:28:36,293 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1277 transitions. Word has length 183 [2018-09-19 03:28:36,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:28:36,294 INFO L480 AbstractCegarLoop]: Abstraction has 1056 states and 1277 transitions. [2018-09-19 03:28:36,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-19 03:28:36,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1277 transitions. [2018-09-19 03:28:36,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-09-19 03:28:36,298 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:28:36,298 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:28:36,298 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:28:36,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1439184525, now seen corresponding path program 1 times [2018-09-19 03:28:36,299 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:28:36,299 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 203 with the following transitions: [2018-09-19 03:28:36,299 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], [437], [439], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [754], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:28:36,304 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:28:36,305 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:28:45,452 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:28:45,453 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 03:28:45,461 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:28:46,801 INFO L232 lantSequenceWeakener]: Weakened 200 states. On average, predicates are now at 73.86% of their original sizes. [2018-09-19 03:28:46,801 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:28:47,186 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:28:47,186 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:28:47,186 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-19 03:28:47,186 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:28:47,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-19 03:28:47,187 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-19 03:28:47,187 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-09-19 03:28:47,188 INFO L87 Difference]: Start difference. First operand 1056 states and 1277 transitions. Second operand 12 states. [2018-09-19 03:28:51,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:28:51,950 INFO L93 Difference]: Finished difference Result 2268 states and 2879 transitions. [2018-09-19 03:28:51,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-19 03:28:51,951 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 202 [2018-09-19 03:28:51,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:28:51,962 INFO L225 Difference]: With dead ends: 2268 [2018-09-19 03:28:51,962 INFO L226 Difference]: Without dead ends: 1364 [2018-09-19 03:28:51,967 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 211 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2018-09-19 03:28:51,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2018-09-19 03:28:52,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1352. [2018-09-19 03:28:52,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-09-19 03:28:52,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1605 transitions. [2018-09-19 03:28:52,036 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1605 transitions. Word has length 202 [2018-09-19 03:28:52,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:28:52,037 INFO L480 AbstractCegarLoop]: Abstraction has 1352 states and 1605 transitions. [2018-09-19 03:28:52,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-19 03:28:52,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1605 transitions. [2018-09-19 03:28:52,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-09-19 03:28:52,042 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:28:52,042 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 03:28:52,043 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:28:52,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1879326070, now seen corresponding path program 1 times [2018-09-19 03:28:52,043 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:28:52,044 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 215 with the following transitions: [2018-09-19 03:28:52,044 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], [437], [439], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [518], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:28:52,054 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:28:52,054 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:28:53,583 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:28:58,329 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:28:58,330 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 03:28:58,339 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:28:59,610 INFO L232 lantSequenceWeakener]: Weakened 212 states. On average, predicates are now at 73.84% of their original sizes. [2018-09-19 03:28:59,611 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:28:59,884 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:28:59,885 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:28:59,885 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 03:28:59,885 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:28:59,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 03:28:59,886 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 03:28:59,886 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 03:28:59,886 INFO L87 Difference]: Start difference. First operand 1352 states and 1605 transitions. Second operand 10 states. [2018-09-19 03:29:04,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:29:04,103 INFO L93 Difference]: Finished difference Result 2719 states and 3368 transitions. [2018-09-19 03:29:04,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 03:29:04,106 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 214 [2018-09-19 03:29:04,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:29:04,118 INFO L225 Difference]: With dead ends: 2719 [2018-09-19 03:29:04,120 INFO L226 Difference]: Without dead ends: 1521 [2018-09-19 03:29:04,124 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 221 GetRequests, 205 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 03:29:04,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2018-09-19 03:29:04,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1503. [2018-09-19 03:29:04,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2018-09-19 03:29:04,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1772 transitions. [2018-09-19 03:29:04,205 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1772 transitions. Word has length 214 [2018-09-19 03:29:04,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:29:04,207 INFO L480 AbstractCegarLoop]: Abstraction has 1503 states and 1772 transitions. [2018-09-19 03:29:04,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 03:29:04,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1772 transitions. [2018-09-19 03:29:04,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-09-19 03:29:04,213 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:29:04,214 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 03:29:04,214 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:29:04,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1810461357, now seen corresponding path program 1 times [2018-09-19 03:29:04,215 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:29:04,215 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 226 with the following transitions: [2018-09-19 03:29:04,215 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], [437], [439], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:29:04,218 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:29:04,218 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:29:07,822 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:29:11,989 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:29:11,989 INFO L272 AbstractInterpreter]: Visited 88 different actions 341 times. Merged at 7 different actions 22 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 03:29:12,025 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:29:13,194 INFO L232 lantSequenceWeakener]: Weakened 223 states. On average, predicates are now at 73.78% of their original sizes. [2018-09-19 03:29:13,195 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:29:13,685 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:29:13,686 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:29:13,686 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-19 03:29:13,686 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:29:13,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-19 03:29:13,687 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-19 03:29:13,687 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-09-19 03:29:13,687 INFO L87 Difference]: Start difference. First operand 1503 states and 1772 transitions. Second operand 13 states. [2018-09-19 03:29:21,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:29:21,680 INFO L93 Difference]: Finished difference Result 3686 states and 4637 transitions. [2018-09-19 03:29:21,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 03:29:21,689 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 225 [2018-09-19 03:29:21,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:29:21,701 INFO L225 Difference]: With dead ends: 3686 [2018-09-19 03:29:21,701 INFO L226 Difference]: Without dead ends: 2337 [2018-09-19 03:29:21,706 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 237 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2018-09-19 03:29:21,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2018-09-19 03:29:21,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 2189. [2018-09-19 03:29:21,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2189 states. [2018-09-19 03:29:21,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2189 states to 2189 states and 2615 transitions. [2018-09-19 03:29:21,793 INFO L78 Accepts]: Start accepts. Automaton has 2189 states and 2615 transitions. Word has length 225 [2018-09-19 03:29:21,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:29:21,794 INFO L480 AbstractCegarLoop]: Abstraction has 2189 states and 2615 transitions. [2018-09-19 03:29:21,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-19 03:29:21,794 INFO L276 IsEmpty]: Start isEmpty. Operand 2189 states and 2615 transitions. [2018-09-19 03:29:21,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-09-19 03:29:21,800 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:29:21,800 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 03:29:21,800 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:29:21,800 INFO L82 PathProgramCache]: Analyzing trace with hash -631074681, now seen corresponding path program 1 times [2018-09-19 03:29:21,800 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:29:21,801 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 236 with the following transitions: [2018-09-19 03:29:21,801 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [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], [437], [439], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:29:21,804 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:29:21,804 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:29:25,158 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:29:38,320 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:29:38,320 INFO L272 AbstractInterpreter]: Visited 96 different actions 555 times. Merged at 7 different actions 34 times. Widened at 1 different actions 1 times. Found 6 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 03:29:38,330 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:29:39,924 INFO L232 lantSequenceWeakener]: Weakened 233 states. On average, predicates are now at 73.74% of their original sizes. [2018-09-19 03:29:39,925 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:29:40,443 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:29:40,444 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:29:40,444 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-19 03:29:40,444 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:29:40,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-19 03:29:40,445 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-19 03:29:40,445 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-09-19 03:29:40,447 INFO L87 Difference]: Start difference. First operand 2189 states and 2615 transitions. Second operand 13 states. [2018-09-19 03:29:49,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:29:49,437 INFO L93 Difference]: Finished difference Result 5360 states and 6747 transitions. [2018-09-19 03:29:49,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 03:29:49,441 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 235 [2018-09-19 03:29:49,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:29:49,454 INFO L225 Difference]: With dead ends: 5360 [2018-09-19 03:29:49,454 INFO L226 Difference]: Without dead ends: 3325 [2018-09-19 03:29:49,460 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 247 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2018-09-19 03:29:49,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3325 states. [2018-09-19 03:29:49,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3325 to 3019. [2018-09-19 03:29:49,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3019 states. [2018-09-19 03:29:49,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3019 states to 3019 states and 3715 transitions. [2018-09-19 03:29:49,564 INFO L78 Accepts]: Start accepts. Automaton has 3019 states and 3715 transitions. Word has length 235 [2018-09-19 03:29:49,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:29:49,565 INFO L480 AbstractCegarLoop]: Abstraction has 3019 states and 3715 transitions. [2018-09-19 03:29:49,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-19 03:29:49,565 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 3715 transitions. [2018-09-19 03:29:49,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-09-19 03:29:49,573 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:29:49,574 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, 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] [2018-09-19 03:29:49,574 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:29:49,574 INFO L82 PathProgramCache]: Analyzing trace with hash 117318037, now seen corresponding path program 1 times [2018-09-19 03:29:49,574 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:29:49,575 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 252 with the following transitions: [2018-09-19 03:29:49,575 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], [437], [439], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:29:49,578 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:29:49,578 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:29:50,830 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:29:59,916 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:29:59,916 INFO L272 AbstractInterpreter]: Visited 121 different actions 471 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 03:29:59,923 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:30:01,235 INFO L232 lantSequenceWeakener]: Weakened 249 states. On average, predicates are now at 73.67% of their original sizes. [2018-09-19 03:30:01,235 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:30:01,741 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:30:01,742 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:30:01,742 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-19 03:30:01,742 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:30:01,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-19 03:30:01,743 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-19 03:30:01,743 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-09-19 03:30:01,743 INFO L87 Difference]: Start difference. First operand 3019 states and 3715 transitions. Second operand 13 states. [2018-09-19 03:30:10,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:30:10,073 INFO L93 Difference]: Finished difference Result 6300 states and 8063 transitions. [2018-09-19 03:30:10,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 03:30:10,075 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 251 [2018-09-19 03:30:10,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:30:10,090 INFO L225 Difference]: With dead ends: 6300 [2018-09-19 03:30:10,090 INFO L226 Difference]: Without dead ends: 3435 [2018-09-19 03:30:10,098 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 263 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2018-09-19 03:30:10,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3435 states. [2018-09-19 03:30:10,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3435 to 3305. [2018-09-19 03:30:10,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3305 states. [2018-09-19 03:30:10,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3305 states to 3305 states and 4062 transitions. [2018-09-19 03:30:10,216 INFO L78 Accepts]: Start accepts. Automaton has 3305 states and 4062 transitions. Word has length 251 [2018-09-19 03:30:10,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:30:10,218 INFO L480 AbstractCegarLoop]: Abstraction has 3305 states and 4062 transitions. [2018-09-19 03:30:10,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-19 03:30:10,218 INFO L276 IsEmpty]: Start isEmpty. Operand 3305 states and 4062 transitions. [2018-09-19 03:30:10,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-09-19 03:30:10,224 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:30:10,225 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 03:30:10,225 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:30:10,225 INFO L82 PathProgramCache]: Analyzing trace with hash 183130148, now seen corresponding path program 1 times [2018-09-19 03:30:10,225 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:30:10,226 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 257 with the following transitions: [2018-09-19 03:30:10,226 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [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], [437], [439], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:30:10,230 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:30:10,230 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:30:12,930 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:30:23,617 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:30:23,617 INFO L272 AbstractInterpreter]: Visited 124 different actions 603 times. Merged at 7 different actions 27 times. Never widened. Found 5 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 03:30:23,624 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:30:25,067 INFO L232 lantSequenceWeakener]: Weakened 254 states. On average, predicates are now at 73.65% of their original sizes. [2018-09-19 03:30:25,068 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:30:25,364 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:30:25,365 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:30:25,365 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 03:30:25,365 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:30:25,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 03:30:25,366 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 03:30:25,366 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 03:30:25,366 INFO L87 Difference]: Start difference. First operand 3305 states and 4062 transitions. Second operand 10 states. [2018-09-19 03:30:31,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:30:31,298 INFO L93 Difference]: Finished difference Result 6634 states and 8307 transitions. [2018-09-19 03:30:31,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 03:30:31,299 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 256 [2018-09-19 03:30:31,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:30:31,316 INFO L225 Difference]: With dead ends: 6634 [2018-09-19 03:30:31,316 INFO L226 Difference]: Without dead ends: 3483 [2018-09-19 03:30:31,325 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 263 GetRequests, 247 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 03:30:31,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3483 states. [2018-09-19 03:30:31,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3483 to 3457. [2018-09-19 03:30:31,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3457 states. [2018-09-19 03:30:31,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3457 states to 3457 states and 4260 transitions. [2018-09-19 03:30:31,463 INFO L78 Accepts]: Start accepts. Automaton has 3457 states and 4260 transitions. Word has length 256 [2018-09-19 03:30:31,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:30:31,464 INFO L480 AbstractCegarLoop]: Abstraction has 3457 states and 4260 transitions. [2018-09-19 03:30:31,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 03:30:31,464 INFO L276 IsEmpty]: Start isEmpty. Operand 3457 states and 4260 transitions. [2018-09-19 03:30:31,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-09-19 03:30:31,473 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:30:31,474 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 03:30:31,474 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:30:31,475 INFO L82 PathProgramCache]: Analyzing trace with hash 170547091, now seen corresponding path program 1 times [2018-09-19 03:30:31,475 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:30:31,475 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 258 with the following transitions: [2018-09-19 03:30:31,475 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], [437], [439], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:30:31,479 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:30:31,479 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:30:35,822 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:30:47,191 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:30:47,191 INFO L272 AbstractInterpreter]: Visited 118 different actions 687 times. Merged at 7 different actions 34 times. Widened at 1 different actions 1 times. Found 6 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 03:30:47,198 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:30:49,125 INFO L232 lantSequenceWeakener]: Weakened 255 states. On average, predicates are now at 73.65% of their original sizes. [2018-09-19 03:30:49,125 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:30:49,997 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:30:49,998 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:30:49,998 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-19 03:30:49,998 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:30:49,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-19 03:30:49,999 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-19 03:30:49,999 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-09-19 03:30:49,999 INFO L87 Difference]: Start difference. First operand 3457 states and 4260 transitions. Second operand 13 states. [2018-09-19 03:30:58,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:30:58,003 INFO L93 Difference]: Finished difference Result 8601 states and 11011 transitions. [2018-09-19 03:30:58,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 03:30:58,004 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 257 [2018-09-19 03:30:58,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:30:58,030 INFO L225 Difference]: With dead ends: 8601 [2018-09-19 03:30:58,030 INFO L226 Difference]: Without dead ends: 5298 [2018-09-19 03:30:58,041 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 269 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2018-09-19 03:30:58,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5298 states. [2018-09-19 03:30:58,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5298 to 4845. [2018-09-19 03:30:58,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4845 states. [2018-09-19 03:30:58,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4845 states to 4845 states and 6065 transitions. [2018-09-19 03:30:58,212 INFO L78 Accepts]: Start accepts. Automaton has 4845 states and 6065 transitions. Word has length 257 [2018-09-19 03:30:58,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:30:58,213 INFO L480 AbstractCegarLoop]: Abstraction has 4845 states and 6065 transitions. [2018-09-19 03:30:58,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-19 03:30:58,213 INFO L276 IsEmpty]: Start isEmpty. Operand 4845 states and 6065 transitions. [2018-09-19 03:30:58,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-09-19 03:30:58,222 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:30:58,222 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, 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] [2018-09-19 03:30:58,222 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:30:58,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1403858525, now seen corresponding path program 1 times [2018-09-19 03:30:58,223 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:30:58,223 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 266 with the following transitions: [2018-09-19 03:30:58,224 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], [437], [439], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [542], [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 03:30:58,227 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:30:58,228 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:31:01,440 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:31:16,143 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:31:16,144 INFO L272 AbstractInterpreter]: Visited 124 different actions 723 times. Merged at 7 different actions 34 times. Widened at 1 different actions 1 times. Found 6 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 03:31:16,149 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:31:17,725 INFO L232 lantSequenceWeakener]: Weakened 263 states. On average, predicates are now at 73.62% of their original sizes. [2018-09-19 03:31:17,726 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:31:18,080 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:31:18,081 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:31:18,081 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-19 03:31:18,081 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:31:18,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-19 03:31:18,082 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-19 03:31:18,082 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-09-19 03:31:18,083 INFO L87 Difference]: Start difference. First operand 4845 states and 6065 transitions. Second operand 11 states. [2018-09-19 03:31:26,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:31:26,991 INFO L93 Difference]: Finished difference Result 9755 states and 12399 transitions. [2018-09-19 03:31:26,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 03:31:26,991 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 265 [2018-09-19 03:31:26,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:31:27,013 INFO L225 Difference]: With dead ends: 9755 [2018-09-19 03:31:27,013 INFO L226 Difference]: Without dead ends: 5064 [2018-09-19 03:31:27,024 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 273 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2018-09-19 03:31:27,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5064 states. [2018-09-19 03:31:27,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5064 to 5004. [2018-09-19 03:31:27,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5004 states. [2018-09-19 03:31:27,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5004 states to 5004 states and 6279 transitions. [2018-09-19 03:31:27,183 INFO L78 Accepts]: Start accepts. Automaton has 5004 states and 6279 transitions. Word has length 265 [2018-09-19 03:31:27,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:31:27,184 INFO L480 AbstractCegarLoop]: Abstraction has 5004 states and 6279 transitions. [2018-09-19 03:31:27,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-19 03:31:27,184 INFO L276 IsEmpty]: Start isEmpty. Operand 5004 states and 6279 transitions. [2018-09-19 03:31:27,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-09-19 03:31:27,194 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:31:27,195 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 03:31:27,195 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:31:27,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1743147136, now seen corresponding path program 1 times [2018-09-19 03:31:27,196 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:31:27,196 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 287 with the following transitions: [2018-09-19 03:31:27,196 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], [437], [439], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [626], [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 03:31:27,200 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:31:27,200 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:31:30,196 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. Received shutdown request... [2018-09-19 03:31:42,572 WARN L572 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-09-19 03:31:42,572 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-09-19 03:31:42,573 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 03:31:42,609 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 03:31:42,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 03:31:42 BoogieIcfgContainer [2018-09-19 03:31:42,610 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 03:31:42,611 INFO L168 Benchmark]: Toolchain (without parser) took 249929.40 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -830.0 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-19 03:31:42,612 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 03:31:42,613 INFO L168 Benchmark]: CACSL2BoogieTranslator took 729.85 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-19 03:31:42,614 INFO L168 Benchmark]: Boogie Procedure Inliner took 121.11 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 03:31:42,615 INFO L168 Benchmark]: Boogie Preprocessor took 284.32 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 758.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -837.7 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. [2018-09-19 03:31:42,616 INFO L168 Benchmark]: RCFGBuilder took 3185.62 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: 125.3 MB). Peak memory consumption was 125.3 MB. Max. memory is 7.1 GB. [2018-09-19 03:31:42,617 INFO L168 Benchmark]: TraceAbstraction took 245601.07 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -159.8 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-09-19 03:31:42,623 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 729.85 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 121.11 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 284.32 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 758.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -837.7 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3185.62 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: 125.3 MB). Peak memory consumption was 125.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 245601.07 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -159.8 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 184]: 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 FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L425] COND TRUE ((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0)) [L426] a1 = ((((a1 / 5) * 5) / 5) + 505228) [L427] a10 = 1 [L429] RET return 25; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L360] COND TRUE ((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)))))) [L361] a1 = ((((a1 - 46038) + -455425) * 10)/ 9) [L362] a19 = 10 [L364] RET return 24; [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 TRUE (((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7)) [L184] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNKNOWN Result, 245.5s OverallTime, 13 OverallIterations, 3 TraceHistogramMax, 86.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2362 SDtfs, 12256 SDslu, 3486 SDs, 0 SdLazy, 21903 SolverSat, 2820 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 73.7s Time, PredicateUnifierStatistics: 24 DeclaredPredicates, 2546 GetRequests, 2316 SyntacticMatches, 0 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 944 ImplicationChecksByTransitivity, 10.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5004occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 135.4s AbstIntTime, 13 AbstIntIterations, 12 AbstIntStrong, 0.9947994331612096 AbsIntWeakeningRatio, 0.11367380560131796 AbsIntAvgWeakeningVarsNumRemoved, 895.3463756177924 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 1388 StatesRemovedByMinimization, 12 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_label27_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_03-31-42-654.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label27_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_03-31-42-654.csv Completed graceful shutdown