/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem11_label50.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 21:06:44,009 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 21:06:44,011 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 21:06:44,030 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 21:06:44,031 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 21:06:44,032 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 21:06:44,034 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 21:06:44,043 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 21:06:44,047 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 21:06:44,050 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 21:06:44,052 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 21:06:44,053 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 21:06:44,054 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 21:06:44,055 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 21:06:44,058 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 21:06:44,059 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 21:06:44,061 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 21:06:44,061 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 21:06:44,063 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 21:06:44,067 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 21:06:44,071 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 21:06:44,076 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 21:06:44,077 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 21:06:44,077 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 21:06:44,080 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 21:06:44,080 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 21:06:44,081 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 21:06:44,082 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 21:06:44,083 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 21:06:44,084 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 21:06:44,085 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 21:06:44,086 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 21:06:44,087 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 21:06:44,088 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 21:06:44,089 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 21:06:44,089 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 21:06:44,090 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 21:06:44,090 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 21:06:44,090 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 21:06:44,091 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 21:06:44,092 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 21:06:44,093 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 21:06:44,115 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 21:06:44,115 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 21:06:44,116 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 21:06:44,121 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 21:06:44,121 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 21:06:44,122 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 21:06:44,122 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 21:06:44,122 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 21:06:44,122 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 21:06:44,122 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 21:06:44,123 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 21:06:44,123 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 21:06:44,123 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 21:06:44,123 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 21:06:44,123 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 21:06:44,123 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 21:06:44,124 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 21:06:44,124 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 21:06:44,124 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 21:06:44,124 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 21:06:44,124 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 21:06:44,125 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 21:06:44,125 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 21:06:44,125 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 21:06:44,125 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 21:06:44,126 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 21:06:44,126 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 21:06:44,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 21:06:44,126 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 21:06:44,126 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 21:06:44,388 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 21:06:44,409 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 21:06:44,414 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 21:06:44,416 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 21:06:44,416 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 21:06:44,417 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label50.c [2019-11-23 21:06:44,490 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9b913d25/b42535a56e904ca4889b5368c23e0089/FLAG604703ed8 [2019-11-23 21:06:45,140 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 21:06:45,141 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label50.c [2019-11-23 21:06:45,156 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9b913d25/b42535a56e904ca4889b5368c23e0089/FLAG604703ed8 [2019-11-23 21:06:45,342 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9b913d25/b42535a56e904ca4889b5368c23e0089 [2019-11-23 21:06:45,350 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 21:06:45,352 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 21:06:45,353 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 21:06:45,353 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 21:06:45,357 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 21:06:45,358 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:06:45" (1/1) ... [2019-11-23 21:06:45,361 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5088ba2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:06:45, skipping insertion in model container [2019-11-23 21:06:45,361 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:06:45" (1/1) ... [2019-11-23 21:06:45,369 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 21:06:45,426 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 21:06:46,027 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:06:46,032 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 21:06:46,296 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:06:46,321 INFO L208 MainTranslator]: Completed translation [2019-11-23 21:06:46,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:06:46 WrapperNode [2019-11-23 21:06:46,322 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 21:06:46,323 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 21:06:46,323 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 21:06:46,323 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 21:06:46,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:06:46" (1/1) ... [2019-11-23 21:06:46,388 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:06:46" (1/1) ... [2019-11-23 21:06:46,561 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 21:06:46,562 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 21:06:46,562 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 21:06:46,563 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 21:06:46,578 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:06:46" (1/1) ... [2019-11-23 21:06:46,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:06:46" (1/1) ... [2019-11-23 21:06:46,593 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:06:46" (1/1) ... [2019-11-23 21:06:46,593 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:06:46" (1/1) ... [2019-11-23 21:06:46,653 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:06:46" (1/1) ... [2019-11-23 21:06:46,681 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:06:46" (1/1) ... [2019-11-23 21:06:46,702 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:06:46" (1/1) ... [2019-11-23 21:06:46,721 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 21:06:46,722 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 21:06:46,723 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 21:06:46,723 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 21:06:46,724 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:06:46" (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 [2019-11-23 21:06:46,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 21:06:46,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 21:06:48,653 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 21:06:48,653 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 21:06:48,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:06:48 BoogieIcfgContainer [2019-11-23 21:06:48,655 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 21:06:48,659 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 21:06:48,660 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 21:06:48,664 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 21:06:48,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:06:45" (1/3) ... [2019-11-23 21:06:48,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cf67035 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:06:48, skipping insertion in model container [2019-11-23 21:06:48,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:06:46" (2/3) ... [2019-11-23 21:06:48,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cf67035 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:06:48, skipping insertion in model container [2019-11-23 21:06:48,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:06:48" (3/3) ... [2019-11-23 21:06:48,671 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label50.c [2019-11-23 21:06:48,682 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 21:06:48,693 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 21:06:48,706 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 21:06:48,753 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 21:06:48,753 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 21:06:48,753 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 21:06:48,753 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 21:06:48,753 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 21:06:48,754 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 21:06:48,754 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 21:06:48,755 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 21:06:48,787 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2019-11-23 21:06:48,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-23 21:06:48,794 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:06:48,795 INFO L410 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] [2019-11-23 21:06:48,796 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:06:48,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:06:48,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1318097310, now seen corresponding path program 1 times [2019-11-23 21:06:48,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:06:48,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654312223] [2019-11-23 21:06:48,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:06:48,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:06:49,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:06:49,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654312223] [2019-11-23 21:06:49,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:06:49,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:06:49,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205614404] [2019-11-23 21:06:49,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:06:49,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:06:49,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:06:49,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:06:49,120 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 4 states. [2019-11-23 21:06:51,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:06:51,359 INFO L93 Difference]: Finished difference Result 973 states and 1743 transitions. [2019-11-23 21:06:51,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:06:51,361 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-11-23 21:06:51,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:06:51,383 INFO L225 Difference]: With dead ends: 973 [2019-11-23 21:06:51,384 INFO L226 Difference]: Without dead ends: 607 [2019-11-23 21:06:51,389 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:06:51,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-11-23 21:06:51,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 604. [2019-11-23 21:06:51,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-11-23 21:06:51,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 874 transitions. [2019-11-23 21:06:51,480 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 874 transitions. Word has length 36 [2019-11-23 21:06:51,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:06:51,480 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 874 transitions. [2019-11-23 21:06:51,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:06:51,481 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 874 transitions. [2019-11-23 21:06:51,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-23 21:06:51,488 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:06:51,489 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:06:51,490 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:06:51,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:06:51,490 INFO L82 PathProgramCache]: Analyzing trace with hash -464053414, now seen corresponding path program 1 times [2019-11-23 21:06:51,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:06:51,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144550182] [2019-11-23 21:06:51,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:06:51,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:06:51,755 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:06:51,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144550182] [2019-11-23 21:06:51,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:06:51,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:06:51,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010854725] [2019-11-23 21:06:51,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:06:51,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:06:51,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:06:51,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:06:51,761 INFO L87 Difference]: Start difference. First operand 604 states and 874 transitions. Second operand 4 states. [2019-11-23 21:06:53,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:06:53,609 INFO L93 Difference]: Finished difference Result 2328 states and 3390 transitions. [2019-11-23 21:06:53,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:06:53,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-11-23 21:06:53,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:06:53,620 INFO L225 Difference]: With dead ends: 2328 [2019-11-23 21:06:53,620 INFO L226 Difference]: Without dead ends: 1726 [2019-11-23 21:06:53,623 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:06:53,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2019-11-23 21:06:53,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1710. [2019-11-23 21:06:53,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1710 states. [2019-11-23 21:06:53,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 2342 transitions. [2019-11-23 21:06:53,696 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 2342 transitions. Word has length 104 [2019-11-23 21:06:53,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:06:53,697 INFO L462 AbstractCegarLoop]: Abstraction has 1710 states and 2342 transitions. [2019-11-23 21:06:53,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:06:53,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 2342 transitions. [2019-11-23 21:06:53,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-23 21:06:53,700 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:06:53,700 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:06:53,701 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:06:53,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:06:53,701 INFO L82 PathProgramCache]: Analyzing trace with hash 898348729, now seen corresponding path program 1 times [2019-11-23 21:06:53,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:06:53,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551146147] [2019-11-23 21:06:53,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:06:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:06:53,851 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:06:53,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551146147] [2019-11-23 21:06:53,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:06:53,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 21:06:53,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054626236] [2019-11-23 21:06:53,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:06:53,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:06:53,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:06:53,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:06:53,854 INFO L87 Difference]: Start difference. First operand 1710 states and 2342 transitions. Second operand 3 states. [2019-11-23 21:06:54,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:06:54,791 INFO L93 Difference]: Finished difference Result 4707 states and 6454 transitions. [2019-11-23 21:06:54,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:06:54,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-11-23 21:06:54,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:06:54,811 INFO L225 Difference]: With dead ends: 4707 [2019-11-23 21:06:54,812 INFO L226 Difference]: Without dead ends: 2999 [2019-11-23 21:06:54,815 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:06:54,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2999 states. [2019-11-23 21:06:54,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2999 to 2999. [2019-11-23 21:06:54,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2999 states. [2019-11-23 21:06:54,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2999 states and 3735 transitions. [2019-11-23 21:06:54,886 INFO L78 Accepts]: Start accepts. Automaton has 2999 states and 3735 transitions. Word has length 130 [2019-11-23 21:06:54,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:06:54,887 INFO L462 AbstractCegarLoop]: Abstraction has 2999 states and 3735 transitions. [2019-11-23 21:06:54,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:06:54,895 INFO L276 IsEmpty]: Start isEmpty. Operand 2999 states and 3735 transitions. [2019-11-23 21:06:54,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-23 21:06:54,899 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:06:54,899 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:06:54,899 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:06:54,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:06:54,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1163752101, now seen corresponding path program 1 times [2019-11-23 21:06:54,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:06:54,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623531804] [2019-11-23 21:06:54,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:06:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:06:55,204 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-23 21:06:55,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623531804] [2019-11-23 21:06:55,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199514384] [2019-11-23 21:06:55,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:06:55,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:06:55,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 21:06:55,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:06:55,376 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:06:55,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:06:55,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-11-23 21:06:55,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008458910] [2019-11-23 21:06:55,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:06:55,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:06:55,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:06:55,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:06:55,381 INFO L87 Difference]: Start difference. First operand 2999 states and 3735 transitions. Second operand 3 states. [2019-11-23 21:06:56,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:06:56,302 INFO L93 Difference]: Finished difference Result 7652 states and 9361 transitions. [2019-11-23 21:06:56,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:06:56,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-23 21:06:56,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:06:56,328 INFO L225 Difference]: With dead ends: 7652 [2019-11-23 21:06:56,329 INFO L226 Difference]: Without dead ends: 4655 [2019-11-23 21:06:56,333 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:06:56,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4655 states. [2019-11-23 21:06:56,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4655 to 3550. [2019-11-23 21:06:56,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3550 states. [2019-11-23 21:06:56,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3550 states to 3550 states and 4399 transitions. [2019-11-23 21:06:56,566 INFO L78 Accepts]: Start accepts. Automaton has 3550 states and 4399 transitions. Word has length 158 [2019-11-23 21:06:56,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:06:56,569 INFO L462 AbstractCegarLoop]: Abstraction has 3550 states and 4399 transitions. [2019-11-23 21:06:56,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:06:56,569 INFO L276 IsEmpty]: Start isEmpty. Operand 3550 states and 4399 transitions. [2019-11-23 21:06:56,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-23 21:06:56,573 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:06:56,574 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:06:56,779 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:06:56,779 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:06:56,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:06:56,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1754552329, now seen corresponding path program 1 times [2019-11-23 21:06:56,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:06:56,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968450868] [2019-11-23 21:06:56,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:06:56,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:06:56,956 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:06:56,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968450868] [2019-11-23 21:06:56,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:06:56,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:06:56,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746909765] [2019-11-23 21:06:56,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:06:56,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:06:56,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:06:56,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:06:56,959 INFO L87 Difference]: Start difference. First operand 3550 states and 4399 transitions. Second operand 4 states. [2019-11-23 21:06:58,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:06:58,646 INFO L93 Difference]: Finished difference Result 8407 states and 10478 transitions. [2019-11-23 21:06:58,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:06:58,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-11-23 21:06:58,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:06:58,673 INFO L225 Difference]: With dead ends: 8407 [2019-11-23 21:06:58,674 INFO L226 Difference]: Without dead ends: 4859 [2019-11-23 21:06:58,678 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:06:58,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4859 states. [2019-11-23 21:06:58,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4859 to 4102. [2019-11-23 21:06:58,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4102 states. [2019-11-23 21:06:58,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4102 states to 4102 states and 5013 transitions. [2019-11-23 21:06:58,756 INFO L78 Accepts]: Start accepts. Automaton has 4102 states and 5013 transitions. Word has length 163 [2019-11-23 21:06:58,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:06:58,756 INFO L462 AbstractCegarLoop]: Abstraction has 4102 states and 5013 transitions. [2019-11-23 21:06:58,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:06:58,757 INFO L276 IsEmpty]: Start isEmpty. Operand 4102 states and 5013 transitions. [2019-11-23 21:06:58,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-11-23 21:06:58,761 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:06:58,761 INFO L410 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 21:06:58,762 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:06:58,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:06:58,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1310756102, now seen corresponding path program 1 times [2019-11-23 21:06:58,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:06:58,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608964493] [2019-11-23 21:06:58,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:06:58,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:06:59,118 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:06:59,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608964493] [2019-11-23 21:06:59,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573819831] [2019-11-23 21:06:59,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:06:59,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:06:59,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-23 21:06:59,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:06:59,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:06:59,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:06:59,829 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 67 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:06:59,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:06:59,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3] total 7 [2019-11-23 21:06:59,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034479188] [2019-11-23 21:06:59,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 21:06:59,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:06:59,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 21:06:59,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:06:59,832 INFO L87 Difference]: Start difference. First operand 4102 states and 5013 transitions. Second operand 8 states. [2019-11-23 21:07:08,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:07:08,610 INFO L93 Difference]: Finished difference Result 17803 states and 21348 transitions. [2019-11-23 21:07:08,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-23 21:07:08,611 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 248 [2019-11-23 21:07:08,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:07:08,666 INFO L225 Difference]: With dead ends: 17803 [2019-11-23 21:07:08,667 INFO L226 Difference]: Without dead ends: 13334 [2019-11-23 21:07:08,674 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-11-23 21:07:08,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13334 states. [2019-11-23 21:07:08,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13334 to 11847. [2019-11-23 21:07:08,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11847 states. [2019-11-23 21:07:08,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11847 states to 11847 states and 13963 transitions. [2019-11-23 21:07:08,916 INFO L78 Accepts]: Start accepts. Automaton has 11847 states and 13963 transitions. Word has length 248 [2019-11-23 21:07:08,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:07:08,917 INFO L462 AbstractCegarLoop]: Abstraction has 11847 states and 13963 transitions. [2019-11-23 21:07:08,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 21:07:08,917 INFO L276 IsEmpty]: Start isEmpty. Operand 11847 states and 13963 transitions. [2019-11-23 21:07:08,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2019-11-23 21:07:08,938 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:07:08,938 INFO L410 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:07:09,143 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:07:09,144 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:07:09,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:07:09,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1638131916, now seen corresponding path program 1 times [2019-11-23 21:07:09,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:07:09,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377988083] [2019-11-23 21:07:09,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:07:09,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:07:09,693 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 218 proven. 158 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:07:09,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377988083] [2019-11-23 21:07:09,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722579822] [2019-11-23 21:07:09,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:07:09,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:07:09,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-23 21:07:09,818 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:07:09,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:07:09,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:07:09,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:07:09,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:07:09,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:07:09,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:07:09,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:07:09,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:07:09,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:07:09,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:07:09,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:07:09,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:07:09,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:07:09,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:07:09,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:07:09,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:07:09,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:07:09,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:07:09,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:07:09,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:07:09,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:07:09,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:07:09,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:07:09,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:07:09,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:07:09,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:07:10,135 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 28 [2019-11-23 21:07:10,597 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 101 proven. 179 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-23 21:07:10,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:07:10,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3] total 9 [2019-11-23 21:07:10,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617974653] [2019-11-23 21:07:10,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 21:07:10,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:07:10,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 21:07:10,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-23 21:07:10,601 INFO L87 Difference]: Start difference. First operand 11847 states and 13963 transitions. Second operand 9 states. [2019-11-23 21:07:20,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:07:20,643 INFO L93 Difference]: Finished difference Result 30168 states and 35764 transitions. [2019-11-23 21:07:20,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-23 21:07:20,644 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 345 [2019-11-23 21:07:20,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:07:20,690 INFO L225 Difference]: With dead ends: 30168 [2019-11-23 21:07:20,690 INFO L226 Difference]: Without dead ends: 20354 [2019-11-23 21:07:20,700 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2019-11-23 21:07:20,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20354 states. [2019-11-23 21:07:20,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20354 to 17011. [2019-11-23 21:07:20,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17011 states. [2019-11-23 21:07:20,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17011 states to 17011 states and 19720 transitions. [2019-11-23 21:07:20,971 INFO L78 Accepts]: Start accepts. Automaton has 17011 states and 19720 transitions. Word has length 345 [2019-11-23 21:07:20,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:07:20,972 INFO L462 AbstractCegarLoop]: Abstraction has 17011 states and 19720 transitions. [2019-11-23 21:07:20,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 21:07:20,972 INFO L276 IsEmpty]: Start isEmpty. Operand 17011 states and 19720 transitions. [2019-11-23 21:07:20,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-11-23 21:07:20,989 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:07:20,989 INFO L410 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:07:21,193 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:07:21,194 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:07:21,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:07:21,194 INFO L82 PathProgramCache]: Analyzing trace with hash -620962545, now seen corresponding path program 1 times [2019-11-23 21:07:21,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:07:21,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105260653] [2019-11-23 21:07:21,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:07:21,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:07:21,548 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-11-23 21:07:21,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105260653] [2019-11-23 21:07:21,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:07:21,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:07:21,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909388731] [2019-11-23 21:07:21,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:07:21,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:07:21,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:07:21,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:07:21,550 INFO L87 Difference]: Start difference. First operand 17011 states and 19720 transitions. Second operand 4 states. [2019-11-23 21:07:23,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:07:23,279 INFO L93 Difference]: Finished difference Result 37366 states and 43502 transitions. [2019-11-23 21:07:23,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:07:23,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 357 [2019-11-23 21:07:23,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:07:23,317 INFO L225 Difference]: With dead ends: 37366 [2019-11-23 21:07:23,317 INFO L226 Difference]: Without dead ends: 20725 [2019-11-23 21:07:23,336 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:07:23,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20725 states. [2019-11-23 21:07:23,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20725 to 19035. [2019-11-23 21:07:23,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19035 states. [2019-11-23 21:07:23,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19035 states to 19035 states and 21900 transitions. [2019-11-23 21:07:23,661 INFO L78 Accepts]: Start accepts. Automaton has 19035 states and 21900 transitions. Word has length 357 [2019-11-23 21:07:23,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:07:23,661 INFO L462 AbstractCegarLoop]: Abstraction has 19035 states and 21900 transitions. [2019-11-23 21:07:23,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:07:23,662 INFO L276 IsEmpty]: Start isEmpty. Operand 19035 states and 21900 transitions. [2019-11-23 21:07:23,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2019-11-23 21:07:23,682 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:07:23,683 INFO L410 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:07:23,683 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:07:23,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:07:23,684 INFO L82 PathProgramCache]: Analyzing trace with hash -108272370, now seen corresponding path program 1 times [2019-11-23 21:07:23,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:07:23,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425282483] [2019-11-23 21:07:23,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:07:23,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:07:24,090 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-23 21:07:24,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425282483] [2019-11-23 21:07:24,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:07:24,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 21:07:24,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986983469] [2019-11-23 21:07:24,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:07:24,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:07:24,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:07:24,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:07:24,094 INFO L87 Difference]: Start difference. First operand 19035 states and 21900 transitions. Second operand 5 states. [2019-11-23 21:07:26,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:07:26,203 INFO L93 Difference]: Finished difference Result 36254 states and 41917 transitions. [2019-11-23 21:07:26,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:07:26,207 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 358 [2019-11-23 21:07:26,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:07:26,241 INFO L225 Difference]: With dead ends: 36254 [2019-11-23 21:07:26,241 INFO L226 Difference]: Without dead ends: 21099 [2019-11-23 21:07:26,257 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:07:26,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21099 states. [2019-11-23 21:07:26,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21099 to 19967. [2019-11-23 21:07:26,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19967 states. [2019-11-23 21:07:26,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19967 states to 19967 states and 22740 transitions. [2019-11-23 21:07:26,552 INFO L78 Accepts]: Start accepts. Automaton has 19967 states and 22740 transitions. Word has length 358 [2019-11-23 21:07:26,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:07:26,552 INFO L462 AbstractCegarLoop]: Abstraction has 19967 states and 22740 transitions. [2019-11-23 21:07:26,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:07:26,553 INFO L276 IsEmpty]: Start isEmpty. Operand 19967 states and 22740 transitions. [2019-11-23 21:07:26,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2019-11-23 21:07:26,571 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:07:26,572 INFO L410 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:07:26,572 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:07:26,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:07:26,573 INFO L82 PathProgramCache]: Analyzing trace with hash 535880552, now seen corresponding path program 1 times [2019-11-23 21:07:26,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:07:26,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658452642] [2019-11-23 21:07:26,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:07:26,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:07:27,011 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-11-23 21:07:27,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658452642] [2019-11-23 21:07:27,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:07:27,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:07:27,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061100242] [2019-11-23 21:07:27,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:07:27,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:07:27,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:07:27,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:07:27,020 INFO L87 Difference]: Start difference. First operand 19967 states and 22740 transitions. Second operand 4 states. [2019-11-23 21:07:28,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:07:28,684 INFO L93 Difference]: Finished difference Result 39938 states and 45481 transitions. [2019-11-23 21:07:28,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:07:28,684 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 361 [2019-11-23 21:07:28,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:07:28,718 INFO L225 Difference]: With dead ends: 39938 [2019-11-23 21:07:28,718 INFO L226 Difference]: Without dead ends: 19973 [2019-11-23 21:07:28,736 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:07:28,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19973 states. [2019-11-23 21:07:28,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19973 to 17942. [2019-11-23 21:07:28,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17942 states. [2019-11-23 21:07:29,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17942 states to 17942 states and 20269 transitions. [2019-11-23 21:07:29,010 INFO L78 Accepts]: Start accepts. Automaton has 17942 states and 20269 transitions. Word has length 361 [2019-11-23 21:07:29,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:07:29,011 INFO L462 AbstractCegarLoop]: Abstraction has 17942 states and 20269 transitions. [2019-11-23 21:07:29,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:07:29,011 INFO L276 IsEmpty]: Start isEmpty. Operand 17942 states and 20269 transitions. [2019-11-23 21:07:29,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2019-11-23 21:07:29,033 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:07:29,033 INFO L410 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:07:29,034 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:07:29,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:07:29,034 INFO L82 PathProgramCache]: Analyzing trace with hash 19325802, now seen corresponding path program 1 times [2019-11-23 21:07:29,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:07:29,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210219528] [2019-11-23 21:07:29,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:07:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:07:29,411 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-23 21:07:29,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210219528] [2019-11-23 21:07:29,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:07:29,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:07:29,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274714244] [2019-11-23 21:07:29,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:07:29,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:07:29,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:07:29,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:07:29,414 INFO L87 Difference]: Start difference. First operand 17942 states and 20269 transitions. Second operand 3 states. [2019-11-23 21:07:30,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:07:30,623 INFO L93 Difference]: Finished difference Result 34770 states and 39330 transitions. [2019-11-23 21:07:30,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:07:30,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 395 [2019-11-23 21:07:30,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:07:30,651 INFO L225 Difference]: With dead ends: 34770 [2019-11-23 21:07:30,651 INFO L226 Difference]: Without dead ends: 19044 [2019-11-23 21:07:30,663 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:07:30,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19044 states. [2019-11-23 21:07:30,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19044 to 17743. [2019-11-23 21:07:30,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17743 states. [2019-11-23 21:07:31,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17743 states to 17743 states and 19773 transitions. [2019-11-23 21:07:31,012 INFO L78 Accepts]: Start accepts. Automaton has 17743 states and 19773 transitions. Word has length 395 [2019-11-23 21:07:31,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:07:31,012 INFO L462 AbstractCegarLoop]: Abstraction has 17743 states and 19773 transitions. [2019-11-23 21:07:31,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:07:31,013 INFO L276 IsEmpty]: Start isEmpty. Operand 17743 states and 19773 transitions. [2019-11-23 21:07:31,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2019-11-23 21:07:31,032 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:07:31,032 INFO L410 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:07:31,033 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:07:31,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:07:31,033 INFO L82 PathProgramCache]: Analyzing trace with hash -168560213, now seen corresponding path program 1 times [2019-11-23 21:07:31,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:07:31,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707760659] [2019-11-23 21:07:31,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:07:31,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:07:31,730 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 388 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:07:31,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707760659] [2019-11-23 21:07:31,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679391306] [2019-11-23 21:07:31,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:07:31,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:07:31,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-23 21:07:31,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:07:31,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:07:31,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:07:33,264 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 191 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:07:33,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:07:33,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 10 [2019-11-23 21:07:33,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529623092] [2019-11-23 21:07:33,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 21:07:33,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:07:33,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 21:07:33,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-23 21:07:33,267 INFO L87 Difference]: Start difference. First operand 17743 states and 19773 transitions. Second operand 10 states. [2019-11-23 21:07:41,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:07:41,604 INFO L93 Difference]: Finished difference Result 36971 states and 41074 transitions. [2019-11-23 21:07:41,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-23 21:07:41,605 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 431 [2019-11-23 21:07:41,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:07:41,626 INFO L225 Difference]: With dead ends: 36971 [2019-11-23 21:07:41,626 INFO L226 Difference]: Without dead ends: 22921 [2019-11-23 21:07:41,635 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 440 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2019-11-23 21:07:41,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22921 states. [2019-11-23 21:07:41,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22921 to 16448. [2019-11-23 21:07:41,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16448 states. [2019-11-23 21:07:41,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16448 states to 16448 states and 18237 transitions. [2019-11-23 21:07:41,846 INFO L78 Accepts]: Start accepts. Automaton has 16448 states and 18237 transitions. Word has length 431 [2019-11-23 21:07:41,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:07:41,847 INFO L462 AbstractCegarLoop]: Abstraction has 16448 states and 18237 transitions. [2019-11-23 21:07:41,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 21:07:41,847 INFO L276 IsEmpty]: Start isEmpty. Operand 16448 states and 18237 transitions. [2019-11-23 21:07:41,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2019-11-23 21:07:41,869 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:07:41,869 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 21:07:42,073 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:07:42,073 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:07:42,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:07:42,074 INFO L82 PathProgramCache]: Analyzing trace with hash -794974525, now seen corresponding path program 1 times [2019-11-23 21:07:42,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:07:42,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608277630] [2019-11-23 21:07:42,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:07:42,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:07:42,712 INFO L134 CoverageAnalysis]: Checked inductivity of 803 backedges. 637 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-11-23 21:07:42,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608277630] [2019-11-23 21:07:42,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:07:42,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:07:42,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760961402] [2019-11-23 21:07:42,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:07:42,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:07:42,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:07:42,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:07:42,716 INFO L87 Difference]: Start difference. First operand 16448 states and 18237 transitions. Second operand 5 states. [2019-11-23 21:07:44,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:07:44,920 INFO L93 Difference]: Finished difference Result 36769 states and 40703 transitions. [2019-11-23 21:07:44,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:07:44,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 527 [2019-11-23 21:07:44,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:07:44,940 INFO L225 Difference]: With dead ends: 36769 [2019-11-23 21:07:44,940 INFO L226 Difference]: Without dead ends: 22353 [2019-11-23 21:07:44,951 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:07:44,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22353 states. [2019-11-23 21:07:45,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22353 to 17921. [2019-11-23 21:07:45,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17921 states. [2019-11-23 21:07:45,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17921 states to 17921 states and 19769 transitions. [2019-11-23 21:07:45,186 INFO L78 Accepts]: Start accepts. Automaton has 17921 states and 19769 transitions. Word has length 527 [2019-11-23 21:07:45,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:07:45,186 INFO L462 AbstractCegarLoop]: Abstraction has 17921 states and 19769 transitions. [2019-11-23 21:07:45,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:07:45,187 INFO L276 IsEmpty]: Start isEmpty. Operand 17921 states and 19769 transitions. [2019-11-23 21:07:45,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2019-11-23 21:07:45,206 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:07:45,207 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:07:45,207 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:07:45,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:07:45,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1413485239, now seen corresponding path program 1 times [2019-11-23 21:07:45,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:07:45,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381070901] [2019-11-23 21:07:45,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:07:45,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:07:45,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1034 backedges. 519 proven. 0 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2019-11-23 21:07:45,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381070901] [2019-11-23 21:07:45,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:07:45,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:07:45,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280228511] [2019-11-23 21:07:45,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:07:45,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:07:45,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:07:45,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:07:45,713 INFO L87 Difference]: Start difference. First operand 17921 states and 19769 transitions. Second operand 3 states. [2019-11-23 21:07:46,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:07:46,626 INFO L93 Difference]: Finished difference Result 36390 states and 40168 transitions. [2019-11-23 21:07:46,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:07:46,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 553 [2019-11-23 21:07:46,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:07:46,627 INFO L225 Difference]: With dead ends: 36390 [2019-11-23 21:07:46,627 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 21:07:46,637 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:07:46,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 21:07:46,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 21:07:46,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 21:07:46,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 21:07:46,637 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 553 [2019-11-23 21:07:46,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:07:46,638 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 21:07:46,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:07:46,638 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 21:07:46,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 21:07:46,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 21:07:47,669 WARN L192 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 516 DAG size of output: 336 [2019-11-23 21:07:48,405 WARN L192 SmtUtils]: Spent 731.00 ms on a formula simplification. DAG size of input: 516 DAG size of output: 336 [2019-11-23 21:07:50,072 WARN L192 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 306 DAG size of output: 71 [2019-11-23 21:07:51,634 WARN L192 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 306 DAG size of output: 71 [2019-11-23 21:07:51,638 INFO L444 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-11-23 21:07:51,638 INFO L444 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-11-23 21:07:51,638 INFO L444 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-11-23 21:07:51,639 INFO L447 ceAbstractionStarter]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2019-11-23 21:07:51,639 INFO L444 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,639 INFO L444 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,640 INFO L444 ceAbstractionStarter]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,640 INFO L444 ceAbstractionStarter]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,640 INFO L444 ceAbstractionStarter]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,640 INFO L444 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,640 INFO L444 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,640 INFO L444 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-11-23 21:07:51,641 INFO L444 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-11-23 21:07:51,641 INFO L444 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-11-23 21:07:51,641 INFO L444 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,641 INFO L444 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,641 INFO L444 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,642 INFO L444 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,642 INFO L444 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,642 INFO L444 ceAbstractionStarter]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,642 INFO L444 ceAbstractionStarter]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,642 INFO L444 ceAbstractionStarter]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,642 INFO L444 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,642 INFO L444 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2019-11-23 21:07:51,643 INFO L444 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-11-23 21:07:51,643 INFO L444 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-11-23 21:07:51,643 INFO L444 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,643 INFO L440 ceAbstractionStarter]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse2 (= ~a25~0 10))) (let ((.cse0 (= ~a25~0 13)) (.cse6 (<= ~a29~0 245)) (.cse3 (<= (+ ~a23~0 43) 0)) (.cse8 (<= ~a29~0 275)) (.cse9 (= ~a25~0 12)) (.cse5 (<= ~a23~0 312)) (.cse7 (exists ((v_~a29~0_502 Int)) (let ((.cse10 (+ v_~a29~0_502 69157))) (and (<= 130 v_~a29~0_502) (<= ~a29~0 (+ (mod .cse10 299861) 300138)) (<= 0 .cse10))))) (.cse1 (= 1 ~a4~0)) (.cse4 (not .cse2))) (or (and .cse0 (<= (+ ~a29~0 (* 5 ~a23~0)) 101230) .cse1) (and .cse1 (= ~a25~0 11)) (and (<= ~a29~0 130) .cse2) (and (not .cse0) (<= ~a29~0 599998) .cse3 .cse4) (and .cse0 .cse5 .cse6) (and (= ~a25~0 9) .cse1) (and .cse1 .cse2 .cse3) (and .cse7 (or (<= ~a23~0 138) .cse6) .cse1) (and .cse8 .cse3 .cse4) (and .cse9 .cse8) (and .cse5 (<= ~a29~0 140)) (and (< 306 ~a23~0) .cse1 .cse2) (and .cse9 .cse5 .cse1) (and .cse7 .cse1 .cse4)))) [2019-11-23 21:07:51,643 INFO L444 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,643 INFO L444 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,644 INFO L444 ceAbstractionStarter]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,644 INFO L444 ceAbstractionStarter]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,644 INFO L444 ceAbstractionStarter]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,644 INFO L444 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,644 INFO L444 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,644 INFO L444 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,644 INFO L444 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-11-23 21:07:51,644 INFO L444 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-11-23 21:07:51,644 INFO L444 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-11-23 21:07:51,645 INFO L444 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2019-11-23 21:07:51,645 INFO L444 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2019-11-23 21:07:51,645 INFO L444 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2019-11-23 21:07:51,645 INFO L444 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2019-11-23 21:07:51,645 INFO L444 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,645 INFO L444 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,645 INFO L444 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,645 INFO L444 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,646 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,646 INFO L444 ceAbstractionStarter]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,646 INFO L444 ceAbstractionStarter]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,646 INFO L444 ceAbstractionStarter]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,646 INFO L444 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,646 INFO L444 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,646 INFO L444 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-11-23 21:07:51,646 INFO L444 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-11-23 21:07:51,646 INFO L444 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2019-11-23 21:07:51,646 INFO L444 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2019-11-23 21:07:51,647 INFO L444 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,647 INFO L444 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,647 INFO L444 ceAbstractionStarter]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,647 INFO L444 ceAbstractionStarter]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,647 INFO L444 ceAbstractionStarter]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,647 INFO L444 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-11-23 21:07:51,647 INFO L444 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2019-11-23 21:07:51,647 INFO L444 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-11-23 21:07:51,647 INFO L444 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,648 INFO L444 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,648 INFO L444 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,648 INFO L444 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,648 INFO L444 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2019-11-23 21:07:51,648 INFO L444 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2019-11-23 21:07:51,648 INFO L444 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,648 INFO L444 ceAbstractionStarter]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,648 INFO L444 ceAbstractionStarter]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,648 INFO L444 ceAbstractionStarter]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,649 INFO L444 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,649 INFO L444 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,649 INFO L444 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2019-11-23 21:07:51,649 INFO L444 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2019-11-23 21:07:51,649 INFO L444 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,649 INFO L444 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,649 INFO L444 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-11-23 21:07:51,649 INFO L444 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-11-23 21:07:51,649 INFO L444 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-11-23 21:07:51,650 INFO L444 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,650 INFO L444 ceAbstractionStarter]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,650 INFO L444 ceAbstractionStarter]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,650 INFO L444 ceAbstractionStarter]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,650 INFO L444 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,650 INFO L444 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,650 INFO L444 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,650 INFO L444 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2019-11-23 21:07:51,650 INFO L444 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-11-23 21:07:51,650 INFO L444 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2019-11-23 21:07:51,651 INFO L444 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2019-11-23 21:07:51,651 INFO L444 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2019-11-23 21:07:51,651 INFO L444 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2019-11-23 21:07:51,651 INFO L444 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2019-11-23 21:07:51,651 INFO L444 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,651 INFO L444 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,651 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 21:07:51,651 INFO L444 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2019-11-23 21:07:51,651 INFO L444 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2019-11-23 21:07:51,652 INFO L444 ceAbstractionStarter]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,652 INFO L444 ceAbstractionStarter]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,652 INFO L444 ceAbstractionStarter]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,652 INFO L444 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,652 INFO L444 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,652 INFO L444 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-11-23 21:07:51,652 INFO L444 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-11-23 21:07:51,652 INFO L444 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2019-11-23 21:07:51,652 INFO L444 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,653 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,653 INFO L444 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,653 INFO L444 ceAbstractionStarter]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,653 INFO L444 ceAbstractionStarter]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,653 INFO L444 ceAbstractionStarter]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,653 INFO L444 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2019-11-23 21:07:51,653 INFO L444 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-11-23 21:07:51,653 INFO L444 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2019-11-23 21:07:51,653 INFO L444 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,653 INFO L444 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,654 INFO L444 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,654 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,654 INFO L444 ceAbstractionStarter]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,654 INFO L444 ceAbstractionStarter]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,654 INFO L444 ceAbstractionStarter]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,654 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-23 21:07:51,654 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 114) no Hoare annotation was computed. [2019-11-23 21:07:51,654 INFO L444 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,654 INFO L444 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2019-11-23 21:07:51,655 INFO L444 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-11-23 21:07:51,655 INFO L444 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2019-11-23 21:07:51,655 INFO L444 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,655 INFO L444 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,655 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,655 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,655 INFO L444 ceAbstractionStarter]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,655 INFO L444 ceAbstractionStarter]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,655 INFO L444 ceAbstractionStarter]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,655 INFO L444 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,656 INFO L444 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,656 INFO L444 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,656 INFO L444 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,656 INFO L444 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2019-11-23 21:07:51,656 INFO L444 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2019-11-23 21:07:51,656 INFO L444 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-11-23 21:07:51,656 INFO L444 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-11-23 21:07:51,656 INFO L444 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-11-23 21:07:51,656 INFO L444 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,657 INFO L444 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,657 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,657 INFO L444 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,657 INFO L444 ceAbstractionStarter]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,657 INFO L444 ceAbstractionStarter]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,657 INFO L444 ceAbstractionStarter]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,657 INFO L444 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2019-11-23 21:07:51,657 INFO L444 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-11-23 21:07:51,657 INFO L444 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2019-11-23 21:07:51,657 INFO L444 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,658 INFO L444 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,658 INFO L444 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,658 INFO L444 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2019-11-23 21:07:51,658 INFO L444 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2019-11-23 21:07:51,658 INFO L444 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,658 INFO L444 ceAbstractionStarter]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,658 INFO L444 ceAbstractionStarter]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,658 INFO L444 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,658 INFO L444 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,659 INFO L444 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-11-23 21:07:51,659 INFO L444 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2019-11-23 21:07:51,659 INFO L444 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,659 INFO L444 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,659 INFO L444 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2019-11-23 21:07:51,659 INFO L444 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2019-11-23 21:07:51,659 INFO L444 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,659 INFO L444 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,659 INFO L444 ceAbstractionStarter]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,660 INFO L444 ceAbstractionStarter]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,660 INFO L444 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,660 INFO L444 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,660 INFO L444 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-11-23 21:07:51,660 INFO L444 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-11-23 21:07:51,660 INFO L444 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2019-11-23 21:07:51,660 INFO L444 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2019-11-23 21:07:51,660 INFO L444 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,660 INFO L444 ceAbstractionStarter]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,661 INFO L444 ceAbstractionStarter]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,661 INFO L444 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,661 INFO L444 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,661 INFO L444 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,661 INFO L444 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,661 INFO L444 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,661 INFO L444 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-11-23 21:07:51,661 INFO L444 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2019-11-23 21:07:51,661 INFO L444 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2019-11-23 21:07:51,661 INFO L444 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2019-11-23 21:07:51,662 INFO L444 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2019-11-23 21:07:51,662 INFO L444 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2019-11-23 21:07:51,662 INFO L444 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,662 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,662 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,662 INFO L444 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,662 INFO L444 ceAbstractionStarter]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,662 INFO L444 ceAbstractionStarter]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,662 INFO L444 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,662 INFO L444 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-11-23 21:07:51,663 INFO L444 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-11-23 21:07:51,663 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 21:07:51,663 INFO L444 ceAbstractionStarter]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,663 INFO L444 ceAbstractionStarter]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,663 INFO L444 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,663 INFO L444 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,663 INFO L444 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,663 INFO L444 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,664 INFO L444 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-11-23 21:07:51,664 INFO L444 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-11-23 21:07:51,664 INFO L444 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,664 INFO L444 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,664 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,664 INFO L444 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,664 INFO L444 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,664 INFO L444 ceAbstractionStarter]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,664 INFO L444 ceAbstractionStarter]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,665 INFO L444 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-11-23 21:07:51,665 INFO L444 ceAbstractionStarter]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,665 INFO L444 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,665 INFO L444 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,665 INFO L444 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-11-23 21:07:51,665 INFO L444 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2019-11-23 21:07:51,665 INFO L444 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-11-23 21:07:51,665 INFO L444 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,665 INFO L444 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2019-11-23 21:07:51,666 INFO L444 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,666 INFO L444 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2019-11-23 21:07:51,666 INFO L444 ceAbstractionStarter]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,666 INFO L444 ceAbstractionStarter]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,666 INFO L444 ceAbstractionStarter]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,666 INFO L444 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,666 INFO L444 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,666 INFO L444 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,666 INFO L444 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2019-11-23 21:07:51,666 INFO L444 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-11-23 21:07:51,667 INFO L444 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-11-23 21:07:51,667 INFO L444 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,667 INFO L444 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,667 INFO L444 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,667 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 21:07:51,667 INFO L444 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,667 INFO L444 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,667 INFO L444 ceAbstractionStarter]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,667 INFO L444 ceAbstractionStarter]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,668 INFO L444 ceAbstractionStarter]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,668 INFO L444 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,668 INFO L444 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,668 INFO L444 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-11-23 21:07:51,668 INFO L444 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-11-23 21:07:51,668 INFO L444 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-11-23 21:07:51,668 INFO L444 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,668 INFO L444 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2019-11-23 21:07:51,668 INFO L444 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2019-11-23 21:07:51,669 INFO L444 ceAbstractionStarter]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,669 INFO L444 ceAbstractionStarter]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,669 INFO L444 ceAbstractionStarter]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,669 INFO L444 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,669 INFO L444 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,669 INFO L444 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,669 INFO L444 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2019-11-23 21:07:51,669 INFO L444 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-11-23 21:07:51,670 INFO L444 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-11-23 21:07:51,670 INFO L444 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,670 INFO L444 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,670 INFO L444 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,670 INFO L440 ceAbstractionStarter]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse2 (= ~a25~0 10))) (let ((.cse0 (= ~a25~0 13)) (.cse6 (<= ~a29~0 245)) (.cse3 (<= (+ ~a23~0 43) 0)) (.cse8 (<= ~a29~0 275)) (.cse9 (= ~a25~0 12)) (.cse5 (<= ~a23~0 312)) (.cse7 (exists ((v_~a29~0_502 Int)) (let ((.cse10 (+ v_~a29~0_502 69157))) (and (<= 130 v_~a29~0_502) (<= ~a29~0 (+ (mod .cse10 299861) 300138)) (<= 0 .cse10))))) (.cse1 (= 1 ~a4~0)) (.cse4 (not .cse2))) (or (and .cse0 (<= (+ ~a29~0 (* 5 ~a23~0)) 101230) .cse1) (and .cse1 (= ~a25~0 11)) (and (<= ~a29~0 130) .cse2) (and (not .cse0) (<= ~a29~0 599998) .cse3 .cse4) (and .cse0 .cse5 .cse6) (and (= ~a25~0 9) .cse1) (and .cse1 .cse2 .cse3) (and .cse7 (or (<= ~a23~0 138) .cse6) .cse1) (and .cse8 .cse3 .cse4) (and .cse9 .cse8) (and .cse5 (<= ~a29~0 140)) (and (< 306 ~a23~0) .cse1 .cse2) (and .cse9 .cse5 .cse1) (and .cse7 .cse1 .cse4)))) [2019-11-23 21:07:51,670 INFO L444 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,670 INFO L444 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2019-11-23 21:07:51,670 INFO L444 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2019-11-23 21:07:51,671 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,671 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,671 INFO L444 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2019-11-23 21:07:51,671 INFO L444 ceAbstractionStarter]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,671 INFO L444 ceAbstractionStarter]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,671 INFO L444 ceAbstractionStarter]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2019-11-23 21:07:51,682 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-23 21:07:51,683 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-23 21:07:51,683 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-23 21:07:51,684 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-23 21:07:51,684 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-23 21:07:51,684 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-23 21:07:51,691 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-23 21:07:51,692 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-23 21:07:51,692 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-23 21:07:51,692 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-23 21:07:51,693 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-23 21:07:51,693 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-23 21:07:51,694 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-23 21:07:51,695 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-23 21:07:51,695 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-23 21:07:51,695 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-23 21:07:51,696 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-23 21:07:51,696 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-23 21:07:51,697 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-23 21:07:51,698 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-23 21:07:51,698 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-23 21:07:51,698 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-23 21:07:51,698 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-23 21:07:51,698 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-23 21:07:51,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 09:07:51 BoogieIcfgContainer [2019-11-23 21:07:51,701 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 21:07:51,703 INFO L168 Benchmark]: Toolchain (without parser) took 66351.11 ms. Allocated memory was 137.9 MB in the beginning and 1.3 GB in the end (delta: 1.2 GB). Free memory was 98.6 MB in the beginning and 681.3 MB in the end (delta: -582.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-11-23 21:07:51,704 INFO L168 Benchmark]: CDTParser took 0.56 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-23 21:07:51,705 INFO L168 Benchmark]: CACSL2BoogieTranslator took 969.75 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 98.4 MB in the beginning and 143.4 MB in the end (delta: -45.0 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. [2019-11-23 21:07:51,706 INFO L168 Benchmark]: Boogie Procedure Inliner took 238.66 ms. Allocated memory is still 202.9 MB. Free memory was 143.4 MB in the beginning and 125.7 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 7.1 GB. [2019-11-23 21:07:51,706 INFO L168 Benchmark]: Boogie Preprocessor took 159.67 ms. Allocated memory is still 202.9 MB. Free memory was 125.7 MB in the beginning and 115.7 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-11-23 21:07:51,707 INFO L168 Benchmark]: RCFGBuilder took 1932.95 ms. Allocated memory was 202.9 MB in the beginning and 259.0 MB in the end (delta: 56.1 MB). Free memory was 115.1 MB in the beginning and 196.0 MB in the end (delta: -80.9 MB). Peak memory consumption was 81.5 MB. Max. memory is 7.1 GB. [2019-11-23 21:07:51,708 INFO L168 Benchmark]: TraceAbstraction took 63041.96 ms. Allocated memory was 259.0 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 196.0 MB in the beginning and 681.3 MB in the end (delta: -485.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-11-23 21:07:51,713 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.56 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 969.75 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 98.4 MB in the beginning and 143.4 MB in the end (delta: -45.0 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 238.66 ms. Allocated memory is still 202.9 MB. Free memory was 143.4 MB in the beginning and 125.7 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 159.67 ms. Allocated memory is still 202.9 MB. Free memory was 125.7 MB in the beginning and 115.7 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1932.95 ms. Allocated memory was 202.9 MB in the beginning and 259.0 MB in the end (delta: 56.1 MB). Free memory was 115.1 MB in the beginning and 196.0 MB in the end (delta: -80.9 MB). Peak memory consumption was 81.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 63041.96 ms. Allocated memory was 259.0 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 196.0 MB in the beginning and 681.3 MB in the end (delta: -485.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 114]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1028]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1034]: Loop Invariant [2019-11-23 21:07:51,724 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-23 21:07:51,724 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-23 21:07:51,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-23 21:07:51,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-23 21:07:51,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-23 21:07:51,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-23 21:07:51,726 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-23 21:07:51,726 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-23 21:07:51,727 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-23 21:07:51,727 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-23 21:07:51,727 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-23 21:07:51,727 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] Derived loop invariant: ((((((((((((((a25 == 13 && a29 + 5 * a23 <= 101230) && 1 == a4) || (1 == a4 && a25 == 11)) || (a29 <= 130 && a25 == 10)) || (((!(a25 == 13) && a29 <= 599998) && a23 + 43 <= 0) && !(a25 == 10))) || ((a25 == 13 && a23 <= 312) && a29 <= 245)) || (a25 == 9 && 1 == a4)) || ((1 == a4 && a25 == 10) && a23 + 43 <= 0)) || (((\exists v_~a29~0_502 : int :: (130 <= v_~a29~0_502 && a29 <= (v_~a29~0_502 + 69157) % 299861 + 300138) && 0 <= v_~a29~0_502 + 69157) && (a23 <= 138 || a29 <= 245)) && 1 == a4)) || ((a29 <= 275 && a23 + 43 <= 0) && !(a25 == 10))) || (a25 == 12 && a29 <= 275)) || (a23 <= 312 && a29 <= 140)) || ((306 < a23 && 1 == a4) && a25 == 10)) || ((a25 == 12 && a23 <= 312) && 1 == a4)) || (((\exists v_~a29~0_502 : int :: (130 <= v_~a29~0_502 && a29 <= (v_~a29~0_502 + 69157) % 299861 + 300138) && 0 <= v_~a29~0_502 + 69157) && 1 == a4) && !(a25 == 10)) - InvariantResult [Line: 22]: Loop Invariant [2019-11-23 21:07:51,728 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-23 21:07:51,728 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-23 21:07:51,729 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-23 21:07:51,729 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-23 21:07:51,729 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-23 21:07:51,729 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-23 21:07:51,730 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-23 21:07:51,730 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-23 21:07:51,730 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-23 21:07:51,731 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-23 21:07:51,731 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-23 21:07:51,731 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] Derived loop invariant: ((((((((((((((a25 == 13 && a29 + 5 * a23 <= 101230) && 1 == a4) || (1 == a4 && a25 == 11)) || (a29 <= 130 && a25 == 10)) || (((!(a25 == 13) && a29 <= 599998) && a23 + 43 <= 0) && !(a25 == 10))) || ((a25 == 13 && a23 <= 312) && a29 <= 245)) || (a25 == 9 && 1 == a4)) || ((1 == a4 && a25 == 10) && a23 + 43 <= 0)) || (((\exists v_~a29~0_502 : int :: (130 <= v_~a29~0_502 && a29 <= (v_~a29~0_502 + 69157) % 299861 + 300138) && 0 <= v_~a29~0_502 + 69157) && (a23 <= 138 || a29 <= 245)) && 1 == a4)) || ((a29 <= 275 && a23 + 43 <= 0) && !(a25 == 10))) || (a25 == 12 && a29 <= 275)) || (a23 <= 312 && a29 <= 140)) || ((306 < a23 && 1 == a4) && a25 == 10)) || ((a25 == 12 && a23 <= 312) && 1 == a4)) || (((\exists v_~a29~0_502 : int :: (130 <= v_~a29~0_502 && a29 <= (v_~a29~0_502 + 69157) % 299861 + 300138) && 0 <= v_~a29~0_502 + 69157) && 1 == a4) && !(a25 == 10)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Result: SAFE, OverallTime: 62.9s, OverallIterations: 14, TraceHistogramMax: 6, AutomataDifference: 45.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.9s, HoareTripleCheckerStatistics: 1976 SDtfs, 10836 SDslu, 944 SDs, 0 SdLazy, 28259 SolverSat, 4459 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 34.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1290 GetRequests, 1212 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19967occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.7s AutomataMinimizationTime, 14 MinimizatonAttempts, 23770 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 250 NumberOfFragments, 359 HoareAnnotationTreeSize, 3 FomulaSimplifications, 38680 FormulaSimplificationTreeSizeReduction, 1.7s HoareSimplificationTime, 3 FomulaSimplificationsInter, 15748 FormulaSimplificationTreeSizeReductionInter, 3.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 5348 NumberOfCodeBlocks, 5348 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 5330 ConstructedInterpolants, 432 QuantifiedInterpolants, 10143979 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1597 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 18 InterpolantComputations, 11 PerfectInterpolantSequences, 4564/5418 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...