/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/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/sumt4.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 17:56:30,092 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 17:56:30,100 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 17:56:30,160 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 17:56:30,161 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 17:56:30,179 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 17:56:30,183 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 17:56:30,188 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 17:56:30,191 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 17:56:30,192 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 17:56:30,194 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 17:56:30,196 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 17:56:30,197 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 17:56:30,198 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 17:56:30,200 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 17:56:30,202 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 17:56:30,204 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 17:56:30,206 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 17:56:30,208 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 17:56:30,211 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 17:56:30,213 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 17:56:30,215 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 17:56:30,217 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 17:56:30,219 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 17:56:30,222 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 17:56:30,223 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 17:56:30,223 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 17:56:30,225 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 17:56:30,226 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 17:56:30,227 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 17:56:30,228 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 17:56:30,229 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 17:56:30,231 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 17:56:30,232 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 17:56:30,234 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 17:56:30,234 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 17:56:30,235 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 17:56:30,236 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 17:56:30,236 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 17:56:30,238 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 17:56:30,239 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 17:56:30,241 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 17:56:30,257 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 17:56:30,258 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 17:56:30,261 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 17:56:30,261 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 17:56:30,261 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 17:56:30,262 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 17:56:30,262 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 17:56:30,262 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 17:56:30,262 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 17:56:30,263 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 17:56:30,263 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 17:56:30,263 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 17:56:30,263 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 17:56:30,264 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 17:56:30,264 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 17:56:30,264 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 17:56:30,264 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 17:56:30,265 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 17:56:30,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 17:56:30,265 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 17:56:30,266 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 17:56:30,266 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 17:56:30,266 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-09-04 17:56:30,812 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 17:56:30,837 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 17:56:30,843 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 17:56:30,847 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 17:56:30,848 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 17:56:30,849 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt4.c [2020-09-04 17:56:30,985 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/cc8dec9dc/d554ea9658634d85995c5cc444a59dfa/FLAG334fface0 [2020-09-04 17:56:31,739 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 17:56:31,741 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/loops-crafted-1/sumt4.c [2020-09-04 17:56:31,758 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/cc8dec9dc/d554ea9658634d85995c5cc444a59dfa/FLAG334fface0 [2020-09-04 17:56:32,045 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/cc8dec9dc/d554ea9658634d85995c5cc444a59dfa [2020-09-04 17:56:32,065 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 17:56:32,068 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 17:56:32,070 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 17:56:32,071 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 17:56:32,077 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 17:56:32,080 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 05:56:32" (1/1) ... [2020-09-04 17:56:32,085 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d85ba32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:56:32, skipping insertion in model container [2020-09-04 17:56:32,086 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 05:56:32" (1/1) ... [2020-09-04 17:56:32,099 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 17:56:32,132 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 17:56:32,403 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 17:56:32,410 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 17:56:32,435 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 17:56:32,458 INFO L208 MainTranslator]: Completed translation [2020-09-04 17:56:32,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:56:32 WrapperNode [2020-09-04 17:56:32,459 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 17:56:32,461 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 17:56:32,461 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 17:56:32,461 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 17:56:32,482 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:56:32" (1/1) ... [2020-09-04 17:56:32,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:56:32" (1/1) ... [2020-09-04 17:56:32,491 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:56:32" (1/1) ... [2020-09-04 17:56:32,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:56:32" (1/1) ... [2020-09-04 17:56:32,497 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:56:32" (1/1) ... [2020-09-04 17:56:32,625 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:56:32" (1/1) ... [2020-09-04 17:56:32,628 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:56:32" (1/1) ... [2020-09-04 17:56:32,631 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 17:56:32,632 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 17:56:32,632 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 17:56:32,633 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 17:56:32,635 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:56:32" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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 [2020-09-04 17:56:32,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 17:56:32,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 17:56:32,725 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-09-04 17:56:32,725 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-09-04 17:56:32,725 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 17:56:32,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 17:56:32,726 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-09-04 17:56:32,726 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-09-04 17:56:32,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-09-04 17:56:32,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 17:56:32,727 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 17:56:32,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 17:56:32,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 17:56:33,174 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 17:56:33,175 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-04 17:56:33,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 05:56:33 BoogieIcfgContainer [2020-09-04 17:56:33,182 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 17:56:33,184 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 17:56:33,185 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 17:56:33,189 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 17:56:33,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 05:56:32" (1/3) ... [2020-09-04 17:56:33,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59661763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 05:56:33, skipping insertion in model container [2020-09-04 17:56:33,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:56:32" (2/3) ... [2020-09-04 17:56:33,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59661763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 05:56:33, skipping insertion in model container [2020-09-04 17:56:33,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 05:56:33" (3/3) ... [2020-09-04 17:56:33,195 INFO L109 eAbstractionObserver]: Analyzing ICFG sumt4.c [2020-09-04 17:56:33,214 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 17:56:33,230 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 17:56:33,261 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 17:56:33,299 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 17:56:33,299 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 17:56:33,299 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-09-04 17:56:33,299 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 17:56:33,300 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 17:56:33,300 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 17:56:33,300 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 17:56:33,300 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 17:56:33,328 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2020-09-04 17:56:33,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-09-04 17:56:33,347 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:56:33,349 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:56:33,350 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:56:33,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:56:33,359 INFO L82 PathProgramCache]: Analyzing trace with hash 2048298944, now seen corresponding path program 1 times [2020-09-04 17:56:33,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:56:33,374 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2834003] [2020-09-04 17:56:33,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:56:33,467 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:56:33,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:56:34,261 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 21 [2020-09-04 17:56:34,465 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 30 [2020-09-04 17:56:34,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:56:34,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:56:34,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:56:34,611 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2834003] [2020-09-04 17:56:34,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:56:34,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 17:56:34,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139201739] [2020-09-04 17:56:34,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 17:56:34,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:56:34,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 17:56:34,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-09-04 17:56:34,662 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 11 states. [2020-09-04 17:56:35,157 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2020-09-04 17:56:35,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:56:35,997 INFO L93 Difference]: Finished difference Result 109 states and 147 transitions. [2020-09-04 17:56:35,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 17:56:36,001 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-09-04 17:56:36,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:56:36,024 INFO L225 Difference]: With dead ends: 109 [2020-09-04 17:56:36,025 INFO L226 Difference]: Without dead ends: 63 [2020-09-04 17:56:36,033 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2020-09-04 17:56:36,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-09-04 17:56:36,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 31. [2020-09-04 17:56:36,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-09-04 17:56:36,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2020-09-04 17:56:36,111 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 20 [2020-09-04 17:56:36,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:56:36,112 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2020-09-04 17:56:36,112 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 17:56:36,112 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2020-09-04 17:56:36,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-04 17:56:36,114 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:56:36,114 INFO L422 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] [2020-09-04 17:56:36,115 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 17:56:36,115 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:56:36,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:56:36,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1303654892, now seen corresponding path program 1 times [2020-09-04 17:56:36,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:56:36,117 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [706842235] [2020-09-04 17:56:36,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:56:36,157 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:56:36,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:56:37,179 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 30 [2020-09-04 17:56:37,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:56:37,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:56:37,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:56:37,464 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [706842235] [2020-09-04 17:56:37,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:56:37,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-09-04 17:56:37,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295563982] [2020-09-04 17:56:37,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-04 17:56:37,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:56:37,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-04 17:56:37,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2020-09-04 17:56:37,469 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 17 states. [2020-09-04 17:56:38,184 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 37 [2020-09-04 17:56:41,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:56:41,240 INFO L93 Difference]: Finished difference Result 76 states and 94 transitions. [2020-09-04 17:56:41,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 17:56:41,242 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2020-09-04 17:56:41,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:56:41,245 INFO L225 Difference]: With dead ends: 76 [2020-09-04 17:56:41,245 INFO L226 Difference]: Without dead ends: 71 [2020-09-04 17:56:41,249 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=177, Invalid=579, Unknown=0, NotChecked=0, Total=756 [2020-09-04 17:56:41,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-09-04 17:56:41,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 34. [2020-09-04 17:56:41,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-09-04 17:56:41,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2020-09-04 17:56:41,273 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 24 [2020-09-04 17:56:41,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:56:41,273 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2020-09-04 17:56:41,274 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-04 17:56:41,274 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2020-09-04 17:56:41,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-09-04 17:56:41,275 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:56:41,275 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:56:41,276 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 17:56:41,276 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:56:41,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:56:41,277 INFO L82 PathProgramCache]: Analyzing trace with hash -132325864, now seen corresponding path program 2 times [2020-09-04 17:56:41,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:56:41,278 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [164549495] [2020-09-04 17:56:41,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:56:41,290 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:56:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:56:41,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:56:41,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:56:41,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:56:41,401 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [164549495] [2020-09-04 17:56:41,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:56:41,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 17:56:41,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620478833] [2020-09-04 17:56:41,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 17:56:41,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:56:41,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 17:56:41,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 17:56:41,404 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 5 states. [2020-09-04 17:56:41,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:56:41,620 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2020-09-04 17:56:41,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 17:56:41,622 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2020-09-04 17:56:41,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:56:41,623 INFO L225 Difference]: With dead ends: 55 [2020-09-04 17:56:41,624 INFO L226 Difference]: Without dead ends: 41 [2020-09-04 17:56:41,625 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-09-04 17:56:41,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-09-04 17:56:41,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2020-09-04 17:56:41,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-09-04 17:56:41,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2020-09-04 17:56:41,648 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 28 [2020-09-04 17:56:41,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:56:41,649 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2020-09-04 17:56:41,649 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 17:56:41,649 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2020-09-04 17:56:41,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-09-04 17:56:41,651 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:56:41,651 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-09-04 17:56:41,652 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 17:56:41,652 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:56:41,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:56:41,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1365663380, now seen corresponding path program 1 times [2020-09-04 17:56:41,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:56:41,654 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1641333151] [2020-09-04 17:56:41,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:56:41,663 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:56:41,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:56:42,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:56:42,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:56:42,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:56:42,083 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1641333151] [2020-09-04 17:56:42,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:56:42,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 17:56:42,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114048576] [2020-09-04 17:56:42,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 17:56:42,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:56:42,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 17:56:42,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-09-04 17:56:42,086 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 9 states. [2020-09-04 17:56:51,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:56:51,212 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2020-09-04 17:56:51,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 17:56:51,213 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-09-04 17:56:51,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:56:51,218 INFO L225 Difference]: With dead ends: 68 [2020-09-04 17:56:51,218 INFO L226 Difference]: Without dead ends: 54 [2020-09-04 17:56:51,219 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2020-09-04 17:56:51,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-09-04 17:56:51,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 36. [2020-09-04 17:56:51,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-09-04 17:56:51,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2020-09-04 17:56:51,254 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 29 [2020-09-04 17:56:51,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:56:51,254 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2020-09-04 17:56:51,254 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 17:56:51,255 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2020-09-04 17:56:51,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-09-04 17:56:51,256 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:56:51,256 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-09-04 17:56:51,256 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 17:56:51,257 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:56:51,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:56:51,257 INFO L82 PathProgramCache]: Analyzing trace with hash 85634078, now seen corresponding path program 1 times [2020-09-04 17:56:51,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:56:51,258 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [112916511] [2020-09-04 17:56:51,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:56:51,281 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:56:51,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:56:51,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:56:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:56:51,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:56:51,389 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [112916511] [2020-09-04 17:56:51,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:56:51,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 17:56:51,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345501179] [2020-09-04 17:56:51,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 17:56:51,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:56:51,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 17:56:51,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 17:56:51,392 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 5 states. [2020-09-04 17:56:51,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:56:51,601 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2020-09-04 17:56:51,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 17:56:51,602 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-09-04 17:56:51,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:56:51,604 INFO L225 Difference]: With dead ends: 53 [2020-09-04 17:56:51,604 INFO L226 Difference]: Without dead ends: 39 [2020-09-04 17:56:51,605 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-09-04 17:56:51,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-09-04 17:56:51,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2020-09-04 17:56:51,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-09-04 17:56:51,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2020-09-04 17:56:51,624 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 30 [2020-09-04 17:56:51,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:56:51,625 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2020-09-04 17:56:51,625 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 17:56:51,625 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2020-09-04 17:56:51,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-09-04 17:56:51,626 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:56:51,627 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-09-04 17:56:51,627 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 17:56:51,627 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:56:51,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:56:51,628 INFO L82 PathProgramCache]: Analyzing trace with hash -613358466, now seen corresponding path program 1 times [2020-09-04 17:56:51,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:56:51,629 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [915801541] [2020-09-04 17:56:51,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:56:51,638 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:56:51,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:56:52,805 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 31 [2020-09-04 17:56:53,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:56:53,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:56:53,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:56:53,134 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [915801541] [2020-09-04 17:56:53,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:56:53,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-09-04 17:56:53,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635513301] [2020-09-04 17:56:53,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-09-04 17:56:53,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:56:53,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-09-04 17:56:53,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2020-09-04 17:56:53,137 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 19 states. [2020-09-04 17:56:54,172 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 34 [2020-09-04 17:56:54,349 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2020-09-04 17:56:55,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:56:55,309 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2020-09-04 17:56:55,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-04 17:56:55,313 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2020-09-04 17:56:55,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:56:55,315 INFO L225 Difference]: With dead ends: 62 [2020-09-04 17:56:55,315 INFO L226 Difference]: Without dead ends: 57 [2020-09-04 17:56:55,321 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=201, Invalid=791, Unknown=0, NotChecked=0, Total=992 [2020-09-04 17:56:55,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-09-04 17:56:55,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2020-09-04 17:56:55,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-09-04 17:56:55,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2020-09-04 17:56:55,354 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 30 [2020-09-04 17:56:55,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:56:55,356 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2020-09-04 17:56:55,356 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-09-04 17:56:55,356 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2020-09-04 17:56:55,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-09-04 17:56:55,359 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:56:55,359 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:56:55,360 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 17:56:55,360 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:56:55,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:56:55,361 INFO L82 PathProgramCache]: Analyzing trace with hash 473561002, now seen corresponding path program 2 times [2020-09-04 17:56:55,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:56:55,362 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2097607916] [2020-09-04 17:56:55,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:56:55,375 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:56:55,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:56:55,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:56:55,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:56:55,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:56:55,522 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2097607916] [2020-09-04 17:56:55,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:56:55,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 17:56:55,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185470884] [2020-09-04 17:56:55,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 17:56:55,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:56:55,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 17:56:55,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-09-04 17:56:55,526 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 6 states. [2020-09-04 17:56:55,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:56:55,842 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2020-09-04 17:56:55,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 17:56:55,843 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2020-09-04 17:56:55,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:56:55,844 INFO L225 Difference]: With dead ends: 61 [2020-09-04 17:56:55,845 INFO L226 Difference]: Without dead ends: 47 [2020-09-04 17:56:55,846 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-09-04 17:56:55,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-09-04 17:56:55,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2020-09-04 17:56:55,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-09-04 17:56:55,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2020-09-04 17:56:55,871 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 34 [2020-09-04 17:56:55,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:56:55,872 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2020-09-04 17:56:55,872 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 17:56:55,872 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2020-09-04 17:56:55,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-09-04 17:56:55,873 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:56:55,874 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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] [2020-09-04 17:56:55,874 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 17:56:55,874 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:56:55,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:56:55,875 INFO L82 PathProgramCache]: Analyzing trace with hash 236960282, now seen corresponding path program 1 times [2020-09-04 17:56:55,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:56:55,875 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2023611165] [2020-09-04 17:56:55,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:56:55,886 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:56:55,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:56:56,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:56:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:56:56,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:56:56,409 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2023611165] [2020-09-04 17:56:56,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:56:56,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 17:56:56,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347442635] [2020-09-04 17:56:56,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 17:56:56,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:56:56,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 17:56:56,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-09-04 17:56:56,412 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 10 states. [2020-09-04 17:57:08,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:57:08,410 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2020-09-04 17:57:08,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 17:57:08,411 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2020-09-04 17:57:08,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:57:08,413 INFO L225 Difference]: With dead ends: 60 [2020-09-04 17:57:08,419 INFO L226 Difference]: Without dead ends: 46 [2020-09-04 17:57:08,420 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2020-09-04 17:57:08,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-09-04 17:57:08,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2020-09-04 17:57:08,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-09-04 17:57:08,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2020-09-04 17:57:08,462 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 35 [2020-09-04 17:57:08,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:57:08,464 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2020-09-04 17:57:08,464 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 17:57:08,464 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2020-09-04 17:57:08,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-09-04 17:57:08,468 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:57:08,468 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:57:08,469 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 17:57:08,469 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:57:08,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:57:08,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1772639952, now seen corresponding path program 1 times [2020-09-04 17:57:08,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:57:08,474 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [406574] [2020-09-04 17:57:08,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:57:08,485 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:57:08,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:57:10,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:57:10,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:57:10,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:57:10,430 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [406574] [2020-09-04 17:57:10,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:57:10,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-09-04 17:57:10,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771988163] [2020-09-04 17:57:10,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-09-04 17:57:10,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:57:10,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-09-04 17:57:10,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2020-09-04 17:57:10,433 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 21 states. [2020-09-04 17:57:11,388 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2020-09-04 17:57:11,575 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 34 [2020-09-04 17:57:11,790 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2020-09-04 17:57:23,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:57:23,321 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2020-09-04 17:57:23,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-04 17:57:23,322 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 36 [2020-09-04 17:57:23,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:57:23,323 INFO L225 Difference]: With dead ends: 70 [2020-09-04 17:57:23,324 INFO L226 Difference]: Without dead ends: 53 [2020-09-04 17:57:23,326 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=220, Invalid=1112, Unknown=0, NotChecked=0, Total=1332 [2020-09-04 17:57:23,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-09-04 17:57:23,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 46. [2020-09-04 17:57:23,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-09-04 17:57:23,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2020-09-04 17:57:23,349 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 36 [2020-09-04 17:57:23,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:57:23,350 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2020-09-04 17:57:23,350 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-09-04 17:57:23,350 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2020-09-04 17:57:23,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-09-04 17:57:23,351 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:57:23,351 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 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] [2020-09-04 17:57:23,352 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 17:57:23,352 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:57:23,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:57:23,352 INFO L82 PathProgramCache]: Analyzing trace with hash -940895396, now seen corresponding path program 2 times [2020-09-04 17:57:23,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:57:23,353 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1757227185] [2020-09-04 17:57:23,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:57:23,367 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:57:23,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:57:23,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:57:23,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:57:23,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:57:23,527 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1757227185] [2020-09-04 17:57:23,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:57:23,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 17:57:23,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657000912] [2020-09-04 17:57:23,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 17:57:23,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:57:23,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 17:57:23,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-09-04 17:57:23,530 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 7 states. [2020-09-04 17:57:23,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:57:23,925 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2020-09-04 17:57:23,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 17:57:23,926 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2020-09-04 17:57:23,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:57:23,929 INFO L225 Difference]: With dead ends: 64 [2020-09-04 17:57:23,930 INFO L226 Difference]: Without dead ends: 50 [2020-09-04 17:57:23,931 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-09-04 17:57:23,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-09-04 17:57:23,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2020-09-04 17:57:23,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-09-04 17:57:23,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2020-09-04 17:57:23,986 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 40 [2020-09-04 17:57:23,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:57:23,986 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2020-09-04 17:57:23,986 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 17:57:23,987 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2020-09-04 17:57:23,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-09-04 17:57:23,999 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:57:24,000 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2020-09-04 17:57:24,000 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 17:57:24,001 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:57:24,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:57:24,002 INFO L82 PathProgramCache]: Analyzing trace with hash -661515096, now seen corresponding path program 1 times [2020-09-04 17:57:24,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:57:24,002 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [287650361] [2020-09-04 17:57:24,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:57:24,014 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:57:24,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:57:24,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:57:24,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:57:24,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:57:24,433 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [287650361] [2020-09-04 17:57:24,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:57:24,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 17:57:24,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852339983] [2020-09-04 17:57:24,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 17:57:24,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:57:24,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 17:57:24,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2020-09-04 17:57:24,435 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 11 states. [2020-09-04 17:57:25,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:57:25,241 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2020-09-04 17:57:25,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 17:57:25,243 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2020-09-04 17:57:25,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:57:25,243 INFO L225 Difference]: With dead ends: 49 [2020-09-04 17:57:25,244 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 17:57:25,245 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2020-09-04 17:57:25,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 17:57:25,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 17:57:25,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 17:57:25,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 17:57:25,247 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2020-09-04 17:57:25,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:57:25,247 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 17:57:25,247 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 17:57:25,247 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 17:57:25,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 17:57:25,248 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 17:57:25,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 17:57:25,364 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 23 [2020-09-04 17:57:25,887 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 31 [2020-09-04 17:57:26,546 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2020-09-04 17:57:26,648 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 23 [2020-09-04 17:57:26,807 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2020-09-04 17:57:26,921 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 27 [2020-09-04 17:57:27,413 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 27 [2020-09-04 17:57:27,573 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2020-09-04 17:57:27,704 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 25 [2020-09-04 17:57:27,871 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 27 [2020-09-04 17:57:28,079 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 27 [2020-09-04 17:57:28,186 INFO L264 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2020-09-04 17:57:28,187 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= ~SIZE~0 |old(~SIZE~0)|) [2020-09-04 17:57:28,187 INFO L264 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2020-09-04 17:57:28,187 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 17:57:28,187 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2020-09-04 17:57:28,188 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 17:57:28,188 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 17:57:28,188 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-09-04 17:57:28,188 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-09-04 17:57:28,189 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-09-04 17:57:28,189 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-09-04 17:57:28,189 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-09-04 17:57:28,189 INFO L271 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: true [2020-09-04 17:57:28,190 INFO L264 CegarLoopResult]: At program point L25(lines 25 28) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0))) (and (<= .cse0 main_~l~0) (<= (let ((.cse3 (div main_~l~0 4294967296))) (let ((.cse2 (* .cse3 (- 4294967296)))) (let ((.cse1 (div (+ main_~l~0 .cse2) 3))) (+ (* 6 .cse1) (* 8589934593 (div (+ (* .cse1 (- 3)) main_~l~0 .cse2) 4294967296)) (* 8589934592 .cse3) 2)))) (* 2 main_~l~0)) (<= main_~l~0 .cse0))) (not (<= 20000001 ~SIZE~0))) [2020-09-04 17:57:28,190 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 14 33) the Hoare annotation is: true [2020-09-04 17:57:28,190 INFO L264 CegarLoopResult]: At program point L23(lines 23 28) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0))) (and (<= .cse0 main_~l~0) (<= main_~l~0 .cse0))) (not (<= 20000001 ~SIZE~0))) [2020-09-04 17:57:28,190 INFO L264 CegarLoopResult]: At program point L25-2(lines 21 28) the Hoare annotation is: (or (let ((.cse1 (+ main_~l~0 1)) (.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-09-04 17:57:28,190 INFO L264 CegarLoopResult]: At program point L21(lines 21 28) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0))) (and (<= .cse0 main_~l~0) (<= main_~l~0 .cse0))) (not (<= 20000001 ~SIZE~0))) [2020-09-04 17:57:28,191 INFO L264 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (let ((.cse2 (+ main_~i~0 main_~j~0 main_~k~0)) (.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0)) (.cse1 (+ main_~i~0 main_~k~0))) (and (<= .cse0 main_~l~0) (<= 0 .cse1) (<= main_~i~0 0) (<= main_~l~0 .cse2) (<= 0 main_~i~0) (<= .cse2 main_~l~0) (<= main_~l~0 0) (<= main_~l~0 .cse0) (<= .cse1 0) (<= 0 main_~l~0))) (not (<= 20000001 ~SIZE~0))) [2020-09-04 17:57:28,191 INFO L264 CegarLoopResult]: At program point L19-2(lines 19 30) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0))) (and (<= .cse0 main_~l~0) (<= main_~l~0 .cse0))) (not (<= 20000001 ~SIZE~0))) [2020-09-04 17:57:28,192 INFO L264 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (let ((.cse2 (+ main_~i~0 main_~j~0 main_~k~0)) (.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0)) (.cse1 (+ main_~i~0 main_~k~0))) (and (<= .cse0 main_~l~0) (<= 0 .cse1) (<= main_~i~0 0) (<= main_~l~0 .cse2) (<= 0 main_~i~0) (<= .cse2 main_~l~0) (<= main_~l~0 0) (<= main_~l~0 .cse0) (<= .cse1 0) (<= 0 main_~l~0))) (not (<= 20000001 ~SIZE~0))) [2020-09-04 17:57:28,194 INFO L264 CegarLoopResult]: At program point L19-3(lines 19 30) the Hoare annotation is: (or (let ((.cse1 (+ (* 4294967296 (div (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0) 4294967296)) main_~l~0)) (.cse0 (* 4294967296 (div main_~l~0 4294967296)))) (and (<= (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0 .cse0) .cse1) (< .cse1 (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0 .cse0 1)))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-09-04 17:57:28,194 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-09-04 17:57:28,195 INFO L264 CegarLoopResult]: At program point L17-2(line 17) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (let ((.cse2 (+ main_~i~0 main_~j~0 main_~k~0)) (.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0)) (.cse1 (+ main_~i~0 main_~k~0))) (and (<= .cse0 main_~l~0) (<= 0 .cse1) (<= main_~i~0 0) (<= main_~l~0 .cse2) (<= 0 main_~i~0) (<= .cse2 main_~l~0) (<= main_~l~0 0) (<= main_~l~0 .cse0) (<= .cse1 0) (<= 0 main_~l~0))) (not (<= 20000001 ~SIZE~0))) [2020-09-04 17:57:28,195 INFO L264 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (and (<= main_~i~0 0) (<= 0 main_~i~0)) (not (<= 20000001 ~SIZE~0))) [2020-09-04 17:57:28,195 INFO L264 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (let ((.cse0 (+ main_~i~0 main_~k~0))) (and (<= 0 .cse0) (<= main_~i~0 0) (<= 0 main_~i~0) (<= .cse0 0))) (not (<= 20000001 ~SIZE~0))) [2020-09-04 17:57:28,195 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 14 33) the Hoare annotation is: true [2020-09-04 17:57:28,195 INFO L264 CegarLoopResult]: At program point L15-3(line 15) the Hoare annotation is: (or (let ((.cse1 (+ main_~i~0 main_~j~0 main_~k~0)) (.cse0 (+ main_~i~0 main_~k~0))) (and (<= 0 .cse0) (<= 0 .cse1) (<= main_~i~0 0) (<= .cse1 0) (<= 0 main_~i~0) (<= .cse0 0))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-09-04 17:57:28,196 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 14 33) the Hoare annotation is: true [2020-09-04 17:57:28,197 INFO L264 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0))) (and (<= .cse0 main_~l~0) (<= main_~l~0 .cse0))) (not (<= 20000001 ~SIZE~0))) [2020-09-04 17:57:28,197 INFO L264 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0))) (and (<= .cse0 main_~l~0) (<= (let ((.cse3 (div main_~l~0 4294967296))) (let ((.cse2 (* .cse3 (- 4294967296)))) (let ((.cse1 (div (+ main_~l~0 .cse2) 3))) (+ (* 6 .cse1) (* 8589934593 (div (+ (* .cse1 (- 3)) main_~l~0 .cse2) 4294967296)) (* 8589934592 .cse3) 2)))) (* 2 main_~l~0)) (<= main_~l~0 .cse0))) (not (<= 20000001 ~SIZE~0))) [2020-09-04 17:57:28,197 INFO L264 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0))) (and (<= .cse0 main_~l~0) (<= main_~l~0 .cse0))) (not (<= 20000001 ~SIZE~0))) [2020-09-04 17:57:28,198 INFO L264 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0))) (and (<= .cse0 main_~l~0) (<= main_~l~0 .cse0))) (not (<= 20000001 ~SIZE~0))) [2020-09-04 17:57:28,198 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (let ((.cse2 (+ main_~i~0 main_~j~0 main_~k~0)) (.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0)) (.cse1 (+ main_~i~0 main_~k~0))) (and (<= .cse0 main_~l~0) (<= 0 .cse1) (<= main_~i~0 0) (<= main_~l~0 .cse2) (<= 0 main_~i~0) (<= .cse2 main_~l~0) (<= main_~l~0 0) (<= main_~l~0 .cse0) (<= .cse1 0) (<= 0 main_~l~0))) (not (<= 20000001 ~SIZE~0))) [2020-09-04 17:57:28,198 INFO L264 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0)) (let ((.cse1 (+ main_~i~0 main_~j~0 main_~k~0)) (.cse0 (+ main_~i~0 main_~k~0)) (.cse3 (div main_~l~0 4294967296)) (.cse2 (div (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0) 4294967296))) (and (<= 0 .cse0) (<= 0 .cse1) (<= main_~i~0 0) (<= .cse1 0) (<= main_~l~0 .cse1) (<= 0 main_~i~0) (< .cse2 (+ .cse3 1)) (<= .cse1 main_~l~0) (<= .cse0 0) (<= (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0 (* 4294967296 .cse3)) (+ (* 4294967296 .cse2) main_~l~0))))) [2020-09-04 17:57:28,198 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (or (let ((.cse1 (+ main_~i~0 main_~j~0 main_~k~0)) (.cse0 (+ main_~i~0 main_~k~0))) (and (<= 0 .cse0) (<= main_~i~0 0) (<= main_~l~0 .cse1) (<= 0 main_~i~0) (<= .cse1 main_~l~0) (<= main_~l~0 0) (<= .cse0 0) (<= 0 main_~l~0))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-09-04 17:57:28,199 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-09-04 17:57:28,199 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-09-04 17:57:28,199 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-09-04 17:57:28,199 INFO L264 CegarLoopResult]: At program point L7(lines 7 9) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-09-04 17:57:28,200 INFO L264 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-09-04 17:57:28,200 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-09-04 17:57:28,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 05:57:28 BoogieIcfgContainer [2020-09-04 17:57:28,278 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 17:57:28,293 INFO L168 Benchmark]: Toolchain (without parser) took 56213.79 ms. Allocated memory was 145.2 MB in the beginning and 320.9 MB in the end (delta: 175.6 MB). Free memory was 101.3 MB in the beginning and 237.2 MB in the end (delta: -135.9 MB). Peak memory consumption was 167.7 MB. Max. memory is 7.1 GB. [2020-09-04 17:57:28,294 INFO L168 Benchmark]: CDTParser took 0.38 ms. Allocated memory is still 145.2 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 17:57:28,298 INFO L168 Benchmark]: CACSL2BoogieTranslator took 389.62 ms. Allocated memory is still 145.2 MB. Free memory was 100.9 MB in the beginning and 91.2 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-09-04 17:57:28,302 INFO L168 Benchmark]: Boogie Preprocessor took 170.87 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 91.2 MB in the beginning and 181.5 MB in the end (delta: -90.2 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2020-09-04 17:57:28,310 INFO L168 Benchmark]: RCFGBuilder took 550.21 ms. Allocated memory is still 202.9 MB. Free memory was 181.5 MB in the beginning and 166.7 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2020-09-04 17:57:28,311 INFO L168 Benchmark]: TraceAbstraction took 55094.03 ms. Allocated memory was 202.9 MB in the beginning and 320.9 MB in the end (delta: 118.0 MB). Free memory was 166.0 MB in the beginning and 237.2 MB in the end (delta: -71.1 MB). Peak memory consumption was 174.8 MB. Max. memory is 7.1 GB. [2020-09-04 17:57:28,324 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38 ms. Allocated memory is still 145.2 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 389.62 ms. Allocated memory is still 145.2 MB. Free memory was 100.9 MB in the beginning and 91.2 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 170.87 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 91.2 MB in the beginning and 181.5 MB in the end (delta: -90.2 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 550.21 ms. Allocated memory is still 202.9 MB. Free memory was 181.5 MB in the beginning and 166.7 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 55094.03 ms. Allocated memory was 202.9 MB in the beginning and 320.9 MB in the end (delta: 118.0 MB). Free memory was 166.0 MB in the beginning and 237.2 MB in the end (delta: -71.1 MB). Peak memory consumption was 174.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: 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: 19]: Loop Invariant Derived loop invariant: (!(SIZE <= 20000001) || (i + j + k + v4 <= l && l <= i + j + k + v4)) || !(20000001 <= SIZE) - ProcedureContractResult [Line: 14]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 51.9s, OverallIterations: 11, TraceHistogramMax: 4, AutomataDifference: 43.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 238 SDtfs, 1372 SDslu, 383 SDs, 0 SdLazy, 1985 SolverSat, 249 SolverUnsat, 13 SolverUnknown, 0 SolverNotchecked, 33.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 215 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 627 ImplicationChecksByTransitivity, 12.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 131 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 37 LocationsWithAnnotation, 109 PreInvPairs, 184 NumberOfFragments, 867 HoareAnnotationTreeSize, 109 FomulaSimplifications, 787908 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 37 FomulaSimplificationsInter, 1390 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...