/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/loop-invgen/nested9.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 06:39:30,516 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 06:39:30,519 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 06:39:30,573 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 06:39:30,574 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 06:39:30,578 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 06:39:30,583 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 06:39:30,591 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 06:39:30,595 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 06:39:30,602 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 06:39:30,604 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 06:39:30,605 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 06:39:30,605 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 06:39:30,608 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 06:39:30,610 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 06:39:30,612 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 06:39:30,613 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 06:39:30,617 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 06:39:30,624 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 06:39:30,630 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 06:39:30,633 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 06:39:30,635 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 06:39:30,636 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 06:39:30,638 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 06:39:30,654 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 06:39:30,655 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 06:39:30,655 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 06:39:30,659 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 06:39:30,660 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 06:39:30,661 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 06:39:30,661 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 06:39:30,662 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 06:39:30,664 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 06:39:30,665 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 06:39:30,666 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 06:39:30,666 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 06:39:30,667 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 06:39:30,667 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 06:39:30,667 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 06:39:30,668 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 06:39:30,669 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 06:39:30,670 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:39:30,685 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 06:39:30,686 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 06:39:30,690 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 06:39:30,690 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 06:39:30,690 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 06:39:30,691 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 06:39:30,691 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 06:39:30,691 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 06:39:30,691 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 06:39:30,692 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 06:39:30,693 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 06:39:30,693 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 06:39:30,693 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 06:39:30,693 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 06:39:30,693 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 06:39:30,694 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 06:39:30,694 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 06:39:30,694 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 06:39:30,694 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 06:39:30,694 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 06:39:30,695 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 06:39:30,695 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 06:39:30,695 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:39:31,092 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 06:39:31,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 06:39:31,137 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 06:39:31,138 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 06:39:31,139 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 06:39:31,140 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/nested9.i [2020-11-07 06:39:31,224 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3af0be9af/b4045901dc1940eba81b3c07afb9a7cc/FLAG0817f1d86 [2020-11-07 06:39:31,842 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 06:39:31,843 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested9.i [2020-11-07 06:39:31,851 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3af0be9af/b4045901dc1940eba81b3c07afb9a7cc/FLAG0817f1d86 [2020-11-07 06:39:32,185 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3af0be9af/b4045901dc1940eba81b3c07afb9a7cc [2020-11-07 06:39:32,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 06:39:32,195 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 06:39:32,199 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 06:39:32,199 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 06:39:32,206 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 06:39:32,207 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:39:32" (1/1) ... [2020-11-07 06:39:32,212 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dd9af01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:39:32, skipping insertion in model container [2020-11-07 06:39:32,212 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:39:32" (1/1) ... [2020-11-07 06:39:32,220 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 06:39:32,241 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 06:39:32,391 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 06:39:32,401 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 06:39:32,421 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 06:39:32,437 INFO L208 MainTranslator]: Completed translation [2020-11-07 06:39:32,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:39:32 WrapperNode [2020-11-07 06:39:32,438 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 06:39:32,439 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 06:39:32,440 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 06:39:32,440 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 06:39:32,454 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:39:32" (1/1) ... [2020-11-07 06:39:32,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:39:32" (1/1) ... [2020-11-07 06:39:32,462 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:39:32" (1/1) ... [2020-11-07 06:39:32,463 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:39:32" (1/1) ... [2020-11-07 06:39:32,469 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:39:32" (1/1) ... [2020-11-07 06:39:32,475 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:39:32" (1/1) ... [2020-11-07 06:39:32,477 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:39:32" (1/1) ... [2020-11-07 06:39:32,479 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 06:39:32,480 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 06:39:32,480 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 06:39:32,481 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 06:39:32,482 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:39:32" (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:39:32,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 06:39:32,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 06:39:32,565 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 06:39:32,565 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-11-07 06:39:32,565 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-11-07 06:39:32,566 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 06:39:32,566 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 06:39:32,566 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 06:39:32,566 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-11-07 06:39:32,567 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-11-07 06:39:32,567 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 06:39:32,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 06:39:32,567 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-11-07 06:39:32,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-11-07 06:39:32,568 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 06:39:32,568 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 06:39:32,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 06:39:32,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 06:39:32,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 06:39:32,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 06:39:32,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 06:39:32,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 06:39:33,356 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 06:39:33,356 INFO L298 CfgBuilder]: Removed 3 assume(true) statements. [2020-11-07 06:39:33,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:39:33 BoogieIcfgContainer [2020-11-07 06:39:33,361 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 06:39:33,363 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 06:39:33,363 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 06:39:33,374 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 06:39:33,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:39:32" (1/3) ... [2020-11-07 06:39:33,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64a7c096 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:39:33, skipping insertion in model container [2020-11-07 06:39:33,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:39:32" (2/3) ... [2020-11-07 06:39:33,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64a7c096 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:39:33, skipping insertion in model container [2020-11-07 06:39:33,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:39:33" (3/3) ... [2020-11-07 06:39:33,377 INFO L111 eAbstractionObserver]: Analyzing ICFG nested9.i [2020-11-07 06:39:33,393 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 06:39:33,398 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 06:39:33,412 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 06:39:33,436 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 06:39:33,437 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 06:39:33,437 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 06:39:33,437 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 06:39:33,437 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 06:39:33,437 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 06:39:33,437 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 06:39:33,437 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 06:39:33,452 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states. [2020-11-07 06:39:33,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-07 06:39:33,463 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:39:33,463 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:39:33,464 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:39:33,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:39:33,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1720334319, now seen corresponding path program 1 times [2020-11-07 06:39:33,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:39:33,481 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [590532565] [2020-11-07 06:39:33,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:39:33,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:33,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:39:33,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:33,886 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:39:33,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [590532565] [2020-11-07 06:39:33,890 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:39:33,891 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 06:39:33,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351174336] [2020-11-07 06:39:33,899 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 06:39:33,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:39:33,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 06:39:33,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-07 06:39:33,926 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 8 states. [2020-11-07 06:39:34,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:39:34,748 INFO L93 Difference]: Finished difference Result 127 states and 161 transitions. [2020-11-07 06:39:34,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 06:39:34,750 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2020-11-07 06:39:34,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:39:34,761 INFO L225 Difference]: With dead ends: 127 [2020-11-07 06:39:34,761 INFO L226 Difference]: Without dead ends: 84 [2020-11-07 06:39:34,765 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2020-11-07 06:39:34,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-11-07 06:39:34,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 73. [2020-11-07 06:39:34,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-11-07 06:39:34,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2020-11-07 06:39:34,850 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 43 [2020-11-07 06:39:34,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:39:34,851 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2020-11-07 06:39:34,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 06:39:34,851 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2020-11-07 06:39:34,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-07 06:39:34,856 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:39:34,856 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:39:34,856 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 06:39:34,856 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:39:34,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:39:34,858 INFO L82 PathProgramCache]: Analyzing trace with hash -545340875, now seen corresponding path program 1 times [2020-11-07 06:39:34,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:39:34,858 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2001079020] [2020-11-07 06:39:34,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:39:34,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:35,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:39:35,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:35,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:39:35,058 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2001079020] [2020-11-07 06:39:35,059 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:39:35,059 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 06:39:35,059 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959300650] [2020-11-07 06:39:35,061 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 06:39:35,061 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:39:35,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 06:39:35,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:39:35,063 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand 10 states. [2020-11-07 06:39:35,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:39:35,930 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2020-11-07 06:39:35,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-07 06:39:35,931 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 49 [2020-11-07 06:39:35,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:39:35,935 INFO L225 Difference]: With dead ends: 97 [2020-11-07 06:39:35,935 INFO L226 Difference]: Without dead ends: 93 [2020-11-07 06:39:35,937 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2020-11-07 06:39:35,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-11-07 06:39:35,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 84. [2020-11-07 06:39:35,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-11-07 06:39:35,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2020-11-07 06:39:35,966 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 49 [2020-11-07 06:39:35,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:39:35,966 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2020-11-07 06:39:35,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 06:39:35,967 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2020-11-07 06:39:35,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-11-07 06:39:35,972 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:39:35,972 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, 1, 1, 1, 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:39:35,972 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 06:39:35,972 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:39:35,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:39:35,973 INFO L82 PathProgramCache]: Analyzing trace with hash 752260360, now seen corresponding path program 1 times [2020-11-07 06:39:35,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:39:35,974 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [808802236] [2020-11-07 06:39:35,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:39:35,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:36,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:39:36,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:36,074 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-07 06:39:36,075 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [808802236] [2020-11-07 06:39:36,075 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:39:36,075 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 06:39:36,075 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656897105] [2020-11-07 06:39:36,076 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 06:39:36,076 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:39:36,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 06:39:36,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 06:39:36,078 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand 6 states. [2020-11-07 06:39:36,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:39:36,424 INFO L93 Difference]: Finished difference Result 150 states and 172 transitions. [2020-11-07 06:39:36,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 06:39:36,424 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2020-11-07 06:39:36,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:39:36,427 INFO L225 Difference]: With dead ends: 150 [2020-11-07 06:39:36,427 INFO L226 Difference]: Without dead ends: 100 [2020-11-07 06:39:36,428 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:39:36,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-11-07 06:39:36,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 88. [2020-11-07 06:39:36,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-11-07 06:39:36,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2020-11-07 06:39:36,454 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 55 [2020-11-07 06:39:36,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:39:36,454 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2020-11-07 06:39:36,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 06:39:36,455 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2020-11-07 06:39:36,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-11-07 06:39:36,457 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:39:36,457 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] [2020-11-07 06:39:36,458 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 06:39:36,458 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:39:36,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:39:36,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1337397749, now seen corresponding path program 1 times [2020-11-07 06:39:36,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:39:36,459 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [874980442] [2020-11-07 06:39:36,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:39:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:36,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:39:36,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:36,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2020-11-07 06:39:36,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:36,644 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-07 06:39:36,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [874980442] [2020-11-07 06:39:36,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:39:36,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 06:39:36,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908810589] [2020-11-07 06:39:36,646 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 06:39:36,646 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:39:36,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 06:39:36,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-11-07 06:39:36,647 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 9 states. [2020-11-07 06:39:37,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:39:37,303 INFO L93 Difference]: Finished difference Result 142 states and 159 transitions. [2020-11-07 06:39:37,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 06:39:37,303 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2020-11-07 06:39:37,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:39:37,305 INFO L225 Difference]: With dead ends: 142 [2020-11-07 06:39:37,305 INFO L226 Difference]: Without dead ends: 89 [2020-11-07 06:39:37,306 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2020-11-07 06:39:37,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-11-07 06:39:37,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2020-11-07 06:39:37,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-11-07 06:39:37,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2020-11-07 06:39:37,329 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 64 [2020-11-07 06:39:37,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:39:37,329 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2020-11-07 06:39:37,329 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 06:39:37,330 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2020-11-07 06:39:37,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-11-07 06:39:37,331 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:39:37,331 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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] [2020-11-07 06:39:37,332 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 06:39:37,332 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:39:37,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:39:37,332 INFO L82 PathProgramCache]: Analyzing trace with hash -2108788121, now seen corresponding path program 2 times [2020-11-07 06:39:37,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:39:37,333 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [657552594] [2020-11-07 06:39:37,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:39:37,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:37,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:39:37,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:37,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-11-07 06:39:37,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:37,494 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-11-07 06:39:37,494 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [657552594] [2020-11-07 06:39:37,495 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:39:37,495 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 06:39:37,495 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922048586] [2020-11-07 06:39:37,496 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 06:39:37,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:39:37,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 06:39:37,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-07 06:39:37,497 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand 8 states. [2020-11-07 06:39:38,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:39:38,113 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2020-11-07 06:39:38,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 06:39:38,113 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2020-11-07 06:39:38,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:39:38,117 INFO L225 Difference]: With dead ends: 116 [2020-11-07 06:39:38,118 INFO L226 Difference]: Without dead ends: 112 [2020-11-07 06:39:38,118 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2020-11-07 06:39:38,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-11-07 06:39:38,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 93. [2020-11-07 06:39:38,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-11-07 06:39:38,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2020-11-07 06:39:38,172 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 70 [2020-11-07 06:39:38,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:39:38,173 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2020-11-07 06:39:38,173 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 06:39:38,173 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2020-11-07 06:39:38,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-11-07 06:39:38,174 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:39:38,174 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:38,175 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 06:39:38,175 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:39:38,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:39:38,180 INFO L82 PathProgramCache]: Analyzing trace with hash -469024378, now seen corresponding path program 3 times [2020-11-07 06:39:38,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:39:38,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [139184933] [2020-11-07 06:39:38,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:39:38,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:38,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:39:38,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:38,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-11-07 06:39:38,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:38,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 06:39:38,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:38,423 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-11-07 06:39:38,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [139184933] [2020-11-07 06:39:38,425 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:39:38,425 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 06:39:38,426 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380003621] [2020-11-07 06:39:38,430 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 06:39:38,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:39:38,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 06:39:38,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:39:38,434 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand 10 states. [2020-11-07 06:39:39,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:39:39,209 INFO L93 Difference]: Finished difference Result 146 states and 162 transitions. [2020-11-07 06:39:39,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 06:39:39,212 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2020-11-07 06:39:39,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:39:39,213 INFO L225 Difference]: With dead ends: 146 [2020-11-07 06:39:39,214 INFO L226 Difference]: Without dead ends: 142 [2020-11-07 06:39:39,214 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2020-11-07 06:39:39,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-11-07 06:39:39,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 102. [2020-11-07 06:39:39,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-11-07 06:39:39,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2020-11-07 06:39:39,254 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 79 [2020-11-07 06:39:39,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:39:39,255 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2020-11-07 06:39:39,255 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 06:39:39,256 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2020-11-07 06:39:39,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-11-07 06:39:39,261 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:39:39,261 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-11-07 06:39:39,262 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 06:39:39,262 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:39:39,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:39:39,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1389623993, now seen corresponding path program 4 times [2020-11-07 06:39:39,263 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:39:39,263 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [939172776] [2020-11-07 06:39:39,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:39:39,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:39,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:39:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:39,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-11-07 06:39:39,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:39,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 06:39:39,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:39,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-11-07 06:39:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:39,503 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-11-07 06:39:39,504 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [939172776] [2020-11-07 06:39:39,504 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:39:39,504 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 06:39:39,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697804045] [2020-11-07 06:39:39,505 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 06:39:39,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:39:39,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 06:39:39,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-11-07 06:39:39,506 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. Second operand 12 states. [2020-11-07 06:39:40,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:39:40,389 INFO L93 Difference]: Finished difference Result 176 states and 198 transitions. [2020-11-07 06:39:40,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-07 06:39:40,390 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 88 [2020-11-07 06:39:40,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:39:40,394 INFO L225 Difference]: With dead ends: 176 [2020-11-07 06:39:40,394 INFO L226 Difference]: Without dead ends: 172 [2020-11-07 06:39:40,395 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=473, Unknown=0, NotChecked=0, Total=600 [2020-11-07 06:39:40,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2020-11-07 06:39:40,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 111. [2020-11-07 06:39:40,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-11-07 06:39:40,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2020-11-07 06:39:40,422 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 88 [2020-11-07 06:39:40,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:39:40,423 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2020-11-07 06:39:40,423 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 06:39:40,423 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2020-11-07 06:39:40,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-11-07 06:39:40,432 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:39:40,432 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2020-11-07 06:39:40,432 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 06:39:40,432 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:39:40,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:39:40,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1150610086, now seen corresponding path program 5 times [2020-11-07 06:39:40,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:39:40,434 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [229710422] [2020-11-07 06:39:40,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:39:40,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:40,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:39:40,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:40,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-11-07 06:39:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:40,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 06:39:40,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:40,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-11-07 06:39:40,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:40,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-11-07 06:39:40,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:40,758 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 8 proven. 51 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-11-07 06:39:40,758 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [229710422] [2020-11-07 06:39:40,758 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:39:40,759 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-11-07 06:39:40,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603474362] [2020-11-07 06:39:40,759 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-07 06:39:40,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:39:40,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-07 06:39:40,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2020-11-07 06:39:40,761 INFO L87 Difference]: Start difference. First operand 111 states and 121 transitions. Second operand 16 states. [2020-11-07 06:39:42,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:39:42,982 INFO L93 Difference]: Finished difference Result 163 states and 182 transitions. [2020-11-07 06:39:42,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-11-07 06:39:42,982 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 97 [2020-11-07 06:39:42,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:39:42,984 INFO L225 Difference]: With dead ends: 163 [2020-11-07 06:39:42,984 INFO L226 Difference]: Without dead ends: 159 [2020-11-07 06:39:42,986 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=444, Invalid=1812, Unknown=0, NotChecked=0, Total=2256 [2020-11-07 06:39:42,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2020-11-07 06:39:43,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 132. [2020-11-07 06:39:43,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-11-07 06:39:43,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 148 transitions. [2020-11-07 06:39:43,012 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 148 transitions. Word has length 97 [2020-11-07 06:39:43,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:39:43,012 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 148 transitions. [2020-11-07 06:39:43,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-07 06:39:43,013 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 148 transitions. [2020-11-07 06:39:43,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2020-11-07 06:39:43,014 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:39:43,014 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:39:43,015 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 06:39:43,015 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:39:43,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:39:43,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1372166708, now seen corresponding path program 6 times [2020-11-07 06:39:43,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:39:43,016 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1850402424] [2020-11-07 06:39:43,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:39:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:43,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:39:43,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:43,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-11-07 06:39:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:43,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 06:39:43,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:43,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 06:39:43,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:43,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-11-07 06:39:43,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:43,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2020-11-07 06:39:43,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:43,132 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2020-11-07 06:39:43,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1850402424] [2020-11-07 06:39:43,132 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:39:43,132 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 06:39:43,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325388511] [2020-11-07 06:39:43,133 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 06:39:43,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:39:43,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 06:39:43,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-07 06:39:43,134 INFO L87 Difference]: Start difference. First operand 132 states and 148 transitions. Second operand 7 states. [2020-11-07 06:39:43,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:39:43,597 INFO L93 Difference]: Finished difference Result 214 states and 243 transitions. [2020-11-07 06:39:43,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 06:39:43,597 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 112 [2020-11-07 06:39:43,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:39:43,599 INFO L225 Difference]: With dead ends: 214 [2020-11-07 06:39:43,599 INFO L226 Difference]: Without dead ends: 134 [2020-11-07 06:39:43,601 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2020-11-07 06:39:43,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-11-07 06:39:43,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2020-11-07 06:39:43,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-11-07 06:39:43,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 147 transitions. [2020-11-07 06:39:43,630 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 147 transitions. Word has length 112 [2020-11-07 06:39:43,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:39:43,630 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 147 transitions. [2020-11-07 06:39:43,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 06:39:43,631 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 147 transitions. [2020-11-07 06:39:43,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2020-11-07 06:39:43,632 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:39:43,632 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2020-11-07 06:39:43,633 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 06:39:43,633 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:39:43,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:39:43,633 INFO L82 PathProgramCache]: Analyzing trace with hash -2139141218, now seen corresponding path program 7 times [2020-11-07 06:39:43,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:39:43,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1518698204] [2020-11-07 06:39:43,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:39:43,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:43,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:39:43,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:43,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2020-11-07 06:39:43,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:43,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 06:39:43,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:43,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 06:39:43,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:43,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-11-07 06:39:43,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:43,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2020-11-07 06:39:43,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:43,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-11-07 06:39:43,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:43,858 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 69 proven. 47 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2020-11-07 06:39:43,858 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1518698204] [2020-11-07 06:39:43,859 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:39:43,859 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 06:39:43,859 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893047645] [2020-11-07 06:39:43,859 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 06:39:43,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:39:43,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 06:39:43,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-07 06:39:43,861 INFO L87 Difference]: Start difference. First operand 132 states and 147 transitions. Second operand 8 states. [2020-11-07 06:39:44,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:39:44,216 INFO L93 Difference]: Finished difference Result 132 states and 147 transitions. [2020-11-07 06:39:44,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 06:39:44,217 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 127 [2020-11-07 06:39:44,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:39:44,218 INFO L225 Difference]: With dead ends: 132 [2020-11-07 06:39:44,218 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 06:39:44,219 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-11-07 06:39:44,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 06:39:44,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 06:39:44,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 06:39:44,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 06:39:44,220 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 127 [2020-11-07 06:39:44,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:39:44,220 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 06:39:44,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 06:39:44,220 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 06:39:44,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 06:39:44,220 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 06:39:44,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 06:39:44,698 WARN L194 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 76 [2020-11-07 06:39:44,862 WARN L194 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 69 [2020-11-07 06:39:45,614 WARN L194 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 18 [2020-11-07 06:39:45,724 WARN L194 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 12 [2020-11-07 06:39:46,025 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 12) the Hoare annotation is: true [2020-11-07 06:39:46,025 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 12) the Hoare annotation is: true [2020-11-07 06:39:46,025 INFO L269 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-11-07 06:39:46,025 INFO L269 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-11-07 06:39:46,026 INFO L269 CegarLoopResult]: At program point L12-3(line 12) the Hoare annotation is: true [2020-11-07 06:39:46,026 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) the Hoare annotation is: true [2020-11-07 06:39:46,026 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 06:39:46,026 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 06:39:46,026 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-11-07 06:39:46,026 INFO L269 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-11-07 06:39:46,026 INFO L269 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-11-07 06:39:46,026 INFO L269 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-11-07 06:39:46,027 INFO L262 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#t~string0.offset| |old(#t~string0.offset)|) (= |old(#length)| |#length|) (= |#t~string1.base| |old(#t~string1.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string0.base| |old(#t~string0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|) (= |#t~string1.offset| |old(#t~string1.offset)|)) [2020-11-07 06:39:46,027 INFO L269 CegarLoopResult]: At program point L12-3(line 12) the Hoare annotation is: true [2020-11-07 06:39:46,027 INFO L269 CegarLoopResult]: At program point L12-4(line 12) the Hoare annotation is: true [2020-11-07 06:39:46,027 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 06:39:46,027 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 06:39:46,027 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 06:39:46,027 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 06:39:46,027 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 06:39:46,028 INFO L266 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-11-07 06:39:46,028 INFO L266 CegarLoopResult]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-11-07 06:39:46,028 INFO L266 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2020-11-07 06:39:46,028 INFO L266 CegarLoopResult]: For program point L15-3(lines 14 16) no Hoare annotation was computed. [2020-11-07 06:39:46,028 INFO L266 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2020-11-07 06:39:46,028 INFO L262 CegarLoopResult]: At program point L35-3(lines 35 37) the Hoare annotation is: (and (<= 1 main_~n~0) (<= (+ main_~j~0 1) (* 3 main_~i~0)) (<= (+ main_~i~0 1) main_~n~0)) [2020-11-07 06:39:46,028 INFO L269 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: true [2020-11-07 06:39:46,029 INFO L262 CegarLoopResult]: At program point L35-4(line 35) the Hoare annotation is: (and (<= 1 main_~n~0) (<= (+ main_~j~0 1) (* 3 main_~i~0)) (<= (+ main_~i~0 1) main_~n~0)) [2020-11-07 06:39:46,029 INFO L269 CegarLoopResult]: At program point L31-1(line 31) the Hoare annotation is: true [2020-11-07 06:39:46,029 INFO L262 CegarLoopResult]: At program point L35-5(line 35) the Hoare annotation is: (and (<= 1 main_~n~0) (<= (+ main_~i~0 1) main_~n~0)) [2020-11-07 06:39:46,029 INFO L262 CegarLoopResult]: At program point L35-6(lines 35 37) the Hoare annotation is: (and (<= 1 main_~n~0) (<= (+ main_~i~0 1) main_~n~0)) [2020-11-07 06:39:46,029 INFO L269 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: true [2020-11-07 06:39:46,029 INFO L269 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: true [2020-11-07 06:39:46,029 INFO L269 CegarLoopResult]: At program point L27-2(line 27) the Hoare annotation is: true [2020-11-07 06:39:46,030 INFO L269 CegarLoopResult]: At program point mainEXIT(lines 25 40) the Hoare annotation is: true [2020-11-07 06:39:46,030 INFO L262 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: (and (<= 1 main_~n~0) (<= (+ main_~j~0 1) (* 3 main_~i~0)) (<= (+ main_~i~0 1) main_~n~0)) [2020-11-07 06:39:46,030 INFO L262 CegarLoopResult]: At program point L36-3(line 36) the Hoare annotation is: (and (<= 1 main_~n~0) (<= (+ main_~k~0 1) main_~j~0) (<= (+ main_~j~0 1) (* 3 main_~i~0)) (<= (+ main_~i~0 1) main_~n~0)) [2020-11-07 06:39:46,030 INFO L269 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: true [2020-11-07 06:39:46,030 INFO L262 CegarLoopResult]: At program point L36-4(line 36) the Hoare annotation is: (and (<= 1 main_~n~0) (<= (+ main_~j~0 1) (* 3 main_~i~0)) (<= (+ main_~i~0 1) main_~n~0)) [2020-11-07 06:39:46,030 INFO L269 CegarLoopResult]: At program point L32-1(line 32) the Hoare annotation is: true [2020-11-07 06:39:46,031 INFO L262 CegarLoopResult]: At program point L36-5(lines 36 37) the Hoare annotation is: (and (<= 1 main_~n~0) (<= (+ main_~j~0 1) (* 3 main_~i~0)) (<= (+ main_~i~0 1) main_~n~0)) [2020-11-07 06:39:46,031 INFO L269 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-11-07 06:39:46,031 INFO L269 CegarLoopResult]: At program point L28-1(line 28) the Hoare annotation is: true [2020-11-07 06:39:46,031 INFO L269 CegarLoopResult]: At program point L28-2(line 28) the Hoare annotation is: true [2020-11-07 06:39:46,031 INFO L262 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: (and (<= 1 main_~n~0) (<= (+ main_~k~0 1) main_~j~0) (<= (+ main_~j~0 1) (* 3 main_~i~0)) (<= (+ main_~i~0 1) main_~n~0)) [2020-11-07 06:39:46,031 INFO L262 CegarLoopResult]: At program point L37-1(lines 36 37) the Hoare annotation is: (and (<= 1 main_~n~0) (<= (+ main_~k~0 1) main_~j~0) (<= (+ main_~j~0 1) (* 3 main_~i~0)) (<= (+ main_~i~0 1) main_~n~0)) [2020-11-07 06:39:46,031 INFO L269 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: true [2020-11-07 06:39:46,032 INFO L269 CegarLoopResult]: At program point L33-1(line 33) the Hoare annotation is: true [2020-11-07 06:39:46,032 INFO L269 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: true [2020-11-07 06:39:46,032 INFO L269 CegarLoopResult]: At program point L29-1(line 29) the Hoare annotation is: true [2020-11-07 06:39:46,032 INFO L269 CegarLoopResult]: At program point L29-2(line 29) the Hoare annotation is: true [2020-11-07 06:39:46,032 INFO L269 CegarLoopResult]: At program point mainFINAL(lines 25 40) the Hoare annotation is: true [2020-11-07 06:39:46,032 INFO L269 CegarLoopResult]: At program point L38(lines 25 40) the Hoare annotation is: true [2020-11-07 06:39:46,032 INFO L262 CegarLoopResult]: At program point L34-2(lines 34 37) the Hoare annotation is: (and (<= 1 main_~n~0) (<= (* 3 main_~i~0) main_~j~0) (<= (+ main_~i~0 1) main_~n~0)) [2020-11-07 06:39:46,032 INFO L262 CegarLoopResult]: At program point L34-3(line 34) the Hoare annotation is: (and (<= 1 main_~n~0) (<= (* 3 main_~i~0) main_~j~0) (<= (+ main_~i~0 1) main_~n~0) (<= (+ |main_#t~post6| 2) (* 2 main_~n~0))) [2020-11-07 06:39:46,033 INFO L269 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: true [2020-11-07 06:39:46,033 INFO L262 CegarLoopResult]: At program point L34-4(line 34) the Hoare annotation is: (let ((.cse0 (* 2 main_~n~0))) (and (<= 1 main_~n~0) (<= (+ main_~i~0 1) .cse0) (<= (+ |main_#t~post6| 2) .cse0))) [2020-11-07 06:39:46,033 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 25 40) the Hoare annotation is: true [2020-11-07 06:39:46,033 INFO L269 CegarLoopResult]: At program point L30-1(line 30) the Hoare annotation is: true [2020-11-07 06:39:46,033 INFO L262 CegarLoopResult]: At program point L34-5(lines 34 37) the Hoare annotation is: (or (= main_~i~0 0) (and (<= 1 main_~n~0) (<= (+ main_~i~0 1) (* 2 main_~n~0)))) [2020-11-07 06:39:46,033 INFO L269 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: true [2020-11-07 06:39:46,033 INFO L269 CegarLoopResult]: At program point L26-1(line 26) the Hoare annotation is: true [2020-11-07 06:39:46,033 INFO L269 CegarLoopResult]: At program point L26-2(line 26) the Hoare annotation is: true [2020-11-07 06:39:46,034 INFO L269 CegarLoopResult]: At program point L26-3(line 26) the Hoare annotation is: true [2020-11-07 06:39:46,034 INFO L269 CegarLoopResult]: At program point L26-4(line 26) the Hoare annotation is: true [2020-11-07 06:39:46,034 INFO L262 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: (and (<= 1 main_~n~0) (<= (+ main_~i~0 1) main_~n~0)) [2020-11-07 06:39:46,034 INFO L262 CegarLoopResult]: At program point L18-2(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-11-07 06:39:46,034 INFO L269 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2020-11-07 06:39:46,034 INFO L262 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-11-07 06:39:46,034 INFO L262 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-11-07 06:39:46,034 INFO L262 CegarLoopResult]: At program point L18(lines 18 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-11-07 06:39:46,035 INFO L262 CegarLoopResult]: At program point L19-1(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-11-07 06:39:46,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:39:46 BoogieIcfgContainer [2020-11-07 06:39:46,055 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 06:39:46,057 INFO L168 Benchmark]: Toolchain (without parser) took 13866.25 ms. Allocated memory was 173.0 MB in the beginning and 308.3 MB in the end (delta: 135.3 MB). Free memory was 149.3 MB in the beginning and 226.7 MB in the end (delta: -77.5 MB). Peak memory consumption was 176.9 MB. Max. memory is 8.0 GB. [2020-11-07 06:39:46,057 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 173.0 MB. Free memory is still 148.5 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 06:39:46,058 INFO L168 Benchmark]: CACSL2BoogieTranslator took 240.08 ms. Allocated memory is still 173.0 MB. Free memory was 148.8 MB in the beginning and 139.1 MB in the end (delta: 9.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2020-11-07 06:39:46,059 INFO L168 Benchmark]: Boogie Preprocessor took 40.03 ms. Allocated memory is still 173.0 MB. Free memory was 139.1 MB in the beginning and 137.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 06:39:46,060 INFO L168 Benchmark]: RCFGBuilder took 881.33 ms. Allocated memory is still 173.0 MB. Free memory was 137.2 MB in the beginning and 155.0 MB in the end (delta: -17.8 MB). Peak memory consumption was 20.4 MB. Max. memory is 8.0 GB. [2020-11-07 06:39:46,060 INFO L168 Benchmark]: TraceAbstraction took 12691.64 ms. Allocated memory was 173.0 MB in the beginning and 308.3 MB in the end (delta: 135.3 MB). Free memory was 154.5 MB in the beginning and 226.7 MB in the end (delta: -72.2 MB). Peak memory consumption was 181.6 MB. Max. memory is 8.0 GB. [2020-11-07 06:39:46,064 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.22 ms. Allocated memory is still 173.0 MB. Free memory is still 148.5 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 240.08 ms. Allocated memory is still 173.0 MB. Free memory was 148.8 MB in the beginning and 139.1 MB in the end (delta: 9.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 40.03 ms. Allocated memory is still 173.0 MB. Free memory was 139.1 MB in the beginning and 137.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 881.33 ms. Allocated memory is still 173.0 MB. Free memory was 137.2 MB in the beginning and 155.0 MB in the end (delta: -17.8 MB). Peak memory consumption was 20.4 MB. Max. memory is 8.0 GB. * TraceAbstraction took 12691.64 ms. Allocated memory was 173.0 MB in the beginning and 308.3 MB in the end (delta: 135.3 MB). Free memory was 154.5 MB in the beginning and 226.7 MB in the end (delta: -72.2 MB). Peak memory consumption was 181.6 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: 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: 25]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: 1 <= n && i + 1 <= n - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: i == 0 || (1 <= n && i + 1 <= 2 * n) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: (1 <= n && j + 1 <= 3 * i) && i + 1 <= n - ProcedureContractResult [Line: 12]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 25]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 10.7s, OverallIterations: 10, TraceHistogramMax: 7, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 481 SDtfs, 1141 SDslu, 840 SDs, 0 SdLazy, 2983 SolverSat, 204 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 253 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred in iteration=8, 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, 10 MinimizatonAttempts, 183 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 67 LocationsWithAnnotation, 271 PreInvPairs, 369 NumberOfFragments, 342 HoareAnnotationTreeSize, 271 FomulaSimplifications, 1359927 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 67 FomulaSimplificationsInter, 3552 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 784 NumberOfCodeBlocks, 784 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 774 ConstructedInterpolants, 0 QuantifiedInterpolants, 185178 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 448/600 InterpolantCoveringCapability, 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...