/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --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.1.25-3af5e1f [2020-09-04 23:10:35,550 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 23:10:35,556 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 23:10:35,605 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 23:10:35,605 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 23:10:35,617 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 23:10:35,619 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 23:10:35,624 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 23:10:35,628 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 23:10:35,631 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 23:10:35,633 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 23:10:35,634 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 23:10:35,634 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 23:10:35,639 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 23:10:35,643 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 23:10:35,645 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 23:10:35,647 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 23:10:35,648 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 23:10:35,651 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 23:10:35,659 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 23:10:35,660 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 23:10:35,662 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 23:10:35,663 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 23:10:35,664 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 23:10:35,669 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 23:10:35,669 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 23:10:35,669 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 23:10:35,672 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 23:10:35,672 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 23:10:35,674 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 23:10:35,675 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 23:10:35,676 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 23:10:35,676 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 23:10:35,677 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 23:10:35,679 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 23:10:35,679 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 23:10:35,680 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 23:10:35,680 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 23:10:35,680 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 23:10:35,681 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 23:10:35,683 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 23:10:35,684 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 23:10:35,706 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 23:10:35,706 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 23:10:35,709 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 23:10:35,709 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 23:10:35,709 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 23:10:35,710 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 23:10:35,710 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 23:10:35,710 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 23:10:35,710 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 23:10:35,711 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 23:10:35,712 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 23:10:35,712 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 23:10:35,712 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 23:10:35,712 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 23:10:35,713 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 23:10:35,713 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 23:10:35,713 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 23:10:35,714 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 23:10:35,714 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 23:10:35,714 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 23:10:35,714 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 23:10:35,715 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 23:10:35,715 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-09-04 23:10:36,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 23:10:36,199 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 23:10:36,203 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 23:10:36,206 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 23:10:36,207 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 23:10:36,208 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/string-2.i [2020-09-04 23:10:36,301 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b9a1ebac7/e70ff943b87542d28625390431212b75/FLAG452bb2af4 [2020-09-04 23:10:36,878 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 23:10:36,879 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/loops/string-2.i [2020-09-04 23:10:36,888 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b9a1ebac7/e70ff943b87542d28625390431212b75/FLAG452bb2af4 [2020-09-04 23:10:37,203 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b9a1ebac7/e70ff943b87542d28625390431212b75 [2020-09-04 23:10:37,217 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 23:10:37,219 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 23:10:37,220 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 23:10:37,221 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 23:10:37,227 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 23:10:37,228 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 11:10:37" (1/1) ... [2020-09-04 23:10:37,233 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c4d5a02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:10:37, skipping insertion in model container [2020-09-04 23:10:37,233 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 11:10:37" (1/1) ... [2020-09-04 23:10:37,242 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 23:10:37,270 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 23:10:37,504 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 23:10:37,509 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 23:10:37,551 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 23:10:37,579 INFO L208 MainTranslator]: Completed translation [2020-09-04 23:10:37,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:10:37 WrapperNode [2020-09-04 23:10:37,579 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 23:10:37,580 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 23:10:37,580 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 23:10:37,580 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 23:10:37,676 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:10:37" (1/1) ... [2020-09-04 23:10:37,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:10:37" (1/1) ... [2020-09-04 23:10:37,687 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:10:37" (1/1) ... [2020-09-04 23:10:37,688 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:10:37" (1/1) ... [2020-09-04 23:10:37,705 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:10:37" (1/1) ... [2020-09-04 23:10:37,720 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:10:37" (1/1) ... [2020-09-04 23:10:37,722 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:10:37" (1/1) ... [2020-09-04 23:10:37,727 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 23:10:37,728 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 23:10:37,728 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 23:10:37,728 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 23:10:37,729 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:10:37" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 23:10:37,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 23:10:37,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 23:10:37,808 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-09-04 23:10:37,809 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-09-04 23:10:37,809 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 23:10:37,809 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 23:10:37,810 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-09-04 23:10:37,810 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-09-04 23:10:37,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-09-04 23:10:37,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-09-04 23:10:37,810 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 23:10:37,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-09-04 23:10:37,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-09-04 23:10:37,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-09-04 23:10:37,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-09-04 23:10:37,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 23:10:37,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 23:10:38,262 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 23:10:38,262 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-09-04 23:10:38,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 11:10:38 BoogieIcfgContainer [2020-09-04 23:10:38,269 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 23:10:38,270 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 23:10:38,271 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 23:10:38,274 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 23:10:38,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 11:10:37" (1/3) ... [2020-09-04 23:10:38,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ec06808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 11:10:38, skipping insertion in model container [2020-09-04 23:10:38,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:10:37" (2/3) ... [2020-09-04 23:10:38,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ec06808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 11:10:38, skipping insertion in model container [2020-09-04 23:10:38,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 11:10:38" (3/3) ... [2020-09-04 23:10:38,279 INFO L109 eAbstractionObserver]: Analyzing ICFG string-2.i [2020-09-04 23:10:38,291 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 23:10:38,302 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 23:10:38,324 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 23:10:38,355 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 23:10:38,355 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 23:10:38,355 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 23:10:38,356 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 23:10:38,356 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 23:10:38,356 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 23:10:38,356 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 23:10:38,356 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 23:10:38,377 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states. [2020-09-04 23:10:38,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-09-04 23:10:38,393 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:10:38,395 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] [2020-09-04 23:10:38,395 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:10:38,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:10:38,403 INFO L82 PathProgramCache]: Analyzing trace with hash -768807104, now seen corresponding path program 1 times [2020-09-04 23:10:38,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:10:38,416 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1480134381] [2020-09-04 23:10:38,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:10:38,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:10:38,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:10:38,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:10:38,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 23:10:38,681 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1480134381] [2020-09-04 23:10:38,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:10:38,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 23:10:38,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747848628] [2020-09-04 23:10:38,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 23:10:38,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:10:38,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 23:10:38,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 23:10:38,718 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 3 states. [2020-09-04 23:10:38,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:10:38,987 INFO L93 Difference]: Finished difference Result 188 states and 215 transitions. [2020-09-04 23:10:38,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 23:10:38,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2020-09-04 23:10:38,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:10:39,002 INFO L225 Difference]: With dead ends: 188 [2020-09-04 23:10:39,003 INFO L226 Difference]: Without dead ends: 77 [2020-09-04 23:10:39,008 INFO L675 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-09-04 23:10:39,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-09-04 23:10:39,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2020-09-04 23:10:39,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-09-04 23:10:39,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2020-09-04 23:10:39,069 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 37 [2020-09-04 23:10:39,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:10:39,070 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2020-09-04 23:10:39,070 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 23:10:39,070 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2020-09-04 23:10:39,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-09-04 23:10:39,072 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:10:39,073 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] [2020-09-04 23:10:39,073 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 23:10:39,074 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:10:39,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:10:39,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1309055982, now seen corresponding path program 1 times [2020-09-04 23:10:39,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:10:39,075 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1702835805] [2020-09-04 23:10:39,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:10:39,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:10:39,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:10:39,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:10:39,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 23:10:39,179 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1702835805] [2020-09-04 23:10:39,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:10:39,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-04 23:10:39,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881244993] [2020-09-04 23:10:39,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-04 23:10:39,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:10:39,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-04 23:10:39,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 23:10:39,183 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 4 states. [2020-09-04 23:10:39,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:10:39,386 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2020-09-04 23:10:39,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-04 23:10:39,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2020-09-04 23:10:39,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:10:39,388 INFO L225 Difference]: With dead ends: 144 [2020-09-04 23:10:39,389 INFO L226 Difference]: Without dead ends: 89 [2020-09-04 23:10:39,390 INFO L675 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-09-04 23:10:39,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-09-04 23:10:39,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 79. [2020-09-04 23:10:39,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-09-04 23:10:39,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2020-09-04 23:10:39,403 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 41 [2020-09-04 23:10:39,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:10:39,404 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2020-09-04 23:10:39,404 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-04 23:10:39,404 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2020-09-04 23:10:39,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-09-04 23:10:39,406 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:10:39,406 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] [2020-09-04 23:10:39,407 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 23:10:39,407 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:10:39,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:10:39,407 INFO L82 PathProgramCache]: Analyzing trace with hash 512896601, now seen corresponding path program 1 times [2020-09-04 23:10:39,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:10:39,408 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1143399144] [2020-09-04 23:10:39,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:10:39,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:10:39,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:10:39,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:10:39,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 23:10:39,556 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1143399144] [2020-09-04 23:10:39,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:10:39,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-04 23:10:39,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15161247] [2020-09-04 23:10:39,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 23:10:39,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:10:39,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 23:10:39,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 23:10:39,559 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 6 states. [2020-09-04 23:10:39,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:10:39,757 INFO L93 Difference]: Finished difference Result 152 states and 162 transitions. [2020-09-04 23:10:39,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 23:10:39,758 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2020-09-04 23:10:39,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:10:39,759 INFO L225 Difference]: With dead ends: 152 [2020-09-04 23:10:39,760 INFO L226 Difference]: Without dead ends: 96 [2020-09-04 23:10:39,761 INFO L675 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-09-04 23:10:39,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-09-04 23:10:39,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 86. [2020-09-04 23:10:39,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-09-04 23:10:39,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2020-09-04 23:10:39,772 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 55 [2020-09-04 23:10:39,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:10:39,772 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2020-09-04 23:10:39,773 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 23:10:39,773 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2020-09-04 23:10:39,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-09-04 23:10:39,775 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:10:39,775 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] [2020-09-04 23:10:39,775 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 23:10:39,776 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:10:39,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:10:39,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1958895614, now seen corresponding path program 2 times [2020-09-04 23:10:39,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:10:39,777 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1370888823] [2020-09-04 23:10:39,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:10:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:10:39,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:10:39,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:10:39,869 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-09-04 23:10:39,870 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1370888823] [2020-09-04 23:10:39,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:10:39,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-04 23:10:39,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764415820] [2020-09-04 23:10:39,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 23:10:39,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:10:39,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 23:10:39,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 23:10:39,872 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 6 states. [2020-09-04 23:10:40,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:10:40,045 INFO L93 Difference]: Finished difference Result 142 states and 151 transitions. [2020-09-04 23:10:40,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 23:10:40,046 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2020-09-04 23:10:40,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:10:40,047 INFO L225 Difference]: With dead ends: 142 [2020-09-04 23:10:40,048 INFO L226 Difference]: Without dead ends: 98 [2020-09-04 23:10:40,049 INFO L675 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-09-04 23:10:40,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-09-04 23:10:40,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 93. [2020-09-04 23:10:40,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-09-04 23:10:40,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2020-09-04 23:10:40,060 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 62 [2020-09-04 23:10:40,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:10:40,060 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2020-09-04 23:10:40,061 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 23:10:40,061 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2020-09-04 23:10:40,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-09-04 23:10:40,062 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:10:40,063 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] [2020-09-04 23:10:40,063 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 23:10:40,063 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:10:40,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:10:40,064 INFO L82 PathProgramCache]: Analyzing trace with hash 11176526, now seen corresponding path program 3 times [2020-09-04 23:10:40,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:10:40,065 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1398395135] [2020-09-04 23:10:40,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:10:40,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:10:40,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:10:40,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:10:40,191 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-09-04 23:10:40,191 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1398395135] [2020-09-04 23:10:40,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:10:40,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-04 23:10:40,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181142655] [2020-09-04 23:10:40,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 23:10:40,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:10:40,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 23:10:40,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-04 23:10:40,194 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand 8 states. [2020-09-04 23:10:40,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:10:40,445 INFO L93 Difference]: Finished difference Result 168 states and 178 transitions. [2020-09-04 23:10:40,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 23:10:40,446 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2020-09-04 23:10:40,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:10:40,447 INFO L225 Difference]: With dead ends: 168 [2020-09-04 23:10:40,447 INFO L226 Difference]: Without dead ends: 105 [2020-09-04 23:10:40,448 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-09-04 23:10:40,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-09-04 23:10:40,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 100. [2020-09-04 23:10:40,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-09-04 23:10:40,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2020-09-04 23:10:40,460 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 69 [2020-09-04 23:10:40,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:10:40,460 INFO L479 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2020-09-04 23:10:40,460 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 23:10:40,461 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2020-09-04 23:10:40,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-09-04 23:10:40,462 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:10:40,462 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] [2020-09-04 23:10:40,462 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 23:10:40,463 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:10:40,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:10:40,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1399032013, now seen corresponding path program 4 times [2020-09-04 23:10:40,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:10:40,464 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [230724450] [2020-09-04 23:10:40,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:10:40,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:10:40,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:10:40,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:10:40,581 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-09-04 23:10:40,582 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [230724450] [2020-09-04 23:10:40,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:10:40,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-04 23:10:40,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982818595] [2020-09-04 23:10:40,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 23:10:40,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:10:40,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 23:10:40,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-09-04 23:10:40,584 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand 10 states. [2020-09-04 23:10:40,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:10:40,849 INFO L93 Difference]: Finished difference Result 175 states and 185 transitions. [2020-09-04 23:10:40,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 23:10:40,850 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 76 [2020-09-04 23:10:40,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:10:40,852 INFO L225 Difference]: With dead ends: 175 [2020-09-04 23:10:40,853 INFO L226 Difference]: Without dead ends: 112 [2020-09-04 23:10:40,856 INFO L675 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-09-04 23:10:40,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-09-04 23:10:40,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 107. [2020-09-04 23:10:40,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-09-04 23:10:40,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2020-09-04 23:10:40,882 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 76 [2020-09-04 23:10:40,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:10:40,883 INFO L479 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2020-09-04 23:10:40,885 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 23:10:40,885 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2020-09-04 23:10:40,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-09-04 23:10:40,886 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:10:40,887 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] [2020-09-04 23:10:40,887 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 23:10:40,887 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:10:40,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:10:40,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1633037998, now seen corresponding path program 5 times [2020-09-04 23:10:40,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:10:40,892 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [301514134] [2020-09-04 23:10:40,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:10:40,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:10:41,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:10:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:10:41,132 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-09-04 23:10:41,132 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [301514134] [2020-09-04 23:10:41,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:10:41,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-04 23:10:41,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097941979] [2020-09-04 23:10:41,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 23:10:41,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:10:41,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 23:10:41,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-09-04 23:10:41,135 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand 12 states. [2020-09-04 23:10:41,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:10:41,487 INFO L93 Difference]: Finished difference Result 177 states and 187 transitions. [2020-09-04 23:10:41,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 23:10:41,487 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 83 [2020-09-04 23:10:41,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:10:41,489 INFO L225 Difference]: With dead ends: 177 [2020-09-04 23:10:41,489 INFO L226 Difference]: Without dead ends: 114 [2020-09-04 23:10:41,491 INFO L675 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-09-04 23:10:41,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-09-04 23:10:41,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2020-09-04 23:10:41,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-09-04 23:10:41,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2020-09-04 23:10:41,501 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 83 [2020-09-04 23:10:41,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:10:41,501 INFO L479 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2020-09-04 23:10:41,501 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 23:10:41,501 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2020-09-04 23:10:41,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-09-04 23:10:41,503 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:10:41,503 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] [2020-09-04 23:10:41,503 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 23:10:41,503 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:10:41,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:10:41,504 INFO L82 PathProgramCache]: Analyzing trace with hash 2059478739, now seen corresponding path program 6 times [2020-09-04 23:10:41,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:10:41,504 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2119455459] [2020-09-04 23:10:41,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:10:41,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:10:41,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:10:41,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:10:41,602 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-09-04 23:10:41,603 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2119455459] [2020-09-04 23:10:41,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:10:41,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-04 23:10:41,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539122511] [2020-09-04 23:10:41,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 23:10:41,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:10:41,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 23:10:41,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-04 23:10:41,605 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand 8 states. [2020-09-04 23:10:41,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:10:41,857 INFO L93 Difference]: Finished difference Result 170 states and 179 transitions. [2020-09-04 23:10:41,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 23:10:41,857 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 90 [2020-09-04 23:10:41,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:10:41,859 INFO L225 Difference]: With dead ends: 170 [2020-09-04 23:10:41,860 INFO L226 Difference]: Without dead ends: 126 [2020-09-04 23:10:41,861 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-09-04 23:10:41,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-09-04 23:10:41,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 121. [2020-09-04 23:10:41,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-09-04 23:10:41,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 126 transitions. [2020-09-04 23:10:41,870 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 126 transitions. Word has length 90 [2020-09-04 23:10:41,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:10:41,871 INFO L479 AbstractCegarLoop]: Abstraction has 121 states and 126 transitions. [2020-09-04 23:10:41,871 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 23:10:41,871 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2020-09-04 23:10:41,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-09-04 23:10:41,872 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:10:41,872 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] [2020-09-04 23:10:41,873 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 23:10:41,873 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:10:41,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:10:41,873 INFO L82 PathProgramCache]: Analyzing trace with hash 2012961241, now seen corresponding path program 7 times [2020-09-04 23:10:41,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:10:41,874 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [568028047] [2020-09-04 23:10:41,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:10:41,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:10:41,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:10:41,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:10:41,996 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-09-04 23:10:41,996 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [568028047] [2020-09-04 23:10:41,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:10:41,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-04 23:10:41,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940459656] [2020-09-04 23:10:41,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 23:10:41,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:10:41,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 23:10:41,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-09-04 23:10:41,998 INFO L87 Difference]: Start difference. First operand 121 states and 126 transitions. Second operand 10 states. [2020-09-04 23:10:42,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:10:42,273 INFO L93 Difference]: Finished difference Result 177 states and 186 transitions. [2020-09-04 23:10:42,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 23:10:42,276 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2020-09-04 23:10:42,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:10:42,278 INFO L225 Difference]: With dead ends: 177 [2020-09-04 23:10:42,278 INFO L226 Difference]: Without dead ends: 133 [2020-09-04 23:10:42,278 INFO L675 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-09-04 23:10:42,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-09-04 23:10:42,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 128. [2020-09-04 23:10:42,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-09-04 23:10:42,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 133 transitions. [2020-09-04 23:10:42,288 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 133 transitions. Word has length 97 [2020-09-04 23:10:42,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:10:42,288 INFO L479 AbstractCegarLoop]: Abstraction has 128 states and 133 transitions. [2020-09-04 23:10:42,288 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 23:10:42,288 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 133 transitions. [2020-09-04 23:10:42,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-09-04 23:10:42,290 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:10:42,290 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] [2020-09-04 23:10:42,290 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 23:10:42,290 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:10:42,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:10:42,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1354290195, now seen corresponding path program 8 times [2020-09-04 23:10:42,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:10:42,291 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [193579053] [2020-09-04 23:10:42,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:10:42,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:10:42,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:10:42,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:10:42,443 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-09-04 23:10:42,443 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [193579053] [2020-09-04 23:10:42,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:10:42,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-04 23:10:42,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48150413] [2020-09-04 23:10:42,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 23:10:42,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:10:42,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 23:10:42,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-09-04 23:10:42,445 INFO L87 Difference]: Start difference. First operand 128 states and 133 transitions. Second operand 12 states. [2020-09-04 23:10:42,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:10:42,773 INFO L93 Difference]: Finished difference Result 179 states and 188 transitions. [2020-09-04 23:10:42,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 23:10:42,773 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 104 [2020-09-04 23:10:42,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:10:42,775 INFO L225 Difference]: With dead ends: 179 [2020-09-04 23:10:42,775 INFO L226 Difference]: Without dead ends: 135 [2020-09-04 23:10:42,777 INFO L675 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-09-04 23:10:42,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-09-04 23:10:42,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2020-09-04 23:10:42,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-09-04 23:10:42,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 140 transitions. [2020-09-04 23:10:42,788 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 140 transitions. Word has length 104 [2020-09-04 23:10:42,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:10:42,789 INFO L479 AbstractCegarLoop]: Abstraction has 135 states and 140 transitions. [2020-09-04 23:10:42,790 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 23:10:42,790 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 140 transitions. [2020-09-04 23:10:42,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-09-04 23:10:42,791 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:10:42,791 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] [2020-09-04 23:10:42,792 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 23:10:42,792 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:10:42,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:10:42,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1908556953, now seen corresponding path program 9 times [2020-09-04 23:10:42,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:10:42,793 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [122857282] [2020-09-04 23:10:42,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:10:42,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 23:10:42,878 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 23:10:42,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 23:10:42,939 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 23:10:42,993 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-04 23:10:42,993 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-04 23:10:42,994 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 23:10:43,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 11:10:43 BoogieIcfgContainer [2020-09-04 23:10:43,069 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 23:10:43,073 INFO L168 Benchmark]: Toolchain (without parser) took 5852.74 ms. Allocated memory was 140.5 MB in the beginning and 277.9 MB in the end (delta: 137.4 MB). Free memory was 103.7 MB in the beginning and 109.9 MB in the end (delta: -6.2 MB). Peak memory consumption was 131.2 MB. Max. memory is 7.1 GB. [2020-09-04 23:10:43,074 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 140.5 MB. Free memory was 121.9 MB in the beginning and 121.4 MB in the end (delta: 419.7 kB). Peak memory consumption was 419.7 kB. Max. memory is 7.1 GB. [2020-09-04 23:10:43,075 INFO L168 Benchmark]: CACSL2BoogieTranslator took 359.47 ms. Allocated memory is still 140.5 MB. Free memory was 103.7 MB in the beginning and 92.8 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2020-09-04 23:10:43,076 INFO L168 Benchmark]: Boogie Preprocessor took 147.11 ms. Allocated memory was 140.5 MB in the beginning and 205.0 MB in the end (delta: 64.5 MB). Free memory was 92.8 MB in the beginning and 182.4 MB in the end (delta: -89.6 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2020-09-04 23:10:43,076 INFO L168 Benchmark]: RCFGBuilder took 541.53 ms. Allocated memory is still 205.0 MB. Free memory was 182.4 MB in the beginning and 158.1 MB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2020-09-04 23:10:43,077 INFO L168 Benchmark]: TraceAbstraction took 4798.85 ms. Allocated memory was 205.0 MB in the beginning and 277.9 MB in the end (delta: 72.9 MB). Free memory was 157.2 MB in the beginning and 109.9 MB in the end (delta: 47.3 MB). Peak memory consumption was 120.1 MB. Max. memory is 7.1 GB. [2020-09-04 23:10:43,081 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 140.5 MB. Free memory was 121.9 MB in the beginning and 121.4 MB in the end (delta: 419.7 kB). Peak memory consumption was 419.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 359.47 ms. Allocated memory is still 140.5 MB. Free memory was 103.7 MB in the beginning and 92.8 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 147.11 ms. Allocated memory was 140.5 MB in the beginning and 205.0 MB in the end (delta: 64.5 MB). Free memory was 92.8 MB in the beginning and 182.4 MB in the end (delta: -89.6 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 541.53 ms. Allocated memory is still 205.0 MB. Free memory was 182.4 MB in the beginning and 158.1 MB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4798.85 ms. Allocated memory was 205.0 MB in the beginning and 277.9 MB in the end (delta: 72.9 MB). Free memory was 157.2 MB in the beginning and 109.9 MB in the end (delta: 47.3 MB). Peak memory consumption was 120.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 9]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of shiftLeft at line 58. Possible FailurePath: [L20] char string_A[5], string_B[5]; VAL [string_A={7:0}, string_B={6:0}] [L21] int i, j, nc_A, nc_B, found=0; VAL [found=0, string_A={7:0}, string_B={6:0}] [L24] i=0 VAL [found=0, i=0, string_A={7:0}, string_B={6:0}] [L24] COND TRUE i<5 VAL [found=0, i=0, string_A={7:0}, string_B={6:0}] [L25] string_A[i]=__VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, found=0, i=0, string_A={7:0}, string_B={6:0}] [L24] i++ VAL [found=0, i=1, string_A={7:0}, string_B={6:0}] [L24] COND TRUE i<5 VAL [found=0, i=1, string_A={7:0}, string_B={6:0}] [L25] string_A[i]=__VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-2, found=0, i=1, string_A={7:0}, string_B={6:0}] [L24] i++ VAL [found=0, i=2, string_A={7:0}, string_B={6:0}] [L24] COND TRUE i<5 VAL [found=0, i=2, string_A={7:0}, string_B={6:0}] [L25] string_A[i]=__VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-3, found=0, i=2, string_A={7:0}, string_B={6:0}] [L24] i++ VAL [found=0, i=3, string_A={7:0}, string_B={6:0}] [L24] COND TRUE i<5 VAL [found=0, i=3, string_A={7:0}, string_B={6:0}] [L25] string_A[i]=__VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-4, found=0, i=3, string_A={7:0}, string_B={6:0}] [L24] i++ VAL [found=0, i=4, string_A={7:0}, string_B={6:0}] [L24] COND TRUE i<5 VAL [found=0, i=4, string_A={7:0}, string_B={6:0}] [L25] string_A[i]=__VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, found=0, i=4, string_A={7:0}, string_B={6:0}] [L24] i++ VAL [found=0, i=5, string_A={7:0}, string_B={6:0}] [L24] COND FALSE !(i<5) VAL [found=0, i=5, string_A={7:0}, string_B={6:0}] [L26] EXPR string_A[5 -1] VAL [found=0, i=5, string_A={7:0}, string_A[5 -1]=0, string_B={6:0}] [L26] COND FALSE !(!(string_A[5 -1]=='\0')) VAL [found=0, i=5, string_A={7:0}, string_A[5 -1]=0, string_B={6:0}] [L28] i=0 VAL [found=0, i=0, string_A={7:0}, string_B={6:0}] [L28] COND TRUE i<5 VAL [found=0, i=0, string_A={7:0}, string_B={6:0}] [L29] string_B[i]=__VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, found=0, i=0, string_A={7:0}, string_B={6:0}] [L28] i++ VAL [found=0, i=1, string_A={7:0}, string_B={6:0}] [L28] COND TRUE i<5 VAL [found=0, i=1, string_A={7:0}, string_B={6:0}] [L29] string_B[i]=__VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-7, found=0, i=1, string_A={7:0}, string_B={6:0}] [L28] i++ VAL [found=0, i=2, string_A={7:0}, string_B={6:0}] [L28] COND TRUE i<5 VAL [found=0, i=2, string_A={7:0}, string_B={6:0}] [L29] string_B[i]=__VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=8, found=0, i=2, string_A={7:0}, string_B={6:0}] [L28] i++ VAL [found=0, i=3, string_A={7:0}, string_B={6:0}] [L28] COND TRUE i<5 VAL [found=0, i=3, string_A={7:0}, string_B={6:0}] [L29] string_B[i]=__VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-8, found=0, i=3, string_A={7:0}, string_B={6:0}] [L28] i++ VAL [found=0, i=4, string_A={7:0}, string_B={6:0}] [L28] COND TRUE i<5 VAL [found=0, i=4, string_A={7:0}, string_B={6:0}] [L29] string_B[i]=__VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, found=0, i=4, string_A={7:0}, string_B={6:0}] [L28] i++ VAL [found=0, i=5, string_A={7:0}, string_B={6:0}] [L28] COND FALSE !(i<5) VAL [found=0, i=5, string_A={7:0}, string_B={6:0}] [L30] EXPR string_B[5 -1] VAL [found=0, i=5, string_A={7:0}, string_B={6:0}, string_B[5 -1]=0] [L30] COND FALSE !(!(string_B[5 -1]=='\0')) VAL [found=0, i=5, string_A={7:0}, string_B={6:0}, string_B[5 -1]=0] [L32] nc_A = 0 VAL [found=0, i=5, nc_A=0, string_A={7:0}, string_B={6:0}] [L33] EXPR string_A[nc_A] VAL [found=0, i=5, nc_A=0, string_A={7:0}, string_A[nc_A]=0, string_B={6:0}] [L33] COND FALSE !(string_A[nc_A]!='\0') VAL [found=0, i=5, nc_A=0, string_A={7:0}, string_A[nc_A]=0, string_B={6:0}] [L36] nc_B = 0 VAL [found=0, i=5, nc_A=0, nc_B=0, string_A={7:0}, string_B={6:0}] [L37] EXPR string_B[nc_B] VAL [found=0, i=5, nc_A=0, nc_B=0, string_A={7:0}, string_B={6:0}, string_B[nc_B]=0] [L37] COND FALSE !(string_B[nc_B]!='\0') VAL [found=0, i=5, nc_A=0, nc_B=0, string_A={7:0}, string_B={6:0}, string_B[nc_B]=0] [L40] COND FALSE !(!(nc_B >= nc_A)) VAL [found=0, i=5, nc_A=0, nc_B=0, string_A={7:0}, string_B={6:0}] [L43] EXPR j=0 VAL [found=0, i=5, j=0, nc_A=0, nc_B=0, string_A={7:0}, string_B={6:0}] [L43] i=j=0 VAL [found=0, i=0, j=0, nc_A=0, nc_B=0, string_A={7:0}, string_B={6:0}] [L44] COND FALSE !((inc_B-1)<