java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label02_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 12:37:52,335 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 12:37:52,337 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 12:37:52,354 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 12:37:52,354 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 12:37:52,358 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 12:37:52,360 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 12:37:52,362 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 12:37:52,364 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 12:37:52,372 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 12:37:52,373 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 12:37:52,374 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 12:37:52,378 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 12:37:52,379 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 12:37:52,383 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 12:37:52,384 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 12:37:52,386 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 12:37:52,389 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 12:37:52,395 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 12:37:52,397 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 12:37:52,400 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 12:37:52,401 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 12:37:52,405 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 12:37:52,405 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 12:37:52,406 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 12:37:52,408 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 12:37:52,409 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 12:37:52,410 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 12:37:52,411 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 12:37:52,413 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 12:37:52,415 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 12:37:52,416 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 12:37:52,416 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 12:37:52,416 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 12:37:52,417 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 12:37:52,420 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 12:37:52,421 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:37:52,451 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 12:37:52,452 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 12:37:52,456 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 12:37:52,456 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 12:37:52,457 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 12:37:52,457 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 12:37:52,457 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 12:37:52,458 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-19 12:37:52,458 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-19 12:37:52,458 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 12:37:52,459 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 12:37:52,459 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 12:37:52,460 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 12:37:52,460 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 12:37:52,461 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 12:37:52,461 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 12:37:52,461 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 12:37:52,463 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 12:37:52,463 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 12:37:52,464 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 12:37:52,464 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 12:37:52,464 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 12:37:52,464 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 12:37:52,464 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 12:37:52,465 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 12:37:52,465 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 12:37:52,465 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 12:37:52,465 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 12:37:52,465 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 12:37:52,466 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 12:37:52,466 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 12:37:52,466 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 12:37:52,466 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 12:37:52,466 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 12:37:52,526 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 12:37:52,541 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 12:37:52,547 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 12:37:52,548 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 12:37:52,549 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 12:37:52,550 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label02_true-unreach-call.c [2018-09-19 12:37:52,923 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8be5633c/148a2b2bcb3d490aa6b9ab112c3982a5/FLAG057bf249c [2018-09-19 12:37:53,201 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 12:37:53,202 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label02_true-unreach-call.c [2018-09-19 12:37:53,219 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8be5633c/148a2b2bcb3d490aa6b9ab112c3982a5/FLAG057bf249c [2018-09-19 12:37:53,242 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8be5633c/148a2b2bcb3d490aa6b9ab112c3982a5 [2018-09-19 12:37:53,254 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 12:37:53,257 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 12:37:53,258 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 12:37:53,259 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 12:37:53,265 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 12:37:53,266 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 12:37:53" (1/1) ... [2018-09-19 12:37:53,269 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56aae051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:37:53, skipping insertion in model container [2018-09-19 12:37:53,270 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 12:37:53" (1/1) ... [2018-09-19 12:37:53,282 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 12:37:53,808 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 12:37:53,827 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 12:37:53,971 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 12:37:54,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:37:54 WrapperNode [2018-09-19 12:37:54,028 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 12:37:54,029 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 12:37:54,029 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 12:37:54,030 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 12:37:54,040 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:37:54" (1/1) ... [2018-09-19 12:37:54,074 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:37:54" (1/1) ... [2018-09-19 12:37:54,141 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 12:37:54,141 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 12:37:54,141 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 12:37:54,141 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 12:37:54,299 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:37:54" (1/1) ... [2018-09-19 12:37:54,300 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:37:54" (1/1) ... [2018-09-19 12:37:54,310 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:37:54" (1/1) ... [2018-09-19 12:37:54,313 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:37:54" (1/1) ... [2018-09-19 12:37:54,360 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:37:54" (1/1) ... [2018-09-19 12:37:54,375 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:37:54" (1/1) ... [2018-09-19 12:37:54,381 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:37:54" (1/1) ... [2018-09-19 12:37:54,394 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 12:37:54,394 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 12:37:54,394 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 12:37:54,395 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 12:37:54,396 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:37:54" (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:37:54,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 12:37:54,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 12:37:54,479 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 12:37:54,479 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 12:37:54,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 12:37:54,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 12:37:54,480 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 12:37:54,480 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 12:37:57,817 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 12:37:57,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 12:37:57 BoogieIcfgContainer [2018-09-19 12:37:57,818 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 12:37:57,819 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 12:37:57,819 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 12:37:57,823 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 12:37:57,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 12:37:53" (1/3) ... [2018-09-19 12:37:57,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@292ea6f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 12:37:57, skipping insertion in model container [2018-09-19 12:37:57,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 12:37:54" (2/3) ... [2018-09-19 12:37:57,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@292ea6f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 12:37:57, skipping insertion in model container [2018-09-19 12:37:57,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 12:37:57" (3/3) ... [2018-09-19 12:37:57,828 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label02_true-unreach-call.c [2018-09-19 12:37:57,838 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 12:37:57,848 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 12:37:57,905 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 12:37:57,906 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 12:37:57,906 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 12:37:57,906 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 12:37:57,906 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 12:37:57,906 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 12:37:57,907 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 12:37:57,907 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 12:37:57,907 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 12:37:57,935 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-19 12:37:57,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-19 12:37:57,946 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:37:57,948 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:37:57,949 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:37:57,954 INFO L82 PathProgramCache]: Analyzing trace with hash 417311892, now seen corresponding path program 1 times [2018-09-19 12:37:57,956 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:37:57,957 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 67 with the following transitions: [2018-09-19 12:37:57,960 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [796], [800], [806], [810], [817], [818], [819], [821] [2018-09-19 12:37:58,007 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:37:58,007 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:37:58,403 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:37:58,405 INFO L272 AbstractInterpreter]: Visited 65 different actions 65 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-19 12:37:58,451 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:37:58,694 INFO L232 lantSequenceWeakener]: Weakened 63 states. On average, predicates are now at 75.67% of their original sizes. [2018-09-19 12:37:58,695 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:37:58,955 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:37:58,957 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:37:58,958 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 12:37:58,959 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:37:58,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 12:37:58,973 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 12:37:58,974 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 12:37:58,977 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 6 states. [2018-09-19 12:38:01,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:38:01,119 INFO L93 Difference]: Finished difference Result 576 states and 995 transitions. [2018-09-19 12:38:01,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 12:38:01,122 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-09-19 12:38:01,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:38:01,139 INFO L225 Difference]: With dead ends: 576 [2018-09-19 12:38:01,139 INFO L226 Difference]: Without dead ends: 358 [2018-09-19 12:38:01,146 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 65 GetRequests, 61 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:38:01,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-09-19 12:38:01,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-09-19 12:38:01,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-19 12:38:01,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2018-09-19 12:38:01,219 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 66 [2018-09-19 12:38:01,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:38:01,219 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2018-09-19 12:38:01,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 12:38:01,220 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2018-09-19 12:38:01,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-09-19 12:38:01,227 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:38:01,228 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:38:01,228 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:38:01,229 INFO L82 PathProgramCache]: Analyzing trace with hash 696839107, now seen corresponding path program 1 times [2018-09-19 12:38:01,229 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:38:01,229 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 138 with the following transitions: [2018-09-19 12:38:01,230 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:38:01,235 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:38:01,235 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:38:01,320 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:38:01,431 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:38:01,431 INFO L272 AbstractInterpreter]: Visited 78 different actions 221 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 12:38:01,467 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:38:01,691 INFO L232 lantSequenceWeakener]: Weakened 134 states. On average, predicates are now at 74.18% of their original sizes. [2018-09-19 12:38:01,691 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:38:02,231 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:38:02,231 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:38:02,231 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:38:02,232 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:38:02,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:38:02,233 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:38:02,234 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:38:02,234 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand 10 states. [2018-09-19 12:38:06,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:38:06,130 INFO L93 Difference]: Finished difference Result 717 states and 1132 transitions. [2018-09-19 12:38:06,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 12:38:06,134 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 137 [2018-09-19 12:38:06,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:38:06,140 INFO L225 Difference]: With dead ends: 717 [2018-09-19 12:38:06,140 INFO L226 Difference]: Without dead ends: 511 [2018-09-19 12:38:06,144 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 143 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 12:38:06,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-09-19 12:38:06,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 505. [2018-09-19 12:38:06,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2018-09-19 12:38:06,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 659 transitions. [2018-09-19 12:38:06,178 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 659 transitions. Word has length 137 [2018-09-19 12:38:06,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:38:06,179 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 659 transitions. [2018-09-19 12:38:06,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:38:06,179 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 659 transitions. [2018-09-19 12:38:06,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-09-19 12:38:06,183 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:38:06,184 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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:38:06,184 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:38:06,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1246975752, now seen corresponding path program 1 times [2018-09-19 12:38:06,185 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:38:06,185 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 147 with the following transitions: [2018-09-19 12:38:06,185 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:38:06,189 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:38:06,189 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:38:06,257 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:38:06,362 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:38:06,362 INFO L272 AbstractInterpreter]: Visited 87 different actions 248 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 12:38:06,387 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:38:06,577 INFO L232 lantSequenceWeakener]: Weakened 143 states. On average, predicates are now at 74.09% of their original sizes. [2018-09-19 12:38:06,578 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:38:06,917 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:38:06,917 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:38:06,918 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:38:06,918 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:38:06,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:38:06,919 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:38:06,919 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:38:06,919 INFO L87 Difference]: Start difference. First operand 505 states and 659 transitions. Second operand 10 states. [2018-09-19 12:38:10,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:38:10,527 INFO L93 Difference]: Finished difference Result 1149 states and 1716 transitions. [2018-09-19 12:38:10,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:38:10,529 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 146 [2018-09-19 12:38:10,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:38:10,535 INFO L225 Difference]: With dead ends: 1149 [2018-09-19 12:38:10,536 INFO L226 Difference]: Without dead ends: 794 [2018-09-19 12:38:10,538 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 153 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:38:10,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2018-09-19 12:38:10,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 783. [2018-09-19 12:38:10,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2018-09-19 12:38:10,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 991 transitions. [2018-09-19 12:38:10,577 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 991 transitions. Word has length 146 [2018-09-19 12:38:10,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:38:10,578 INFO L480 AbstractCegarLoop]: Abstraction has 783 states and 991 transitions. [2018-09-19 12:38:10,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:38:10,578 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 991 transitions. [2018-09-19 12:38:10,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-09-19 12:38:10,583 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:38:10,584 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:10,584 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:38:10,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1408154240, now seen corresponding path program 1 times [2018-09-19 12:38:10,585 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:38:10,585 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 183 with the following transitions: [2018-09-19 12:38:10,586 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [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], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:38:10,590 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:38:10,591 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:38:10,698 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:38:10,965 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:38:10,965 INFO L272 AbstractInterpreter]: Visited 123 different actions 356 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 12:38:11,002 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:38:11,427 INFO L232 lantSequenceWeakener]: Weakened 179 states. On average, predicates are now at 73.81% of their original sizes. [2018-09-19 12:38:11,427 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:38:11,912 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:38:11,913 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:38:11,913 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:38:11,913 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:38:11,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:38:11,914 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:38:11,914 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:38:11,915 INFO L87 Difference]: Start difference. First operand 783 states and 991 transitions. Second operand 10 states. [2018-09-19 12:38:16,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:38:16,979 INFO L93 Difference]: Finished difference Result 1723 states and 2312 transitions. [2018-09-19 12:38:16,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 12:38:16,980 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 182 [2018-09-19 12:38:16,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:38:16,987 INFO L225 Difference]: With dead ends: 1723 [2018-09-19 12:38:16,987 INFO L226 Difference]: Without dead ends: 1090 [2018-09-19 12:38:16,990 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 188 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 12:38:16,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2018-09-19 12:38:17,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1081. [2018-09-19 12:38:17,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1081 states. [2018-09-19 12:38:17,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1341 transitions. [2018-09-19 12:38:17,025 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1341 transitions. Word has length 182 [2018-09-19 12:38:17,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:38:17,026 INFO L480 AbstractCegarLoop]: Abstraction has 1081 states and 1341 transitions. [2018-09-19 12:38:17,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:38:17,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1341 transitions. [2018-09-19 12:38:17,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-09-19 12:38:17,031 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:38:17,031 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:17,032 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:38:17,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1512419139, now seen corresponding path program 1 times [2018-09-19 12:38:17,032 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:38:17,032 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 202 with the following transitions: [2018-09-19 12:38:17,033 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [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], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [754], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:38:17,038 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:38:17,039 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:38:17,360 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:38:17,361 INFO L272 AbstractInterpreter]: Visited 142 different actions 413 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 12:38:17,399 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:38:17,614 INFO L232 lantSequenceWeakener]: Weakened 198 states. On average, predicates are now at 73.71% of their original sizes. [2018-09-19 12:38:17,615 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:38:17,736 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:38:17,736 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:38:17,736 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:38:17,736 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:38:17,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:38:17,737 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:38:17,737 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:38:17,737 INFO L87 Difference]: Start difference. First operand 1081 states and 1341 transitions. Second operand 10 states. [2018-09-19 12:38:20,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:38:20,651 INFO L93 Difference]: Finished difference Result 2464 states and 3181 transitions. [2018-09-19 12:38:20,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 12:38:20,652 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 201 [2018-09-19 12:38:20,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:38:20,660 INFO L225 Difference]: With dead ends: 2464 [2018-09-19 12:38:20,660 INFO L226 Difference]: Without dead ends: 1533 [2018-09-19 12:38:20,664 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 207 GetRequests, 192 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:38:20,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2018-09-19 12:38:20,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1521. [2018-09-19 12:38:20,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1521 states. [2018-09-19 12:38:20,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 1832 transitions. [2018-09-19 12:38:20,711 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 1832 transitions. Word has length 201 [2018-09-19 12:38:20,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:38:20,712 INFO L480 AbstractCegarLoop]: Abstraction has 1521 states and 1832 transitions. [2018-09-19 12:38:20,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:38:20,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 1832 transitions. [2018-09-19 12:38:20,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-09-19 12:38:20,716 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:38:20,717 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-09-19 12:38:20,717 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:38:20,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1959328001, now seen corresponding path program 1 times [2018-09-19 12:38:20,718 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:38:20,718 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 214 with the following transitions: [2018-09-19 12:38:20,718 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [518], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:38:20,722 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:38:20,722 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:38:20,802 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:38:20,962 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:38:20,962 INFO L272 AbstractInterpreter]: Visited 84 different actions 323 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 12:38:21,002 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:38:21,281 INFO L232 lantSequenceWeakener]: Weakened 210 states. On average, predicates are now at 73.7% of their original sizes. [2018-09-19 12:38:21,281 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:38:21,595 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:38:21,595 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:38:21,596 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:38:21,596 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:38:21,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:38:21,596 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:38:21,597 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:38:21,597 INFO L87 Difference]: Start difference. First operand 1521 states and 1832 transitions. Second operand 10 states. [2018-09-19 12:38:23,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:38:23,928 INFO L93 Difference]: Finished difference Result 3061 states and 3823 transitions. [2018-09-19 12:38:23,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:38:23,929 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 213 [2018-09-19 12:38:23,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:38:23,938 INFO L225 Difference]: With dead ends: 3061 [2018-09-19 12:38:23,938 INFO L226 Difference]: Without dead ends: 1690 [2018-09-19 12:38:23,942 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 220 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:38:23,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2018-09-19 12:38:23,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1672. [2018-09-19 12:38:23,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2018-09-19 12:38:23,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1998 transitions. [2018-09-19 12:38:23,985 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1998 transitions. Word has length 213 [2018-09-19 12:38:23,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:38:23,986 INFO L480 AbstractCegarLoop]: Abstraction has 1672 states and 1998 transitions. [2018-09-19 12:38:23,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:38:23,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1998 transitions. [2018-09-19 12:38:23,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-09-19 12:38:23,990 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:38:23,990 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-09-19 12:38:23,991 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:38:23,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1452233237, now seen corresponding path program 1 times [2018-09-19 12:38:23,991 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:38:23,991 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 220 with the following transitions: [2018-09-19 12:38:23,992 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:38:23,994 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:38:23,994 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:38:24,045 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:38:24,155 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:38:24,156 INFO L272 AbstractInterpreter]: Visited 88 different actions 340 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:38:24,194 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:38:24,452 INFO L232 lantSequenceWeakener]: Weakened 216 states. On average, predicates are now at 73.67% of their original sizes. [2018-09-19 12:38:24,452 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:38:24,584 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:38:24,584 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:38:24,584 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:38:24,584 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:38:24,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:38:24,585 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:38:24,585 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:38:24,586 INFO L87 Difference]: Start difference. First operand 1672 states and 1998 transitions. Second operand 10 states. [2018-09-19 12:38:26,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:38:26,958 INFO L93 Difference]: Finished difference Result 3508 states and 4339 transitions. [2018-09-19 12:38:26,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:38:26,963 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 219 [2018-09-19 12:38:26,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:38:26,973 INFO L225 Difference]: With dead ends: 3508 [2018-09-19 12:38:26,973 INFO L226 Difference]: Without dead ends: 1986 [2018-09-19 12:38:26,978 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 226 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:38:26,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1986 states. [2018-09-19 12:38:27,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1986 to 1956. [2018-09-19 12:38:27,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1956 states. [2018-09-19 12:38:27,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1956 states to 1956 states and 2368 transitions. [2018-09-19 12:38:27,034 INFO L78 Accepts]: Start accepts. Automaton has 1956 states and 2368 transitions. Word has length 219 [2018-09-19 12:38:27,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:38:27,035 INFO L480 AbstractCegarLoop]: Abstraction has 1956 states and 2368 transitions. [2018-09-19 12:38:27,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:38:27,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1956 states and 2368 transitions. [2018-09-19 12:38:27,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-09-19 12:38:27,040 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:38:27,041 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-09-19 12:38:27,041 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:38:27,041 INFO L82 PathProgramCache]: Analyzing trace with hash 501368352, now seen corresponding path program 1 times [2018-09-19 12:38:27,042 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:38:27,042 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 225 with the following transitions: [2018-09-19 12:38:27,042 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:38:27,045 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:38:27,045 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:38:27,109 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:38:27,401 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:38:27,401 INFO L272 AbstractInterpreter]: Visited 88 different actions 340 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:38:27,438 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:38:27,696 INFO L232 lantSequenceWeakener]: Weakened 221 states. On average, predicates are now at 73.65% of their original sizes. [2018-09-19 12:38:27,697 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:38:27,922 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:38:27,922 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:38:27,922 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:38:27,923 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:38:27,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:38:27,923 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:38:27,924 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:38:27,924 INFO L87 Difference]: Start difference. First operand 1956 states and 2368 transitions. Second operand 10 states. [2018-09-19 12:38:30,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:38:30,485 INFO L93 Difference]: Finished difference Result 4370 states and 5531 transitions. [2018-09-19 12:38:30,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:38:30,485 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 224 [2018-09-19 12:38:30,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:38:30,498 INFO L225 Difference]: With dead ends: 4370 [2018-09-19 12:38:30,499 INFO L226 Difference]: Without dead ends: 2564 [2018-09-19 12:38:30,504 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 231 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:38:30,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2018-09-19 12:38:30,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 2527. [2018-09-19 12:38:30,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2527 states. [2018-09-19 12:38:30,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2527 states to 2527 states and 3089 transitions. [2018-09-19 12:38:30,573 INFO L78 Accepts]: Start accepts. Automaton has 2527 states and 3089 transitions. Word has length 224 [2018-09-19 12:38:30,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:38:30,573 INFO L480 AbstractCegarLoop]: Abstraction has 2527 states and 3089 transitions. [2018-09-19 12:38:30,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:38:30,574 INFO L276 IsEmpty]: Start isEmpty. Operand 2527 states and 3089 transitions. [2018-09-19 12:38:30,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-09-19 12:38:30,579 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:38:30,579 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-09-19 12:38:30,580 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:38:30,580 INFO L82 PathProgramCache]: Analyzing trace with hash -2101467944, now seen corresponding path program 1 times [2018-09-19 12:38:30,580 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:38:30,580 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 229 with the following transitions: [2018-09-19 12:38:30,580 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [542], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:38:30,582 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:38:30,582 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:38:30,631 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:38:30,796 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:38:30,797 INFO L272 AbstractInterpreter]: Visited 90 different actions 434 times. Merged at 7 different actions 28 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:38:30,801 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:38:31,051 INFO L232 lantSequenceWeakener]: Weakened 225 states. On average, predicates are now at 73.63% of their original sizes. [2018-09-19 12:38:31,052 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:38:31,306 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:38:31,306 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:38:31,306 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:38:31,307 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:38:31,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:38:31,307 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:38:31,307 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:38:31,307 INFO L87 Difference]: Start difference. First operand 2527 states and 3089 transitions. Second operand 10 states. [2018-09-19 12:38:34,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:38:34,621 INFO L93 Difference]: Finished difference Result 5813 states and 7415 transitions. [2018-09-19 12:38:34,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:38:34,631 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 228 [2018-09-19 12:38:34,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:38:34,647 INFO L225 Difference]: With dead ends: 5813 [2018-09-19 12:38:34,647 INFO L226 Difference]: Without dead ends: 3436 [2018-09-19 12:38:34,656 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 235 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:38:34,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3436 states. [2018-09-19 12:38:34,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3436 to 3377. [2018-09-19 12:38:34,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3377 states. [2018-09-19 12:38:34,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3377 states to 3377 states and 4175 transitions. [2018-09-19 12:38:34,808 INFO L78 Accepts]: Start accepts. Automaton has 3377 states and 4175 transitions. Word has length 228 [2018-09-19 12:38:34,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:38:34,810 INFO L480 AbstractCegarLoop]: Abstraction has 3377 states and 4175 transitions. [2018-09-19 12:38:34,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:38:34,810 INFO L276 IsEmpty]: Start isEmpty. Operand 3377 states and 4175 transitions. [2018-09-19 12:38:34,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-09-19 12:38:34,818 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:38:34,819 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:38:34,819 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:38:34,819 INFO L82 PathProgramCache]: Analyzing trace with hash -2050132244, now seen corresponding path program 1 times [2018-09-19 12:38:34,819 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:38:34,820 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 235 with the following transitions: [2018-09-19 12:38:34,820 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:38:34,822 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:38:34,822 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:38:34,876 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:38:40,417 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:38:40,418 INFO L272 AbstractInterpreter]: Visited 96 different actions 464 times. Merged at 7 different actions 28 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:38:40,426 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:38:41,945 INFO L232 lantSequenceWeakener]: Weakened 231 states. On average, predicates are now at 73.61% of their original sizes. [2018-09-19 12:38:41,945 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:38:42,040 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:38:42,040 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:38:42,041 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:38:42,041 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:38:42,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:38:42,041 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:38:42,042 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:38:42,042 INFO L87 Difference]: Start difference. First operand 3377 states and 4175 transitions. Second operand 10 states. [2018-09-19 12:38:44,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:38:44,749 INFO L93 Difference]: Finished difference Result 8372 states and 10738 transitions. [2018-09-19 12:38:44,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:38:44,750 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 234 [2018-09-19 12:38:44,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:38:44,770 INFO L225 Difference]: With dead ends: 8372 [2018-09-19 12:38:44,771 INFO L226 Difference]: Without dead ends: 5145 [2018-09-19 12:38:44,779 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 241 GetRequests, 225 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:38:44,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5145 states. [2018-09-19 12:38:44,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5145 to 5045. [2018-09-19 12:38:44,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5045 states. [2018-09-19 12:38:44,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5045 states to 5045 states and 6270 transitions. [2018-09-19 12:38:44,890 INFO L78 Accepts]: Start accepts. Automaton has 5045 states and 6270 transitions. Word has length 234 [2018-09-19 12:38:44,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:38:44,891 INFO L480 AbstractCegarLoop]: Abstraction has 5045 states and 6270 transitions. [2018-09-19 12:38:44,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:38:44,891 INFO L276 IsEmpty]: Start isEmpty. Operand 5045 states and 6270 transitions. [2018-09-19 12:38:44,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-09-19 12:38:44,901 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:38:44,901 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-09-19 12:38:44,902 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:38:44,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1615276175, now seen corresponding path program 1 times [2018-09-19 12:38:44,902 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:38:44,902 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 250 with the following transitions: [2018-09-19 12:38:44,903 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [626], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:38:44,905 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:38:44,906 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:38:44,956 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:38:45,260 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:38:45,261 INFO L272 AbstractInterpreter]: Visited 111 different actions 539 times. Merged at 7 different actions 28 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:38:45,299 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:38:45,562 INFO L232 lantSequenceWeakener]: Weakened 246 states. On average, predicates are now at 73.55% of their original sizes. [2018-09-19 12:38:45,566 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:38:45,722 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:38:45,722 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:38:45,723 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:38:45,723 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:38:45,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:38:45,724 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:38:45,724 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:38:45,724 INFO L87 Difference]: Start difference. First operand 5045 states and 6270 transitions. Second operand 10 states. [2018-09-19 12:38:48,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:38:48,876 INFO L93 Difference]: Finished difference Result 10399 states and 13068 transitions. [2018-09-19 12:38:48,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:38:48,877 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 249 [2018-09-19 12:38:48,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:38:48,897 INFO L225 Difference]: With dead ends: 10399 [2018-09-19 12:38:48,897 INFO L226 Difference]: Without dead ends: 5504 [2018-09-19 12:38:48,909 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 256 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:38:48,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5504 states. [2018-09-19 12:38:49,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5504 to 5429. [2018-09-19 12:38:49,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5429 states. [2018-09-19 12:38:49,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5429 states to 5429 states and 6773 transitions. [2018-09-19 12:38:49,025 INFO L78 Accepts]: Start accepts. Automaton has 5429 states and 6773 transitions. Word has length 249 [2018-09-19 12:38:49,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:38:49,026 INFO L480 AbstractCegarLoop]: Abstraction has 5429 states and 6773 transitions. [2018-09-19 12:38:49,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:38:49,026 INFO L276 IsEmpty]: Start isEmpty. Operand 5429 states and 6773 transitions. [2018-09-19 12:38:49,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-09-19 12:38:49,035 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:38:49,036 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-09-19 12:38:49,036 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:38:49,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1058847117, now seen corresponding path program 1 times [2018-09-19 12:38:49,036 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:38:49,037 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 256 with the following transitions: [2018-09-19 12:38:49,037 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:38:49,041 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:38:49,041 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:38:49,129 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:38:49,333 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:38:49,334 INFO L272 AbstractInterpreter]: Visited 124 different actions 483 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 12:38:49,338 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:38:49,583 INFO L232 lantSequenceWeakener]: Weakened 252 states. On average, predicates are now at 73.53% of their original sizes. [2018-09-19 12:38:49,584 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:38:49,685 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:38:49,686 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:38:49,686 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:38:49,686 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:38:49,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:38:49,687 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:38:49,687 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:38:49,687 INFO L87 Difference]: Start difference. First operand 5429 states and 6773 transitions. Second operand 10 states. [2018-09-19 12:38:53,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:38:53,296 INFO L93 Difference]: Finished difference Result 11196 states and 14212 transitions. [2018-09-19 12:38:53,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:38:53,303 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 255 [2018-09-19 12:38:53,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:38:53,323 INFO L225 Difference]: With dead ends: 11196 [2018-09-19 12:38:53,324 INFO L226 Difference]: Without dead ends: 5917 [2018-09-19 12:38:53,334 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 262 GetRequests, 246 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:38:53,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5917 states. [2018-09-19 12:38:53,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5917 to 5887. [2018-09-19 12:38:53,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5887 states. [2018-09-19 12:38:53,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5887 states to 5887 states and 7406 transitions. [2018-09-19 12:38:53,438 INFO L78 Accepts]: Start accepts. Automaton has 5887 states and 7406 transitions. Word has length 255 [2018-09-19 12:38:53,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:38:53,438 INFO L480 AbstractCegarLoop]: Abstraction has 5887 states and 7406 transitions. [2018-09-19 12:38:53,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:38:53,439 INFO L276 IsEmpty]: Start isEmpty. Operand 5887 states and 7406 transitions. [2018-09-19 12:38:53,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-09-19 12:38:53,448 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:38:53,448 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-09-19 12:38:53,449 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:38:53,449 INFO L82 PathProgramCache]: Analyzing trace with hash -485114912, now seen corresponding path program 1 times [2018-09-19 12:38:53,449 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:38:53,449 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 257 with the following transitions: [2018-09-19 12:38:53,450 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:38:53,452 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:38:53,452 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:38:53,497 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:38:53,749 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:38:53,749 INFO L272 AbstractInterpreter]: Visited 118 different actions 574 times. Merged at 7 different actions 28 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:38:53,757 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:38:53,987 INFO L232 lantSequenceWeakener]: Weakened 253 states. On average, predicates are now at 73.53% of their original sizes. [2018-09-19 12:38:53,988 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:38:54,078 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:38:54,079 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:38:54,079 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:38:54,079 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:38:54,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:38:54,080 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:38:54,080 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:38:54,081 INFO L87 Difference]: Start difference. First operand 5887 states and 7406 transitions. Second operand 10 states. [2018-09-19 12:38:57,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:38:57,241 INFO L93 Difference]: Finished difference Result 13421 states and 17237 transitions. [2018-09-19 12:38:57,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:38:57,247 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 256 [2018-09-19 12:38:57,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:38:57,269 INFO L225 Difference]: With dead ends: 13421 [2018-09-19 12:38:57,270 INFO L226 Difference]: Without dead ends: 7684 [2018-09-19 12:38:57,284 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 263 GetRequests, 247 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:38:57,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7684 states. [2018-09-19 12:38:57,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7684 to 7560. [2018-09-19 12:38:57,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7560 states. [2018-09-19 12:38:57,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7560 states to 7560 states and 9639 transitions. [2018-09-19 12:38:57,422 INFO L78 Accepts]: Start accepts. Automaton has 7560 states and 9639 transitions. Word has length 256 [2018-09-19 12:38:57,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:38:57,423 INFO L480 AbstractCegarLoop]: Abstraction has 7560 states and 9639 transitions. [2018-09-19 12:38:57,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:38:57,423 INFO L276 IsEmpty]: Start isEmpty. Operand 7560 states and 9639 transitions. [2018-09-19 12:38:57,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-09-19 12:38:57,439 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:38:57,439 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-09-19 12:38:57,440 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:38:57,440 INFO L82 PathProgramCache]: Analyzing trace with hash -893308512, now seen corresponding path program 1 times [2018-09-19 12:38:57,440 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:38:57,440 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 289 with the following transitions: [2018-09-19 12:38:57,441 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [782], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:38:57,444 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:38:57,444 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:38:57,492 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:38:57,828 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:38:57,828 INFO L272 AbstractInterpreter]: Visited 150 different actions 587 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 12:38:57,854 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:38:58,173 INFO L232 lantSequenceWeakener]: Weakened 285 states. On average, predicates are now at 73.44% of their original sizes. [2018-09-19 12:38:58,174 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:38:58,922 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:38:58,923 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:38:58,923 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:38:58,923 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:38:58,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:38:58,924 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:38:58,924 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:38:58,924 INFO L87 Difference]: Start difference. First operand 7560 states and 9639 transitions. Second operand 10 states. [2018-09-19 12:39:02,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:39:02,336 INFO L93 Difference]: Finished difference Result 16780 states and 21621 transitions. [2018-09-19 12:39:02,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:39:02,339 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 288 [2018-09-19 12:39:02,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:39:02,362 INFO L225 Difference]: With dead ends: 16780 [2018-09-19 12:39:02,362 INFO L226 Difference]: Without dead ends: 9370 [2018-09-19 12:39:02,376 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 295 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:39:02,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9370 states. [2018-09-19 12:39:02,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9370 to 9238. [2018-09-19 12:39:02,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9238 states. [2018-09-19 12:39:02,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9238 states to 9238 states and 11908 transitions. [2018-09-19 12:39:02,549 INFO L78 Accepts]: Start accepts. Automaton has 9238 states and 11908 transitions. Word has length 288 [2018-09-19 12:39:02,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:39:02,550 INFO L480 AbstractCegarLoop]: Abstraction has 9238 states and 11908 transitions. [2018-09-19 12:39:02,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:39:02,550 INFO L276 IsEmpty]: Start isEmpty. Operand 9238 states and 11908 transitions. [2018-09-19 12:39:02,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-09-19 12:39:02,570 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:39:02,570 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:39:02,571 INFO L423 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:39:02,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1489893843, now seen corresponding path program 1 times [2018-09-19 12:39:02,571 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:39:02,571 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 298 with the following transitions: [2018-09-19 12:39:02,572 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [526], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:39:02,574 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:39:02,574 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:39:02,620 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:39:02,819 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:39:02,820 INFO L272 AbstractInterpreter]: Visited 89 different actions 438 times. Merged at 8 different actions 37 times. Never widened. Found 9 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:39:02,851 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:39:03,161 INFO L232 lantSequenceWeakener]: Weakened 294 states. On average, predicates are now at 73.45% of their original sizes. [2018-09-19 12:39:03,161 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:39:03,950 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:39:03,950 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:39:03,950 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:39:03,951 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:39:03,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:39:03,951 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:39:03,952 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:39:03,952 INFO L87 Difference]: Start difference. First operand 9238 states and 11908 transitions. Second operand 10 states. [2018-09-19 12:39:06,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:39:06,946 INFO L93 Difference]: Finished difference Result 20530 states and 26690 transitions. [2018-09-19 12:39:06,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:39:06,947 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 297 [2018-09-19 12:39:06,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:39:06,980 INFO L225 Difference]: With dead ends: 20530 [2018-09-19 12:39:06,980 INFO L226 Difference]: Without dead ends: 11442 [2018-09-19 12:39:06,999 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 304 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:39:07,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11442 states. [2018-09-19 12:39:07,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11442 to 11268. [2018-09-19 12:39:07,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11268 states. [2018-09-19 12:39:07,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11268 states to 11268 states and 14578 transitions. [2018-09-19 12:39:07,212 INFO L78 Accepts]: Start accepts. Automaton has 11268 states and 14578 transitions. Word has length 297 [2018-09-19 12:39:07,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:39:07,213 INFO L480 AbstractCegarLoop]: Abstraction has 11268 states and 14578 transitions. [2018-09-19 12:39:07,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:39:07,213 INFO L276 IsEmpty]: Start isEmpty. Operand 11268 states and 14578 transitions. [2018-09-19 12:39:07,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-09-19 12:39:07,236 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:39:07,236 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:39:07,236 INFO L423 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:39:07,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1573895747, now seen corresponding path program 1 times [2018-09-19 12:39:07,237 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:39:07,237 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 306 with the following transitions: [2018-09-19 12:39:07,237 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [534], [535], [538], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:39:07,239 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:39:07,239 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:39:07,297 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:39:07,494 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:39:07,494 INFO L272 AbstractInterpreter]: Visited 90 different actions 440 times. Merged at 8 different actions 34 times. Never widened. Found 8 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:39:07,528 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:39:07,857 INFO L232 lantSequenceWeakener]: Weakened 302 states. On average, predicates are now at 73.43% of their original sizes. [2018-09-19 12:39:07,858 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:39:08,652 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:39:08,653 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:39:08,653 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:39:08,653 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:39:08,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:39:08,654 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:39:08,654 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:39:08,654 INFO L87 Difference]: Start difference. First operand 11268 states and 14578 transitions. Second operand 10 states. [2018-09-19 12:39:12,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:39:12,220 INFO L93 Difference]: Finished difference Result 24169 states and 31450 transitions. [2018-09-19 12:39:12,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-19 12:39:12,226 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 305 [2018-09-19 12:39:12,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:39:12,275 INFO L225 Difference]: With dead ends: 24169 [2018-09-19 12:39:12,275 INFO L226 Difference]: Without dead ends: 13051 [2018-09-19 12:39:12,296 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 312 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:39:12,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13051 states. [2018-09-19 12:39:12,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13051 to 12904. [2018-09-19 12:39:12,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12904 states. [2018-09-19 12:39:12,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12904 states to 12904 states and 16702 transitions. [2018-09-19 12:39:12,536 INFO L78 Accepts]: Start accepts. Automaton has 12904 states and 16702 transitions. Word has length 305 [2018-09-19 12:39:12,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:39:12,537 INFO L480 AbstractCegarLoop]: Abstraction has 12904 states and 16702 transitions. [2018-09-19 12:39:12,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:39:12,537 INFO L276 IsEmpty]: Start isEmpty. Operand 12904 states and 16702 transitions. [2018-09-19 12:39:12,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-09-19 12:39:12,563 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:39:12,564 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-09-19 12:39:12,564 INFO L423 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:39:12,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1040232825, now seen corresponding path program 1 times [2018-09-19 12:39:12,564 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:39:12,565 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 308 with the following transitions: [2018-09-19 12:39:12,565 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:39:12,568 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:39:12,569 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:39:12,634 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:39:18,618 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:39:18,619 INFO L272 AbstractInterpreter]: Visited 97 different actions 573 times. Merged at 8 different actions 46 times. Widened at 1 different actions 1 times. Found 11 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:39:18,636 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:39:20,607 INFO L232 lantSequenceWeakener]: Weakened 304 states. On average, predicates are now at 73.43% of their original sizes. [2018-09-19 12:39:20,608 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:39:20,920 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:39:20,921 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:39:20,921 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:39:20,921 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:39:20,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:39:20,922 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:39:20,922 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:39:20,922 INFO L87 Difference]: Start difference. First operand 12904 states and 16702 transitions. Second operand 10 states. [2018-09-19 12:39:24,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:39:24,985 INFO L93 Difference]: Finished difference Result 27274 states and 35434 transitions. [2018-09-19 12:39:24,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:39:24,989 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 307 [2018-09-19 12:39:24,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:39:25,018 INFO L225 Difference]: With dead ends: 27274 [2018-09-19 12:39:25,018 INFO L226 Difference]: Without dead ends: 14520 [2018-09-19 12:39:25,036 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 314 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:39:25,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14520 states. [2018-09-19 12:39:25,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14520 to 14234. [2018-09-19 12:39:25,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14234 states. [2018-09-19 12:39:25,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14234 states to 14234 states and 18516 transitions. [2018-09-19 12:39:25,281 INFO L78 Accepts]: Start accepts. Automaton has 14234 states and 18516 transitions. Word has length 307 [2018-09-19 12:39:25,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:39:25,281 INFO L480 AbstractCegarLoop]: Abstraction has 14234 states and 18516 transitions. [2018-09-19 12:39:25,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:39:25,282 INFO L276 IsEmpty]: Start isEmpty. Operand 14234 states and 18516 transitions. [2018-09-19 12:39:25,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-09-19 12:39:25,305 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:39:25,306 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-09-19 12:39:25,306 INFO L423 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:39:25,306 INFO L82 PathProgramCache]: Analyzing trace with hash 992985308, now seen corresponding path program 1 times [2018-09-19 12:39:25,307 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:39:25,307 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 315 with the following transitions: [2018-09-19 12:39:25,307 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:39:25,309 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:39:25,309 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:39:25,351 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:39:25,544 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:39:25,544 INFO L272 AbstractInterpreter]: Visited 104 different actions 510 times. Merged at 8 different actions 34 times. Never widened. Found 8 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:39:25,578 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:39:25,865 INFO L232 lantSequenceWeakener]: Weakened 311 states. On average, predicates are now at 73.41% of their original sizes. [2018-09-19 12:39:25,865 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:39:25,984 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:39:25,985 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:39:25,985 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:39:25,985 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:39:25,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:39:25,986 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:39:25,986 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:39:25,986 INFO L87 Difference]: Start difference. First operand 14234 states and 18516 transitions. Second operand 10 states. [2018-09-19 12:39:28,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:39:28,727 INFO L93 Difference]: Finished difference Result 29317 states and 38295 transitions. [2018-09-19 12:39:28,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:39:28,729 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 314 [2018-09-19 12:39:28,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:39:28,763 INFO L225 Difference]: With dead ends: 29317 [2018-09-19 12:39:28,763 INFO L226 Difference]: Without dead ends: 15233 [2018-09-19 12:39:28,782 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 321 GetRequests, 305 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:39:28,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15233 states. [2018-09-19 12:39:29,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15233 to 15014. [2018-09-19 12:39:29,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15014 states. [2018-09-19 12:39:29,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15014 states to 15014 states and 19527 transitions. [2018-09-19 12:39:29,029 INFO L78 Accepts]: Start accepts. Automaton has 15014 states and 19527 transitions. Word has length 314 [2018-09-19 12:39:29,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:39:29,030 INFO L480 AbstractCegarLoop]: Abstraction has 15014 states and 19527 transitions. [2018-09-19 12:39:29,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:39:29,030 INFO L276 IsEmpty]: Start isEmpty. Operand 15014 states and 19527 transitions. [2018-09-19 12:39:29,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-09-19 12:39:29,050 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:39:29,050 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:39:29,050 INFO L423 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:39:29,050 INFO L82 PathProgramCache]: Analyzing trace with hash 255444755, now seen corresponding path program 1 times [2018-09-19 12:39:29,051 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:39:29,051 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 318 with the following transitions: [2018-09-19 12:39:29,051 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [546], [547], [551], [555], [559], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:39:29,053 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:39:29,053 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:39:29,099 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:39:35,070 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:39:35,070 INFO L272 AbstractInterpreter]: Visited 97 different actions 568 times. Merged at 8 different actions 41 times. Widened at 1 different actions 1 times. Found 9 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:39:35,080 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:39:36,839 INFO L232 lantSequenceWeakener]: Weakened 314 states. On average, predicates are now at 73.4% of their original sizes. [2018-09-19 12:39:36,839 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:39:36,999 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:39:37,000 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:39:37,000 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:39:37,000 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:39:37,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:39:37,000 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:39:37,000 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:39:37,001 INFO L87 Difference]: Start difference. First operand 15014 states and 19527 transitions. Second operand 10 states. [2018-09-19 12:39:42,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:39:42,478 INFO L93 Difference]: Finished difference Result 31248 states and 40901 transitions. [2018-09-19 12:39:42,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:39:42,478 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 317 [2018-09-19 12:39:42,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:39:42,510 INFO L225 Difference]: With dead ends: 31248 [2018-09-19 12:39:42,510 INFO L226 Difference]: Without dead ends: 16384 [2018-09-19 12:39:42,530 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 324 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 12:39:42,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16384 states. [2018-09-19 12:39:42,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16384 to 16100. [2018-09-19 12:39:42,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16100 states. [2018-09-19 12:39:42,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16100 states to 16100 states and 21070 transitions. [2018-09-19 12:39:42,786 INFO L78 Accepts]: Start accepts. Automaton has 16100 states and 21070 transitions. Word has length 317 [2018-09-19 12:39:42,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:39:42,786 INFO L480 AbstractCegarLoop]: Abstraction has 16100 states and 21070 transitions. [2018-09-19 12:39:42,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:39:42,787 INFO L276 IsEmpty]: Start isEmpty. Operand 16100 states and 21070 transitions. [2018-09-19 12:39:42,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-09-19 12:39:42,804 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:39:42,805 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 12:39:42,805 INFO L423 AbstractCegarLoop]: === Iteration 20 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:39:42,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1930686283, now seen corresponding path program 1 times [2018-09-19 12:39:42,806 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:39:42,806 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 322 with the following transitions: [2018-09-19 12:39:42,806 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [562], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:39:42,808 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:39:42,808 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:39:42,852 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:39:49,469 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:39:49,469 INFO L272 AbstractInterpreter]: Visited 97 different actions 664 times. Merged at 8 different actions 51 times. Widened at 1 different actions 2 times. Found 11 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:39:49,475 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:39:51,487 INFO L232 lantSequenceWeakener]: Weakened 318 states. On average, predicates are now at 73.4% of their original sizes. [2018-09-19 12:39:51,487 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:39:51,634 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:39:51,634 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:39:51,634 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:39:51,635 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:39:51,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:39:51,635 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:39:51,635 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:39:51,636 INFO L87 Difference]: Start difference. First operand 16100 states and 21070 transitions. Second operand 10 states. [2018-09-19 12:39:55,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:39:55,303 INFO L93 Difference]: Finished difference Result 33283 states and 43657 transitions. [2018-09-19 12:39:55,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:39:55,304 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 321 [2018-09-19 12:39:55,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:39:55,340 INFO L225 Difference]: With dead ends: 33283 [2018-09-19 12:39:55,340 INFO L226 Difference]: Without dead ends: 17333 [2018-09-19 12:39:55,361 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 328 GetRequests, 312 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:39:55,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17333 states. [2018-09-19 12:39:55,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17333 to 17020. [2018-09-19 12:39:55,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17020 states. [2018-09-19 12:39:55,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17020 states to 17020 states and 22326 transitions. [2018-09-19 12:39:55,606 INFO L78 Accepts]: Start accepts. Automaton has 17020 states and 22326 transitions. Word has length 321 [2018-09-19 12:39:55,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:39:55,606 INFO L480 AbstractCegarLoop]: Abstraction has 17020 states and 22326 transitions. [2018-09-19 12:39:55,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:39:55,606 INFO L276 IsEmpty]: Start isEmpty. Operand 17020 states and 22326 transitions. [2018-09-19 12:39:55,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-09-19 12:39:55,617 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:39:55,617 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 12:39:55,618 INFO L423 AbstractCegarLoop]: === Iteration 21 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:39:55,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1960776168, now seen corresponding path program 1 times [2018-09-19 12:39:55,618 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:39:55,618 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 325 with the following transitions: [2018-09-19 12:39:55,619 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [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], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [782], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:39:55,621 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:39:55,622 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:39:55,692 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:39:55,940 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:39:55,940 INFO L272 AbstractInterpreter]: Visited 150 different actions 587 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 12:39:55,944 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:39:56,232 INFO L232 lantSequenceWeakener]: Weakened 321 states. On average, predicates are now at 73.36% of their original sizes. [2018-09-19 12:39:56,232 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:39:56,338 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:39:56,339 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:39:56,339 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:39:56,339 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:39:56,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:39:56,340 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:39:56,340 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:39:56,340 INFO L87 Difference]: Start difference. First operand 17020 states and 22326 transitions. Second operand 10 states. [2018-09-19 12:39:59,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:39:59,297 INFO L93 Difference]: Finished difference Result 35215 states and 46290 transitions. [2018-09-19 12:39:59,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:39:59,298 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 324 [2018-09-19 12:39:59,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:39:59,333 INFO L225 Difference]: With dead ends: 35215 [2018-09-19 12:39:59,333 INFO L226 Difference]: Without dead ends: 18345 [2018-09-19 12:39:59,356 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 331 GetRequests, 315 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:39:59,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18345 states. [2018-09-19 12:39:59,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18345 to 17954. [2018-09-19 12:39:59,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17954 states. [2018-09-19 12:39:59,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17954 states to 17954 states and 23579 transitions. [2018-09-19 12:39:59,629 INFO L78 Accepts]: Start accepts. Automaton has 17954 states and 23579 transitions. Word has length 324 [2018-09-19 12:39:59,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:39:59,629 INFO L480 AbstractCegarLoop]: Abstraction has 17954 states and 23579 transitions. [2018-09-19 12:39:59,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:39:59,629 INFO L276 IsEmpty]: Start isEmpty. Operand 17954 states and 23579 transitions. [2018-09-19 12:39:59,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-09-19 12:39:59,640 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:39:59,641 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:39:59,641 INFO L423 AbstractCegarLoop]: === Iteration 22 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:39:59,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1267792915, now seen corresponding path program 1 times [2018-09-19 12:39:59,641 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:39:59,641 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 330 with the following transitions: [2018-09-19 12:39:59,642 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:39:59,644 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:39:59,644 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:39:59,689 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:39:59,995 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:39:59,995 INFO L272 AbstractInterpreter]: Visited 119 different actions 704 times. Merged at 8 different actions 45 times. Widened at 1 different actions 1 times. Found 11 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:40:00,002 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:40:00,443 INFO L232 lantSequenceWeakener]: Weakened 326 states. On average, predicates are now at 73.38% of their original sizes. [2018-09-19 12:40:00,443 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:40:00,528 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:40:00,528 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:40:00,528 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:40:00,528 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:40:00,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:40:00,529 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:40:00,529 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:40:00,530 INFO L87 Difference]: Start difference. First operand 17954 states and 23579 transitions. Second operand 10 states. [2018-09-19 12:40:04,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:40:04,580 INFO L93 Difference]: Finished difference Result 37767 states and 49724 transitions. [2018-09-19 12:40:04,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:40:04,581 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 329 [2018-09-19 12:40:04,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:40:04,611 INFO L225 Difference]: With dead ends: 37767 [2018-09-19 12:40:04,611 INFO L226 Difference]: Without dead ends: 19963 [2018-09-19 12:40:04,628 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 336 GetRequests, 320 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:40:04,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19963 states. [2018-09-19 12:40:04,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19963 to 19520. [2018-09-19 12:40:04,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19520 states. [2018-09-19 12:40:04,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19520 states to 19520 states and 25686 transitions. [2018-09-19 12:40:04,869 INFO L78 Accepts]: Start accepts. Automaton has 19520 states and 25686 transitions. Word has length 329 [2018-09-19 12:40:04,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:40:04,869 INFO L480 AbstractCegarLoop]: Abstraction has 19520 states and 25686 transitions. [2018-09-19 12:40:04,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:40:04,870 INFO L276 IsEmpty]: Start isEmpty. Operand 19520 states and 25686 transitions. [2018-09-19 12:40:04,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2018-09-19 12:40:04,885 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:40:04,886 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:04,886 INFO L423 AbstractCegarLoop]: === Iteration 23 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:40:04,886 INFO L82 PathProgramCache]: Analyzing trace with hash -709822505, now seen corresponding path program 1 times [2018-09-19 12:40:04,886 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:40:04,887 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 344 with the following transitions: [2018-09-19 12:40:04,887 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [562], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:40:04,889 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:40:04,889 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:40:04,925 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:40:05,266 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 12:40:05,267 INFO L272 AbstractInterpreter]: Visited 119 different actions 819 times. Merged at 8 different actions 52 times. Widened at 1 different actions 2 times. Found 11 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:40:05,272 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 12:40:05,529 INFO L232 lantSequenceWeakener]: Weakened 340 states. On average, predicates are now at 73.35% of their original sizes. [2018-09-19 12:40:05,529 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 12:40:05,651 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 12:40:05,651 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 12:40:05,651 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 12:40:05,651 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 12:40:05,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 12:40:05,652 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 12:40:05,652 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 12:40:05,652 INFO L87 Difference]: Start difference. First operand 19520 states and 25686 transitions. Second operand 10 states. [2018-09-19 12:40:09,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 12:40:09,186 INFO L93 Difference]: Finished difference Result 40792 states and 53797 transitions. [2018-09-19 12:40:09,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 12:40:09,186 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 343 [2018-09-19 12:40:09,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 12:40:09,229 INFO L225 Difference]: With dead ends: 40792 [2018-09-19 12:40:09,229 INFO L226 Difference]: Without dead ends: 21422 [2018-09-19 12:40:09,251 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 350 GetRequests, 334 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:40:09,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21422 states. [2018-09-19 12:40:09,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21422 to 21074. [2018-09-19 12:40:09,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21074 states. [2018-09-19 12:40:09,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21074 states to 21074 states and 27733 transitions. [2018-09-19 12:40:09,514 INFO L78 Accepts]: Start accepts. Automaton has 21074 states and 27733 transitions. Word has length 343 [2018-09-19 12:40:09,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 12:40:09,514 INFO L480 AbstractCegarLoop]: Abstraction has 21074 states and 27733 transitions. [2018-09-19 12:40:09,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 12:40:09,514 INFO L276 IsEmpty]: Start isEmpty. Operand 21074 states and 27733 transitions. [2018-09-19 12:40:09,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-09-19 12:40:09,534 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 12:40:09,535 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-09-19 12:40:09,535 INFO L423 AbstractCegarLoop]: === Iteration 24 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 12:40:09,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1852339140, now seen corresponding path program 1 times [2018-09-19 12:40:09,535 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 12:40:09,535 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 345 with the following transitions: [2018-09-19 12:40:09,536 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [694], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 12:40:09,538 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-09-19 12:40:09,538 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 12:40:09,579 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 12:40:09,873 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-19 12:40:09,873 INFO L272 AbstractInterpreter]: Visited 130 different actions 636 times. Merged at 8 different actions 34 times. Never widened. Found 8 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 12:40:09,910 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 12:40:09,954 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 12:40:09,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 12:40:09 BoogieIcfgContainer [2018-09-19 12:40:09,955 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 12:40:09,956 INFO L168 Benchmark]: Toolchain (without parser) took 136700.67 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -168.5 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-09-19 12:40:09,957 INFO L168 Benchmark]: CDTParser took 0.20 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:40:09,958 INFO L168 Benchmark]: CACSL2BoogieTranslator took 769.73 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-19 12:40:09,959 INFO L168 Benchmark]: Boogie Procedure Inliner took 111.77 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-19 12:40:09,959 INFO L168 Benchmark]: Boogie Preprocessor took 252.76 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 756.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -849.5 MB). Peak memory consumption was 29.1 MB. Max. memory is 7.1 GB. [2018-09-19 12:40:09,960 INFO L168 Benchmark]: RCFGBuilder took 3423.69 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: 109.3 MB). Peak memory consumption was 109.3 MB. Max. memory is 7.1 GB. [2018-09-19 12:40:09,961 INFO L168 Benchmark]: TraceAbstraction took 132135.81 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 529.4 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2018-09-19 12:40:09,966 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 769.73 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 111.77 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 252.76 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 756.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -849.5 MB). Peak memory consumption was 29.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3423.69 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: 109.3 MB). Peak memory consumption was 109.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 132135.81 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 529.4 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 181]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L7] int inputC = 3; [L8] int inputD = 4; [L9] int inputE = 5; [L10] int inputF = 6; [L11] int inputB = 2; [L14] int a1 = 23; [L15] int a19 = 9; [L16] int a10 = 0; [L17] int a12 = 0; [L18] int a4 = 14; [L579] int output = -1; [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND TRUE (((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0)) [L255] a1 = (((a1 / 5) + 110755) + 220746) [L256] a10 = 1 [L257] a19 = 8 [L259] RET return -1; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND TRUE (((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0)) [L245] a1 = (((((a1 % 25)- -13) - 42605) / 5) - -8517) [L246] a10 = 3 [L248] RET return 26; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L425] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) [L430] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) [L436] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) [L442] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) [L448] COND TRUE ((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0))) [L449] a1 = ((((((a1 % 25)- -12) - 0) * 5) % 25)- -13) [L450] a10 = 3 [L451] a19 = 6 [L453] RET return -1; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND TRUE (((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6)) [L181] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNKNOWN Result, 132.0s OverallTime, 24 OverallIterations, 4 TraceHistogramMax, 78.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3940 SDtfs, 16528 SDslu, 8453 SDs, 0 SdLazy, 46458 SolverSat, 4773 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 62.5s Time, PredicateUnifierStatistics: 46 DeclaredPredicates, 5905 GetRequests, 5552 SyntacticMatches, 0 SemanticMatches, 353 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 876 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21074occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 30.9s AbstIntTime, 24 AbstIntIterations, 23 AbstIntStrong, 0.9969478526318014 AbsIntWeakeningRatio, 0.10642009769713887 AbsIntAvgWeakeningVarsNumRemoved, 21.815422191207258 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 3250 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: No data available, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label02_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_12-40-09-980.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label02_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INTCON-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_12-40-09-980.csv Received shutdown request...