/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loops/string-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 06:35:12,366 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 06:35:12,372 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 06:35:12,427 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 06:35:12,428 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 06:35:12,433 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 06:35:12,437 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 06:35:12,445 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 06:35:12,448 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 06:35:12,454 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 06:35:12,464 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 06:35:12,469 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 06:35:12,469 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 06:35:12,471 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 06:35:12,473 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 06:35:12,477 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 06:35:12,478 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 06:35:12,481 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 06:35:12,488 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 06:35:12,492 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 06:35:12,495 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 06:35:12,496 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 06:35:12,499 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 06:35:12,501 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 06:35:12,508 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 06:35:12,508 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 06:35:12,509 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 06:35:12,515 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 06:35:12,516 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 06:35:12,517 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 06:35:12,517 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 06:35:12,519 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 06:35:12,520 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 06:35:12,521 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 06:35:12,522 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 06:35:12,522 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 06:35:12,523 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 06:35:12,523 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 06:35:12,524 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 06:35:12,524 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 06:35:12,525 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 06:35:12,526 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 06:35:12,548 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 06:35:12,548 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 06:35:12,554 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 06:35:12,554 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 06:35:12,554 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 06:35:12,554 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 06:35:12,554 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 06:35:12,555 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 06:35:12,555 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 06:35:12,555 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 06:35:12,556 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 06:35:12,556 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 06:35:12,556 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 06:35:12,557 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 06:35:12,557 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 06:35:12,557 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 06:35:12,557 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 06:35:12,558 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 06:35:12,558 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 06:35:12,558 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 06:35:12,558 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 06:35:12,558 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 06:35:12,559 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-11-07 06:35:12,942 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 06:35:12,996 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 06:35:12,999 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 06:35:13,000 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 06:35:13,001 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 06:35:13,002 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/string-2.i [2020-11-07 06:35:13,098 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22adfcf5a/225e9bdd920f4575b6be89a6637743aa/FLAG6d0f6c8af [2020-11-07 06:35:13,772 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 06:35:13,773 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/string-2.i [2020-11-07 06:35:13,782 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22adfcf5a/225e9bdd920f4575b6be89a6637743aa/FLAG6d0f6c8af [2020-11-07 06:35:14,143 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22adfcf5a/225e9bdd920f4575b6be89a6637743aa [2020-11-07 06:35:14,146 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 06:35:14,154 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 06:35:14,162 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 06:35:14,162 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 06:35:14,171 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 06:35:14,172 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:35:14" (1/1) ... [2020-11-07 06:35:14,177 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31a31951 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:35:14, skipping insertion in model container [2020-11-07 06:35:14,177 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:35:14" (1/1) ... [2020-11-07 06:35:14,188 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 06:35:14,211 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 06:35:14,397 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 06:35:14,407 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 06:35:14,433 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 06:35:14,452 INFO L208 MainTranslator]: Completed translation [2020-11-07 06:35:14,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:35:14 WrapperNode [2020-11-07 06:35:14,453 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 06:35:14,454 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 06:35:14,454 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 06:35:14,454 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 06:35:14,468 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:35:14" (1/1) ... [2020-11-07 06:35:14,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:35:14" (1/1) ... [2020-11-07 06:35:14,479 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:35:14" (1/1) ... [2020-11-07 06:35:14,479 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:35:14" (1/1) ... [2020-11-07 06:35:14,491 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:35:14" (1/1) ... [2020-11-07 06:35:14,498 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:35:14" (1/1) ... [2020-11-07 06:35:14,500 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:35:14" (1/1) ... [2020-11-07 06:35:14,503 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 06:35:14,504 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 06:35:14,505 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 06:35:14,505 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 06:35:14,506 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:35:14" (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 [2020-11-07 06:35:14,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 06:35:14,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 06:35:14,595 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 06:35:14,595 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-11-07 06:35:14,595 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-11-07 06:35:14,595 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 06:35:14,596 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 06:35:14,596 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 06:35:14,596 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-11-07 06:35:14,596 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-11-07 06:35:14,596 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 06:35:14,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 06:35:14,597 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-11-07 06:35:14,597 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-11-07 06:35:14,597 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-11-07 06:35:14,597 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 06:35:14,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 06:35:14,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 06:35:14,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 06:35:14,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 06:35:14,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 06:35:14,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 06:35:15,155 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 06:35:15,155 INFO L298 CfgBuilder]: Removed 5 assume(true) statements. [2020-11-07 06:35:15,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:35:15 BoogieIcfgContainer [2020-11-07 06:35:15,158 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 06:35:15,159 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 06:35:15,159 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 06:35:15,163 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 06:35:15,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:35:14" (1/3) ... [2020-11-07 06:35:15,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22711bf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:35:15, skipping insertion in model container [2020-11-07 06:35:15,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:35:14" (2/3) ... [2020-11-07 06:35:15,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22711bf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:35:15, skipping insertion in model container [2020-11-07 06:35:15,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:35:15" (3/3) ... [2020-11-07 06:35:15,166 INFO L111 eAbstractionObserver]: Analyzing ICFG string-2.i [2020-11-07 06:35:15,182 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 06:35:15,187 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 06:35:15,200 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 06:35:15,226 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 06:35:15,227 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 06:35:15,227 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 06:35:15,227 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 06:35:15,227 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 06:35:15,227 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 06:35:15,228 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 06:35:15,228 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 06:35:15,246 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states. [2020-11-07 06:35:15,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-07 06:35:15,258 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:35:15,259 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:35:15,260 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:35:15,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:35:15,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1931188946, now seen corresponding path program 1 times [2020-11-07 06:35:15,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:35:15,280 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1334285086] [2020-11-07 06:35:15,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:35:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:15,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:35:15,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:15,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:35:15,581 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1334285086] [2020-11-07 06:35:15,586 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:35:15,587 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-07 06:35:15,588 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795908368] [2020-11-07 06:35:15,598 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-07 06:35:15,599 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:35:15,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-07 06:35:15,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-07 06:35:15,638 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 3 states. [2020-11-07 06:35:16,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:35:16,134 INFO L93 Difference]: Finished difference Result 200 states and 230 transitions. [2020-11-07 06:35:16,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-07 06:35:16,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2020-11-07 06:35:16,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:35:16,146 INFO L225 Difference]: With dead ends: 200 [2020-11-07 06:35:16,146 INFO L226 Difference]: Without dead ends: 83 [2020-11-07 06:35:16,151 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-07 06:35:16,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-11-07 06:35:16,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2020-11-07 06:35:16,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-11-07 06:35:16,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2020-11-07 06:35:16,211 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 43 [2020-11-07 06:35:16,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:35:16,212 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2020-11-07 06:35:16,212 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-07 06:35:16,212 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2020-11-07 06:35:16,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-11-07 06:35:16,215 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:35:16,215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:35:16,215 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 06:35:16,215 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:35:16,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:35:16,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1726206385, now seen corresponding path program 1 times [2020-11-07 06:35:16,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:35:16,217 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [475034245] [2020-11-07 06:35:16,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:35:16,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:16,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:35:16,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:16,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:35:16,351 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [475034245] [2020-11-07 06:35:16,351 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:35:16,352 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 06:35:16,352 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483011428] [2020-11-07 06:35:16,354 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 06:35:16,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:35:16,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 06:35:16,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 06:35:16,355 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 4 states. [2020-11-07 06:35:16,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:35:16,659 INFO L93 Difference]: Finished difference Result 152 states and 163 transitions. [2020-11-07 06:35:16,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 06:35:16,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2020-11-07 06:35:16,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:35:16,662 INFO L225 Difference]: With dead ends: 152 [2020-11-07 06:35:16,662 INFO L226 Difference]: Without dead ends: 95 [2020-11-07 06:35:16,663 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 06:35:16,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-11-07 06:35:16,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2020-11-07 06:35:16,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-11-07 06:35:16,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2020-11-07 06:35:16,679 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 47 [2020-11-07 06:35:16,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:35:16,679 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2020-11-07 06:35:16,680 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 06:35:16,680 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2020-11-07 06:35:16,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-07 06:35:16,682 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:35:16,682 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 06:35:16,682 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 06:35:16,683 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:35:16,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:35:16,683 INFO L82 PathProgramCache]: Analyzing trace with hash 531359868, now seen corresponding path program 1 times [2020-11-07 06:35:16,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:35:16,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1806911983] [2020-11-07 06:35:16,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:35:16,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:16,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:35:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:16,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-07 06:35:16,834 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1806911983] [2020-11-07 06:35:16,834 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:35:16,835 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-11-07 06:35:16,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376895305] [2020-11-07 06:35:16,835 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 06:35:16,836 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:35:16,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 06:35:16,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-07 06:35:16,837 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand 6 states. [2020-11-07 06:35:17,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:35:17,203 INFO L93 Difference]: Finished difference Result 160 states and 170 transitions. [2020-11-07 06:35:17,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 06:35:17,204 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2020-11-07 06:35:17,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:35:17,206 INFO L225 Difference]: With dead ends: 160 [2020-11-07 06:35:17,206 INFO L226 Difference]: Without dead ends: 102 [2020-11-07 06:35:17,207 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-11-07 06:35:17,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-11-07 06:35:17,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 92. [2020-11-07 06:35:17,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-11-07 06:35:17,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2020-11-07 06:35:17,221 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 61 [2020-11-07 06:35:17,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:35:17,222 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2020-11-07 06:35:17,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 06:35:17,222 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2020-11-07 06:35:17,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-11-07 06:35:17,224 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:35:17,224 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-07 06:35:17,225 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 06:35:17,225 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:35:17,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:35:17,226 INFO L82 PathProgramCache]: Analyzing trace with hash 2109050272, now seen corresponding path program 2 times [2020-11-07 06:35:17,226 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:35:17,226 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2075062975] [2020-11-07 06:35:17,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:35:17,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:17,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:35:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:17,431 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-11-07 06:35:17,432 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2075062975] [2020-11-07 06:35:17,432 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:35:17,432 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-11-07 06:35:17,433 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119171263] [2020-11-07 06:35:17,433 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 06:35:17,433 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:35:17,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 06:35:17,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-07 06:35:17,435 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand 6 states. [2020-11-07 06:35:17,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:35:17,736 INFO L93 Difference]: Finished difference Result 150 states and 159 transitions. [2020-11-07 06:35:17,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 06:35:17,737 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2020-11-07 06:35:17,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:35:17,739 INFO L225 Difference]: With dead ends: 150 [2020-11-07 06:35:17,739 INFO L226 Difference]: Without dead ends: 104 [2020-11-07 06:35:17,740 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-11-07 06:35:17,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-11-07 06:35:17,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99. [2020-11-07 06:35:17,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-11-07 06:35:17,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2020-11-07 06:35:17,754 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 68 [2020-11-07 06:35:17,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:35:17,755 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2020-11-07 06:35:17,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 06:35:17,755 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2020-11-07 06:35:17,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-11-07 06:35:17,758 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:35:17,758 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-07 06:35:17,759 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 06:35:17,759 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:35:17,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:35:17,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1042508207, now seen corresponding path program 3 times [2020-11-07 06:35:17,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:35:17,760 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [566472821] [2020-11-07 06:35:17,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:35:17,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:17,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:35:17,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:17,954 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-11-07 06:35:17,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [566472821] [2020-11-07 06:35:17,958 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:35:17,958 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 06:35:17,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264976059] [2020-11-07 06:35:17,959 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 06:35:17,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:35:17,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 06:35:17,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-07 06:35:17,961 INFO L87 Difference]: Start difference. First operand 99 states and 104 transitions. Second operand 8 states. [2020-11-07 06:35:18,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:35:18,307 INFO L93 Difference]: Finished difference Result 176 states and 186 transitions. [2020-11-07 06:35:18,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 06:35:18,309 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 75 [2020-11-07 06:35:18,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:35:18,311 INFO L225 Difference]: With dead ends: 176 [2020-11-07 06:35:18,311 INFO L226 Difference]: Without dead ends: 111 [2020-11-07 06:35:18,312 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-11-07 06:35:18,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-11-07 06:35:18,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2020-11-07 06:35:18,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-11-07 06:35:18,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2020-11-07 06:35:18,325 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 75 [2020-11-07 06:35:18,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:35:18,325 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2020-11-07 06:35:18,325 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 06:35:18,326 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2020-11-07 06:35:18,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-11-07 06:35:18,329 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:35:18,329 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:35:18,329 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 06:35:18,329 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:35:18,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:35:18,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1786539125, now seen corresponding path program 4 times [2020-11-07 06:35:18,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:35:18,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1094382923] [2020-11-07 06:35:18,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:35:18,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:18,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:35:18,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:18,520 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-11-07 06:35:18,521 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1094382923] [2020-11-07 06:35:18,521 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:35:18,521 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 06:35:18,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080221732] [2020-11-07 06:35:18,523 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 06:35:18,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:35:18,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 06:35:18,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:35:18,525 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand 10 states. [2020-11-07 06:35:18,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:35:18,908 INFO L93 Difference]: Finished difference Result 183 states and 193 transitions. [2020-11-07 06:35:18,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 06:35:18,909 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 82 [2020-11-07 06:35:18,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:35:18,910 INFO L225 Difference]: With dead ends: 183 [2020-11-07 06:35:18,911 INFO L226 Difference]: Without dead ends: 118 [2020-11-07 06:35:18,912 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2020-11-07 06:35:18,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-11-07 06:35:18,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 113. [2020-11-07 06:35:18,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-11-07 06:35:18,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 118 transitions. [2020-11-07 06:35:18,926 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 118 transitions. Word has length 82 [2020-11-07 06:35:18,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:35:18,926 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 118 transitions. [2020-11-07 06:35:18,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 06:35:18,927 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 118 transitions. [2020-11-07 06:35:18,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-11-07 06:35:18,928 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:35:18,929 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2020-11-07 06:35:18,929 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 06:35:18,929 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:35:18,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:35:18,930 INFO L82 PathProgramCache]: Analyzing trace with hash 2016028113, now seen corresponding path program 5 times [2020-11-07 06:35:18,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:35:18,930 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1283942316] [2020-11-07 06:35:18,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:35:18,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:19,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:35:19,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:19,131 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-11-07 06:35:19,131 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1283942316] [2020-11-07 06:35:19,132 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:35:19,132 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 06:35:19,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770835864] [2020-11-07 06:35:19,133 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 06:35:19,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:35:19,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 06:35:19,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-11-07 06:35:19,134 INFO L87 Difference]: Start difference. First operand 113 states and 118 transitions. Second operand 12 states. [2020-11-07 06:35:19,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:35:19,513 INFO L93 Difference]: Finished difference Result 185 states and 195 transitions. [2020-11-07 06:35:19,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-07 06:35:19,514 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 89 [2020-11-07 06:35:19,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:35:19,516 INFO L225 Difference]: With dead ends: 185 [2020-11-07 06:35:19,516 INFO L226 Difference]: Without dead ends: 120 [2020-11-07 06:35:19,517 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2020-11-07 06:35:19,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-11-07 06:35:19,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2020-11-07 06:35:19,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-11-07 06:35:19,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 125 transitions. [2020-11-07 06:35:19,530 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 125 transitions. Word has length 89 [2020-11-07 06:35:19,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:35:19,531 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 125 transitions. [2020-11-07 06:35:19,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 06:35:19,531 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 125 transitions. [2020-11-07 06:35:19,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-11-07 06:35:19,532 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:35:19,533 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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] [2020-11-07 06:35:19,533 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 06:35:19,533 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:35:19,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:35:19,534 INFO L82 PathProgramCache]: Analyzing trace with hash 741764341, now seen corresponding path program 6 times [2020-11-07 06:35:19,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:35:19,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [189638912] [2020-11-07 06:35:19,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:35:19,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:19,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:35:19,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:19,673 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-11-07 06:35:19,673 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [189638912] [2020-11-07 06:35:19,673 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:35:19,674 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 06:35:19,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421308692] [2020-11-07 06:35:19,674 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 06:35:19,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:35:19,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 06:35:19,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-07 06:35:19,676 INFO L87 Difference]: Start difference. First operand 120 states and 125 transitions. Second operand 8 states. [2020-11-07 06:35:19,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:35:19,916 INFO L93 Difference]: Finished difference Result 178 states and 187 transitions. [2020-11-07 06:35:19,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 06:35:19,918 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2020-11-07 06:35:19,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:35:19,919 INFO L225 Difference]: With dead ends: 178 [2020-11-07 06:35:19,920 INFO L226 Difference]: Without dead ends: 132 [2020-11-07 06:35:19,921 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-11-07 06:35:19,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-11-07 06:35:19,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 127. [2020-11-07 06:35:19,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-11-07 06:35:19,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2020-11-07 06:35:19,947 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 96 [2020-11-07 06:35:19,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:35:19,948 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2020-11-07 06:35:19,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 06:35:19,949 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2020-11-07 06:35:19,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-11-07 06:35:19,951 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:35:19,955 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 06:35:19,955 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 06:35:19,955 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:35:19,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:35:19,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1731640668, now seen corresponding path program 7 times [2020-11-07 06:35:19,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:35:19,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1617060710] [2020-11-07 06:35:19,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:35:20,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:20,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:35:20,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:20,170 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-11-07 06:35:20,173 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1617060710] [2020-11-07 06:35:20,173 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:35:20,174 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 06:35:20,175 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562770454] [2020-11-07 06:35:20,176 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 06:35:20,182 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:35:20,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 06:35:20,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:35:20,184 INFO L87 Difference]: Start difference. First operand 127 states and 132 transitions. Second operand 10 states. [2020-11-07 06:35:20,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:35:20,614 INFO L93 Difference]: Finished difference Result 185 states and 194 transitions. [2020-11-07 06:35:20,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 06:35:20,614 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 103 [2020-11-07 06:35:20,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:35:20,617 INFO L225 Difference]: With dead ends: 185 [2020-11-07 06:35:20,617 INFO L226 Difference]: Without dead ends: 139 [2020-11-07 06:35:20,618 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2020-11-07 06:35:20,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-11-07 06:35:20,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 134. [2020-11-07 06:35:20,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-11-07 06:35:20,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 139 transitions. [2020-11-07 06:35:20,645 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 139 transitions. Word has length 103 [2020-11-07 06:35:20,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:35:20,645 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 139 transitions. [2020-11-07 06:35:20,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 06:35:20,646 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 139 transitions. [2020-11-07 06:35:20,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2020-11-07 06:35:20,647 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:35:20,647 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 06:35:20,647 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 06:35:20,648 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:35:20,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:35:20,648 INFO L82 PathProgramCache]: Analyzing trace with hash -170558699, now seen corresponding path program 8 times [2020-11-07 06:35:20,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:35:20,649 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1774230927] [2020-11-07 06:35:20,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:35:20,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:20,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:35:20,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:35:20,854 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-11-07 06:35:20,854 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1774230927] [2020-11-07 06:35:20,855 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:35:20,856 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 06:35:20,856 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983735400] [2020-11-07 06:35:20,856 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 06:35:20,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:35:20,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 06:35:20,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-11-07 06:35:20,858 INFO L87 Difference]: Start difference. First operand 134 states and 139 transitions. Second operand 12 states. [2020-11-07 06:35:21,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:35:21,266 INFO L93 Difference]: Finished difference Result 187 states and 196 transitions. [2020-11-07 06:35:21,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-07 06:35:21,267 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 110 [2020-11-07 06:35:21,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:35:21,269 INFO L225 Difference]: With dead ends: 187 [2020-11-07 06:35:21,269 INFO L226 Difference]: Without dead ends: 141 [2020-11-07 06:35:21,270 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2020-11-07 06:35:21,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-11-07 06:35:21,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2020-11-07 06:35:21,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-11-07 06:35:21,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 146 transitions. [2020-11-07 06:35:21,281 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 146 transitions. Word has length 110 [2020-11-07 06:35:21,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:35:21,282 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 146 transitions. [2020-11-07 06:35:21,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 06:35:21,282 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 146 transitions. [2020-11-07 06:35:21,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-11-07 06:35:21,283 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:35:21,283 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 06:35:21,284 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 06:35:21,284 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:35:21,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:35:21,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1454273732, now seen corresponding path program 9 times [2020-11-07 06:35:21,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:35:21,285 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [702854176] [2020-11-07 06:35:21,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:35:21,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 06:35:21,321 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 06:35:21,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 06:35:21,352 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 06:35:21,396 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-11-07 06:35:21,396 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-07 06:35:21,397 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 06:35:21,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:35:21 BoogieIcfgContainer [2020-11-07 06:35:21,494 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 06:35:21,497 INFO L168 Benchmark]: Toolchain (without parser) took 7346.73 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 127.5 MB in the beginning and 84.6 MB in the end (delta: 42.9 MB). Peak memory consumption was 74.8 MB. Max. memory is 8.0 GB. [2020-11-07 06:35:21,499 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 125.8 MB. Free memory was 99.4 MB in the beginning and 99.4 MB in the end (delta: 67.8 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 06:35:21,500 INFO L168 Benchmark]: CACSL2BoogieTranslator took 291.49 ms. Allocated memory is still 151.0 MB. Free memory was 126.9 MB in the beginning and 116.8 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2020-11-07 06:35:21,504 INFO L168 Benchmark]: Boogie Preprocessor took 49.43 ms. Allocated memory is still 151.0 MB. Free memory was 116.8 MB in the beginning and 115.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 06:35:21,507 INFO L168 Benchmark]: RCFGBuilder took 653.30 ms. Allocated memory is still 151.0 MB. Free memory was 114.9 MB in the beginning and 116.8 MB in the end (delta: -1.9 MB). Peak memory consumption was 10.0 MB. Max. memory is 8.0 GB. [2020-11-07 06:35:21,509 INFO L168 Benchmark]: TraceAbstraction took 6334.39 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 116.5 MB in the beginning and 84.6 MB in the end (delta: 31.8 MB). Peak memory consumption was 63.8 MB. Max. memory is 8.0 GB. [2020-11-07 06:35:21,515 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 125.8 MB. Free memory was 99.4 MB in the beginning and 99.4 MB in the end (delta: 67.8 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 291.49 ms. Allocated memory is still 151.0 MB. Free memory was 126.9 MB in the beginning and 116.8 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 49.43 ms. Allocated memory is still 151.0 MB. Free memory was 116.8 MB in the beginning and 115.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 653.30 ms. Allocated memory is still 151.0 MB. Free memory was 114.9 MB in the beginning and 116.8 MB in the end (delta: -1.9 MB). Peak memory consumption was 10.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 6334.39 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 116.5 MB in the beginning and 84.6 MB in the end (delta: 31.8 MB). Peak memory consumption was 63.8 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 12]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of shiftLeft at line 69. Possible FailurePath: [L31] char string_A[5], string_B[5]; VAL [string_A={9:0}, string_B={6:0}] [L32] int i, j, nc_A, nc_B, found=0; VAL [found=0, string_A={9:0}, string_B={6:0}] [L35] i=0 VAL [found=0, i=0, string_A={9:0}, string_B={6:0}] [L35] COND TRUE i<5 VAL [found=0, i=0, string_A={9:0}, string_B={6:0}] [L36] string_A[i]=__VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, found=0, i=0, string_A={9:0}, string_B={6:0}] [L35] i++ VAL [found=0, i=1, string_A={9:0}, string_B={6:0}] [L35] COND TRUE i<5 VAL [found=0, i=1, string_A={9:0}, string_B={6:0}] [L36] string_A[i]=__VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-2, found=0, i=1, string_A={9:0}, string_B={6:0}] [L35] i++ VAL [found=0, i=2, string_A={9:0}, string_B={6:0}] [L35] COND TRUE i<5 VAL [found=0, i=2, string_A={9:0}, string_B={6:0}] [L36] string_A[i]=__VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-3, found=0, i=2, string_A={9:0}, string_B={6:0}] [L35] i++ VAL [found=0, i=3, string_A={9:0}, string_B={6:0}] [L35] COND TRUE i<5 VAL [found=0, i=3, string_A={9:0}, string_B={6:0}] [L36] string_A[i]=__VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-4, found=0, i=3, string_A={9:0}, string_B={6:0}] [L35] i++ VAL [found=0, i=4, string_A={9:0}, string_B={6:0}] [L35] COND TRUE i<5 VAL [found=0, i=4, string_A={9:0}, string_B={6:0}] [L36] string_A[i]=__VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, found=0, i=4, string_A={9:0}, string_B={6:0}] [L35] i++ VAL [found=0, i=5, string_A={9:0}, string_B={6:0}] [L35] COND FALSE !(i<5) VAL [found=0, i=5, string_A={9:0}, string_B={6:0}] [L37] EXPR string_A[5 -1] VAL [found=0, i=5, string_A={9:0}, string_A[5 -1]=0, string_B={6:0}] [L37] COND FALSE !(!(string_A[5 -1]=='\0')) VAL [found=0, i=5, string_A={9:0}, string_A[5 -1]=0, string_B={6:0}] [L39] i=0 VAL [found=0, i=0, string_A={9:0}, string_B={6:0}] [L39] COND TRUE i<5 VAL [found=0, i=0, string_A={9:0}, string_B={6:0}] [L40] string_B[i]=__VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, found=0, i=0, string_A={9:0}, string_B={6:0}] [L39] i++ VAL [found=0, i=1, string_A={9:0}, string_B={6:0}] [L39] COND TRUE i<5 VAL [found=0, i=1, string_A={9:0}, string_B={6:0}] [L40] string_B[i]=__VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-7, found=0, i=1, string_A={9:0}, string_B={6:0}] [L39] i++ VAL [found=0, i=2, string_A={9:0}, string_B={6:0}] [L39] COND TRUE i<5 VAL [found=0, i=2, string_A={9:0}, string_B={6:0}] [L40] string_B[i]=__VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-8, found=0, i=2, string_A={9:0}, string_B={6:0}] [L39] i++ VAL [found=0, i=3, string_A={9:0}, string_B={6:0}] [L39] COND TRUE i<5 VAL [found=0, i=3, string_A={9:0}, string_B={6:0}] [L40] string_B[i]=__VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-9, found=0, i=3, string_A={9:0}, string_B={6:0}] [L39] i++ VAL [found=0, i=4, string_A={9:0}, string_B={6:0}] [L39] COND TRUE i<5 VAL [found=0, i=4, string_A={9:0}, string_B={6:0}] [L40] string_B[i]=__VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, found=0, i=4, string_A={9:0}, string_B={6:0}] [L39] i++ VAL [found=0, i=5, string_A={9:0}, string_B={6:0}] [L39] COND FALSE !(i<5) VAL [found=0, i=5, string_A={9:0}, string_B={6:0}] [L41] EXPR string_B[5 -1] VAL [found=0, i=5, string_A={9:0}, string_B={6:0}, string_B[5 -1]=0] [L41] COND FALSE !(!(string_B[5 -1]=='\0')) VAL [found=0, i=5, string_A={9:0}, string_B={6:0}, string_B[5 -1]=0] [L43] nc_A = 0 VAL [found=0, i=5, nc_A=0, string_A={9:0}, string_B={6:0}] [L44] EXPR string_A[nc_A] VAL [found=0, i=5, nc_A=0, string_A={9:0}, string_A[nc_A]=0, string_B={6:0}] [L44] COND FALSE !(string_A[nc_A]!='\0') VAL [found=0, i=5, nc_A=0, string_A={9:0}, string_A[nc_A]=0, string_B={6:0}] [L47] nc_B = 0 VAL [found=0, i=5, nc_A=0, nc_B=0, string_A={9:0}, string_B={6:0}] [L48] EXPR string_B[nc_B] VAL [found=0, i=5, nc_A=0, nc_B=0, string_A={9:0}, string_B={6:0}, string_B[nc_B]=0] [L48] COND FALSE !(string_B[nc_B]!='\0') VAL [found=0, i=5, nc_A=0, nc_B=0, string_A={9:0}, string_B={6:0}, string_B[nc_B]=0] [L51] COND FALSE !(!(nc_B >= nc_A)) VAL [found=0, i=5, nc_A=0, nc_B=0, string_A={9:0}, string_B={6:0}] [L54] EXPR j=0 VAL [found=0, i=5, j=0, nc_A=0, nc_B=0, string_A={9:0}, string_B={6:0}] [L54] i=j=0 VAL [found=0, i=0, j=0, nc_A=0, nc_B=0, string_A={9:0}, string_B={6:0}] [L55] COND FALSE !((inc_B-1)<