java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label34_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 03:29:16,430 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 03:29:16,432 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 03:29:16,445 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 03:29:16,448 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 03:29:16,449 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 03:29:16,451 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 03:29:16,453 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 03:29:16,454 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 03:29:16,455 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 03:29:16,456 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 03:29:16,456 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 03:29:16,457 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 03:29:16,458 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 03:29:16,459 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 03:29:16,460 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 03:29:16,461 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 03:29:16,463 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 03:29:16,465 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 03:29:16,467 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 03:29:16,468 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 03:29:16,469 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 03:29:16,471 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 03:29:16,471 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 03:29:16,472 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 03:29:16,473 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 03:29:16,474 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 03:29:16,474 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 03:29:16,475 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 03:29:16,478 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 03:29:16,478 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 03:29:16,479 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 03:29:16,479 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 03:29:16,482 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 03:29:16,483 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 03:29:16,484 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 03:29:16,484 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf [2018-09-19 03:29:16,517 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 03:29:16,517 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 03:29:16,518 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 03:29:16,518 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 03:29:16,518 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 03:29:16,518 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 03:29:16,519 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 03:29:16,519 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-19 03:29:16,519 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 03:29:16,519 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 03:29:16,519 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 03:29:16,519 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-19 03:29:16,520 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 03:29:16,520 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 03:29:16,520 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 03:29:16,521 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 03:29:16,521 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 03:29:16,521 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 03:29:16,521 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 03:29:16,521 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 03:29:16,522 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 03:29:16,522 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 03:29:16,522 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 03:29:16,522 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 03:29:16,522 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 03:29:16,523 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 03:29:16,523 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 03:29:16,523 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 03:29:16,523 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 03:29:16,523 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 03:29:16,524 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 03:29:16,524 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 03:29:16,524 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 03:29:16,524 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 03:29:16,574 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 03:29:16,588 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 03:29:16,594 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 03:29:16,596 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 03:29:16,597 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 03:29:16,597 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label34_true-unreach-call.c [2018-09-19 03:29:16,930 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77f95ac47/aeb4db68257d4500a81d330ada9d1624/FLAGc2490d3b4 [2018-09-19 03:29:17,167 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 03:29:17,168 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label34_true-unreach-call.c [2018-09-19 03:29:17,183 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77f95ac47/aeb4db68257d4500a81d330ada9d1624/FLAGc2490d3b4 [2018-09-19 03:29:17,199 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77f95ac47/aeb4db68257d4500a81d330ada9d1624 [2018-09-19 03:29:17,210 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 03:29:17,213 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 03:29:17,215 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 03:29:17,215 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 03:29:17,226 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 03:29:17,227 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:29:17" (1/1) ... [2018-09-19 03:29:17,230 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17281938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:29:17, skipping insertion in model container [2018-09-19 03:29:17,231 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:29:17" (1/1) ... [2018-09-19 03:29:17,244 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 03:29:17,758 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 03:29:17,775 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 03:29:17,908 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 03:29:17,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:29:17 WrapperNode [2018-09-19 03:29:17,953 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 03:29:17,954 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 03:29:17,955 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 03:29:17,955 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 03:29:17,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:29:17" (1/1) ... [2018-09-19 03:29:17,994 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:29:17" (1/1) ... [2018-09-19 03:29:18,081 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 03:29:18,082 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 03:29:18,082 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 03:29:18,082 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 03:29:18,093 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:29:17" (1/1) ... [2018-09-19 03:29:18,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:29:17" (1/1) ... [2018-09-19 03:29:18,104 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:29:17" (1/1) ... [2018-09-19 03:29:18,105 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:29:17" (1/1) ... [2018-09-19 03:29:18,319 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:29:17" (1/1) ... [2018-09-19 03:29:18,331 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:29:17" (1/1) ... [2018-09-19 03:29:18,340 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:29:17" (1/1) ... [2018-09-19 03:29:18,353 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 03:29:18,354 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 03:29:18,354 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 03:29:18,355 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 03:29:18,356 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:29:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 03:29:18,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 03:29:18,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 03:29:18,428 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 03:29:18,428 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 03:29:18,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 03:29:18,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 03:29:18,429 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 03:29:18,429 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 03:29:21,386 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 03:29:21,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:29:21 BoogieIcfgContainer [2018-09-19 03:29:21,387 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 03:29:21,388 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 03:29:21,388 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 03:29:21,392 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 03:29:21,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 03:29:17" (1/3) ... [2018-09-19 03:29:21,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e2559d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:29:21, skipping insertion in model container [2018-09-19 03:29:21,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:29:17" (2/3) ... [2018-09-19 03:29:21,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e2559d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:29:21, skipping insertion in model container [2018-09-19 03:29:21,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:29:21" (3/3) ... [2018-09-19 03:29:21,396 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label34_true-unreach-call.c [2018-09-19 03:29:21,405 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 03:29:21,413 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 03:29:21,464 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 03:29:21,465 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 03:29:21,466 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 03:29:21,466 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 03:29:21,466 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 03:29:21,466 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 03:29:21,467 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 03:29:21,467 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 03:29:21,467 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 03:29:21,494 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-19 03:29:21,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-19 03:29:21,506 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:29:21,507 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 03:29:21,508 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:29:21,513 INFO L82 PathProgramCache]: Analyzing trace with hash 427988964, now seen corresponding path program 1 times [2018-09-19 03:29:21,516 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:29:21,516 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 71 with the following transitions: [2018-09-19 03:29:21,519 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [461], [463], [796], [800], [806], [810], [817], [818], [819], [821] [2018-09-19 03:29:21,578 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:29:21,579 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:29:23,337 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:29:23,339 INFO L272 AbstractInterpreter]: Visited 69 different actions 69 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-19 03:29:23,354 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:29:24,174 INFO L232 lantSequenceWeakener]: Weakened 68 states. On average, predicates are now at 76.12% of their original sizes. [2018-09-19 03:29:24,175 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:29:24,532 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:29:24,534 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:29:24,534 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 03:29:24,534 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:29:24,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 03:29:24,553 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 03:29:24,554 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 03:29:24,556 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 6 states. [2018-09-19 03:29:29,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:29:29,316 INFO L93 Difference]: Finished difference Result 576 states and 995 transitions. [2018-09-19 03:29:29,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 03:29:29,320 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-09-19 03:29:29,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:29:29,336 INFO L225 Difference]: With dead ends: 576 [2018-09-19 03:29:29,336 INFO L226 Difference]: Without dead ends: 358 [2018-09-19 03:29:29,342 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 69 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 03:29:29,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-09-19 03:29:29,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-09-19 03:29:29,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-19 03:29:29,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2018-09-19 03:29:29,417 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 70 [2018-09-19 03:29:29,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:29:29,418 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2018-09-19 03:29:29,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 03:29:29,418 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2018-09-19 03:29:29,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-09-19 03:29:29,428 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:29:29,429 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 03:29:29,429 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:29:29,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1761224749, now seen corresponding path program 1 times [2018-09-19 03:29:29,430 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:29:29,430 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 142 with the following transitions: [2018-09-19 03:29:29,431 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [461], [463], [466], [474], [482], [490], [495], [498], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:29:29,443 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:29:29,443 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:29:30,917 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:29:33,961 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:29:33,961 INFO L272 AbstractInterpreter]: Visited 78 different actions 221 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 03:29:33,974 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:29:34,966 INFO L232 lantSequenceWeakener]: Weakened 139 states. On average, predicates are now at 74.45% of their original sizes. [2018-09-19 03:29:34,967 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:29:35,496 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:29:35,497 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:29:35,497 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 03:29:35,497 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:29:35,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 03:29:35,498 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 03:29:35,499 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 03:29:35,499 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand 10 states. [2018-09-19 03:29:43,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:29:43,436 INFO L93 Difference]: Finished difference Result 717 states and 1132 transitions. [2018-09-19 03:29:43,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 03:29:43,440 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 141 [2018-09-19 03:29:43,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:29:43,445 INFO L225 Difference]: With dead ends: 717 [2018-09-19 03:29:43,445 INFO L226 Difference]: Without dead ends: 511 [2018-09-19 03:29:43,448 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 147 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 03:29:43,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-09-19 03:29:43,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 505. [2018-09-19 03:29:43,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2018-09-19 03:29:43,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 659 transitions. [2018-09-19 03:29:43,486 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 659 transitions. Word has length 141 [2018-09-19 03:29:43,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:29:43,487 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 659 transitions. [2018-09-19 03:29:43,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 03:29:43,487 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 659 transitions. [2018-09-19 03:29:43,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-09-19 03:29:43,491 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:29:43,492 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 03:29:43,492 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:29:43,492 INFO L82 PathProgramCache]: Analyzing trace with hash -831848424, now seen corresponding path program 1 times [2018-09-19 03:29:43,492 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:29:43,493 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 151 with the following transitions: [2018-09-19 03:29:43,493 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [461], [463], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:29:43,498 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:29:43,498 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:29:48,354 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:29:50,076 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:29:50,076 INFO L272 AbstractInterpreter]: Visited 87 different actions 248 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 03:29:50,101 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:29:51,225 INFO L232 lantSequenceWeakener]: Weakened 148 states. On average, predicates are now at 74.35% of their original sizes. [2018-09-19 03:29:51,225 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:29:51,866 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:29:51,866 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:29:51,866 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-19 03:29:51,866 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:29:51,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-19 03:29:51,867 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-19 03:29:51,867 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-09-19 03:29:51,868 INFO L87 Difference]: Start difference. First operand 505 states and 659 transitions. Second operand 13 states. [2018-09-19 03:30:02,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:30:02,595 INFO L93 Difference]: Finished difference Result 1333 states and 2076 transitions. [2018-09-19 03:30:02,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-19 03:30:02,596 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 150 [2018-09-19 03:30:02,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:30:02,603 INFO L225 Difference]: With dead ends: 1333 [2018-09-19 03:30:02,603 INFO L226 Difference]: Without dead ends: 978 [2018-09-19 03:30:02,606 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 164 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=164, Invalid=592, Unknown=0, NotChecked=0, Total=756 [2018-09-19 03:30:02,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2018-09-19 03:30:02,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 762. [2018-09-19 03:30:02,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2018-09-19 03:30:02,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 943 transitions. [2018-09-19 03:30:02,647 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 943 transitions. Word has length 150 [2018-09-19 03:30:02,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:30:02,648 INFO L480 AbstractCegarLoop]: Abstraction has 762 states and 943 transitions. [2018-09-19 03:30:02,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-19 03:30:02,648 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 943 transitions. [2018-09-19 03:30:02,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-09-19 03:30:02,652 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:30:02,653 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 03:30:02,653 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:30:02,653 INFO L82 PathProgramCache]: Analyzing trace with hash 209457808, now seen corresponding path program 1 times [2018-09-19 03:30:02,653 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:30:02,654 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 187 with the following transitions: [2018-09-19 03:30:02,654 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [461], [463], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:30:02,660 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:30:02,660 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:30:05,204 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:30:10,800 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:30:10,801 INFO L272 AbstractInterpreter]: Visited 123 different actions 356 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 03:30:10,805 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:30:11,897 INFO L232 lantSequenceWeakener]: Weakened 184 states. On average, predicates are now at 74.03% of their original sizes. [2018-09-19 03:30:11,898 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:30:12,290 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:30:12,290 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:30:12,290 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-19 03:30:12,290 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:30:12,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-19 03:30:12,291 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-19 03:30:12,292 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-09-19 03:30:12,293 INFO L87 Difference]: Start difference. First operand 762 states and 943 transitions. Second operand 12 states. [2018-09-19 03:30:21,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:30:21,896 INFO L93 Difference]: Finished difference Result 1677 states and 2200 transitions. [2018-09-19 03:30:21,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 03:30:21,897 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 186 [2018-09-19 03:30:21,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:30:21,903 INFO L225 Difference]: With dead ends: 1677 [2018-09-19 03:30:21,904 INFO L226 Difference]: Without dead ends: 1067 [2018-09-19 03:30:21,906 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 194 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2018-09-19 03:30:21,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2018-09-19 03:30:21,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1056. [2018-09-19 03:30:21,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1056 states. [2018-09-19 03:30:21,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1277 transitions. [2018-09-19 03:30:21,945 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1277 transitions. Word has length 186 [2018-09-19 03:30:21,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:30:21,946 INFO L480 AbstractCegarLoop]: Abstraction has 1056 states and 1277 transitions. [2018-09-19 03:30:21,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-19 03:30:21,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1277 transitions. [2018-09-19 03:30:21,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-09-19 03:30:21,950 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:30:21,950 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 03:30:21,950 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:30:21,950 INFO L82 PathProgramCache]: Analyzing trace with hash -621618349, now seen corresponding path program 1 times [2018-09-19 03:30:21,951 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:30:21,951 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 206 with the following transitions: [2018-09-19 03:30:21,951 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [461], [463], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [754], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:30:21,957 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:30:21,957 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:30:31,275 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:30:31,275 INFO L272 AbstractInterpreter]: Visited 142 different actions 413 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 03:30:31,280 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:30:32,503 INFO L232 lantSequenceWeakener]: Weakened 203 states. On average, predicates are now at 73.91% of their original sizes. [2018-09-19 03:30:32,504 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:30:32,885 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:30:32,886 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:30:32,886 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-19 03:30:32,886 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:30:32,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-19 03:30:32,887 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-19 03:30:32,887 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-09-19 03:30:32,887 INFO L87 Difference]: Start difference. First operand 1056 states and 1277 transitions. Second operand 12 states. [2018-09-19 03:30:40,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:30:40,467 INFO L93 Difference]: Finished difference Result 2268 states and 2879 transitions. [2018-09-19 03:30:40,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-19 03:30:40,467 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 205 [2018-09-19 03:30:40,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:30:40,474 INFO L225 Difference]: With dead ends: 2268 [2018-09-19 03:30:40,474 INFO L226 Difference]: Without dead ends: 1364 [2018-09-19 03:30:40,477 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 214 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2018-09-19 03:30:40,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2018-09-19 03:30:40,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1352. [2018-09-19 03:30:40,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-09-19 03:30:40,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1605 transitions. [2018-09-19 03:30:40,523 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1605 transitions. Word has length 205 [2018-09-19 03:30:40,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:30:40,524 INFO L480 AbstractCegarLoop]: Abstraction has 1352 states and 1605 transitions. [2018-09-19 03:30:40,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-19 03:30:40,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1605 transitions. [2018-09-19 03:30:40,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-09-19 03:30:40,528 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:30:40,528 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 03:30:40,528 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:30:40,528 INFO L82 PathProgramCache]: Analyzing trace with hash -267612977, now seen corresponding path program 1 times [2018-09-19 03:30:40,529 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:30:40,529 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 218 with the following transitions: [2018-09-19 03:30:40,529 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [461], [463], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [518], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:30:40,532 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:30:40,532 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:30:41,836 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:30:46,384 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:30:46,384 INFO L272 AbstractInterpreter]: Visited 84 different actions 323 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 03:30:46,388 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:30:47,655 INFO L232 lantSequenceWeakener]: Weakened 215 states. On average, predicates are now at 73.89% of their original sizes. [2018-09-19 03:30:47,655 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:30:47,934 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:30:47,934 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:30:47,934 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 03:30:47,934 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:30:47,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 03:30:47,935 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 03:30:47,935 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 03:30:47,936 INFO L87 Difference]: Start difference. First operand 1352 states and 1605 transitions. Second operand 10 states. [2018-09-19 03:30:52,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:30:52,546 INFO L93 Difference]: Finished difference Result 2719 states and 3368 transitions. [2018-09-19 03:30:52,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 03:30:52,548 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 217 [2018-09-19 03:30:52,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:30:52,560 INFO L225 Difference]: With dead ends: 2719 [2018-09-19 03:30:52,561 INFO L226 Difference]: Without dead ends: 1521 [2018-09-19 03:30:52,565 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 224 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 03:30:52,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2018-09-19 03:30:52,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1503. [2018-09-19 03:30:52,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2018-09-19 03:30:52,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1772 transitions. [2018-09-19 03:30:52,637 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1772 transitions. Word has length 217 [2018-09-19 03:30:52,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:30:52,638 INFO L480 AbstractCegarLoop]: Abstraction has 1503 states and 1772 transitions. [2018-09-19 03:30:52,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 03:30:52,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1772 transitions. [2018-09-19 03:30:52,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-09-19 03:30:52,643 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:30:52,643 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 03:30:52,643 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:30:52,644 INFO L82 PathProgramCache]: Analyzing trace with hash 743709424, now seen corresponding path program 1 times [2018-09-19 03:30:52,644 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:30:52,644 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 229 with the following transitions: [2018-09-19 03:30:52,644 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [461], [463], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:30:52,651 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:30:52,651 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:30:55,506 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:30:59,074 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:30:59,074 INFO L272 AbstractInterpreter]: Visited 88 different actions 341 times. Merged at 7 different actions 22 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 03:30:59,082 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:31:00,226 INFO L232 lantSequenceWeakener]: Weakened 226 states. On average, predicates are now at 73.83% of their original sizes. [2018-09-19 03:31:00,226 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:31:00,681 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:31:00,681 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:31:00,682 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-19 03:31:00,682 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:31:00,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-19 03:31:00,682 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-19 03:31:00,683 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-09-19 03:31:00,683 INFO L87 Difference]: Start difference. First operand 1503 states and 1772 transitions. Second operand 13 states. [2018-09-19 03:31:07,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:31:07,329 INFO L93 Difference]: Finished difference Result 3686 states and 4637 transitions. [2018-09-19 03:31:07,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 03:31:07,331 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 228 [2018-09-19 03:31:07,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:31:07,340 INFO L225 Difference]: With dead ends: 3686 [2018-09-19 03:31:07,341 INFO L226 Difference]: Without dead ends: 2337 [2018-09-19 03:31:07,346 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 240 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2018-09-19 03:31:07,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2018-09-19 03:31:07,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 2189. [2018-09-19 03:31:07,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2189 states. [2018-09-19 03:31:07,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2189 states to 2189 states and 2615 transitions. [2018-09-19 03:31:07,422 INFO L78 Accepts]: Start accepts. Automaton has 2189 states and 2615 transitions. Word has length 228 [2018-09-19 03:31:07,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:31:07,423 INFO L480 AbstractCegarLoop]: Abstraction has 2189 states and 2615 transitions. [2018-09-19 03:31:07,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-19 03:31:07,423 INFO L276 IsEmpty]: Start isEmpty. Operand 2189 states and 2615 transitions. [2018-09-19 03:31:07,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-09-19 03:31:07,429 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:31:07,429 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 03:31:07,430 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:31:07,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1894472260, now seen corresponding path program 1 times [2018-09-19 03:31:07,430 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:31:07,430 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 239 with the following transitions: [2018-09-19 03:31:07,431 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [461], [463], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:31:07,433 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:31:07,433 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:31:10,764 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:31:23,698 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:31:23,698 INFO L272 AbstractInterpreter]: Visited 96 different actions 555 times. Merged at 7 different actions 34 times. Widened at 1 different actions 1 times. Found 6 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 03:31:23,709 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:31:25,110 INFO L232 lantSequenceWeakener]: Weakened 236 states. On average, predicates are now at 73.78% of their original sizes. [2018-09-19 03:31:25,110 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:31:25,594 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:31:25,594 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:31:25,594 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-19 03:31:25,594 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:31:25,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-19 03:31:25,595 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-19 03:31:25,595 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-09-19 03:31:25,595 INFO L87 Difference]: Start difference. First operand 2189 states and 2615 transitions. Second operand 13 states. [2018-09-19 03:31:34,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:31:34,696 INFO L93 Difference]: Finished difference Result 5360 states and 6747 transitions. [2018-09-19 03:31:34,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 03:31:34,698 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 238 [2018-09-19 03:31:34,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:31:34,711 INFO L225 Difference]: With dead ends: 5360 [2018-09-19 03:31:34,712 INFO L226 Difference]: Without dead ends: 3325 [2018-09-19 03:31:34,718 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 250 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2018-09-19 03:31:34,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3325 states. [2018-09-19 03:31:34,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3325 to 3019. [2018-09-19 03:31:34,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3019 states. [2018-09-19 03:31:34,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3019 states to 3019 states and 3715 transitions. [2018-09-19 03:31:34,834 INFO L78 Accepts]: Start accepts. Automaton has 3019 states and 3715 transitions. Word has length 238 [2018-09-19 03:31:34,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:31:34,837 INFO L480 AbstractCegarLoop]: Abstraction has 3019 states and 3715 transitions. [2018-09-19 03:31:34,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-19 03:31:34,837 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 3715 transitions. [2018-09-19 03:31:34,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-09-19 03:31:34,844 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:31:34,844 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 03:31:34,844 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:31:34,845 INFO L82 PathProgramCache]: Analyzing trace with hash -752200176, now seen corresponding path program 1 times [2018-09-19 03:31:34,845 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:31:34,845 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 255 with the following transitions: [2018-09-19 03:31:34,845 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [461], [463], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:31:34,848 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:31:34,848 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:31:36,031 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:31:44,772 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:31:44,772 INFO L272 AbstractInterpreter]: Visited 121 different actions 471 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 03:31:44,780 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:31:46,163 INFO L232 lantSequenceWeakener]: Weakened 252 states. On average, predicates are now at 73.72% of their original sizes. [2018-09-19 03:31:46,164 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:31:46,656 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:31:46,657 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:31:46,657 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-19 03:31:46,657 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:31:46,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-19 03:31:46,658 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-19 03:31:46,658 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-09-19 03:31:46,658 INFO L87 Difference]: Start difference. First operand 3019 states and 3715 transitions. Second operand 13 states. [2018-09-19 03:31:54,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:31:54,182 INFO L93 Difference]: Finished difference Result 6300 states and 8063 transitions. [2018-09-19 03:31:54,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 03:31:54,182 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 254 [2018-09-19 03:31:54,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:31:54,194 INFO L225 Difference]: With dead ends: 6300 [2018-09-19 03:31:54,194 INFO L226 Difference]: Without dead ends: 3435 [2018-09-19 03:31:54,201 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 266 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2018-09-19 03:31:54,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3435 states. [2018-09-19 03:31:54,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3435 to 3305. [2018-09-19 03:31:54,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3305 states. [2018-09-19 03:31:54,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3305 states to 3305 states and 4062 transitions. [2018-09-19 03:31:54,300 INFO L78 Accepts]: Start accepts. Automaton has 3305 states and 4062 transitions. Word has length 254 [2018-09-19 03:31:54,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:31:54,300 INFO L480 AbstractCegarLoop]: Abstraction has 3305 states and 4062 transitions. [2018-09-19 03:31:54,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-19 03:31:54,301 INFO L276 IsEmpty]: Start isEmpty. Operand 3305 states and 4062 transitions. [2018-09-19 03:31:54,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-09-19 03:31:54,306 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:31:54,307 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 03:31:54,307 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:31:54,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1829582141, now seen corresponding path program 1 times [2018-09-19 03:31:54,307 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:31:54,308 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 260 with the following transitions: [2018-09-19 03:31:54,308 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [461], [463], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:31:54,311 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:31:54,311 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:31:56,955 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:32:07,625 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:32:07,625 INFO L272 AbstractInterpreter]: Visited 124 different actions 603 times. Merged at 7 different actions 27 times. Never widened. Found 5 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 03:32:07,633 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:32:09,015 INFO L232 lantSequenceWeakener]: Weakened 257 states. On average, predicates are now at 73.7% of their original sizes. [2018-09-19 03:32:09,016 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:32:09,321 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:32:09,322 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:32:09,322 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 03:32:09,322 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:32:09,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 03:32:09,323 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 03:32:09,323 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 03:32:09,323 INFO L87 Difference]: Start difference. First operand 3305 states and 4062 transitions. Second operand 10 states. [2018-09-19 03:32:16,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:32:16,077 INFO L93 Difference]: Finished difference Result 6634 states and 8307 transitions. [2018-09-19 03:32:16,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 03:32:16,078 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 259 [2018-09-19 03:32:16,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:32:16,090 INFO L225 Difference]: With dead ends: 6634 [2018-09-19 03:32:16,091 INFO L226 Difference]: Without dead ends: 3483 [2018-09-19 03:32:16,097 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 266 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 03:32:16,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3483 states. [2018-09-19 03:32:16,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3483 to 3457. [2018-09-19 03:32:16,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3457 states. [2018-09-19 03:32:16,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3457 states to 3457 states and 4260 transitions. [2018-09-19 03:32:16,209 INFO L78 Accepts]: Start accepts. Automaton has 3457 states and 4260 transitions. Word has length 259 [2018-09-19 03:32:16,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:32:16,210 INFO L480 AbstractCegarLoop]: Abstraction has 3457 states and 4260 transitions. [2018-09-19 03:32:16,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 03:32:16,210 INFO L276 IsEmpty]: Start isEmpty. Operand 3457 states and 4260 transitions. [2018-09-19 03:32:16,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-09-19 03:32:16,216 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:32:16,217 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 03:32:16,217 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:32:16,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1362669744, now seen corresponding path program 1 times [2018-09-19 03:32:16,217 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:32:16,218 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 261 with the following transitions: [2018-09-19 03:32:16,218 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [461], [463], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:32:16,221 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:32:16,221 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:32:20,273 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:32:31,602 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:32:31,602 INFO L272 AbstractInterpreter]: Visited 118 different actions 687 times. Merged at 7 different actions 34 times. Widened at 1 different actions 1 times. Found 6 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 03:32:31,611 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:32:33,373 INFO L232 lantSequenceWeakener]: Weakened 258 states. On average, predicates are now at 73.69% of their original sizes. [2018-09-19 03:32:33,373 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:32:34,043 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:32:34,043 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:32:34,043 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-19 03:32:34,043 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:32:34,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-19 03:32:34,044 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-19 03:32:34,044 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-09-19 03:32:34,044 INFO L87 Difference]: Start difference. First operand 3457 states and 4260 transitions. Second operand 13 states. [2018-09-19 03:32:41,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:32:41,823 INFO L93 Difference]: Finished difference Result 8601 states and 11011 transitions. [2018-09-19 03:32:41,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 03:32:41,823 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 260 [2018-09-19 03:32:41,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:32:41,842 INFO L225 Difference]: With dead ends: 8601 [2018-09-19 03:32:41,843 INFO L226 Difference]: Without dead ends: 5298 [2018-09-19 03:32:41,850 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 272 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2018-09-19 03:32:41,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5298 states. [2018-09-19 03:32:41,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5298 to 4845. [2018-09-19 03:32:41,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4845 states. [2018-09-19 03:32:41,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4845 states to 4845 states and 6065 transitions. [2018-09-19 03:32:41,988 INFO L78 Accepts]: Start accepts. Automaton has 4845 states and 6065 transitions. Word has length 260 [2018-09-19 03:32:41,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:32:41,989 INFO L480 AbstractCegarLoop]: Abstraction has 4845 states and 6065 transitions. [2018-09-19 03:32:41,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-19 03:32:41,989 INFO L276 IsEmpty]: Start isEmpty. Operand 4845 states and 6065 transitions. [2018-09-19 03:32:41,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-09-19 03:32:41,997 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:32:41,997 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 03:32:41,997 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:32:41,998 INFO L82 PathProgramCache]: Analyzing trace with hash 143442464, now seen corresponding path program 1 times [2018-09-19 03:32:41,998 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:32:41,998 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 269 with the following transitions: [2018-09-19 03:32:41,998 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [461], [463], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [542], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:32:42,002 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:32:42,002 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:32:44,502 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:32:58,658 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:32:58,658 INFO L272 AbstractInterpreter]: Visited 124 different actions 723 times. Merged at 7 different actions 34 times. Widened at 1 different actions 1 times. Found 6 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 03:32:58,666 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:33:00,081 INFO L232 lantSequenceWeakener]: Weakened 266 states. On average, predicates are now at 73.66% of their original sizes. [2018-09-19 03:33:00,081 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:33:00,433 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:33:00,434 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:33:00,434 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-19 03:33:00,434 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:33:00,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-19 03:33:00,435 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-19 03:33:00,435 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-09-19 03:33:00,435 INFO L87 Difference]: Start difference. First operand 4845 states and 6065 transitions. Second operand 11 states. [2018-09-19 03:33:05,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:33:05,479 INFO L93 Difference]: Finished difference Result 9755 states and 12399 transitions. [2018-09-19 03:33:05,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 03:33:05,480 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 268 [2018-09-19 03:33:05,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:33:05,502 INFO L225 Difference]: With dead ends: 9755 [2018-09-19 03:33:05,502 INFO L226 Difference]: Without dead ends: 5064 [2018-09-19 03:33:05,518 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 276 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2018-09-19 03:33:05,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5064 states. [2018-09-19 03:33:05,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5064 to 5004. [2018-09-19 03:33:05,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5004 states. [2018-09-19 03:33:05,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5004 states to 5004 states and 6279 transitions. [2018-09-19 03:33:05,668 INFO L78 Accepts]: Start accepts. Automaton has 5004 states and 6279 transitions. Word has length 268 [2018-09-19 03:33:05,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:33:05,669 INFO L480 AbstractCegarLoop]: Abstraction has 5004 states and 6279 transitions. [2018-09-19 03:33:05,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-19 03:33:05,669 INFO L276 IsEmpty]: Start isEmpty. Operand 5004 states and 6279 transitions. [2018-09-19 03:33:05,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-09-19 03:33:05,678 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:33:05,679 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 03:33:05,679 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:33:05,679 INFO L82 PathProgramCache]: Analyzing trace with hash 857658727, now seen corresponding path program 1 times [2018-09-19 03:33:05,679 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:33:05,680 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 290 with the following transitions: [2018-09-19 03:33:05,680 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [461], [463], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [626], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 03:33:05,685 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:33:05,686 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:33:08,255 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 03:33:22,312 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 03:33:22,312 INFO L272 AbstractInterpreter]: Visited 124 different actions 723 times. Merged at 7 different actions 34 times. Widened at 1 different actions 1 times. Found 6 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 03:33:22,317 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 03:33:23,786 INFO L232 lantSequenceWeakener]: Weakened 287 states. On average, predicates are now at 73.59% of their original sizes. [2018-09-19 03:33:23,787 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 03:33:24,098 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 03:33:24,099 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 03:33:24,099 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 03:33:24,099 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 03:33:24,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 03:33:24,100 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 03:33:24,100 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 03:33:24,100 INFO L87 Difference]: Start difference. First operand 5004 states and 6279 transitions. Second operand 10 states. [2018-09-19 03:33:29,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 03:33:29,139 INFO L93 Difference]: Finished difference Result 10208 states and 12992 transitions. [2018-09-19 03:33:29,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 03:33:29,139 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 289 [2018-09-19 03:33:29,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 03:33:29,153 INFO L225 Difference]: With dead ends: 10208 [2018-09-19 03:33:29,154 INFO L226 Difference]: Without dead ends: 5358 [2018-09-19 03:33:29,163 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 296 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 03:33:29,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5358 states. [2018-09-19 03:33:29,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5358 to 5314. [2018-09-19 03:33:29,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5314 states. [2018-09-19 03:33:29,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5314 states to 5314 states and 6691 transitions. [2018-09-19 03:33:29,303 INFO L78 Accepts]: Start accepts. Automaton has 5314 states and 6691 transitions. Word has length 289 [2018-09-19 03:33:29,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 03:33:29,304 INFO L480 AbstractCegarLoop]: Abstraction has 5314 states and 6691 transitions. [2018-09-19 03:33:29,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 03:33:29,304 INFO L276 IsEmpty]: Start isEmpty. Operand 5314 states and 6691 transitions. [2018-09-19 03:33:29,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-09-19 03:33:29,314 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 03:33:29,314 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, 4, 4, 4, 4, 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 03:33:29,314 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 03:33:29,314 INFO L82 PathProgramCache]: Analyzing trace with hash -129946013, now seen corresponding path program 1 times [2018-09-19 03:33:29,315 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 03:33:29,315 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 302 with the following transitions: [2018-09-19 03:33:29,315 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [461], [463], [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 03:33:29,317 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 03:33:29,317 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 03:33:32,452 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. Received shutdown request... [2018-09-19 03:33:32,736 WARN L572 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-09-19 03:33:32,737 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-09-19 03:33:32,738 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 03:33:32,803 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 03:33:32,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 03:33:32 BoogieIcfgContainer [2018-09-19 03:33:32,803 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 03:33:32,804 INFO L168 Benchmark]: Toolchain (without parser) took 255593.61 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -286.9 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-19 03:33:32,807 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 03:33:32,808 INFO L168 Benchmark]: CACSL2BoogieTranslator took 739.10 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-19 03:33:32,810 INFO L168 Benchmark]: Boogie Procedure Inliner took 126.88 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-19 03:33:32,812 INFO L168 Benchmark]: Boogie Preprocessor took 272.11 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 781.7 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -872.1 MB). Peak memory consumption was 30.1 MB. Max. memory is 7.1 GB. [2018-09-19 03:33:32,813 INFO L168 Benchmark]: RCFGBuilder took 3032.50 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 99.1 MB). Peak memory consumption was 99.1 MB. Max. memory is 7.1 GB. [2018-09-19 03:33:32,815 INFO L168 Benchmark]: TraceAbstraction took 251415.51 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 433.3 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-19 03:33:32,822 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.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 739.10 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 126.88 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 272.11 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 781.7 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -872.1 MB). Peak memory consumption was 30.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3032.50 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 99.1 MB). Peak memory consumption was 99.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 251415.51 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 433.3 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 193]: 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 TRUE ((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14))))) [L222] a19 = 10 [L224] RET return 25; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL 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 TRUE (((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7)) [L193] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNKNOWN Result, 251.3s OverallTime, 14 OverallIterations, 4 TraceHistogramMax, 93.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2552 SDtfs, 13037 SDslu, 4352 SDs, 0 SdLazy, 25590 SolverSat, 3034 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 80.2s Time, PredicateUnifierStatistics: 26 DeclaredPredicates, 2878 GetRequests, 2632 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 985 ImplicationChecksByTransitivity, 9.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5314occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 134.4s AbstIntTime, 14 AbstIntIterations, 13 AbstIntStrong, 0.994983167110949 AbsIntWeakeningRatio, 0.10973837209302326 AbsIntAvgWeakeningVarsNumRemoved, 896.3088662790698 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 1432 StatesRemovedByMinimization, 13 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_label34_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_03-33-32-859.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label34_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_03-33-32-859.csv Completed graceful shutdown