java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem11_label19_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 12:44:27,844 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 12:44:27,846 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 12:44:27,858 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 12:44:27,858 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 12:44:27,859 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 12:44:27,860 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 12:44:27,862 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 12:44:27,864 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 12:44:27,865 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 12:44:27,865 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 12:44:27,866 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 12:44:27,867 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 12:44:27,867 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 12:44:27,869 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 12:44:27,869 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 12:44:27,870 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 12:44:27,872 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 12:44:27,874 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 12:44:27,876 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 12:44:27,877 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 12:44:27,878 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 12:44:27,880 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 12:44:27,881 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 12:44:27,881 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 12:44:27,882 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 12:44:27,883 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 12:44:27,884 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 12:44:27,885 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 12:44:27,886 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 12:44:27,886 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 12:44:27,887 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 12:44:27,887 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 12:44:27,887 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 12:44:27,888 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 12:44:27,889 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 12:44:27,890 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf [2018-09-19 12:44:27,907 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 12:44:27,907 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 12:44:27,910 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 12:44:27,910 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 12:44:27,910 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 12:44:27,910 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 12:44:27,910 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 12:44:27,911 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-19 12:44:27,911 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-19 12:44:27,911 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 12:44:27,911 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 12:44:27,911 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 12:44:27,912 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 12:44:27,912 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 12:44:27,914 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 12:44:27,914 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 12:44:27,914 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 12:44:27,914 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 12:44:27,914 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 12:44:27,914 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 12:44:27,915 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 12:44:27,915 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 12:44:27,915 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 12:44:27,915 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 12:44:27,916 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 12:44:27,917 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 12:44:27,917 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 12:44:27,917 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 12:44:27,917 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 12:44:27,917 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 12:44:27,918 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 12:44:27,918 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 12:44:27,918 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 12:44:27,918 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 12:44:27,974 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 12:44:27,991 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 12:44:27,997 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 12:44:27,999 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 12:44:27,999 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 12:44:28,000 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label19_true-unreach-call.c [2018-09-19 12:44:28,335 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02c43a479/30a43031cd5344a19abba95f72dbc6c5/FLAG90477d9cc [2018-09-19 12:44:28,711 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 12:44:28,712 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label19_true-unreach-call.c [2018-09-19 12:44:28,739 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02c43a479/30a43031cd5344a19abba95f72dbc6c5/FLAG90477d9cc [2018-09-19 12:44:28,759 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02c43a479/30a43031cd5344a19abba95f72dbc6c5 [2018-09-19 12:44:28,769 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 12:44:28,772 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 12:44:28,773 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 12:44:28,774 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 12:44:28,781 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 12:44:28,782 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 12:44:28" (1/1) ... [2018-09-19 12:44:28,785 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5569bc79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:44:28, skipping insertion in model container [2018-09-19 12:44:28,785 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 12:44:28" (1/1) ... [2018-09-19 12:44:28,797 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 12:44:29,426 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 12:44:29,448 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 12:44:29,648 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 12:44:29,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:44:29 WrapperNode [2018-09-19 12:44:29,718 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 12:44:29,719 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 12:44:29,719 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 12:44:29,720 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 12:44:29,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:44:29" (1/1) ... [2018-09-19 12:44:29,779 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:44:29" (1/1) ... [2018-09-19 12:44:29,895 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 12:44:29,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 12:44:29,895 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 12:44:29,896 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 12:44:30,148 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:44:29" (1/1) ... [2018-09-19 12:44:30,149 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:44:29" (1/1) ... [2018-09-19 12:44:30,157 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:44:29" (1/1) ... [2018-09-19 12:44:30,159 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:44:29" (1/1) ... [2018-09-19 12:44:30,218 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:44:29" (1/1) ... [2018-09-19 12:44:30,245 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:44:29" (1/1) ... [2018-09-19 12:44:30,280 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:44:29" (1/1) ... [2018-09-19 12:44:30,298 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 12:44:30,299 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 12:44:30,299 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 12:44:30,299 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 12:44:30,300 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:44:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 12:44:30,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 12:44:30,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 12:44:30,373 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 12:44:30,374 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 12:44:30,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 12:44:30,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 12:44:30,375 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 12:44:30,375 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 12:44:35,198 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 12:44:35,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 12:44:35 BoogieIcfgContainer [2018-09-19 12:44:35,200 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 12:44:35,201 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 12:44:35,201 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 12:44:35,204 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 12:44:35,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 12:44:28" (1/3) ... [2018-09-19 12:44:35,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2528a4b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 12:44:35, skipping insertion in model container [2018-09-19 12:44:35,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:44:29" (2/3) ... [2018-09-19 12:44:35,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2528a4b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 12:44:35, skipping insertion in model container [2018-09-19 12:44:35,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 12:44:35" (3/3) ... [2018-09-19 12:44:35,209 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label19_true-unreach-call.c [2018-09-19 12:44:35,218 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 12:44:35,228 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 12:44:35,284 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 12:44:35,285 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 12:44:35,287 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 12:44:35,287 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 12:44:35,287 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 12:44:35,287 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 12:44:35,288 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 12:44:35,288 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 12:44:35,288 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 12:44:35,332 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states. [2018-09-19 12:44:35,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-09-19 12:44:35,343 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:44:35,345 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] [2018-09-19 12:44:35,346 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:44:35,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1747963281, now seen corresponding path program 1 times [2018-09-19 12:44:35,353 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:44:35,354 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 64 with the following transitions: [2018-09-19 12:44:35,356 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], [405], [407], [1088], [1092], [1098], [1102], [1109], [1110], [1111], [1113] [2018-09-19 12:44:35,400 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:44:35,400 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:44:35,794 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:44:35,797 INFO L272 AbstractInterpreter]: Visited 62 different actions 62 times. Never merged. Never widened. Never found a fixpoint. Largest state had 27 variables. [2018-09-19 12:44:35,848 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:44:36,123 INFO L232 lantSequenceWeakener]: Weakened 60 states. On average, predicates are now at 75.3% of their original sizes. [2018-09-19 12:44:36,123 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:44:36,376 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:44:36,378 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:44:36,378 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 12:44:36,378 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:44:36,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 12:44:36,394 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 12:44:36,395 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 12:44:36,398 INFO L87 Difference]: Start difference. First operand 293 states. Second operand 6 states. [2018-09-19 12:44:40,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:44:40,478 INFO L93 Difference]: Finished difference Result 776 states and 1363 transitions. [2018-09-19 12:44:40,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 12:44:40,482 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-09-19 12:44:40,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:44:40,501 INFO L225 Difference]: With dead ends: 776 [2018-09-19 12:44:40,501 INFO L226 Difference]: Without dead ends: 481 [2018-09-19 12:44:40,509 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 62 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 12:44:40,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2018-09-19 12:44:40,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 479. [2018-09-19 12:44:40,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-09-19 12:44:40,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 682 transitions. [2018-09-19 12:44:40,608 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 682 transitions. Word has length 63 [2018-09-19 12:44:40,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:44:40,609 INFO L480 AbstractCegarLoop]: Abstraction has 479 states and 682 transitions. [2018-09-19 12:44:40,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 12:44:40,609 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 682 transitions. [2018-09-19 12:44:40,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-09-19 12:44:40,620 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:44:40,620 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:44:40,621 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:44:40,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1497265463, now seen corresponding path program 1 times [2018-09-19 12:44:40,621 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:44:40,622 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 181 with the following transitions: [2018-09-19 12:44:40,622 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], [405], [407], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [710], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-09-19 12:44:40,631 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:44:40,631 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:44:40,927 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:44:41,593 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:44:41,594 INFO L272 AbstractInterpreter]: Visited 124 different actions 359 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-09-19 12:44:41,628 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:44:42,047 INFO L232 lantSequenceWeakener]: Weakened 177 states. On average, predicates are now at 73.88% of their original sizes. [2018-09-19 12:44:42,047 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:44:42,654 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:44:42,654 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:44:42,654 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:44:42,655 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:44:42,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:44:42,656 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:44:42,657 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:44:42,657 INFO L87 Difference]: Start difference. First operand 479 states and 682 transitions. Second operand 10 states. [2018-09-19 12:44:46,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:44:46,709 INFO L93 Difference]: Finished difference Result 960 states and 1546 transitions. [2018-09-19 12:44:46,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-19 12:44:46,711 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 180 [2018-09-19 12:44:46,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:44:46,719 INFO L225 Difference]: With dead ends: 960 [2018-09-19 12:44:46,720 INFO L226 Difference]: Without dead ends: 677 [2018-09-19 12:44:46,723 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 186 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 12:44:46,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2018-09-19 12:44:46,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 673. [2018-09-19 12:44:46,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2018-09-19 12:44:46,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 896 transitions. [2018-09-19 12:44:46,764 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 896 transitions. Word has length 180 [2018-09-19 12:44:46,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:44:46,765 INFO L480 AbstractCegarLoop]: Abstraction has 673 states and 896 transitions. [2018-09-19 12:44:46,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:44:46,768 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 896 transitions. [2018-09-19 12:44:46,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-09-19 12:44:46,773 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:44:46,773 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:44:46,774 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:44:46,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1434730883, now seen corresponding path program 1 times [2018-09-19 12:44:46,774 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:44:46,774 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 191 with the following transitions: [2018-09-19 12:44:46,775 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], [405], [407], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [750], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-09-19 12:44:46,780 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:44:46,781 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:44:46,942 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:44:47,240 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:44:47,241 INFO L272 AbstractInterpreter]: Visited 134 different actions 389 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-09-19 12:44:47,269 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:44:47,718 INFO L232 lantSequenceWeakener]: Weakened 187 states. On average, predicates are now at 73.83% of their original sizes. [2018-09-19 12:44:47,718 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:44:48,475 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:44:48,475 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:44:48,475 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:44:48,475 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:44:48,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:44:48,478 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:44:48,479 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:44:48,479 INFO L87 Difference]: Start difference. First operand 673 states and 896 transitions. Second operand 10 states. [2018-09-19 12:44:51,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:44:51,921 INFO L93 Difference]: Finished difference Result 1155 states and 1764 transitions. [2018-09-19 12:44:51,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-19 12:44:51,922 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 190 [2018-09-19 12:44:51,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:44:51,929 INFO L225 Difference]: With dead ends: 1155 [2018-09-19 12:44:51,930 INFO L226 Difference]: Without dead ends: 872 [2018-09-19 12:44:51,931 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 196 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 12:44:51,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2018-09-19 12:44:51,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 864. [2018-09-19 12:44:51,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2018-09-19 12:44:51,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1120 transitions. [2018-09-19 12:44:51,971 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1120 transitions. Word has length 190 [2018-09-19 12:44:51,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:44:51,972 INFO L480 AbstractCegarLoop]: Abstraction has 864 states and 1120 transitions. [2018-09-19 12:44:51,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:44:51,972 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1120 transitions. [2018-09-19 12:44:51,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-09-19 12:44:51,986 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:44:51,987 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:44:51,987 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:44:51,989 INFO L82 PathProgramCache]: Analyzing trace with hash 507062389, now seen corresponding path program 1 times [2018-09-19 12:44:51,989 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:44:51,990 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 196 with the following transitions: [2018-09-19 12:44:51,990 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], [405], [407], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [769], [772], [776], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-09-19 12:44:51,999 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:44:51,999 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:44:52,153 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:44:52,413 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:44:52,414 INFO L272 AbstractInterpreter]: Visited 139 different actions 404 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-09-19 12:44:52,451 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:44:52,782 INFO L232 lantSequenceWeakener]: Weakened 192 states. On average, predicates are now at 73.87% of their original sizes. [2018-09-19 12:44:52,782 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:44:53,036 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:44:53,037 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:44:53,037 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-19 12:44:53,037 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:44:53,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-19 12:44:53,038 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-19 12:44:53,038 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-09-19 12:44:53,038 INFO L87 Difference]: Start difference. First operand 864 states and 1120 transitions. Second operand 12 states. [2018-09-19 12:45:02,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:45:02,726 INFO L93 Difference]: Finished difference Result 1963 states and 3023 transitions. [2018-09-19 12:45:02,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-19 12:45:02,728 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 195 [2018-09-19 12:45:02,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:45:02,739 INFO L225 Difference]: With dead ends: 1963 [2018-09-19 12:45:02,740 INFO L226 Difference]: Without dead ends: 1680 [2018-09-19 12:45:02,742 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 206 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2018-09-19 12:45:02,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1680 states. [2018-09-19 12:45:02,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1680 to 1662. [2018-09-19 12:45:02,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1662 states. [2018-09-19 12:45:02,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 1662 states and 2081 transitions. [2018-09-19 12:45:02,787 INFO L78 Accepts]: Start accepts. Automaton has 1662 states and 2081 transitions. Word has length 195 [2018-09-19 12:45:02,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:45:02,788 INFO L480 AbstractCegarLoop]: Abstraction has 1662 states and 2081 transitions. [2018-09-19 12:45:02,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-19 12:45:02,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 2081 transitions. [2018-09-19 12:45:02,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-09-19 12:45:02,791 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:45:02,792 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:45:02,792 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:45:02,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1573601226, now seen corresponding path program 1 times [2018-09-19 12:45:02,793 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:45:02,793 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 212 with the following transitions: [2018-09-19 12:45:02,793 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], [405], [407], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [777], [781], [785], [789], [793], [797], [808], [812], [816], [820], [824], [828], [832], [843], [847], [851], [862], [866], [869], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-09-19 12:45:02,798 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:45:02,799 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:45:02,960 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:45:03,216 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:45:03,216 INFO L272 AbstractInterpreter]: Visited 155 different actions 452 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-09-19 12:45:03,251 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:45:03,576 INFO L232 lantSequenceWeakener]: Weakened 208 states. On average, predicates are now at 73.76% of their original sizes. [2018-09-19 12:45:03,576 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:45:03,712 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:45:03,712 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:45:03,712 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:45:03,712 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:45:03,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:45:03,713 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:45:03,713 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:45:03,714 INFO L87 Difference]: Start difference. First operand 1662 states and 2081 transitions. Second operand 10 states. [2018-09-19 12:45:07,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:45:07,469 INFO L93 Difference]: Finished difference Result 3329 states and 4359 transitions. [2018-09-19 12:45:07,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-19 12:45:07,470 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 211 [2018-09-19 12:45:07,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:45:07,481 INFO L225 Difference]: With dead ends: 3329 [2018-09-19 12:45:07,482 INFO L226 Difference]: Without dead ends: 2055 [2018-09-19 12:45:07,486 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 217 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 12:45:07,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2055 states. [2018-09-19 12:45:07,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2055 to 2047. [2018-09-19 12:45:07,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2047 states. [2018-09-19 12:45:07,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2047 states to 2047 states and 2519 transitions. [2018-09-19 12:45:07,536 INFO L78 Accepts]: Start accepts. Automaton has 2047 states and 2519 transitions. Word has length 211 [2018-09-19 12:45:07,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:45:07,537 INFO L480 AbstractCegarLoop]: Abstraction has 2047 states and 2519 transitions. [2018-09-19 12:45:07,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:45:07,537 INFO L276 IsEmpty]: Start isEmpty. Operand 2047 states and 2519 transitions. [2018-09-19 12:45:07,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-09-19 12:45:07,542 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:45:07,543 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:45:07,543 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:45:07,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1603363387, now seen corresponding path program 1 times [2018-09-19 12:45:07,543 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:45:07,544 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 262 with the following transitions: [2018-09-19 12:45:07,544 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], [405], [407], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [538], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [710], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-09-19 12:45:07,547 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:45:07,547 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:45:07,665 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:45:08,165 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:45:08,165 INFO L272 AbstractInterpreter]: Visited 125 different actions 608 times. Merged at 7 different actions 27 times. Never widened. Found 5 fixpoints after 1 different actions. Largest state had 28 variables. [2018-09-19 12:45:08,199 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:45:08,589 INFO L232 lantSequenceWeakener]: Weakened 258 states. On average, predicates are now at 73.65% of their original sizes. [2018-09-19 12:45:08,590 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:45:08,721 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:45:08,721 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:45:08,722 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:45:08,722 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:45:08,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:45:08,723 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:45:08,723 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:45:08,723 INFO L87 Difference]: Start difference. First operand 2047 states and 2519 transitions. Second operand 10 states. [2018-09-19 12:45:13,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:45:13,144 INFO L93 Difference]: Finished difference Result 3565 states and 4668 transitions. [2018-09-19 12:45:13,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-19 12:45:13,152 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 261 [2018-09-19 12:45:13,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:45:13,166 INFO L225 Difference]: With dead ends: 3565 [2018-09-19 12:45:13,166 INFO L226 Difference]: Without dead ends: 2674 [2018-09-19 12:45:13,170 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 267 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 12:45:13,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2018-09-19 12:45:13,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2660. [2018-09-19 12:45:13,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2660 states. [2018-09-19 12:45:13,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2660 states to 2660 states and 3246 transitions. [2018-09-19 12:45:13,230 INFO L78 Accepts]: Start accepts. Automaton has 2660 states and 3246 transitions. Word has length 261 [2018-09-19 12:45:13,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:45:13,231 INFO L480 AbstractCegarLoop]: Abstraction has 2660 states and 3246 transitions. [2018-09-19 12:45:13,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:45:13,231 INFO L276 IsEmpty]: Start isEmpty. Operand 2660 states and 3246 transitions. [2018-09-19 12:45:13,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-09-19 12:45:13,236 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:45:13,237 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:45:13,237 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:45:13,237 INFO L82 PathProgramCache]: Analyzing trace with hash 29484163, now seen corresponding path program 1 times [2018-09-19 12:45:13,237 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:45:13,238 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 266 with the following transitions: [2018-09-19 12:45:13,238 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], [405], [407], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [554], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [710], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-09-19 12:45:13,241 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:45:13,241 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:45:13,342 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:45:13,806 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:45:13,806 INFO L272 AbstractInterpreter]: Visited 125 different actions 608 times. Merged at 7 different actions 27 times. Never widened. Found 5 fixpoints after 1 different actions. Largest state had 28 variables. [2018-09-19 12:45:13,835 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:45:14,189 INFO L232 lantSequenceWeakener]: Weakened 262 states. On average, predicates are now at 73.65% of their original sizes. [2018-09-19 12:45:14,190 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:45:14,296 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:45:14,296 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:45:14,296 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:45:14,297 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:45:14,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:45:14,297 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:45:14,297 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:45:14,298 INFO L87 Difference]: Start difference. First operand 2660 states and 3246 transitions. Second operand 10 states. [2018-09-19 12:45:19,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:45:19,254 INFO L93 Difference]: Finished difference Result 5729 states and 7522 transitions. [2018-09-19 12:45:19,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:45:19,258 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 265 [2018-09-19 12:45:19,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:45:19,275 INFO L225 Difference]: With dead ends: 5729 [2018-09-19 12:45:19,275 INFO L226 Difference]: Without dead ends: 4224 [2018-09-19 12:45:19,282 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 272 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:45:19,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4224 states. [2018-09-19 12:45:19,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4224 to 4174. [2018-09-19 12:45:19,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4174 states. [2018-09-19 12:45:19,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4174 states to 4174 states and 5136 transitions. [2018-09-19 12:45:19,381 INFO L78 Accepts]: Start accepts. Automaton has 4174 states and 5136 transitions. Word has length 265 [2018-09-19 12:45:19,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:45:19,382 INFO L480 AbstractCegarLoop]: Abstraction has 4174 states and 5136 transitions. [2018-09-19 12:45:19,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:45:19,382 INFO L276 IsEmpty]: Start isEmpty. Operand 4174 states and 5136 transitions. [2018-09-19 12:45:19,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-09-19 12:45:19,388 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:45:19,389 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:45:19,389 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:45:19,389 INFO L82 PathProgramCache]: Analyzing trace with hash 34575104, now seen corresponding path program 1 times [2018-09-19 12:45:19,390 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:45:19,390 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 269 with the following transitions: [2018-09-19 12:45:19,390 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], [405], [407], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [750], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-09-19 12:45:19,393 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:45:19,393 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:45:19,508 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:45:19,802 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:45:19,802 INFO L272 AbstractInterpreter]: Visited 135 different actions 527 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 28 variables. [2018-09-19 12:45:19,839 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:45:20,094 INFO L232 lantSequenceWeakener]: Weakened 265 states. On average, predicates are now at 73.64% of their original sizes. [2018-09-19 12:45:20,094 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:45:20,181 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:45:20,182 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:45:20,182 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:45:20,182 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:45:20,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:45:20,183 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:45:20,183 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:45:20,183 INFO L87 Difference]: Start difference. First operand 4174 states and 5136 transitions. Second operand 10 states. [2018-09-19 12:45:25,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:45:25,133 INFO L93 Difference]: Finished difference Result 5669 states and 7289 transitions. [2018-09-19 12:45:25,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-19 12:45:25,137 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 268 [2018-09-19 12:45:25,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:45:25,156 INFO L225 Difference]: With dead ends: 5669 [2018-09-19 12:45:25,156 INFO L226 Difference]: Without dead ends: 4774 [2018-09-19 12:45:25,161 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 274 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 12:45:25,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4774 states. [2018-09-19 12:45:25,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4774 to 4753. [2018-09-19 12:45:25,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4753 states. [2018-09-19 12:45:25,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4753 states to 4753 states and 5808 transitions. [2018-09-19 12:45:25,260 INFO L78 Accepts]: Start accepts. Automaton has 4753 states and 5808 transitions. Word has length 268 [2018-09-19 12:45:25,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:45:25,261 INFO L480 AbstractCegarLoop]: Abstraction has 4753 states and 5808 transitions. [2018-09-19 12:45:25,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:45:25,263 INFO L276 IsEmpty]: Start isEmpty. Operand 4753 states and 5808 transitions. [2018-09-19 12:45:25,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-09-19 12:45:25,269 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:45:25,269 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:45:25,270 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:45:25,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1109493451, now seen corresponding path program 1 times [2018-09-19 12:45:25,270 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:45:25,270 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 270 with the following transitions: [2018-09-19 12:45:25,271 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], [405], [407], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [570], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [710], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-09-19 12:45:25,273 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:45:25,273 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:45:25,424 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:45:25,964 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:45:25,964 INFO L272 AbstractInterpreter]: Visited 125 different actions 608 times. Merged at 7 different actions 27 times. Never widened. Found 5 fixpoints after 1 different actions. Largest state had 28 variables. [2018-09-19 12:45:25,972 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:45:26,305 INFO L232 lantSequenceWeakener]: Weakened 266 states. On average, predicates are now at 73.64% of their original sizes. [2018-09-19 12:45:26,306 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:45:26,434 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:45:26,434 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:45:26,434 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:45:26,434 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:45:26,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:45:26,435 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:45:26,435 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:45:26,436 INFO L87 Difference]: Start difference. First operand 4753 states and 5808 transitions. Second operand 10 states. [2018-09-19 12:45:30,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:45:30,833 INFO L93 Difference]: Finished difference Result 6061 states and 7776 transitions. [2018-09-19 12:45:30,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-19 12:45:30,834 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 269 [2018-09-19 12:45:30,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:45:30,854 INFO L225 Difference]: With dead ends: 6061 [2018-09-19 12:45:30,854 INFO L226 Difference]: Without dead ends: 5360 [2018-09-19 12:45:30,858 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 275 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 12:45:30,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5360 states. [2018-09-19 12:45:30,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5360 to 5332. [2018-09-19 12:45:30,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5332 states. [2018-09-19 12:45:30,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5332 states to 5332 states and 6574 transitions. [2018-09-19 12:45:30,969 INFO L78 Accepts]: Start accepts. Automaton has 5332 states and 6574 transitions. Word has length 269 [2018-09-19 12:45:30,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:45:30,970 INFO L480 AbstractCegarLoop]: Abstraction has 5332 states and 6574 transitions. [2018-09-19 12:45:30,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:45:30,970 INFO L276 IsEmpty]: Start isEmpty. Operand 5332 states and 6574 transitions. [2018-09-19 12:45:30,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-09-19 12:45:30,979 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:45:30,979 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:45:30,979 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:45:30,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1304365404, now seen corresponding path program 1 times [2018-09-19 12:45:30,980 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:45:30,980 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 271 with the following transitions: [2018-09-19 12:45:30,980 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], [405], [407], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [574], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [710], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-09-19 12:45:30,983 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:45:30,983 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:45:31,085 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:45:31,481 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:45:31,481 INFO L272 AbstractInterpreter]: Visited 125 different actions 608 times. Merged at 7 different actions 27 times. Never widened. Found 5 fixpoints after 1 different actions. Largest state had 28 variables. [2018-09-19 12:45:31,491 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:45:31,796 INFO L232 lantSequenceWeakener]: Weakened 267 states. On average, predicates are now at 73.64% of their original sizes. [2018-09-19 12:45:31,797 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:45:32,010 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:45:32,010 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:45:32,010 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:45:32,011 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:45:32,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:45:32,011 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:45:32,011 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:45:32,012 INFO L87 Difference]: Start difference. First operand 5332 states and 6574 transitions. Second operand 10 states. [2018-09-19 12:45:35,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:45:35,173 INFO L93 Difference]: Finished difference Result 6440 states and 8279 transitions. [2018-09-19 12:45:35,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-19 12:45:35,174 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 270 [2018-09-19 12:45:35,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:45:35,194 INFO L225 Difference]: With dead ends: 6440 [2018-09-19 12:45:35,194 INFO L226 Difference]: Without dead ends: 5739 [2018-09-19 12:45:35,198 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 276 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 12:45:35,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5739 states. [2018-09-19 12:45:35,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5739 to 5720. [2018-09-19 12:45:35,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5720 states. [2018-09-19 12:45:35,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5720 states to 5720 states and 7054 transitions. [2018-09-19 12:45:35,300 INFO L78 Accepts]: Start accepts. Automaton has 5720 states and 7054 transitions. Word has length 270 [2018-09-19 12:45:35,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:45:35,301 INFO L480 AbstractCegarLoop]: Abstraction has 5720 states and 7054 transitions. [2018-09-19 12:45:35,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:45:35,301 INFO L276 IsEmpty]: Start isEmpty. Operand 5720 states and 7054 transitions. [2018-09-19 12:45:35,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-09-19 12:45:35,308 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:45:35,308 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:45:35,308 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:45:35,309 INFO L82 PathProgramCache]: Analyzing trace with hash 66727175, now seen corresponding path program 1 times [2018-09-19 12:45:35,309 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:45:35,309 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 272 with the following transitions: [2018-09-19 12:45:35,309 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], [405], [407], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [538], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [750], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-09-19 12:45:35,312 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:45:35,312 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:45:35,416 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:45:35,836 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:45:35,836 INFO L272 AbstractInterpreter]: Visited 135 different actions 658 times. Merged at 7 different actions 27 times. Never widened. Found 5 fixpoints after 1 different actions. Largest state had 28 variables. [2018-09-19 12:45:35,866 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:45:36,151 INFO L232 lantSequenceWeakener]: Weakened 268 states. On average, predicates are now at 73.63% of their original sizes. [2018-09-19 12:45:36,152 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:45:36,245 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:45:36,245 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:45:36,245 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:45:36,245 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:45:36,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:45:36,246 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:45:36,246 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:45:36,246 INFO L87 Difference]: Start difference. First operand 5720 states and 7054 transitions. Second operand 10 states. [2018-09-19 12:45:39,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:45:39,280 INFO L93 Difference]: Finished difference Result 8834 states and 11274 transitions. [2018-09-19 12:45:39,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-19 12:45:39,282 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 271 [2018-09-19 12:45:39,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:45:39,301 INFO L225 Difference]: With dead ends: 8834 [2018-09-19 12:45:39,301 INFO L226 Difference]: Without dead ends: 7157 [2018-09-19 12:45:39,307 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 277 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 12:45:39,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7157 states. [2018-09-19 12:45:39,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7157 to 7126. [2018-09-19 12:45:39,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7126 states. [2018-09-19 12:45:39,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7126 states to 7126 states and 8818 transitions. [2018-09-19 12:45:39,424 INFO L78 Accepts]: Start accepts. Automaton has 7126 states and 8818 transitions. Word has length 271 [2018-09-19 12:45:39,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:45:39,425 INFO L480 AbstractCegarLoop]: Abstraction has 7126 states and 8818 transitions. [2018-09-19 12:45:39,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:45:39,425 INFO L276 IsEmpty]: Start isEmpty. Operand 7126 states and 8818 transitions. [2018-09-19 12:45:39,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-09-19 12:45:39,433 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:45:39,433 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:45:39,434 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:45:39,434 INFO L82 PathProgramCache]: Analyzing trace with hash 642077555, now seen corresponding path program 1 times [2018-09-19 12:45:39,434 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:45:39,434 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 278 with the following transitions: [2018-09-19 12:45:39,435 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [405], [407], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [562], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [750], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-09-19 12:45:39,437 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:45:39,438 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:45:39,546 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:45:40,213 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:45:40,213 INFO L272 AbstractInterpreter]: Visited 135 different actions 658 times. Merged at 7 different actions 27 times. Never widened. Found 5 fixpoints after 1 different actions. Largest state had 28 variables. [2018-09-19 12:45:40,220 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:45:40,594 INFO L232 lantSequenceWeakener]: Weakened 274 states. On average, predicates are now at 73.62% of their original sizes. [2018-09-19 12:45:40,594 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:45:40,703 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:45:40,703 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:45:40,703 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:45:40,703 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:45:40,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:45:40,704 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:45:40,704 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:45:40,704 INFO L87 Difference]: Start difference. First operand 7126 states and 8818 transitions. Second operand 10 states. [2018-09-19 12:45:45,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:45:45,495 INFO L93 Difference]: Finished difference Result 16163 states and 20872 transitions. [2018-09-19 12:45:45,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:45:45,496 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 277 [2018-09-19 12:45:45,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:45:45,538 INFO L225 Difference]: With dead ends: 16163 [2018-09-19 12:45:45,538 INFO L226 Difference]: Without dead ends: 14241 [2018-09-19 12:45:45,551 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 284 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:45:45,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14241 states. [2018-09-19 12:45:45,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14241 to 14052. [2018-09-19 12:45:45,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14052 states. [2018-09-19 12:45:45,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14052 states to 14052 states and 17688 transitions. [2018-09-19 12:45:45,791 INFO L78 Accepts]: Start accepts. Automaton has 14052 states and 17688 transitions. Word has length 277 [2018-09-19 12:45:45,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:45:45,792 INFO L480 AbstractCegarLoop]: Abstraction has 14052 states and 17688 transitions. [2018-09-19 12:45:45,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:45:45,792 INFO L276 IsEmpty]: Start isEmpty. Operand 14052 states and 17688 transitions. [2018-09-19 12:45:45,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-09-19 12:45:45,801 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:45:45,801 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:45:45,802 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:45:45,802 INFO L82 PathProgramCache]: Analyzing trace with hash 615040407, now seen corresponding path program 1 times [2018-09-19 12:45:45,802 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:45:45,805 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 280 with the following transitions: [2018-09-19 12:45:45,805 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], [405], [407], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [570], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [750], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-09-19 12:45:45,808 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:45:45,809 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:45:45,920 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:45:46,384 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:45:46,384 INFO L272 AbstractInterpreter]: Visited 135 different actions 658 times. Merged at 7 different actions 27 times. Never widened. Found 5 fixpoints after 1 different actions. Largest state had 28 variables. [2018-09-19 12:45:46,422 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:45:47,026 INFO L232 lantSequenceWeakener]: Weakened 276 states. On average, predicates are now at 73.62% of their original sizes. [2018-09-19 12:45:47,026 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:45:47,163 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:45:47,163 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:45:47,164 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:45:47,164 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:45:47,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:45:47,164 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:45:47,165 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:45:47,165 INFO L87 Difference]: Start difference. First operand 14052 states and 17688 transitions. Second operand 10 states. [2018-09-19 12:45:51,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:45:51,376 INFO L93 Difference]: Finished difference Result 19414 states and 25023 transitions. [2018-09-19 12:45:51,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-19 12:45:51,376 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 279 [2018-09-19 12:45:51,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:45:51,422 INFO L225 Difference]: With dead ends: 19414 [2018-09-19 12:45:51,423 INFO L226 Difference]: Without dead ends: 17613 [2018-09-19 12:45:51,434 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 285 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 12:45:51,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17613 states. [2018-09-19 12:45:51,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17613 to 17564. [2018-09-19 12:45:51,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17564 states. [2018-09-19 12:45:51,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17564 states to 17564 states and 22335 transitions. [2018-09-19 12:45:51,732 INFO L78 Accepts]: Start accepts. Automaton has 17564 states and 22335 transitions. Word has length 279 [2018-09-19 12:45:51,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:45:51,733 INFO L480 AbstractCegarLoop]: Abstraction has 17564 states and 22335 transitions. [2018-09-19 12:45:51,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:45:51,733 INFO L276 IsEmpty]: Start isEmpty. Operand 17564 states and 22335 transitions. [2018-09-19 12:45:51,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-09-19 12:45:51,744 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:45:51,744 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:45:51,744 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:45:51,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1972640636, now seen corresponding path program 1 times [2018-09-19 12:45:51,745 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:45:51,745 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 287 with the following transitions: [2018-09-19 12:45:51,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], [405], [407], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [598], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [750], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-09-19 12:45:51,749 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:45:51,749 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:45:51,856 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:45:52,172 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:45:52,173 INFO L272 AbstractInterpreter]: Visited 135 different actions 528 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 28 variables. [2018-09-19 12:45:52,207 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:45:52,560 INFO L232 lantSequenceWeakener]: Weakened 283 states. On average, predicates are now at 73.6% of their original sizes. [2018-09-19 12:45:52,561 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:45:52,682 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:45:52,682 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:45:52,682 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:45:52,682 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:45:52,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:45:52,683 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:45:52,683 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:45:52,683 INFO L87 Difference]: Start difference. First operand 17564 states and 22335 transitions. Second operand 10 states. [2018-09-19 12:45:55,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:45:55,826 INFO L93 Difference]: Finished difference Result 19772 states and 25515 transitions. [2018-09-19 12:45:55,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-19 12:45:55,829 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 286 [2018-09-19 12:45:55,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:45:55,866 INFO L225 Difference]: With dead ends: 19772 [2018-09-19 12:45:55,866 INFO L226 Difference]: Without dead ends: 17979 [2018-09-19 12:45:55,877 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 292 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 12:45:55,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17979 states. [2018-09-19 12:45:56,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17979 to 17955. [2018-09-19 12:45:56,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17955 states. [2018-09-19 12:45:56,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17955 states to 17955 states and 22834 transitions. [2018-09-19 12:45:56,152 INFO L78 Accepts]: Start accepts. Automaton has 17955 states and 22834 transitions. Word has length 286 [2018-09-19 12:45:56,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:45:56,152 INFO L480 AbstractCegarLoop]: Abstraction has 17955 states and 22834 transitions. [2018-09-19 12:45:56,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:45:56,152 INFO L276 IsEmpty]: Start isEmpty. Operand 17955 states and 22834 transitions. [2018-09-19 12:45:56,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-09-19 12:45:56,377 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:45:56,378 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:45:56,378 INFO L423 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:45:56,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1366465100, now seen corresponding path program 1 times [2018-09-19 12:45:56,379 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:45:56,379 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 288 with the following transitions: [2018-09-19 12:45:56,379 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], [405], [407], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [582], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [769], [772], [776], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-09-19 12:45:56,382 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:45:56,382 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:45:56,500 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:45:56,916 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:45:56,916 INFO L272 AbstractInterpreter]: Visited 140 different actions 683 times. Merged at 7 different actions 27 times. Never widened. Found 5 fixpoints after 1 different actions. Largest state had 28 variables. [2018-09-19 12:45:56,924 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:45:57,312 INFO L232 lantSequenceWeakener]: Weakened 284 states. On average, predicates are now at 73.64% of their original sizes. [2018-09-19 12:45:57,313 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:45:57,498 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:45:57,499 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:45:57,499 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-19 12:45:57,499 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:45:57,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-19 12:45:57,500 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-19 12:45:57,500 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-09-19 12:45:57,500 INFO L87 Difference]: Start difference. First operand 17955 states and 22834 transitions. Second operand 12 states. [2018-09-19 12:46:08,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:46:08,222 INFO L93 Difference]: Finished difference Result 27137 states and 35384 transitions. [2018-09-19 12:46:08,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-19 12:46:08,224 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 287 [2018-09-19 12:46:08,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:46:08,276 INFO L225 Difference]: With dead ends: 27137 [2018-09-19 12:46:08,276 INFO L226 Difference]: Without dead ends: 23619 [2018-09-19 12:46:08,474 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 302 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2018-09-19 12:46:08,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23619 states. [2018-09-19 12:46:08,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23619 to 23496. [2018-09-19 12:46:08,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23496 states. [2018-09-19 12:46:08,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23496 states to 23496 states and 30001 transitions. [2018-09-19 12:46:08,771 INFO L78 Accepts]: Start accepts. Automaton has 23496 states and 30001 transitions. Word has length 287 [2018-09-19 12:46:08,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:46:08,771 INFO L480 AbstractCegarLoop]: Abstraction has 23496 states and 30001 transitions. [2018-09-19 12:46:08,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-19 12:46:08,772 INFO L276 IsEmpty]: Start isEmpty. Operand 23496 states and 30001 transitions. [2018-09-19 12:46:08,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-09-19 12:46:08,780 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:46:08,780 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:46:08,780 INFO L423 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:46:08,781 INFO L82 PathProgramCache]: Analyzing trace with hash 641786000, now seen corresponding path program 1 times [2018-09-19 12:46:08,781 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:46:08,781 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 293 with the following transitions: [2018-09-19 12:46:08,781 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], [405], [407], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [629], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [750], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-09-19 12:46:08,784 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:46:08,784 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:46:08,880 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:46:09,392 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:46:09,393 INFO L272 AbstractInterpreter]: Visited 135 different actions 528 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 28 variables. [2018-09-19 12:46:09,432 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:46:09,876 INFO L232 lantSequenceWeakener]: Weakened 289 states. On average, predicates are now at 73.59% of their original sizes. [2018-09-19 12:46:09,876 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:46:09,967 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:46:09,967 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:46:09,967 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:46:09,967 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:46:09,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:46:09,968 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:46:09,968 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:46:09,968 INFO L87 Difference]: Start difference. First operand 23496 states and 30001 transitions. Second operand 10 states. [2018-09-19 12:46:14,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:46:14,478 INFO L93 Difference]: Finished difference Result 46704 states and 60385 transitions. [2018-09-19 12:46:14,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:46:14,479 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 292 [2018-09-19 12:46:14,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:46:14,560 INFO L225 Difference]: With dead ends: 46704 [2018-09-19 12:46:14,560 INFO L226 Difference]: Without dead ends: 32538 [2018-09-19 12:46:14,598 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 299 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:46:14,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32538 states. [2018-09-19 12:46:15,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32538 to 32232. [2018-09-19 12:46:15,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32232 states. [2018-09-19 12:46:15,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32232 states to 32232 states and 41155 transitions. [2018-09-19 12:46:15,073 INFO L78 Accepts]: Start accepts. Automaton has 32232 states and 41155 transitions. Word has length 292 [2018-09-19 12:46:15,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:46:15,074 INFO L480 AbstractCegarLoop]: Abstraction has 32232 states and 41155 transitions. [2018-09-19 12:46:15,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:46:15,074 INFO L276 IsEmpty]: Start isEmpty. Operand 32232 states and 41155 transitions. [2018-09-19 12:46:15,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-09-19 12:46:15,083 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:46:15,083 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:46:15,084 INFO L423 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:46:15,084 INFO L82 PathProgramCache]: Analyzing trace with hash -496912550, now seen corresponding path program 1 times [2018-09-19 12:46:15,084 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:46:15,084 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 293 with the following transitions: [2018-09-19 12:46:15,085 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], [405], [407], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [538], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [777], [781], [785], [789], [793], [797], [808], [812], [816], [820], [824], [828], [832], [843], [847], [851], [862], [866], [869], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-09-19 12:46:15,089 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:46:15,089 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:46:15,214 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:46:16,136 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-19 12:46:16,136 INFO L272 AbstractInterpreter]: Visited 157 different actions 766 times. Merged at 7 different actions 27 times. Never widened. Found 5 fixpoints after 1 different actions. Largest state had 28 variables. [2018-09-19 12:46:16,174 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 12:46:16,221 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 12:46:16,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 12:46:16 BoogieIcfgContainer [2018-09-19 12:46:16,221 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 12:46:16,223 INFO L168 Benchmark]: Toolchain (without parser) took 107453.13 ms. Allocated memory was 1.5 GB in the beginning and 3.7 GB in the end (delta: 2.2 GB). Free memory was 1.4 GB in the beginning and 3.3 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-09-19 12:46:16,224 INFO L168 Benchmark]: CDTParser took 0.16 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 12:46:16,225 INFO L168 Benchmark]: CACSL2BoogieTranslator took 945.26 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. [2018-09-19 12:46:16,226 INFO L168 Benchmark]: Boogie Procedure Inliner took 175.71 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-19 12:46:16,226 INFO L168 Benchmark]: Boogie Preprocessor took 403.39 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 806.9 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -930.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2018-09-19 12:46:16,227 INFO L168 Benchmark]: RCFGBuilder took 4900.81 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: 171.0 MB). Peak memory consumption was 171.0 MB. Max. memory is 7.1 GB. [2018-09-19 12:46:16,228 INFO L168 Benchmark]: TraceAbstraction took 101020.89 ms. Allocated memory was 2.3 GB in the beginning and 3.7 GB in the end (delta: 1.4 GB). Free memory was 2.1 GB in the beginning and 3.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-09-19 12:46:16,233 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.16 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 945.26 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 175.71 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 403.39 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 806.9 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -930.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4900.81 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: 171.0 MB). Peak memory consumption was 171.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 101020.89 ms. Allocated memory was 2.3 GB in the beginning and 3.7 GB in the end (delta: 1.4 GB). Free memory was 2.1 GB in the beginning and 3.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 174]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L7] int inputA = 1; [L8] int inputD = 4; [L9] int inputB = 2; [L10] int inputE = 5; [L11] int inputF = 6; [L12] int inputC = 3; [L15] int a29 = 130; [L16] int a4 = 1; [L17] int a23 = 312; [L18] int a8 = 15; [L19] int a25 = 10; [L20] int a3 = 1; [L1031] int output = -1; [L1034] COND TRUE 1 [L1037] int input; [L1038] input = __VERIFIER_nondet_int() [L1039] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1042] CALL, EXPR calculate_output(input) [L23] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L26] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L29] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L32] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L35] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L38] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L41] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L44] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L47] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L50] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L53] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L56] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L59] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L62] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L65] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L68] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L71] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L74] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L77] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L80] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L83] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L86] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L89] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L92] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L95] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L98] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L101] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L104] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L107] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L110] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L113] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L116] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L119] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L122] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L125] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L128] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L131] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L134] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L137] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L140] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L143] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L146] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L149] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L152] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L155] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L158] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L161] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L164] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L167] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L170] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L173] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L176] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L179] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L182] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && 306 < a23 ) && (a8==15))) [L185] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L188] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L191] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L194] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L197] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L200] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L203] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L207] COND FALSE !((( ((140 < a29) && (245 >= a29)) && ((a25==12) && ( a23 <= -43 && ((a8==15) && ((input == 6) && (a3==1)))))) && !(a4==1))) [L214] COND FALSE !((!(a4==1) && (((a3==1) && ((((((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 4)) && a23 <= -43 )) && (a8==15)))) [L221] COND FALSE !(((a25==11) && (!(a4==1) && (((((input == 2) && (a3==1)) && a23 <= -43 ) && (a8==15)) && ((245 < a29) && (277 >= a29)) )))) [L227] COND FALSE !(((( a29 <= 140 && ((a3==1) && (((input == 5) && (a25==13)) && (a4==1)))) && (a8==15)) && 306 < a23 )) [L233] COND FALSE !((((a8==15) && (((((((a4==1) && 277 < a29 ) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 )) && (input == 6))) && (a3==1))) [L240] COND FALSE !(((((input == 4) && (( a23 <= -43 && ((a25==9) && (!(a4==1) && a29 <= 140 ))) || (((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && ((a25==13) && ( 277 < a29 && (a4==1))))))) && (a8==15)) && (a3==1))) [L247] COND FALSE !((((a3==1) && (!(a4==1) && (( a29 <= 140 && ((input == 1) && ((a25==12) || ((a25==10) || (a25==11))))) && ((-43 < a23) && (138 >= a23)) ))) && (a8==15))) [L254] COND FALSE !(((( ((245 < a29) && (277 >= a29)) && (( a23 <= -43 && (!(a4==1) && (input == 1))) && (a25==11))) && (a8==15)) && (a3==1))) [L260] COND FALSE !(((((a4==1) && (((input == 1) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))) && (a8==15))) && 306 < a23 ) && (a3==1))) [L265] COND FALSE !((( 277 < a29 && (((a8==15) && ( a23 <= -43 && ((input == 2) && (a3==1)))) && !(a4==1))) && (a25==13))) [L268] COND FALSE !(( a29 <= 140 && ((((a8==15) && ((a3==1) && ((input == 1) && ((a25==12) || (a25==13))))) && !(a4==1)) && a23 <= -43 ))) [L275] COND FALSE !((((a4==1) && ((a8==15) && (((a3==1) && (((a25==9) || (a25==10)) && (input == 5))) && ((140 < a29) && (245 >= a29)) ))) && 306 < a23 )) [L280] COND FALSE !(((a3==1) && (((((input == 5) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ( ((245 < a29) && (277 >= a29)) && (a25==9))))) && (a8==15)) && !(a4==1)) && a23 <= -43 ))) [L287] COND FALSE !(((a8==15) && ((((!(a4==1) && (((a25==12) || (a25==13)) && (input == 4))) && a23 <= -43 ) && a29 <= 140 ) && (a3==1)))) [L294] COND FALSE !(((a8==15) && (!(a4==1) && ( a23 <= -43 && ((a3==1) && ( 277 < a29 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 6)))))))) [L299] COND FALSE !(( 306 < a23 && (((a8==15) && ((a3==1) && ((a4==1) && (((a25==11) || (a25==12)) && (input == 6))))) && ((140 < a29) && (245 >= a29)) ))) [L305] COND FALSE !(((((a8==15) && ( a29 <= 140 && ( a23 <= -43 && ((input == 2) && ((a25==10) || (a25==11)))))) && !(a4==1)) && (a3==1))) [L310] COND FALSE !(((a3==1) && ( ((245 < a29) && (277 >= a29)) && (((a4==1) && ((a8==15) && ((((a25==11) || (a25==12)) || (a25==13)) && (input == 5)))) && 306 < a23 )))) [L317] COND FALSE !(((((a8==15) && (((a4==1) && ((input == 2) && ((a25==13) || ((a25==11) || (a25==12))))) && ((245 < a29) && (277 >= a29)) )) && 306 < a23 ) && (a3==1))) [L322] COND FALSE !((( 306 < a23 && ((a8==15) && ((((input == 6) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a4==1))) [L329] COND FALSE !(((((a8==15) && (((((a25==11) || (a25==12)) && (input == 4)) && 306 < a23 ) && (a3==1))) && (a4==1)) && ((140 < a29) && (245 >= a29)) )) [L334] COND FALSE !(( a23 <= -43 && ( ((140 < a29) && (245 >= a29)) && (((a8==15) && (((input == 4) && ((a25==11) || ((a25==9) || (a25==10)))) && !(a4==1))) && (a3==1))))) [L340] COND FALSE !((((((((((a25==12) && ((245 < a29) && (277 >= a29)) ) || ((a25==13) && ((245 < a29) && (277 >= a29)) )) || ( 277 < a29 && (a25==9))) && (input == 1)) && a23 <= -43 ) && (a8==15)) && !(a4==1)) && (a3==1))) [L346] COND FALSE !((!(a4==1) && ( a29 <= 140 && ((((((a25==12) || (a25==13)) && (input == 2)) && a23 <= -43 ) && (a3==1)) && (a8==15))))) [L353] COND FALSE !(((a8==15) && (( 306 < a23 && ((a3==1) && ((input == 4) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))))) && (a4==1)))) [L358] COND FALSE !(((((input == 3) && (( a23 <= -43 && ((!(a4==1) && a29 <= 140 ) && (a25==9))) || (( 306 < a23 && (( 277 < a29 && (a4==1)) && (a25==12))) || ((((a4==1) && 277 < a29 ) && (a25==13)) && 306 < a23 )))) && (a3==1)) && (a8==15))) [L365] COND FALSE !(( 306 < a23 && ((a4==1) && (((((((a25==11) || (a25==12)) || (a25==13)) && (input == 3)) && (a8==15)) && (a3==1)) && ((245 < a29) && (277 >= a29)) )))) [L370] COND FALSE !(( ((245 < a29) && (277 >= a29)) && (((((!(a4==1) && (input == 6)) && (a3==1)) && (a25==11)) && (a8==15)) && a23 <= -43 ))) [L377] COND FALSE !((( ((-43 < a23) && (138 >= a23)) && (((a8==15) && ((input == 2) && ((( a29 <= 140 && (a25==13)) || ( ((140 < a29) && (245 >= a29)) && (a25==9))) || ((a25==10) && ((140 < a29) && (245 >= a29)) )))) && (a3==1))) && !(a4==1))) [L384] COND FALSE !(( a29 <= 140 && ((a8==15) && ((((((a25==10) || (a25==11)) && (input == 3)) && a23 <= -43 ) && (a3==1)) && !(a4==1))))) [L391] COND FALSE !((((((a8==15) && (((input == 3) && (((a25==10) || (a25==11)) || (a25==12))) && (a3==1))) && a23 <= -43 ) && !(a4==1)) && 277 < a29 )) [L398] COND FALSE !(((!(a4==1) && ((a25==9) && ((a8==15) && ((a3==1) && ( ((-43 < a23) && (138 >= a23)) && (input == 1)))))) && a29 <= 140 )) [L411] COND FALSE !(((a8==15) && ((( 306 < a23 && (((((a25==11) || (a25==12)) || (a25==13)) && (input == 6)) && ((245 < a29) && (277 >= a29)) )) && (a4==1)) && (a3==1)))) [L417] COND FALSE !((((((!(a4==1) && ((a8==15) && (input == 2))) && (a3==1)) && ((140 < a29) && (245 >= a29)) ) && (a25==12)) && a23 <= -43 )) [L422] COND FALSE !(( a23 <= -43 && (( a29 <= 140 && ((a8==15) && (!(a4==1) && (((a25==12) || (a25==13)) && (input == 3))))) && (a3==1)))) [L429] COND FALSE !(((((((input == 6) && ((((a25==13) && a29 <= 140 ) || ( ((140 < a29) && (245 >= a29)) && (a25==9))) || ( ((140 < a29) && (245 >= a29)) && (a25==10)))) && (a8==15)) && (a3==1)) && !(a4==1)) && ((-43 < a23) && (138 >= a23)) )) [L436] COND FALSE !(((!(a4==1) && (((((a3==1) && (input == 4)) && (a25==11)) && ((245 < a29) && (277 >= a29)) ) && a23 <= -43 )) && (a8==15))) [L443] COND FALSE !(((a3==1) && ( ((140 < a29) && (245 >= a29)) && ( a23 <= -43 && ((a8==15) && (!(a4==1) && ((((a25==9) || (a25==10)) || (a25==11)) && (input == 3)))))))) [L450] COND FALSE !(((((!(a4==1) && (((((a25==10) || (a25==11)) || (a25==12)) && (input == 4)) && 277 < a29 )) && a23 <= -43 ) && (a8==15)) && (a3==1))) [L456] COND FALSE !(( ((140 < a29) && (245 >= a29)) && ((a8==15) && (((a25==12) && (!(a4==1) && ( a23 <= -43 && (input == 4)))) && (a3==1))))) [L463] COND FALSE !(((a3==1) && ((((((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || (((a25==9) && (!(a4==1) && a29 <= 140 )) && a23 <= -43 )) && (input == 2)) && (a8==15)))) [L470] COND FALSE !(((((input == 5) && (((((a25==12) && ((a4==1) && 277 < a29 )) && 306 < a23 ) || ((( 277 < a29 && (a4==1)) && (a25==13)) && 306 < a23 )) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 ))) && (a8==15)) && (a3==1))) [L477] COND FALSE !(((a25==12) && (((a3==1) && ((((input == 1) && a23 <= -43 ) && ((140 < a29) && (245 >= a29)) ) && !(a4==1))) && (a8==15)))) [L487] COND FALSE !((((a8==15) && (( ((-43 < a23) && (138 >= a23)) && ((input == 1) && (( ((140 < a29) && (245 >= a29)) && (a25==10)) || (((a25==13) && a29 <= 140 ) || ((a25==9) && ((140 < a29) && (245 >= a29)) ))))) && (a3==1))) && !(a4==1))) [L500] COND FALSE !(((a3==1) && ((a8==15) && (((((( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 3)) && !(a4==1)) && a23 <= -43 )))) [L507] COND FALSE !((( a29 <= 140 && ( ((-43 < a23) && (138 >= a23)) && ((a3==1) && ((a8==15) && (((a25==12) || ((a25==10) || (a25==11))) && (input == 2)))))) && !(a4==1))) [L514] COND FALSE !((((a4==1) && ( 306 < a23 && ((((input == 3) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a8==15))) [L526] COND FALSE !(((a4==1) && ((((a3==1) && ( 306 < a23 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 4)))) && a29 <= 140 ) && (a8==15)))) [L531] COND FALSE !((((( ((-43 < a23) && (138 >= a23)) && ((!(a4==1) && (input == 5)) && (a3==1))) && (a25==9)) && a29 <= 140 ) && (a8==15))) [L537] COND FALSE !(( 306 < a23 && (((a8==15) && ((((input == 1) && ((a25==11) || (a25==12))) && (a4==1)) && (a3==1))) && ((140 < a29) && (245 >= a29)) ))) [L542] COND FALSE !(((((a8==15) && ( a23 <= -43 && (((input == 1) && ((a25==10) || (a25==11))) && a29 <= 140 ))) && !(a4==1)) && (a3==1))) [L549] COND FALSE !(((( a23 <= -43 && (!(a4==1) && ((a3==1) && (((a25==11) || ((a25==9) || (a25==10))) && (input == 5))))) && (a8==15)) && ((140 < a29) && (245 >= a29)) )) [L555] COND FALSE !(((a3==1) && ( ((-43 < a23) && (138 >= a23)) && ((a8==15) && ((((((a25==10) || (a25==11)) || (a25==12)) && (input == 5)) && a29 <= 140 ) && !(a4==1)))))) [L561] COND FALSE !(( 306 < a23 && (((a3==1) && ( 277 < a29 && (((input == 4) && (((a25==9) || (a25==10)) || (a25==11))) && (a8==15)))) && (a4==1)))) [L566] COND FALSE !((!(a4==1) && ( a23 <= -43 && ((a8==15) && (((((a25==12) || ((a25==10) || (a25==11))) && (input == 1)) && (a3==1)) && 277 < a29 ))))) [L572] COND FALSE !(( 277 < a29 && (((a25==13) && ( a23 <= -43 && (!(a4==1) && ((input == 1) && (a3==1))))) && (a8==15)))) [L575] COND FALSE !(((( ((-43 < a23) && (138 >= a23)) && (((a25==9) && ((input == 4) && !(a4==1))) && a29 <= 140 )) && (a3==1)) && (a8==15))) [L581] COND FALSE !(((a8==15) && ((((a3==1) && (((((a25==10) || (a25==11)) || (a25==12)) && (input == 3)) && (a4==1))) && 306 < a23 ) && a29 <= 140 ))) [L586] COND FALSE !((( ((-43 < a23) && (138 >= a23)) && ((a3==1) && (!(a4==1) && ((input == 4) && (((a25==10) && ((140 < a29) && (245 >= a29)) ) || (((a25==13) && a29 <= 140 ) || ( ((140 < a29) && (245 >= a29)) && (a25==9)))))))) && (a8==15))) [L598] COND FALSE !(((((a8==15) && ((!(a4==1) && (((a25==11) || ((a25==9) || (a25==10))) && (input == 6))) && (a3==1))) && a23 <= -43 ) && ((140 < a29) && (245 >= a29)) )) [L603] COND FALSE !(( a29 <= 140 && (((a4==1) && ((a8==15) && (((input == 6) && (((a25==10) || (a25==11)) || (a25==12))) && 306 < a23 ))) && (a3==1)))) [L615] COND FALSE !(((((((a3==1) && ((input == 5) && ((a25==11) || (a25==12)))) && (a4==1)) && 306 < a23 ) && ((140 < a29) && (245 >= a29)) ) && (a8==15))) [L621] COND FALSE !(((((a4==1) && ( 306 < a23 && ((a8==15) && (((a25==11) || (a25==12)) && (input == 2))))) && ((140 < a29) && (245 >= a29)) ) && (a3==1))) [L628] COND FALSE !(((((a8==15) && ( a23 <= -43 && (!(a4==1) && ((a25==11) && (input == 5))))) && (a3==1)) && ((245 < a29) && (277 >= a29)) )) [L635] COND FALSE !((((((((input == 2) && ((a25==9) || (a25==10))) && (a8==15)) && ((140 < a29) && (245 >= a29)) ) && 306 < a23 ) && (a3==1)) && (a4==1))) [L642] COND FALSE !(((a8==15) && (((( 277 < a29 && ((input == 2) && ((a25==11) || ((a25==9) || (a25==10))))) && (a4==1)) && (a3==1)) && 306 < a23 ))) [L647] COND FALSE !(((((( ((-43 < a23) && (138 >= a23)) && ((input == 3) && ((a25==12) || ((a25==10) || (a25==11))))) && !(a4==1)) && (a8==15)) && a29 <= 140 ) && (a3==1))) [L658] COND FALSE !((((!(a4==1) && ((((input == 6) && ((a25==12) || ((a25==10) || (a25==11)))) && (a8==15)) && ((-43 < a23) && (138 >= a23)) )) && (a3==1)) && a29 <= 140 )) [L663] COND FALSE !(((a25==9) && (( a29 <= 140 && ((a3==1) && (!(a4==1) && ( ((-43 < a23) && (138 >= a23)) && (input == 2))))) && (a8==15)))) [L670] COND FALSE !((!(a4==1) && ( a23 <= -43 && (((a8==15) && (((((a25==12) && ((245 < a29) && (277 >= a29)) ) || ( ((245 < a29) && (277 >= a29)) && (a25==13))) || ((a25==9) && 277 < a29 )) && (input == 3))) && (a3==1))))) [L675] COND FALSE !((((!(a4==1) && ((a3==1) && ((input == 5) && ((( ((245 < a29) && (277 >= a29)) && (a25==12)) || ((a25==13) && ((245 < a29) && (277 >= a29)) )) || ((a25==9) && 277 < a29 ))))) && a23 <= -43 ) && (a8==15))) [L681] COND FALSE !(( a23 <= -43 && (!(a4==1) && ( ((245 < a29) && (277 >= a29)) && ((a8==15) && ((a25==11) && ((a3==1) && (input == 3)))))))) [L688] COND FALSE !(((((a8==15) && ( 306 < a23 && ( ((140 < a29) && (245 >= a29)) && ((input == 1) && ((a25==9) || (a25==10)))))) && (a4==1)) && (a3==1))) [L694] COND FALSE !((!(a4==1) && (((((a3==1) && ((input == 2) && (((a25==9) || (a25==10)) || (a25==11)))) && ((140 < a29) && (245 >= a29)) ) && a23 <= -43 ) && (a8==15)))) [L706] COND FALSE !(((((((( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) ))) && (input == 6)) && (a3==1)) && 306 < a23 ) && (a4==1)) && (a8==15))) [L712] COND FALSE !(( 306 < a23 && ((a8==15) && ( 277 < a29 && ((a4==1) && ((a3==1) && ((((a25==9) || (a25==10)) || (a25==11)) && (input == 5)))))))) [L717] COND FALSE !(((( 277 < a29 && ((a8==15) && (((input == 6) && a23 <= -43 ) && (a25==13)))) && !(a4==1)) && (a3==1))) [L731] COND FALSE !(((a3==1) && (((!(a4==1) && ((( ((140 < a29) && (245 >= a29)) && (a25==10)) || (( a29 <= 140 && (a25==13)) || ((a25==9) && ((140 < a29) && (245 >= a29)) ))) && (input == 3))) && ((-43 < a23) && (138 >= a23)) ) && (a8==15)))) [L738] COND TRUE ((a3==1) && (( 306 < a23 && (((a4==1) && (((a25==12) || ((a25==10) || (a25==11))) && (input == 1))) && a29 <= 140 )) && (a8==15))) [L739] a29 = ((((a29 + 161077) + -91920) % 299861)- -300138) [L740] a25 = 9 [L742] RET return 26; [L1042] EXPR calculate_output(input) [L1042] output = calculate_output(input) [L1034] COND TRUE 1 [L1037] int input; [L1038] input = __VERIFIER_nondet_int() [L1039] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1042] CALL, EXPR calculate_output(input) [L23] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L26] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L29] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L32] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L35] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L38] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L41] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L44] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L47] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L50] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L53] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L56] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L59] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L62] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L65] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L68] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L71] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L74] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L77] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L80] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L83] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L86] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L89] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L92] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L95] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L98] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L101] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L104] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L107] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L110] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L113] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L116] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L119] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L122] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L125] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L128] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L131] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L134] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L137] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L140] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L143] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L146] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L149] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L152] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L155] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L158] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L161] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L164] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L167] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L170] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L173] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L176] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L179] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L182] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && 306 < a23 ) && (a8==15))) [L185] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L188] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L191] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L194] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L197] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L200] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L203] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L207] COND FALSE !((( ((140 < a29) && (245 >= a29)) && ((a25==12) && ( a23 <= -43 && ((a8==15) && ((input == 6) && (a3==1)))))) && !(a4==1))) [L214] COND FALSE !((!(a4==1) && (((a3==1) && ((((((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 4)) && a23 <= -43 )) && (a8==15)))) [L221] COND FALSE !(((a25==11) && (!(a4==1) && (((((input == 2) && (a3==1)) && a23 <= -43 ) && (a8==15)) && ((245 < a29) && (277 >= a29)) )))) [L227] COND FALSE !(((( a29 <= 140 && ((a3==1) && (((input == 5) && (a25==13)) && (a4==1)))) && (a8==15)) && 306 < a23 )) [L233] COND FALSE !((((a8==15) && (((((((a4==1) && 277 < a29 ) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 )) && (input == 6))) && (a3==1))) [L240] COND FALSE !(((((input == 4) && (( a23 <= -43 && ((a25==9) && (!(a4==1) && a29 <= 140 ))) || (((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && ((a25==13) && ( 277 < a29 && (a4==1))))))) && (a8==15)) && (a3==1))) [L247] COND FALSE !((((a3==1) && (!(a4==1) && (( a29 <= 140 && ((input == 1) && ((a25==12) || ((a25==10) || (a25==11))))) && ((-43 < a23) && (138 >= a23)) ))) && (a8==15))) [L254] COND FALSE !(((( ((245 < a29) && (277 >= a29)) && (( a23 <= -43 && (!(a4==1) && (input == 1))) && (a25==11))) && (a8==15)) && (a3==1))) [L260] COND FALSE !(((((a4==1) && (((input == 1) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))) && (a8==15))) && 306 < a23 ) && (a3==1))) [L265] COND FALSE !((( 277 < a29 && (((a8==15) && ( a23 <= -43 && ((input == 2) && (a3==1)))) && !(a4==1))) && (a25==13))) [L268] COND FALSE !(( a29 <= 140 && ((((a8==15) && ((a3==1) && ((input == 1) && ((a25==12) || (a25==13))))) && !(a4==1)) && a23 <= -43 ))) [L275] COND TRUE (((a4==1) && ((a8==15) && (((a3==1) && (((a25==9) || (a25==10)) && (input == 5))) && ((140 < a29) && (245 >= a29)) ))) && 306 < a23 ) [L276] a23 = ((((a23 * -2)/ 10) * 4) * 1) [L277] a25 = 13 [L279] RET return -1; [L1042] EXPR calculate_output(input) [L1042] output = calculate_output(input) [L1034] COND TRUE 1 [L1037] int input; [L1038] input = __VERIFIER_nondet_int() [L1039] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1042] CALL calculate_output(input) [L23] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L26] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L29] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L32] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L35] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L38] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L41] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L44] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L47] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L50] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L53] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L56] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L59] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L62] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L65] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L68] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L71] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L74] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L77] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L80] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L83] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L86] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L89] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L92] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L95] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L98] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L101] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L104] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L107] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L110] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L113] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L116] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L119] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L122] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L125] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L128] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L131] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L134] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L137] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L140] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L143] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L146] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L149] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L152] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L155] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L158] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L161] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) [L164] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L167] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) [L170] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) [L173] COND TRUE ((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15)) [L174] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 293 locations, 1 error locations. UNKNOWN Result, 100.9s OverallTime, 17 OverallIterations, 3 TraceHistogramMax, 78.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4441 SDtfs, 14972 SDslu, 6700 SDs, 0 SdLazy, 42816 SolverSat, 3712 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 65.6s Time, PredicateUnifierStatistics: 32 DeclaredPredicates, 3970 GetRequests, 3720 SyntacticMatches, 0 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 689 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32232occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 10.5s AbstIntTime, 17 AbstIntIterations, 16 AbstIntStrong, 0.997753404291869 AbsIntWeakeningRatio, 0.1075883575883576 AbsIntAvgWeakeningVarsNumRemoved, 25.74948024948025 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 894 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: No data available, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem11_label19_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_12-46-16-248.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem11_label19_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_12-46-16-248.csv Received shutdown request...