/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops/string-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-02 23:02:10,829 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-02 23:02:10,831 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-02 23:02:10,868 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-02 23:02:10,869 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-02 23:02:10,871 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-02 23:02:10,875 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-02 23:02:10,880 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-02 23:02:10,882 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-02 23:02:10,886 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-02 23:02:10,887 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-02 23:02:10,888 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-02 23:02:10,888 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-02 23:02:10,890 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-02 23:02:10,891 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-02 23:02:10,893 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-02 23:02:10,895 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-02 23:02:10,896 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-02 23:02:10,898 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-02 23:02:10,903 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-02 23:02:10,905 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-02 23:02:10,906 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-02 23:02:10,907 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-02 23:02:10,909 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-02 23:02:10,915 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-02 23:02:10,915 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-02 23:02:10,915 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-02 23:02:10,918 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-02 23:02:10,919 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-02 23:02:10,920 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-02 23:02:10,920 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-02 23:02:10,921 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-02 23:02:10,922 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-02 23:02:10,923 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-02 23:02:10,923 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-02 23:02:10,924 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-02 23:02:10,924 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-02 23:02:10,924 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-02 23:02:10,925 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-02 23:02:10,925 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-02 23:02:10,926 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-02 23:02:10,930 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2021-05-02 23:02:10,945 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-02 23:02:10,945 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-02 23:02:10,949 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-02 23:02:10,949 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-02 23:02:10,949 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-02 23:02:10,949 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-02 23:02:10,950 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-02 23:02:10,950 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-02 23:02:10,950 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-02 23:02:10,950 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-02 23:02:10,951 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-02 23:02:10,951 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-02 23:02:10,951 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-02 23:02:10,951 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-02 23:02:10,952 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-02 23:02:10,952 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-02 23:02:10,952 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-02 23:02:10,952 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-02 23:02:10,952 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 23:02:10,953 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-02 23:02:10,953 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-02 23:02:10,953 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-02 23:02:10,953 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-02 23:02:10,953 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2021-05-02 23:02:11,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-02 23:02:11,324 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-02 23:02:11,326 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-02 23:02:11,327 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-02 23:02:11,328 INFO L275 PluginConnector]: CDTParser initialized [2021-05-02 23:02:11,329 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/string-1.i [2021-05-02 23:02:11,385 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0da71dae/f552ecec6f5f43d88124966696c34e5d/FLAG185240c5c [2021-05-02 23:02:11,837 INFO L306 CDTParser]: Found 1 translation units. [2021-05-02 23:02:11,837 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/string-1.i [2021-05-02 23:02:11,857 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0da71dae/f552ecec6f5f43d88124966696c34e5d/FLAG185240c5c [2021-05-02 23:02:12,363 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0da71dae/f552ecec6f5f43d88124966696c34e5d [2021-05-02 23:02:12,365 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-02 23:02:12,367 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-02 23:02:12,371 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-02 23:02:12,372 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-02 23:02:12,376 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-02 23:02:12,377 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:02:12" (1/1) ... [2021-05-02 23:02:12,378 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6688903 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:02:12, skipping insertion in model container [2021-05-02 23:02:12,378 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:02:12" (1/1) ... [2021-05-02 23:02:12,385 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-02 23:02:12,402 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-02 23:02:12,523 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/string-1.i[896,909] [2021-05-02 23:02:12,539 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 23:02:12,545 INFO L203 MainTranslator]: Completed pre-run [2021-05-02 23:02:12,579 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/string-1.i[896,909] [2021-05-02 23:02:12,595 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 23:02:12,607 INFO L208 MainTranslator]: Completed translation [2021-05-02 23:02:12,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:02:12 WrapperNode [2021-05-02 23:02:12,607 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-02 23:02:12,608 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-02 23:02:12,608 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-02 23:02:12,608 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-02 23:02:12,619 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:02:12" (1/1) ... [2021-05-02 23:02:12,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:02:12" (1/1) ... [2021-05-02 23:02:12,633 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:02:12" (1/1) ... [2021-05-02 23:02:12,633 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:02:12" (1/1) ... [2021-05-02 23:02:12,649 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:02:12" (1/1) ... [2021-05-02 23:02:12,653 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:02:12" (1/1) ... [2021-05-02 23:02:12,655 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:02:12" (1/1) ... [2021-05-02 23:02:12,661 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-02 23:02:12,662 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-02 23:02:12,662 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-02 23:02:12,662 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-02 23:02:12,663 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:02:12" (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 [2021-05-02 23:02:12,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-02 23:02:12,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-02 23:02:12,734 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-02 23:02:12,734 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-05-02 23:02:12,734 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-02 23:02:12,735 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-02 23:02:12,735 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-02 23:02:12,735 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-02 23:02:12,735 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-05-02 23:02:12,735 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-05-02 23:02:12,736 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-02 23:02:12,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-02 23:02:12,736 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-05-02 23:02:12,737 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-02 23:02:12,737 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2021-05-02 23:02:12,737 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-02 23:02:12,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-02 23:02:12,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-02 23:02:12,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-02 23:02:12,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-02 23:02:12,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-02 23:02:12,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-02 23:02:13,098 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-02 23:02:13,099 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-05-02 23:02:13,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:02:13 BoogieIcfgContainer [2021-05-02 23:02:13,100 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-02 23:02:13,102 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-02 23:02:13,102 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-02 23:02:13,118 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-02 23:02:13,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.05 11:02:12" (1/3) ... [2021-05-02 23:02:13,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@231f8454 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:02:13, skipping insertion in model container [2021-05-02 23:02:13,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:02:12" (2/3) ... [2021-05-02 23:02:13,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@231f8454 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:02:13, skipping insertion in model container [2021-05-02 23:02:13,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:02:13" (3/3) ... [2021-05-02 23:02:13,120 INFO L111 eAbstractionObserver]: Analyzing ICFG string-1.i [2021-05-02 23:02:13,125 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-02 23:02:13,128 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-02 23:02:13,140 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-02 23:02:13,157 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-02 23:02:13,158 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-02 23:02:13,158 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-02 23:02:13,158 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-02 23:02:13,158 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-02 23:02:13,158 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-02 23:02:13,158 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-02 23:02:13,158 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-02 23:02:13,171 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 28 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-02 23:02:13,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-05-02 23:02:13,177 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:13,178 INFO L523 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] [2021-05-02 23:02:13,178 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:13,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:13,183 INFO L82 PathProgramCache]: Analyzing trace with hash 739829093, now seen corresponding path program 1 times [2021-05-02 23:02:13,190 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:13,191 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2082464330] [2021-05-02 23:02:13,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:13,244 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:02:13,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:13,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:13,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:13,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:02:13,481 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:13,481 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2082464330] [2021-05-02 23:02:13,483 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2082464330] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:13,484 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:13,484 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-02 23:02:13,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925421086] [2021-05-02 23:02:13,488 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-02 23:02:13,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:13,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-02 23:02:13,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 23:02:13,503 INFO L87 Difference]: Start difference. First operand has 35 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 28 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:13,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:13,715 INFO L93 Difference]: Finished difference Result 73 states and 109 transitions. [2021-05-02 23:02:13,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-02 23:02:13,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2021-05-02 23:02:13,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:13,726 INFO L225 Difference]: With dead ends: 73 [2021-05-02 23:02:13,727 INFO L226 Difference]: Without dead ends: 36 [2021-05-02 23:02:13,729 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 57.1ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 23:02:13,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-05-02 23:02:13,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2021-05-02 23:02:13,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:13,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2021-05-02 23:02:13,771 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 22 [2021-05-02 23:02:13,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:13,772 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2021-05-02 23:02:13,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:13,772 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2021-05-02 23:02:13,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-05-02 23:02:13,774 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:13,774 INFO L523 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] [2021-05-02 23:02:13,774 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-02 23:02:13,775 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:13,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:13,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1075962823, now seen corresponding path program 1 times [2021-05-02 23:02:13,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:13,777 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1955234450] [2021-05-02 23:02:13,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:13,794 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-05-02 23:02:13,799 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:02:13,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:13,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:13,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:13,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:02:13,926 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:13,926 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1955234450] [2021-05-02 23:02:13,926 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1955234450] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:13,926 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:13,927 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 23:02:13,927 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594652451] [2021-05-02 23:02:13,927 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 23:02:13,928 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:13,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 23:02:13,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-05-02 23:02:13,928 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:14,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:14,085 INFO L93 Difference]: Finished difference Result 65 states and 80 transitions. [2021-05-02 23:02:14,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 23:02:14,085 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2021-05-02 23:02:14,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:14,086 INFO L225 Difference]: With dead ends: 65 [2021-05-02 23:02:14,086 INFO L226 Difference]: Without dead ends: 44 [2021-05-02 23:02:14,088 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 29.6ms TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-05-02 23:02:14,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-05-02 23:02:14,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 34. [2021-05-02 23:02:14,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:14,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2021-05-02 23:02:14,094 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 28 [2021-05-02 23:02:14,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:14,094 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2021-05-02 23:02:14,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:14,095 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2021-05-02 23:02:14,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-05-02 23:02:14,095 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:14,096 INFO L523 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] [2021-05-02 23:02:14,096 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-02 23:02:14,096 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:14,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:14,097 INFO L82 PathProgramCache]: Analyzing trace with hash 875420793, now seen corresponding path program 2 times [2021-05-02 23:02:14,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:14,097 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [650572345] [2021-05-02 23:02:14,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:14,102 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-05-02 23:02:14,103 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:02:14,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:14,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:14,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:14,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:02:14,179 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:14,180 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [650572345] [2021-05-02 23:02:14,180 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [650572345] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:14,180 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:14,180 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 23:02:14,180 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607171945] [2021-05-02 23:02:14,181 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 23:02:14,181 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:14,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 23:02:14,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-05-02 23:02:14,182 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:14,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:14,274 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2021-05-02 23:02:14,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 23:02:14,275 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2021-05-02 23:02:14,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:14,276 INFO L225 Difference]: With dead ends: 75 [2021-05-02 23:02:14,276 INFO L226 Difference]: Without dead ends: 52 [2021-05-02 23:02:14,277 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 29.0ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-05-02 23:02:14,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-05-02 23:02:14,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 38. [2021-05-02 23:02:14,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:14,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2021-05-02 23:02:14,284 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 32 [2021-05-02 23:02:14,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:14,284 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2021-05-02 23:02:14,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:14,285 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2021-05-02 23:02:14,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-05-02 23:02:14,286 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:14,286 INFO L523 BasicCegarLoop]: trace histogram [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] [2021-05-02 23:02:14,286 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-02 23:02:14,286 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:14,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:14,287 INFO L82 PathProgramCache]: Analyzing trace with hash 133934009, now seen corresponding path program 3 times [2021-05-02 23:02:14,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:14,287 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [431919847] [2021-05-02 23:02:14,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:14,292 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-05-02 23:02:14,294 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:02:14,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:14,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:14,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:14,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:02:14,389 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:14,389 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [431919847] [2021-05-02 23:02:14,390 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [431919847] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:14,390 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:14,390 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 23:02:14,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341095771] [2021-05-02 23:02:14,391 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 23:02:14,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:14,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 23:02:14,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-02 23:02:14,392 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:14,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:14,546 INFO L93 Difference]: Finished difference Result 85 states and 104 transitions. [2021-05-02 23:02:14,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 23:02:14,547 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2021-05-02 23:02:14,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:14,549 INFO L225 Difference]: With dead ends: 85 [2021-05-02 23:02:14,549 INFO L226 Difference]: Without dead ends: 60 [2021-05-02 23:02:14,550 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 53.7ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-02 23:02:14,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-05-02 23:02:14,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2021-05-02 23:02:14,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:14,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2021-05-02 23:02:14,566 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 36 [2021-05-02 23:02:14,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:14,566 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2021-05-02 23:02:14,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:14,566 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2021-05-02 23:02:14,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-05-02 23:02:14,569 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:14,569 INFO L523 BasicCegarLoop]: trace histogram [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] [2021-05-02 23:02:14,569 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-02 23:02:14,569 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:14,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:14,570 INFO L82 PathProgramCache]: Analyzing trace with hash 173558265, now seen corresponding path program 4 times [2021-05-02 23:02:14,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:14,570 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1421470392] [2021-05-02 23:02:14,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:14,577 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-05-02 23:02:14,579 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:02:14,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:14,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:14,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:14,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:02:14,705 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:14,706 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1421470392] [2021-05-02 23:02:14,706 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1421470392] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:14,706 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:14,706 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-05-02 23:02:14,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400474071] [2021-05-02 23:02:14,707 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-02 23:02:14,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:14,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-02 23:02:14,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-05-02 23:02:14,709 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:14,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:14,834 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2021-05-02 23:02:14,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 23:02:14,835 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2021-05-02 23:02:14,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:14,838 INFO L225 Difference]: With dead ends: 93 [2021-05-02 23:02:14,838 INFO L226 Difference]: Without dead ends: 66 [2021-05-02 23:02:14,839 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 43.9ms TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-05-02 23:02:14,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-05-02 23:02:14,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2021-05-02 23:02:14,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:14,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2021-05-02 23:02:14,851 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 40 [2021-05-02 23:02:14,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:14,851 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2021-05-02 23:02:14,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:14,852 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2021-05-02 23:02:14,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-05-02 23:02:14,852 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:14,852 INFO L523 BasicCegarLoop]: trace histogram [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] [2021-05-02 23:02:14,853 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-02 23:02:14,853 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:14,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:14,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1461422279, now seen corresponding path program 5 times [2021-05-02 23:02:14,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:14,854 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [322464973] [2021-05-02 23:02:14,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:14,858 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-05-02 23:02:14,859 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:02:14,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:14,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:14,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:14,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:02:14,967 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:14,967 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [322464973] [2021-05-02 23:02:14,967 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [322464973] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:14,967 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:14,967 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-02 23:02:14,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217669116] [2021-05-02 23:02:14,968 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-02 23:02:14,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:14,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-02 23:02:14,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-05-02 23:02:14,969 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:15,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:15,098 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2021-05-02 23:02:15,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 23:02:15,099 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2021-05-02 23:02:15,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:15,099 INFO L225 Difference]: With dead ends: 62 [2021-05-02 23:02:15,099 INFO L226 Difference]: Without dead ends: 48 [2021-05-02 23:02:15,100 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 95.1ms TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-05-02 23:02:15,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2021-05-02 23:02:15,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2021-05-02 23:02:15,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 43 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:15,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2021-05-02 23:02:15,104 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 44 [2021-05-02 23:02:15,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:15,104 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2021-05-02 23:02:15,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:15,105 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2021-05-02 23:02:15,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-05-02 23:02:15,105 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:15,105 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 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] [2021-05-02 23:02:15,105 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-02 23:02:15,106 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:15,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:15,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1421983316, now seen corresponding path program 1 times [2021-05-02 23:02:15,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:15,106 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1598377625] [2021-05-02 23:02:15,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:15,111 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-05-02 23:02:15,112 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:02:15,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:15,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:15,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:15,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:02:15,215 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:15,215 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1598377625] [2021-05-02 23:02:15,215 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1598377625] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:15,215 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:15,215 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-05-02 23:02:15,216 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368362278] [2021-05-02 23:02:15,216 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-02 23:02:15,216 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:15,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-02 23:02:15,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-05-02 23:02:15,217 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:15,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:15,417 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2021-05-02 23:02:15,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-02 23:02:15,418 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2021-05-02 23:02:15,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:15,419 INFO L225 Difference]: With dead ends: 59 [2021-05-02 23:02:15,419 INFO L226 Difference]: Without dead ends: 51 [2021-05-02 23:02:15,421 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 143.0ms TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-05-02 23:02:15,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-05-02 23:02:15,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2021-05-02 23:02:15,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:15,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2021-05-02 23:02:15,438 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 46 [2021-05-02 23:02:15,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:15,438 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2021-05-02 23:02:15,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:15,439 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2021-05-02 23:02:15,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-05-02 23:02:15,439 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:15,439 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 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] [2021-05-02 23:02:15,440 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-02 23:02:15,440 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:15,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:15,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1370221367, now seen corresponding path program 1 times [2021-05-02 23:02:15,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:15,441 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [177103645] [2021-05-02 23:02:15,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:15,448 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-05-02 23:02:15,449 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:02:15,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:15,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:15,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:15,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:02:15,533 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:15,533 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [177103645] [2021-05-02 23:02:15,533 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [177103645] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:15,533 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:15,533 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 23:02:15,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801526423] [2021-05-02 23:02:15,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 23:02:15,535 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:15,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 23:02:15,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-05-02 23:02:15,538 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:15,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:15,584 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2021-05-02 23:02:15,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 23:02:15,585 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2021-05-02 23:02:15,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:15,587 INFO L225 Difference]: With dead ends: 67 [2021-05-02 23:02:15,587 INFO L226 Difference]: Without dead ends: 51 [2021-05-02 23:02:15,588 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 23.2ms TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-05-02 23:02:15,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-05-02 23:02:15,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2021-05-02 23:02:15,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 46 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:15,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2021-05-02 23:02:15,596 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 48 [2021-05-02 23:02:15,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:15,597 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2021-05-02 23:02:15,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:15,597 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2021-05-02 23:02:15,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-05-02 23:02:15,600 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:15,600 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 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] [2021-05-02 23:02:15,600 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-02 23:02:15,600 INFO L428 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:15,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:15,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1255822596, now seen corresponding path program 1 times [2021-05-02 23:02:15,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:15,606 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [154430203] [2021-05-02 23:02:15,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:15,612 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-05-02 23:02:15,613 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:02:15,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:15,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:15,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:15,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:02:15,744 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:15,744 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [154430203] [2021-05-02 23:02:15,744 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [154430203] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:15,744 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:15,744 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-05-02 23:02:15,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554565796] [2021-05-02 23:02:15,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-02 23:02:15,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:15,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-02 23:02:15,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-05-02 23:02:15,746 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:15,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:15,891 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2021-05-02 23:02:15,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-02 23:02:15,892 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2021-05-02 23:02:15,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:15,892 INFO L225 Difference]: With dead ends: 75 [2021-05-02 23:02:15,892 INFO L226 Difference]: Without dead ends: 61 [2021-05-02 23:02:15,893 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 111.9ms TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-05-02 23:02:15,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-05-02 23:02:15,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2021-05-02 23:02:15,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 51 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:15,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2021-05-02 23:02:15,897 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 50 [2021-05-02 23:02:15,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:15,898 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2021-05-02 23:02:15,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:15,898 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2021-05-02 23:02:15,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-05-02 23:02:15,898 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:15,899 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 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] [2021-05-02 23:02:15,899 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-02 23:02:15,899 INFO L428 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:15,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:15,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1364208609, now seen corresponding path program 1 times [2021-05-02 23:02:15,899 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:15,900 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [248205511] [2021-05-02 23:02:15,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:15,904 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-05-02 23:02:15,905 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:02:15,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:16,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:16,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:02:16,013 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:16,013 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [248205511] [2021-05-02 23:02:16,013 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [248205511] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:16,013 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:16,013 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-05-02 23:02:16,013 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451483566] [2021-05-02 23:02:16,013 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-02 23:02:16,014 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:16,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-02 23:02:16,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-05-02 23:02:16,014 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:16,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:16,160 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2021-05-02 23:02:16,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-02 23:02:16,161 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2021-05-02 23:02:16,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:16,162 INFO L225 Difference]: With dead ends: 85 [2021-05-02 23:02:16,162 INFO L226 Difference]: Without dead ends: 71 [2021-05-02 23:02:16,162 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 96.2ms TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-05-02 23:02:16,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-05-02 23:02:16,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2021-05-02 23:02:16,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.140625) internal successors, (73), 64 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:16,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2021-05-02 23:02:16,167 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 52 [2021-05-02 23:02:16,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:16,167 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2021-05-02 23:02:16,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:16,167 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2021-05-02 23:02:16,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-05-02 23:02:16,168 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:16,168 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:02:16,168 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-02 23:02:16,169 INFO L428 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:16,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:16,169 INFO L82 PathProgramCache]: Analyzing trace with hash 487788375, now seen corresponding path program 2 times [2021-05-02 23:02:16,169 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:16,169 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1735835470] [2021-05-02 23:02:16,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:16,173 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-05-02 23:02:16,174 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:02:16,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:16,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:16,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:16,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:02:16,277 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:16,277 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1735835470] [2021-05-02 23:02:16,277 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1735835470] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:16,277 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:16,277 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-05-02 23:02:16,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941852592] [2021-05-02 23:02:16,278 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-05-02 23:02:16,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:16,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-05-02 23:02:16,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-05-02 23:02:16,278 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:16,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:16,496 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2021-05-02 23:02:16,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-05-02 23:02:16,496 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2021-05-02 23:02:16,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:16,497 INFO L225 Difference]: With dead ends: 83 [2021-05-02 23:02:16,498 INFO L226 Difference]: Without dead ends: 66 [2021-05-02 23:02:16,498 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 158.4ms TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2021-05-02 23:02:16,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-05-02 23:02:16,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2021-05-02 23:02:16,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 55 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:16,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2021-05-02 23:02:16,505 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 52 [2021-05-02 23:02:16,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:16,507 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2021-05-02 23:02:16,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:16,507 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2021-05-02 23:02:16,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-05-02 23:02:16,508 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:16,508 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 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] [2021-05-02 23:02:16,508 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-05-02 23:02:16,509 INFO L428 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:16,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:16,509 INFO L82 PathProgramCache]: Analyzing trace with hash -559251162, now seen corresponding path program 2 times [2021-05-02 23:02:16,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:16,509 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [96201261] [2021-05-02 23:02:16,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:16,518 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-05-02 23:02:16,519 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:02:16,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:16,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:16,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:16,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:02:16,582 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:16,582 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [96201261] [2021-05-02 23:02:16,582 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [96201261] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:16,583 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:16,583 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-05-02 23:02:16,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166628581] [2021-05-02 23:02:16,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-02 23:02:16,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:16,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-02 23:02:16,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-05-02 23:02:16,584 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:16,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:16,678 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2021-05-02 23:02:16,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 23:02:16,679 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2021-05-02 23:02:16,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:16,680 INFO L225 Difference]: With dead ends: 69 [2021-05-02 23:02:16,680 INFO L226 Difference]: Without dead ends: 57 [2021-05-02 23:02:16,680 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 42.0ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-05-02 23:02:16,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-05-02 23:02:16,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2021-05-02 23:02:16,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 52 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:16,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2021-05-02 23:02:16,685 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 54 [2021-05-02 23:02:16,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:16,686 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2021-05-02 23:02:16,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:16,687 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2021-05-02 23:02:16,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-05-02 23:02:16,688 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:16,688 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 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] [2021-05-02 23:02:16,688 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-05-02 23:02:16,688 INFO L428 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:16,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:16,689 INFO L82 PathProgramCache]: Analyzing trace with hash 328203649, now seen corresponding path program 3 times [2021-05-02 23:02:16,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:16,689 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1141936222] [2021-05-02 23:02:16,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:16,693 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-05-02 23:02:16,695 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:02:16,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:16,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:16,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:16,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:02:16,828 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:16,828 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1141936222] [2021-05-02 23:02:16,828 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1141936222] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:16,828 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:16,828 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-05-02 23:02:16,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413385320] [2021-05-02 23:02:16,828 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-05-02 23:02:16,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:16,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-05-02 23:02:16,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-05-02 23:02:16,829 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:17,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:17,027 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2021-05-02 23:02:17,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-05-02 23:02:17,028 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2021-05-02 23:02:17,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:17,029 INFO L225 Difference]: With dead ends: 66 [2021-05-02 23:02:17,029 INFO L226 Difference]: Without dead ends: 60 [2021-05-02 23:02:17,029 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 135.3ms TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2021-05-02 23:02:17,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-05-02 23:02:17,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2021-05-02 23:02:17,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 52 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:17,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2021-05-02 23:02:17,036 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 56 [2021-05-02 23:02:17,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:17,036 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2021-05-02 23:02:17,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:17,036 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2021-05-02 23:02:17,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-05-02 23:02:17,039 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:17,039 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 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] [2021-05-02 23:02:17,039 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-05-02 23:02:17,039 INFO L428 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:17,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:17,039 INFO L82 PathProgramCache]: Analyzing trace with hash -351854721, now seen corresponding path program 3 times [2021-05-02 23:02:17,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:17,040 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1502847964] [2021-05-02 23:02:17,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:17,046 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-05-02 23:02:17,048 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:02:17,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:17,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:17,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:17,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:02:17,165 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:17,165 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1502847964] [2021-05-02 23:02:17,165 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1502847964] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:17,165 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:17,165 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-05-02 23:02:17,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180528152] [2021-05-02 23:02:17,165 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-02 23:02:17,165 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:17,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-02 23:02:17,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-05-02 23:02:17,166 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand has 12 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:17,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:17,365 INFO L93 Difference]: Finished difference Result 87 states and 102 transitions. [2021-05-02 23:02:17,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-05-02 23:02:17,366 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2021-05-02 23:02:17,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:17,366 INFO L225 Difference]: With dead ends: 87 [2021-05-02 23:02:17,366 INFO L226 Difference]: Without dead ends: 71 [2021-05-02 23:02:17,367 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 127.3ms TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2021-05-02 23:02:17,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-05-02 23:02:17,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2021-05-02 23:02:17,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 59 states have (on average 1.152542372881356) internal successors, (68), 59 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:17,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2021-05-02 23:02:17,373 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 56 [2021-05-02 23:02:17,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:17,373 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2021-05-02 23:02:17,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:17,373 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2021-05-02 23:02:17,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-05-02 23:02:17,374 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:17,374 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 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] [2021-05-02 23:02:17,374 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-05-02 23:02:17,374 INFO L428 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:17,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:17,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1780018396, now seen corresponding path program 4 times [2021-05-02 23:02:17,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:17,375 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [675711543] [2021-05-02 23:02:17,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:17,380 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-05-02 23:02:17,381 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:02:17,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:17,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:17,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:02:17,462 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:17,463 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [675711543] [2021-05-02 23:02:17,463 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [675711543] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:17,463 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:17,463 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-02 23:02:17,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925513333] [2021-05-02 23:02:17,463 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-02 23:02:17,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:17,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-02 23:02:17,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-05-02 23:02:17,466 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:17,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:17,572 INFO L93 Difference]: Finished difference Result 109 states and 130 transitions. [2021-05-02 23:02:17,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 23:02:17,573 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2021-05-02 23:02:17,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:17,574 INFO L225 Difference]: With dead ends: 109 [2021-05-02 23:02:17,574 INFO L226 Difference]: Without dead ends: 97 [2021-05-02 23:02:17,576 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 60.9ms TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-05-02 23:02:17,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-05-02 23:02:17,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 86. [2021-05-02 23:02:17,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 81 states have (on average 1.1975308641975309) internal successors, (97), 81 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:17,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 101 transitions. [2021-05-02 23:02:17,584 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 101 transitions. Word has length 58 [2021-05-02 23:02:17,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:17,584 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 101 transitions. [2021-05-02 23:02:17,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:17,585 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 101 transitions. [2021-05-02 23:02:17,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-05-02 23:02:17,589 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:17,589 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 3, 3, 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] [2021-05-02 23:02:17,590 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-05-02 23:02:17,590 INFO L428 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:17,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:17,590 INFO L82 PathProgramCache]: Analyzing trace with hash 2088694042, now seen corresponding path program 4 times [2021-05-02 23:02:17,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:17,590 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [295968427] [2021-05-02 23:02:17,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:17,596 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-05-02 23:02:17,597 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:02:17,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:17,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:17,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:02:17,740 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:17,740 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [295968427] [2021-05-02 23:02:17,740 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [295968427] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:17,740 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:17,740 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-05-02 23:02:17,740 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275487947] [2021-05-02 23:02:17,740 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-05-02 23:02:17,740 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:17,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-05-02 23:02:17,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-05-02 23:02:17,741 INFO L87 Difference]: Start difference. First operand 86 states and 101 transitions. Second operand has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:18,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:18,024 INFO L93 Difference]: Finished difference Result 110 states and 132 transitions. [2021-05-02 23:02:18,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-05-02 23:02:18,024 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2021-05-02 23:02:18,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:18,025 INFO L225 Difference]: With dead ends: 110 [2021-05-02 23:02:18,025 INFO L226 Difference]: Without dead ends: 104 [2021-05-02 23:02:18,026 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 183.6ms TimeCoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2021-05-02 23:02:18,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-05-02 23:02:18,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 90. [2021-05-02 23:02:18,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 85 states have (on average 1.2117647058823529) internal successors, (103), 85 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:18,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 107 transitions. [2021-05-02 23:02:18,034 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 107 transitions. Word has length 58 [2021-05-02 23:02:18,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:18,034 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 107 transitions. [2021-05-02 23:02:18,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:18,035 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 107 transitions. [2021-05-02 23:02:18,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-05-02 23:02:18,035 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:18,035 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 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] [2021-05-02 23:02:18,035 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-05-02 23:02:18,036 INFO L428 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:18,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:18,036 INFO L82 PathProgramCache]: Analyzing trace with hash 144224649, now seen corresponding path program 5 times [2021-05-02 23:02:18,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:18,036 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [350514221] [2021-05-02 23:02:18,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:18,040 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-05-02 23:02:18,042 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:02:18,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:18,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:18,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:18,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:02:18,123 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:18,123 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [350514221] [2021-05-02 23:02:18,123 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [350514221] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:18,124 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:18,124 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-05-02 23:02:18,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605769634] [2021-05-02 23:02:18,124 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-02 23:02:18,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:18,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-02 23:02:18,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-05-02 23:02:18,125 INFO L87 Difference]: Start difference. First operand 90 states and 107 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:18,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:18,249 INFO L93 Difference]: Finished difference Result 106 states and 125 transitions. [2021-05-02 23:02:18,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 23:02:18,249 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2021-05-02 23:02:18,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:18,250 INFO L225 Difference]: With dead ends: 106 [2021-05-02 23:02:18,250 INFO L226 Difference]: Without dead ends: 87 [2021-05-02 23:02:18,250 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 70.6ms TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-05-02 23:02:18,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-05-02 23:02:18,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2021-05-02 23:02:18,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 80 states have (on average 1.1625) internal successors, (93), 80 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:18,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 97 transitions. [2021-05-02 23:02:18,257 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 97 transitions. Word has length 60 [2021-05-02 23:02:18,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:18,258 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 97 transitions. [2021-05-02 23:02:18,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:18,258 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 97 transitions. [2021-05-02 23:02:18,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-05-02 23:02:18,258 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:18,258 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:02:18,259 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-05-02 23:02:18,259 INFO L428 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:18,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:18,259 INFO L82 PathProgramCache]: Analyzing trace with hash 2129101949, now seen corresponding path program 5 times [2021-05-02 23:02:18,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:18,259 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1978654713] [2021-05-02 23:02:18,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:18,263 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-05-02 23:02:18,264 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:02:18,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:18,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:18,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:18,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:02:18,335 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:18,335 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1978654713] [2021-05-02 23:02:18,335 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1978654713] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:18,335 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:18,335 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-02 23:02:18,335 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150492229] [2021-05-02 23:02:18,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-02 23:02:18,335 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:18,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-02 23:02:18,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-05-02 23:02:18,336 INFO L87 Difference]: Start difference. First operand 85 states and 97 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:18,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:18,424 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2021-05-02 23:02:18,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 23:02:18,425 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2021-05-02 23:02:18,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:18,425 INFO L225 Difference]: With dead ends: 91 [2021-05-02 23:02:18,425 INFO L226 Difference]: Without dead ends: 68 [2021-05-02 23:02:18,426 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 55.4ms TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-05-02 23:02:18,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-05-02 23:02:18,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-05-02 23:02:18,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 63 states have (on average 1.1587301587301588) internal successors, (73), 63 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:18,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2021-05-02 23:02:18,431 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 60 [2021-05-02 23:02:18,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:18,431 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2021-05-02 23:02:18,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:18,431 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2021-05-02 23:02:18,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-05-02 23:02:18,432 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:18,432 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:02:18,432 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-05-02 23:02:18,432 INFO L428 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:18,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:18,432 INFO L82 PathProgramCache]: Analyzing trace with hash -344219479, now seen corresponding path program 6 times [2021-05-02 23:02:18,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:18,433 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [53345682] [2021-05-02 23:02:18,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:18,437 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-05-02 23:02:18,438 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:02:18,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:18,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:18,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:18,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:02:18,513 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:18,513 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [53345682] [2021-05-02 23:02:18,513 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [53345682] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:18,513 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:18,513 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-05-02 23:02:18,513 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427157855] [2021-05-02 23:02:18,513 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-02 23:02:18,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:18,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-02 23:02:18,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-05-02 23:02:18,514 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:18,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:18,616 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2021-05-02 23:02:18,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-02 23:02:18,617 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2021-05-02 23:02:18,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:18,617 INFO L225 Difference]: With dead ends: 79 [2021-05-02 23:02:18,617 INFO L226 Difference]: Without dead ends: 63 [2021-05-02 23:02:18,618 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 61.9ms TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-05-02 23:02:18,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-05-02 23:02:18,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-05-02 23:02:18,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 58 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:18,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2021-05-02 23:02:18,622 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 60 [2021-05-02 23:02:18,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:18,622 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2021-05-02 23:02:18,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:18,622 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2021-05-02 23:02:18,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-05-02 23:02:18,623 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:18,623 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:02:18,623 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-05-02 23:02:18,623 INFO L428 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:18,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:18,624 INFO L82 PathProgramCache]: Analyzing trace with hash -346543548, now seen corresponding path program 7 times [2021-05-02 23:02:18,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:18,624 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1610974462] [2021-05-02 23:02:18,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:18,628 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-05-02 23:02:18,629 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:02:18,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:18,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:18,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:18,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:02:18,736 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:18,736 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1610974462] [2021-05-02 23:02:18,736 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1610974462] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:18,736 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:18,736 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-05-02 23:02:18,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743560681] [2021-05-02 23:02:18,737 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-05-02 23:02:18,737 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:18,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-05-02 23:02:18,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-05-02 23:02:18,737 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:18,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:18,952 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2021-05-02 23:02:18,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-05-02 23:02:18,953 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2021-05-02 23:02:18,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:18,953 INFO L225 Difference]: With dead ends: 74 [2021-05-02 23:02:18,953 INFO L226 Difference]: Without dead ends: 68 [2021-05-02 23:02:18,954 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 163.7ms TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2021-05-02 23:02:18,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-05-02 23:02:18,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2021-05-02 23:02:18,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 58 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:18,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2021-05-02 23:02:18,958 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 62 [2021-05-02 23:02:18,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:18,959 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2021-05-02 23:02:18,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:18,959 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2021-05-02 23:02:18,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-05-02 23:02:18,959 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:18,959 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 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] [2021-05-02 23:02:18,959 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-05-02 23:02:18,960 INFO L428 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:18,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:18,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1047608126, now seen corresponding path program 6 times [2021-05-02 23:02:18,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:18,960 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1722822630] [2021-05-02 23:02:18,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:18,964 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-05-02 23:02:18,965 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:02:18,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:19,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:19,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:19,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:02:19,081 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:19,081 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1722822630] [2021-05-02 23:02:19,081 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1722822630] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:19,081 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:19,081 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-05-02 23:02:19,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953663712] [2021-05-02 23:02:19,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-05-02 23:02:19,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:19,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-05-02 23:02:19,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-05-02 23:02:19,082 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:19,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:19,291 INFO L93 Difference]: Finished difference Result 99 states and 118 transitions. [2021-05-02 23:02:19,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-05-02 23:02:19,291 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2021-05-02 23:02:19,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:19,292 INFO L225 Difference]: With dead ends: 99 [2021-05-02 23:02:19,292 INFO L226 Difference]: Without dead ends: 81 [2021-05-02 23:02:19,292 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 153.1ms TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2021-05-02 23:02:19,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-05-02 23:02:19,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2021-05-02 23:02:19,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.164179104477612) internal successors, (78), 67 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:19,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2021-05-02 23:02:19,299 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 62 [2021-05-02 23:02:19,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:19,299 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2021-05-02 23:02:19,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:19,299 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2021-05-02 23:02:19,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-05-02 23:02:19,300 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:19,300 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 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] [2021-05-02 23:02:19,300 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-05-02 23:02:19,300 INFO L428 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:19,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:19,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1672013017, now seen corresponding path program 8 times [2021-05-02 23:02:19,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:19,300 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1640846689] [2021-05-02 23:02:19,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:19,306 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-05-02 23:02:19,307 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:02:19,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:19,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:19,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:19,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:02:19,398 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:19,398 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1640846689] [2021-05-02 23:02:19,398 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1640846689] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:19,398 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:19,398 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-05-02 23:02:19,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733568940] [2021-05-02 23:02:19,398 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-05-02 23:02:19,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:19,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-05-02 23:02:19,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-05-02 23:02:19,399 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:19,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:19,537 INFO L93 Difference]: Finished difference Result 129 states and 157 transitions. [2021-05-02 23:02:19,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-02 23:02:19,538 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2021-05-02 23:02:19,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:19,538 INFO L225 Difference]: With dead ends: 129 [2021-05-02 23:02:19,538 INFO L226 Difference]: Without dead ends: 115 [2021-05-02 23:02:19,539 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 84.5ms TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2021-05-02 23:02:19,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-05-02 23:02:19,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 100. [2021-05-02 23:02:19,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 95 states have (on average 1.2105263157894737) internal successors, (115), 95 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:19,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 119 transitions. [2021-05-02 23:02:19,550 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 119 transitions. Word has length 64 [2021-05-02 23:02:19,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:19,551 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 119 transitions. [2021-05-02 23:02:19,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:19,551 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 119 transitions. [2021-05-02 23:02:19,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-05-02 23:02:19,551 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:19,551 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 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] [2021-05-02 23:02:19,551 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-05-02 23:02:19,552 INFO L428 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:19,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:19,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1013928861, now seen corresponding path program 7 times [2021-05-02 23:02:19,552 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:19,552 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [937580071] [2021-05-02 23:02:19,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:19,558 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-05-02 23:02:19,559 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:02:19,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:19,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:19,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:19,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:02:19,687 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:19,687 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [937580071] [2021-05-02 23:02:19,687 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [937580071] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:19,688 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:19,688 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-05-02 23:02:19,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990594116] [2021-05-02 23:02:19,689 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-05-02 23:02:19,689 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:19,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-05-02 23:02:19,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2021-05-02 23:02:19,689 INFO L87 Difference]: Start difference. First operand 100 states and 119 transitions. Second operand has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 13 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:20,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:20,052 INFO L93 Difference]: Finished difference Result 132 states and 162 transitions. [2021-05-02 23:02:20,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-05-02 23:02:20,052 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 13 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2021-05-02 23:02:20,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:20,055 INFO L225 Difference]: With dead ends: 132 [2021-05-02 23:02:20,055 INFO L226 Difference]: Without dead ends: 126 [2021-05-02 23:02:20,056 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 255.1ms TimeCoverageRelationStatistics Valid=190, Invalid=622, Unknown=0, NotChecked=0, Total=812 [2021-05-02 23:02:20,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-05-02 23:02:20,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 104. [2021-05-02 23:02:20,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 99 states have (on average 1.2222222222222223) internal successors, (121), 99 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:20,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 125 transitions. [2021-05-02 23:02:20,068 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 125 transitions. Word has length 64 [2021-05-02 23:02:20,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:20,069 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 125 transitions. [2021-05-02 23:02:20,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 13 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:20,069 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 125 transitions. [2021-05-02 23:02:20,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-05-02 23:02:20,069 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:20,070 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:02:20,070 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-05-02 23:02:20,070 INFO L428 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:20,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:20,070 INFO L82 PathProgramCache]: Analyzing trace with hash -429691828, now seen corresponding path program 9 times [2021-05-02 23:02:20,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:20,070 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [88740052] [2021-05-02 23:02:20,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:20,074 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-05-02 23:02:20,075 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:02:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:20,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:20,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:20,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:02:20,174 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:20,174 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [88740052] [2021-05-02 23:02:20,175 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [88740052] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:20,175 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:20,175 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-05-02 23:02:20,175 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471460432] [2021-05-02 23:02:20,175 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-02 23:02:20,175 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:20,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-02 23:02:20,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-05-02 23:02:20,176 INFO L87 Difference]: Start difference. First operand 104 states and 125 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:20,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:20,363 INFO L93 Difference]: Finished difference Result 136 states and 166 transitions. [2021-05-02 23:02:20,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-05-02 23:02:20,363 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2021-05-02 23:02:20,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:20,364 INFO L225 Difference]: With dead ends: 136 [2021-05-02 23:02:20,364 INFO L226 Difference]: Without dead ends: 119 [2021-05-02 23:02:20,364 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 121.8ms TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2021-05-02 23:02:20,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-05-02 23:02:20,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 106. [2021-05-02 23:02:20,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 101 states have (on average 1.2178217821782178) internal successors, (123), 101 states have internal predecessors, (123), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:20,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 127 transitions. [2021-05-02 23:02:20,375 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 127 transitions. Word has length 66 [2021-05-02 23:02:20,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:20,375 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 127 transitions. [2021-05-02 23:02:20,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:20,376 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 127 transitions. [2021-05-02 23:02:20,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-05-02 23:02:20,376 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:20,376 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:02:20,376 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-05-02 23:02:20,376 INFO L428 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:20,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:20,377 INFO L82 PathProgramCache]: Analyzing trace with hash 71914048, now seen corresponding path program 8 times [2021-05-02 23:02:20,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:20,377 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1414369181] [2021-05-02 23:02:20,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:20,381 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-05-02 23:02:20,383 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:02:20,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:20,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:20,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:20,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:02:20,467 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:20,467 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1414369181] [2021-05-02 23:02:20,467 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1414369181] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:20,468 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:20,468 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-05-02 23:02:20,468 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621800830] [2021-05-02 23:02:20,468 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-05-02 23:02:20,468 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:20,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-05-02 23:02:20,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-05-02 23:02:20,469 INFO L87 Difference]: Start difference. First operand 106 states and 127 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:20,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:20,606 INFO L93 Difference]: Finished difference Result 134 states and 162 transitions. [2021-05-02 23:02:20,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-02 23:02:20,607 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2021-05-02 23:02:20,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:20,608 INFO L225 Difference]: With dead ends: 134 [2021-05-02 23:02:20,608 INFO L226 Difference]: Without dead ends: 114 [2021-05-02 23:02:20,608 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 77.1ms TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2021-05-02 23:02:20,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-05-02 23:02:20,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 94. [2021-05-02 23:02:20,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 89 states have (on average 1.1797752808988764) internal successors, (105), 89 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:20,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 109 transitions. [2021-05-02 23:02:20,617 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 109 transitions. Word has length 66 [2021-05-02 23:02:20,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:20,617 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 109 transitions. [2021-05-02 23:02:20,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:20,617 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 109 transitions. [2021-05-02 23:02:20,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-05-02 23:02:20,618 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:20,618 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 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] [2021-05-02 23:02:20,618 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-05-02 23:02:20,618 INFO L428 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:20,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:20,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1121275668, now seen corresponding path program 10 times [2021-05-02 23:02:20,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:20,619 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1369534849] [2021-05-02 23:02:20,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:20,622 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-05-02 23:02:20,624 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:02:20,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:20,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:20,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:20,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:02:20,723 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:20,723 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1369534849] [2021-05-02 23:02:20,723 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1369534849] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:20,723 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:20,723 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-05-02 23:02:20,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640417028] [2021-05-02 23:02:20,724 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-02 23:02:20,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:20,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-02 23:02:20,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-05-02 23:02:20,725 INFO L87 Difference]: Start difference. First operand 94 states and 109 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:20,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:20,913 INFO L93 Difference]: Finished difference Result 118 states and 140 transitions. [2021-05-02 23:02:20,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-02 23:02:20,913 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2021-05-02 23:02:20,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:20,914 INFO L225 Difference]: With dead ends: 118 [2021-05-02 23:02:20,914 INFO L226 Difference]: Without dead ends: 98 [2021-05-02 23:02:20,915 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 108.9ms TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2021-05-02 23:02:20,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-05-02 23:02:20,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 89. [2021-05-02 23:02:20,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 84 states have (on average 1.1547619047619047) internal successors, (97), 84 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:20,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 101 transitions. [2021-05-02 23:02:20,924 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 101 transitions. Word has length 66 [2021-05-02 23:02:20,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:20,924 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 101 transitions. [2021-05-02 23:02:20,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:20,924 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 101 transitions. [2021-05-02 23:02:20,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-05-02 23:02:20,925 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:20,925 INFO L523 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:02:20,925 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-05-02 23:02:20,925 INFO L428 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:20,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:20,925 INFO L82 PathProgramCache]: Analyzing trace with hash 719926191, now seen corresponding path program 11 times [2021-05-02 23:02:20,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:20,925 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1150999787] [2021-05-02 23:02:20,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:20,930 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-05-02 23:02:20,931 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:02:20,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:21,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:21,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:21,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:02:21,042 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:21,042 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1150999787] [2021-05-02 23:02:21,042 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1150999787] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:21,043 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:21,043 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-05-02 23:02:21,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278623295] [2021-05-02 23:02:21,044 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-05-02 23:02:21,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:21,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-05-02 23:02:21,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-05-02 23:02:21,044 INFO L87 Difference]: Start difference. First operand 89 states and 101 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:21,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:21,236 INFO L93 Difference]: Finished difference Result 106 states and 122 transitions. [2021-05-02 23:02:21,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-05-02 23:02:21,236 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2021-05-02 23:02:21,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:21,237 INFO L225 Difference]: With dead ends: 106 [2021-05-02 23:02:21,237 INFO L226 Difference]: Without dead ends: 69 [2021-05-02 23:02:21,238 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 137.5ms TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2021-05-02 23:02:21,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-05-02 23:02:21,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-05-02 23:02:21,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.140625) internal successors, (73), 64 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:21,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2021-05-02 23:02:21,245 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 68 [2021-05-02 23:02:21,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:21,245 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2021-05-02 23:02:21,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:21,245 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2021-05-02 23:02:21,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-05-02 23:02:21,246 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:21,246 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:02:21,246 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-05-02 23:02:21,246 INFO L428 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:21,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:21,246 INFO L82 PathProgramCache]: Analyzing trace with hash 462723015, now seen corresponding path program 12 times [2021-05-02 23:02:21,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:21,247 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1320380394] [2021-05-02 23:02:21,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:21,254 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-05-02 23:02:21,255 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:02:21,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:21,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:21,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:21,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:02:21,398 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:21,398 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1320380394] [2021-05-02 23:02:21,398 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1320380394] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:21,398 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:21,398 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-05-02 23:02:21,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367713712] [2021-05-02 23:02:21,398 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-05-02 23:02:21,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:21,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-05-02 23:02:21,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2021-05-02 23:02:21,399 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand has 15 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 13 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:21,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:21,690 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2021-05-02 23:02:21,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-05-02 23:02:21,691 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 13 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2021-05-02 23:02:21,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:21,691 INFO L225 Difference]: With dead ends: 82 [2021-05-02 23:02:21,691 INFO L226 Difference]: Without dead ends: 76 [2021-05-02 23:02:21,692 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 228.0ms TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2021-05-02 23:02:21,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-05-02 23:02:21,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2021-05-02 23:02:21,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.140625) internal successors, (73), 64 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:21,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2021-05-02 23:02:21,698 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 68 [2021-05-02 23:02:21,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:21,698 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2021-05-02 23:02:21,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 13 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:21,698 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2021-05-02 23:02:21,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-05-02 23:02:21,699 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:21,699 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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] [2021-05-02 23:02:21,699 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-05-02 23:02:21,699 INFO L428 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:21,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:21,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1049529029, now seen corresponding path program 9 times [2021-05-02 23:02:21,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:21,700 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [207585222] [2021-05-02 23:02:21,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:21,703 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-05-02 23:02:21,704 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:02:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:21,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:21,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:21,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:02:21,856 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:21,856 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [207585222] [2021-05-02 23:02:21,856 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [207585222] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:21,856 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:21,856 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-05-02 23:02:21,856 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69071223] [2021-05-02 23:02:21,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-05-02 23:02:21,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:21,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-05-02 23:02:21,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2021-05-02 23:02:21,857 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 14 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:22,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:22,148 INFO L93 Difference]: Finished difference Result 111 states and 134 transitions. [2021-05-02 23:02:22,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-05-02 23:02:22,149 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 14 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2021-05-02 23:02:22,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:22,149 INFO L225 Difference]: With dead ends: 111 [2021-05-02 23:02:22,149 INFO L226 Difference]: Without dead ends: 91 [2021-05-02 23:02:22,150 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 202.8ms TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2021-05-02 23:02:22,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-05-02 23:02:22,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 80. [2021-05-02 23:02:22,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.1733333333333333) internal successors, (88), 75 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:22,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions. [2021-05-02 23:02:22,159 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 92 transitions. Word has length 68 [2021-05-02 23:02:22,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:22,160 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 92 transitions. [2021-05-02 23:02:22,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 14 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:22,160 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2021-05-02 23:02:22,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-05-02 23:02:22,160 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:22,160 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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] [2021-05-02 23:02:22,161 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-05-02 23:02:22,161 INFO L428 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:22,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:22,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1355926550, now seen corresponding path program 13 times [2021-05-02 23:02:22,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:22,161 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1254561362] [2021-05-02 23:02:22,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:22,165 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-05-02 23:02:22,166 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:02:22,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:22,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:22,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:22,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:02:22,274 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:22,274 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1254561362] [2021-05-02 23:02:22,274 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1254561362] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:22,274 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:22,275 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-05-02 23:02:22,275 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704879386] [2021-05-02 23:02:22,275 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-05-02 23:02:22,275 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:22,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-05-02 23:02:22,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-05-02 23:02:22,276 INFO L87 Difference]: Start difference. First operand 80 states and 92 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:22,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:22,457 INFO L93 Difference]: Finished difference Result 149 states and 184 transitions. [2021-05-02 23:02:22,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-05-02 23:02:22,458 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2021-05-02 23:02:22,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:22,459 INFO L225 Difference]: With dead ends: 149 [2021-05-02 23:02:22,459 INFO L226 Difference]: Without dead ends: 133 [2021-05-02 23:02:22,460 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 110.7ms TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2021-05-02 23:02:22,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-05-02 23:02:22,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 114. [2021-05-02 23:02:22,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 109 states have (on average 1.2201834862385321) internal successors, (133), 109 states have internal predecessors, (133), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:22,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 137 transitions. [2021-05-02 23:02:22,474 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 137 transitions. Word has length 70 [2021-05-02 23:02:22,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:22,474 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 137 transitions. [2021-05-02 23:02:22,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:22,474 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 137 transitions. [2021-05-02 23:02:22,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-05-02 23:02:22,475 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:22,475 INFO L523 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 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] [2021-05-02 23:02:22,475 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-05-02 23:02:22,475 INFO L428 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:22,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:22,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1441126688, now seen corresponding path program 10 times [2021-05-02 23:02:22,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:22,476 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [266712169] [2021-05-02 23:02:22,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:22,480 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-05-02 23:02:22,482 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:02:22,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:22,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:22,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:22,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:02:22,969 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:22,969 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [266712169] [2021-05-02 23:02:22,969 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [266712169] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:22,970 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:22,970 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-05-02 23:02:22,970 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513239010] [2021-05-02 23:02:22,970 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-05-02 23:02:22,970 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:22,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-05-02 23:02:22,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2021-05-02 23:02:22,971 INFO L87 Difference]: Start difference. First operand 114 states and 137 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 16 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:23,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:23,393 INFO L93 Difference]: Finished difference Result 143 states and 174 transitions. [2021-05-02 23:02:23,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-02 23:02:23,393 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 16 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2021-05-02 23:02:23,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:23,394 INFO L225 Difference]: With dead ends: 143 [2021-05-02 23:02:23,394 INFO L226 Difference]: Without dead ends: 107 [2021-05-02 23:02:23,395 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 422.9ms TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2021-05-02 23:02:23,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-05-02 23:02:23,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 99. [2021-05-02 23:02:23,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 94 states have (on average 1.1595744680851063) internal successors, (109), 94 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:23,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2021-05-02 23:02:23,409 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 70 [2021-05-02 23:02:23,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:23,410 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2021-05-02 23:02:23,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 16 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:23,410 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2021-05-02 23:02:23,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-05-02 23:02:23,410 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:23,410 INFO L523 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:02:23,411 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-05-02 23:02:23,411 INFO L428 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:23,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:23,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1988634575, now seen corresponding path program 14 times [2021-05-02 23:02:23,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:23,411 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1014536535] [2021-05-02 23:02:23,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:23,415 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-05-02 23:02:23,417 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:02:23,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:23,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:23,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:23,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:02:23,530 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:23,530 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1014536535] [2021-05-02 23:02:23,530 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1014536535] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:23,530 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:23,530 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-05-02 23:02:23,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202614230] [2021-05-02 23:02:23,531 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-05-02 23:02:23,531 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:23,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-05-02 23:02:23,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2021-05-02 23:02:23,532 INFO L87 Difference]: Start difference. First operand 99 states and 113 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:23,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:23,795 INFO L93 Difference]: Finished difference Result 140 states and 168 transitions. [2021-05-02 23:02:23,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-05-02 23:02:23,795 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 72 [2021-05-02 23:02:23,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:23,796 INFO L225 Difference]: With dead ends: 140 [2021-05-02 23:02:23,796 INFO L226 Difference]: Without dead ends: 120 [2021-05-02 23:02:23,797 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 162.0ms TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2021-05-02 23:02:23,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-05-02 23:02:23,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 103. [2021-05-02 23:02:23,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 98 states have (on average 1.163265306122449) internal successors, (114), 98 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:23,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 118 transitions. [2021-05-02 23:02:23,812 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 118 transitions. Word has length 72 [2021-05-02 23:02:23,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:23,812 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 118 transitions. [2021-05-02 23:02:23,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:23,813 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 118 transitions. [2021-05-02 23:02:23,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-05-02 23:02:23,813 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:23,813 INFO L523 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 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] [2021-05-02 23:02:23,813 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-05-02 23:02:23,814 INFO L428 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:23,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:23,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1533649391, now seen corresponding path program 15 times [2021-05-02 23:02:23,814 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:23,814 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [750613582] [2021-05-02 23:02:23,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:23,818 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-05-02 23:02:23,819 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:02:23,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:23,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:23,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:02:23,944 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:23,944 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [750613582] [2021-05-02 23:02:23,944 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [750613582] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:23,944 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:23,944 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-05-02 23:02:23,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486381823] [2021-05-02 23:02:23,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-05-02 23:02:23,945 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:23,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-05-02 23:02:23,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-05-02 23:02:23,945 INFO L87 Difference]: Start difference. First operand 103 states and 118 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:24,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:24,127 INFO L93 Difference]: Finished difference Result 122 states and 142 transitions. [2021-05-02 23:02:24,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-05-02 23:02:24,127 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 72 [2021-05-02 23:02:24,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:24,128 INFO L225 Difference]: With dead ends: 122 [2021-05-02 23:02:24,128 INFO L226 Difference]: Without dead ends: 85 [2021-05-02 23:02:24,129 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 139.9ms TimeCoverageRelationStatistics Valid=152, Invalid=310, Unknown=0, NotChecked=0, Total=462 [2021-05-02 23:02:24,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-05-02 23:02:24,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2021-05-02 23:02:24,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 80 states have (on average 1.15) internal successors, (92), 80 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:24,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2021-05-02 23:02:24,142 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 72 [2021-05-02 23:02:24,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:24,142 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2021-05-02 23:02:24,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:24,142 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2021-05-02 23:02:24,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-05-02 23:02:24,142 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:02:24,143 INFO L523 BasicCegarLoop]: trace histogram [7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:02:24,143 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-05-02 23:02:24,143 INFO L428 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:02:24,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:02:24,143 INFO L82 PathProgramCache]: Analyzing trace with hash 769718898, now seen corresponding path program 16 times [2021-05-02 23:02:24,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:02:24,143 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [296690606] [2021-05-02 23:02:24,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:02:24,147 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2021-05-02 23:02:24,148 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:02:24,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:24,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:02:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:02:24,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:02:24,299 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:02:24,299 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [296690606] [2021-05-02 23:02:24,299 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [296690606] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:02:24,299 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:02:24,299 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-05-02 23:02:24,299 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909305851] [2021-05-02 23:02:24,299 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-05-02 23:02:24,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:02:24,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-05-02 23:02:24,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2021-05-02 23:02:24,300 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 14 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:24,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:02:24,530 INFO L93 Difference]: Finished difference Result 94 states and 108 transitions. [2021-05-02 23:02:24,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-05-02 23:02:24,530 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 14 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2021-05-02 23:02:24,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:02:24,530 INFO L225 Difference]: With dead ends: 94 [2021-05-02 23:02:24,530 INFO L226 Difference]: Without dead ends: 0 [2021-05-02 23:02:24,531 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 171.0ms TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2021-05-02 23:02:24,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-02 23:02:24,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-02 23:02:24,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-02 23:02:24,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-02 23:02:24,532 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2021-05-02 23:02:24,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:02:24,532 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-02 23:02:24,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 14 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:02:24,532 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-02 23:02:24,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-02 23:02:24,532 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-05-02 23:02:24,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-05-02 23:02:25,702 WARN L205 SmtUtils]: Spent 946.00 ms on a formula simplification. DAG size of input: 329 DAG size of output: 287 [2021-05-02 23:02:26,144 WARN L205 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 254 DAG size of output: 229 [2021-05-02 23:02:26,506 WARN L205 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2021-05-02 23:02:26,807 WARN L205 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 30 [2021-05-02 23:02:27,063 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 30 [2021-05-02 23:02:29,466 WARN L205 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 273 DAG size of output: 99 [2021-05-02 23:02:29,756 WARN L205 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 34 [2021-05-02 23:02:31,381 WARN L205 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 218 DAG size of output: 91 [2021-05-02 23:02:31,773 WARN L205 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 45 [2021-05-02 23:02:31,840 INFO L198 CegarLoopUtils]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2021-05-02 23:02:31,840 INFO L198 CegarLoopUtils]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2021-05-02 23:02:31,840 INFO L198 CegarLoopUtils]: For program point L12-1(line 12) no Hoare annotation was computed. [2021-05-02 23:02:31,840 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2021-05-02 23:02:31,840 INFO L194 CegarLoopUtils]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#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)|)) [2021-05-02 23:02:31,840 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-05-02 23:02:31,840 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-05-02 23:02:31,840 INFO L201 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-05-02 23:02:31,840 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-05-02 23:02:31,841 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-05-02 23:02:31,841 INFO L198 CegarLoopUtils]: For program point L16(line 16) no Hoare annotation was computed. [2021-05-02 23:02:31,841 INFO L198 CegarLoopUtils]: For program point L16-2(lines 15 17) no Hoare annotation was computed. [2021-05-02 23:02:31,841 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notENTRY(lines 15 17) no Hoare annotation was computed. [2021-05-02 23:02:31,841 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notEXIT(lines 15 17) no Hoare annotation was computed. [2021-05-02 23:02:31,841 INFO L201 CegarLoopUtils]: At program point mainEXIT(lines 28 72) the Hoare annotation is: true [2021-05-02 23:02:31,841 INFO L194 CegarLoopUtils]: At program point L69(line 69) the Hoare annotation is: (let ((.cse2 (<= 1 main_~nc_B~0)) (.cse0 (<= main_~nc_B~0 main_~j~0)) (.cse1 (= 1 main_~found~0))) (or (and .cse0 (<= main_~nc_B~0 2) .cse1 .cse2 (<= 2 main_~nc_A~0)) (and .cse0 (<= main_~nc_B~0 1) .cse1 .cse2) (and (<= (+ main_~j~0 1) main_~nc_B~0) .cse2 (= 0 main_~found~0)) (and (= main_~nc_B~0 0) (= main_~i~0 0) (= main_~i~0 main_~j~0) .cse1) (and (<= 3 main_~nc_B~0) .cse0 (<= 3 main_~nc_A~0) (<= main_~nc_B~0 4) .cse1))) [2021-05-02 23:02:31,841 INFO L201 CegarLoopUtils]: At program point L69-1(line 69) the Hoare annotation is: true [2021-05-02 23:02:31,841 INFO L194 CegarLoopUtils]: At program point L53-2(lines 53 65) the Hoare annotation is: (let ((.cse0 (<= 1 main_~nc_B~0)) (.cse1 (= 0 main_~found~0))) (or (and (<= main_~nc_B~0 2) .cse0 (<= 2 main_~nc_A~0) .cse1) (and (<= (+ main_~j~0 1) main_~nc_B~0) .cse0 .cse1) (and (= main_~nc_B~0 0) (= main_~i~0 0) (= main_~i~0 main_~j~0)) (and (<= 3 main_~nc_A~0) (<= main_~nc_B~0 4) .cse0 .cse1) (and (<= main_~nc_B~0 1) .cse0 .cse1))) [2021-05-02 23:02:31,841 INFO L194 CegarLoopUtils]: At program point L37-2(lines 37 38) the Hoare annotation is: (and (<= main_~i~0 4) (= |main_~#string_B~0.offset| 0) (= |main_~#string_A~0.offset| 0) (= 0 main_~found~0)) [2021-05-02 23:02:31,841 INFO L194 CegarLoopUtils]: At program point L37-3(lines 37 38) the Hoare annotation is: (and (= |main_~#string_B~0.offset| 0) (= |main_~#string_A~0.offset| 0) (= 0 main_~found~0)) [2021-05-02 23:02:31,842 INFO L194 CegarLoopUtils]: At program point L37-4(lines 37 38) the Hoare annotation is: (and (= |main_~#string_B~0.offset| 0) (= |main_~#string_A~0.offset| 0) (= 0 main_~found~0)) [2021-05-02 23:02:31,842 INFO L194 CegarLoopUtils]: At program point L33-2(lines 33 34) the Hoare annotation is: (and (<= main_~i~0 4) (= |main_~#string_B~0.offset| 0) (= |main_~#string_A~0.offset| 0) (= 0 main_~found~0)) [2021-05-02 23:02:31,842 INFO L194 CegarLoopUtils]: At program point L33-3(lines 33 34) the Hoare annotation is: (and (= |main_~#string_B~0.offset| 0) (= |main_~#string_A~0.offset| 0) (= 0 main_~found~0)) [2021-05-02 23:02:31,842 INFO L194 CegarLoopUtils]: At program point L33-4(lines 33 34) the Hoare annotation is: (and (= |main_~#string_B~0.offset| 0) (= |main_~#string_A~0.offset| 0) (= 0 main_~found~0)) [2021-05-02 23:02:31,842 INFO L194 CegarLoopUtils]: At program point L46-1(lines 46 47) the Hoare annotation is: (let ((.cse5 (<= 2 main_~nc_B~0)) (.cse3 (<= 1 main_~nc_B~0)) (.cse7 (<= main_~nc_A~0 3)) (.cse1 (+ main_~nc_B~0 |main_~#string_A~0.offset|)) (.cse0 (= (select (select |#memory_int| |main_~#string_B~0.base|) (+ |main_~#string_B~0.offset| 4)) 0)) (.cse8 (= main_~nc_B~0 0)) (.cse6 (= |main_~#string_B~0.offset| 0)) (.cse2 (= |main_~#string_A~0.offset| 0)) (.cse4 (= 0 main_~found~0))) (or (and .cse0 (= .cse1 (+ |main_~#string_B~0.offset| 1)) (<= main_~nc_B~0 1) .cse2 .cse3 .cse4) (and .cse5 .cse0 (= (+ |main_~#string_B~0.offset| 2) .cse1) (<= main_~nc_B~0 2) .cse2 .cse4) (and (= |main_#t~mem11| 0) .cse5 .cse0 .cse6 (<= main_~nc_B~0 4) .cse2 .cse4) (and .cse7 .cse3 .cse4) (and .cse8 .cse7 .cse4) (and (<= 3 main_~nc_B~0) .cse0 (= (+ |main_~#string_B~0.offset| 3) .cse1) (<= main_~nc_B~0 3) .cse2 .cse4) (and .cse0 .cse8 .cse6 .cse2 .cse4))) [2021-05-02 23:02:31,842 INFO L201 CegarLoopUtils]: At program point mainFINAL(lines 28 72) the Hoare annotation is: true [2021-05-02 23:02:31,842 INFO L194 CegarLoopUtils]: At program point L46-3(lines 46 47) the Hoare annotation is: (let ((.cse2 (<= 1 main_~nc_B~0)) (.cse4 (<= main_~nc_A~0 3)) (.cse0 (= (select (select |#memory_int| |main_~#string_B~0.base|) (+ |main_~#string_B~0.offset| 4)) 0)) (.cse5 (= main_~nc_B~0 0)) (.cse6 (= |main_~#string_B~0.offset| 0)) (.cse1 (= |main_~#string_A~0.offset| 0)) (.cse3 (= 0 main_~found~0))) (or (and .cse0 (= (+ main_~nc_B~0 |main_~#string_A~0.offset|) (+ |main_~#string_B~0.offset| 1)) (<= main_~nc_B~0 1) .cse1 .cse2 .cse3) (and .cse4 .cse2 .cse3) (and .cse5 .cse4 .cse3) (and (<= 2 main_~nc_B~0) .cse0 .cse6 (<= main_~nc_B~0 4) .cse1 .cse3) (and .cse0 .cse5 .cse6 .cse1 .cse3))) [2021-05-02 23:02:31,843 INFO L194 CegarLoopUtils]: At program point L46-4(lines 29 72) the Hoare annotation is: (let ((.cse0 (<= 1 main_~nc_B~0)) (.cse1 (= 0 main_~found~0))) (or (= main_~nc_B~0 0) (and (<= main_~nc_A~0 3) .cse0 .cse1) (and (<= main_~nc_B~0 3) .cse0 .cse1) (and (<= 2 main_~nc_B~0) (= (select (select |#memory_int| |main_~#string_B~0.base|) (+ |main_~#string_B~0.offset| 4)) 0) (= |main_~#string_B~0.offset| 0) (<= main_~nc_B~0 4) (= |main_~#string_A~0.offset| 0) .cse1))) [2021-05-02 23:02:31,843 INFO L194 CegarLoopUtils]: At program point L42-1(lines 42 43) the Hoare annotation is: (let ((.cse0 (= (select (select |#memory_int| |main_~#string_B~0.base|) (+ |main_~#string_B~0.offset| 4)) 0)) (.cse1 (= |main_~#string_B~0.offset| 0)) (.cse2 (= |main_~#string_A~0.offset| 0)) (.cse3 (= 0 main_~found~0))) (or (and (= main_~nc_A~0 0) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (<= 1 main_~nc_A~0)))) [2021-05-02 23:02:31,843 INFO L194 CegarLoopUtils]: At program point L42-3(lines 42 43) the Hoare annotation is: (let ((.cse0 (= (select (select |#memory_int| |main_~#string_B~0.base|) (+ |main_~#string_B~0.offset| 4)) 0)) (.cse1 (= |main_~#string_B~0.offset| 0)) (.cse2 (= |main_~#string_A~0.offset| 0)) (.cse3 (= 0 main_~found~0))) (or (and (= main_~nc_A~0 0) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (<= 1 main_~nc_A~0)))) [2021-05-02 23:02:31,843 INFO L194 CegarLoopUtils]: At program point L42-4(lines 42 43) the Hoare annotation is: (let ((.cse0 (= 0 main_~found~0))) (or (and (<= main_~nc_A~0 3) .cse0) (and (= (select (select |#memory_int| |main_~#string_B~0.base|) (+ |main_~#string_B~0.offset| 4)) 0) (= |main_~#string_B~0.offset| 0) (= |main_~#string_A~0.offset| 0) .cse0))) [2021-05-02 23:02:31,843 INFO L194 CegarLoopUtils]: At program point mainENTRY(lines 28 72) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2021-05-02 23:02:31,843 INFO L194 CegarLoopUtils]: At program point L55(lines 55 64) the Hoare annotation is: (let ((.cse20 (+ main_~j~0 1)) (.cse23 (+ main_~i~0 2))) (let ((.cse12 (<= 2 main_~nc_B~0)) (.cse4 (<= 4 main_~nc_B~0)) (.cse21 (<= main_~nc_B~0 4)) (.cse13 (<= main_~nc_A~0 2)) (.cse14 (<= 2 main_~nc_A~0)) (.cse6 (= main_~j~0 0)) (.cse0 (= main_~nc_B~0 4)) (.cse3 (= (select (select |#memory_int| |main_~#string_B~0.base|) (+ |main_~#string_B~0.offset| 4)) 0)) (.cse5 (= |main_~#string_B~0.offset| 0)) (.cse17 (<= 4 main_~nc_A~0)) (.cse8 (<= main_~nc_A~0 4)) (.cse9 (= |main_~#string_A~0.offset| 0)) (.cse11 (= main_~i~0 main_~j~0)) (.cse16 (<= main_~nc_A~0 .cse23)) (.cse2 (<= (+ main_~j~0 2) main_~nc_B~0)) (.cse1 (<= 3 main_~nc_B~0)) (.cse18 (<= .cse20 main_~nc_B~0)) (.cse7 (<= 3 main_~nc_A~0)) (.cse22 (<= main_~nc_B~0 3)) (.cse15 (<= main_~nc_A~0 3)) (.cse19 (<= main_~nc_A~0 (+ main_~i~0 1))) (.cse10 (= 0 main_~found~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= main_~nc_A~0 (+ main_~i~0 3)) .cse10) (and (= main_~i~0 0) .cse11 (<= main_~nc_A~0 1) (<= 1 main_~nc_B~0) .cse10) (and .cse12 .cse6 .cse13 .cse11 .cse14 .cse10) (and .cse1 .cse6 .cse7 .cse15 .cse10 .cse16) (and .cse0 .cse3 .cse5 .cse17 .cse18 .cse8 .cse19 .cse9 .cse10) (and .cse12 .cse6 .cse13 .cse19 .cse14 .cse10) (and .cse12 .cse18 .cse13 (<= main_~nc_B~0 2) (<= main_~nc_B~0 .cse20) .cse11 .cse14 .cse10) (and .cse1 .cse2 .cse4 .cse3 .cse5 .cse6 .cse7 .cse8 .cse21 .cse11 .cse9 .cse10) (and .cse18 .cse7 .cse22 .cse19 .cse11 .cse10) (and .cse1 .cse2 .cse3 .cse5 (<= (+ main_~j~0 3) main_~nc_B~0) (<= 1 main_~i~0) .cse7 .cse8 .cse21 .cse11 .cse9 .cse10) (and .cse2 .cse13 .cse19 .cse11 .cse14 .cse10) (and .cse1 .cse6 .cse7 .cse15 .cse11 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse17 .cse7 .cse8 .cse9 .cse10 .cse16) (and .cse1 .cse2 .cse7 .cse15 .cse11 .cse10 .cse16) (and (or (and .cse1 .cse2 .cse7) (and .cse1 .cse18 .cse7 .cse22)) (<= (+ main_~j~0 main_~nc_A~0) .cse23) .cse15 .cse19 .cse10)))) [2021-05-02 23:02:31,844 INFO L194 CegarLoopUtils]: At program point L55-2(lines 53 65) the Hoare annotation is: (let ((.cse25 (+ main_~j~0 1))) (let ((.cse1 (= main_~j~0 0)) (.cse4 (<= 2 main_~nc_A~0)) (.cse7 (<= 3 main_~nc_B~0)) (.cse0 (<= 2 main_~nc_B~0)) (.cse16 (<= .cse25 main_~nc_B~0)) (.cse5 (= 0 main_~found~0))) (let ((.cse20 (<= 4 main_~nc_B~0)) (.cse10 (<= 3 main_~nc_A~0)) (.cse12 (or (and .cse0 .cse1 .cse4 .cse5) (and .cse7 (<= (+ main_~j~0 2) main_~nc_B~0) .cse0 .cse16 .cse5))) (.cse24 (+ main_~i~0 2))) (let ((.cse15 (= main_~i~0 0)) (.cse19 (<= main_~nc_A~0 main_~i~0)) (.cse14 (<= main_~nc_A~0 .cse24)) (.cse6 (= main_~nc_B~0 4)) (.cse8 (= (select (select |#memory_int| |main_~#string_B~0.base|) (+ |main_~#string_B~0.offset| 4)) 0)) (.cse9 (= |main_~#string_B~0.offset| 0)) (.cse21 (or (and .cse7 .cse1 .cse10 .cse12) (and .cse7 .cse20 (<= (+ main_~j~0 3) main_~nc_B~0) .cse10 .cse12))) (.cse11 (<= main_~nc_A~0 4)) (.cse13 (= |main_~#string_A~0.offset| 0)) (.cse2 (<= main_~nc_A~0 2)) (.cse18 (<= main_~nc_A~0 (+ main_~i~0 1))) (.cse23 (<= main_~nc_A~0 3)) (.cse3 (= main_~i~0 main_~j~0)) (.cse22 (<= main_~nc_B~0 4)) (.cse26 (<= main_~nc_B~0 main_~j~0)) (.cse17 (<= 1 main_~nc_B~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse9 (<= 4 main_~nc_A~0) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse3 (<= main_~nc_A~0 1) .cse17 .cse5) (and .cse0 .cse1 .cse2 .cse18 .cse4 .cse5) (and .cse19 .cse16 .cse17 (<= (+ main_~nc_A~0 main_~nc_B~0) 2) .cse5) (and .cse8 .cse20 .cse9 .cse1 .cse21 .cse11 .cse22 .cse3 .cse13) (and .cse7 .cse0 .cse16 .cse19 .cse10 .cse23 .cse5) (and .cse7 .cse20 .cse19 .cse16 .cse10 .cse11 .cse5) (and (= main_~nc_B~0 0) .cse15 .cse3) (and .cse7 .cse10 (<= (+ main_~j~0 main_~nc_A~0) .cse24) .cse23 .cse12 .cse18) (and .cse0 .cse19 .cse16 .cse2 .cse5) (and .cse7 .cse10 .cse23 .cse12 .cse3 .cse14) (and .cse7 .cse1 .cse10 .cse23 .cse12 .cse14) (and .cse7 .cse0 .cse16 .cse10 .cse23 .cse18 .cse3 .cse5) (and .cse7 .cse20 .cse8 .cse9 .cse16 .cse10 .cse11 (<= main_~nc_B~0 .cse25) .cse3 .cse13 .cse5) (and .cse6 .cse8 .cse20 .cse9 .cse1 .cse21 .cse11 .cse13 (<= main_~nc_A~0 (+ main_~i~0 3))) (and .cse8 .cse9 (<= 1 main_~i~0) .cse21 .cse11 .cse22 .cse3 .cse13) (and .cse16 .cse2 .cse18 .cse3 .cse4 .cse5) (and .cse26 (<= main_~nc_B~0 1) .cse17 .cse5) (and .cse7 .cse1 .cse10 .cse23 .cse12 .cse3) (and .cse7 .cse26 .cse10 .cse22 .cse5) (and .cse26 (<= main_~nc_B~0 2) .cse17 .cse4 .cse5)))))) [2021-05-02 23:02:31,844 INFO L194 CegarLoopUtils]: At program point L39(line 39) the Hoare annotation is: (and (= |main_~#string_B~0.offset| 0) (= |main_~#string_A~0.offset| 0) (= (select (select |#memory_int| |main_~#string_B~0.base|) (+ |main_~#string_B~0.offset| 4)) |main_#t~mem8|) (= 0 main_~found~0)) [2021-05-02 23:02:31,844 INFO L194 CegarLoopUtils]: At program point L35(line 35) the Hoare annotation is: (and (= |main_~#string_B~0.offset| 0) (= |main_~#string_A~0.offset| 0) (= 0 main_~found~0)) [2021-05-02 23:02:31,844 INFO L201 CegarLoopUtils]: At program point L19-2(lines 18 23) the Hoare annotation is: true [2021-05-02 23:02:31,844 INFO L201 CegarLoopUtils]: At program point __VERIFIER_assertENTRY(lines 18 23) the Hoare annotation is: true [2021-05-02 23:02:31,844 INFO L201 CegarLoopUtils]: At program point __VERIFIER_assertEXIT(lines 18 23) the Hoare annotation is: true [2021-05-02 23:02:31,844 INFO L194 CegarLoopUtils]: At program point L20(line 20) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-05-02 23:02:31,844 INFO L194 CegarLoopUtils]: At program point L19(lines 19 21) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2021-05-02 23:02:31,844 INFO L194 CegarLoopUtils]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-05-02 23:02:31,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.05 11:02:31 BoogieIcfgContainer [2021-05-02 23:02:31,868 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-02 23:02:31,868 INFO L168 Benchmark]: Toolchain (without parser) took 19501.98 ms. Allocated memory was 200.3 MB in the beginning and 348.1 MB in the end (delta: 147.8 MB). Free memory was 164.2 MB in the beginning and 279.7 MB in the end (delta: -115.5 MB). Peak memory consumption was 195.5 MB. Max. memory is 8.0 GB. [2021-05-02 23:02:31,869 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 200.3 MB. Free memory is still 180.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-02 23:02:31,869 INFO L168 Benchmark]: CACSL2BoogieTranslator took 236.08 ms. Allocated memory is still 200.3 MB. Free memory was 163.8 MB in the beginning and 181.5 MB in the end (delta: -17.6 MB). Peak memory consumption was 6.0 MB. Max. memory is 8.0 GB. [2021-05-02 23:02:31,869 INFO L168 Benchmark]: Boogie Preprocessor took 53.30 ms. Allocated memory is still 200.3 MB. Free memory was 181.5 MB in the beginning and 179.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-05-02 23:02:31,869 INFO L168 Benchmark]: RCFGBuilder took 438.12 ms. Allocated memory is still 200.3 MB. Free memory was 179.9 MB in the beginning and 160.5 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.9 MB. Max. memory is 8.0 GB. [2021-05-02 23:02:31,869 INFO L168 Benchmark]: TraceAbstraction took 18766.34 ms. Allocated memory was 200.3 MB in the beginning and 348.1 MB in the end (delta: 147.8 MB). Free memory was 160.0 MB in the beginning and 279.7 MB in the end (delta: -119.8 MB). Peak memory consumption was 191.3 MB. Max. memory is 8.0 GB. [2021-05-02 23:02:31,870 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.13 ms. Allocated memory is still 200.3 MB. Free memory is still 180.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 236.08 ms. Allocated memory is still 200.3 MB. Free memory was 163.8 MB in the beginning and 181.5 MB in the end (delta: -17.6 MB). Peak memory consumption was 6.0 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 53.30 ms. Allocated memory is still 200.3 MB. Free memory was 181.5 MB in the beginning and 179.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 438.12 ms. Allocated memory is still 200.3 MB. Free memory was 179.9 MB in the beginning and 160.5 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.9 MB. Max. memory is 8.0 GB. * TraceAbstraction took 18766.34 ms. Allocated memory was 200.3 MB in the beginning and 348.1 MB in the end (delta: 147.8 MB). Free memory was 160.0 MB in the beginning and 279.7 MB in the end (delta: -119.8 MB). Peak memory consumption was 191.3 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 20]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 11377.5ms, OverallIterations: 34, TraceHistogramMax: 7, EmptinessCheckTime: 39.4ms, AutomataDifference: 6433.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 7306.4ms, InitialAbstractionConstructionTime: 8.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 806 SDtfs, 928 SDslu, 3372 SDs, 0 SdLazy, 5452 SolverSat, 605 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2965.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 567 GetRequests, 103 SyntacticMatches, 2 SemanticMatches, 462 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1144 ImplicationChecksByTransitivity, 4118.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=30, InterpolantAutomatonStates: 402, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 302.9ms AutomataMinimizationTime, 34 MinimizatonAttempts, 275 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 35 LocationsWithAnnotation, 269 PreInvPairs, 558 NumberOfFragments, 2123 HoareAnnotationTreeSize, 269 FomulaSimplifications, 89784338 FormulaSimplificationTreeSizeReduction, 1703.6ms HoareSimplificationTime, 35 FomulaSimplificationsInter, 11379988 FormulaSimplificationTreeSizeReductionInter, 5581.9ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((((((((unknown-#memory_int-unknown[string_B][string_B + 4] == 0 && nc_B + string_A == string_B + 1) && nc_B <= 1) && string_A == 0) && 1 <= nc_B) && 0 == found) || ((nc_A <= 3 && 1 <= nc_B) && 0 == found)) || ((nc_B == 0 && nc_A <= 3) && 0 == found)) || (((((2 <= nc_B && unknown-#memory_int-unknown[string_B][string_B + 4] == 0) && string_B == 0) && nc_B <= 4) && string_A == 0) && 0 == found)) || ((((unknown-#memory_int-unknown[string_B][string_B + 4] == 0 && nc_B == 0) && string_B == 0) && string_A == 0) && 0 == found) - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: ((((nc_A == 0 && unknown-#memory_int-unknown[string_B][string_B + 4] == 0) && string_B == 0) && string_A == 0) && 0 == found) || ((((unknown-#memory_int-unknown[string_B][string_B + 4] == 0 && string_B == 0) && string_A == 0) && 0 == found) && 1 <= nc_A) - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: (string_B == 0 && string_A == 0) && 0 == found - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (string_B == 0 && string_A == 0) && 0 == found - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((2 <= nc_B && j == 0) && nc_A <= 2) && i == j) && 2 <= nc_A) && 0 == found) || (((((((((nc_B == 4 && 3 <= nc_B) && unknown-#memory_int-unknown[string_B][string_B + 4] == 0) && string_B == 0) && 4 <= nc_A) && 3 <= nc_A) && nc_A <= 4) && ((((2 <= nc_B && j == 0) && 2 <= nc_A) && 0 == found) || ((((3 <= nc_B && j + 2 <= nc_B) && 2 <= nc_B) && j + 1 <= nc_B) && 0 == found))) && string_A == 0) && nc_A <= i + 2)) || (((((i == 0 && j + 1 <= nc_B) && i == j) && nc_A <= 1) && 1 <= nc_B) && 0 == found)) || (((((2 <= nc_B && j == 0) && nc_A <= 2) && nc_A <= i + 1) && 2 <= nc_A) && 0 == found)) || ((((nc_A <= i && j + 1 <= nc_B) && 1 <= nc_B) && nc_A + nc_B <= 2) && 0 == found)) || ((((((((unknown-#memory_int-unknown[string_B][string_B + 4] == 0 && 4 <= nc_B) && string_B == 0) && j == 0) && ((((3 <= nc_B && j == 0) && 3 <= nc_A) && ((((2 <= nc_B && j == 0) && 2 <= nc_A) && 0 == found) || ((((3 <= nc_B && j + 2 <= nc_B) && 2 <= nc_B) && j + 1 <= nc_B) && 0 == found))) || ((((3 <= nc_B && 4 <= nc_B) && j + 3 <= nc_B) && 3 <= nc_A) && ((((2 <= nc_B && j == 0) && 2 <= nc_A) && 0 == found) || ((((3 <= nc_B && j + 2 <= nc_B) && 2 <= nc_B) && j + 1 <= nc_B) && 0 == found))))) && nc_A <= 4) && nc_B <= 4) && i == j) && string_A == 0)) || ((((((3 <= nc_B && 2 <= nc_B) && j + 1 <= nc_B) && nc_A <= i) && 3 <= nc_A) && nc_A <= 3) && 0 == found)) || ((((((3 <= nc_B && 4 <= nc_B) && nc_A <= i) && j + 1 <= nc_B) && 3 <= nc_A) && nc_A <= 4) && 0 == found)) || ((nc_B == 0 && i == 0) && i == j)) || (((((3 <= nc_B && 3 <= nc_A) && j + nc_A <= i + 2) && nc_A <= 3) && ((((2 <= nc_B && j == 0) && 2 <= nc_A) && 0 == found) || ((((3 <= nc_B && j + 2 <= nc_B) && 2 <= nc_B) && j + 1 <= nc_B) && 0 == found))) && nc_A <= i + 1)) || ((((2 <= nc_B && nc_A <= i) && j + 1 <= nc_B) && nc_A <= 2) && 0 == found)) || (((((3 <= nc_B && 3 <= nc_A) && nc_A <= 3) && ((((2 <= nc_B && j == 0) && 2 <= nc_A) && 0 == found) || ((((3 <= nc_B && j + 2 <= nc_B) && 2 <= nc_B) && j + 1 <= nc_B) && 0 == found))) && i == j) && nc_A <= i + 2)) || (((((3 <= nc_B && j == 0) && 3 <= nc_A) && nc_A <= 3) && ((((2 <= nc_B && j == 0) && 2 <= nc_A) && 0 == found) || ((((3 <= nc_B && j + 2 <= nc_B) && 2 <= nc_B) && j + 1 <= nc_B) && 0 == found))) && nc_A <= i + 2)) || (((((((3 <= nc_B && 2 <= nc_B) && j + 1 <= nc_B) && 3 <= nc_A) && nc_A <= 3) && nc_A <= i + 1) && i == j) && 0 == found)) || ((((((((((3 <= nc_B && 4 <= nc_B) && unknown-#memory_int-unknown[string_B][string_B + 4] == 0) && string_B == 0) && j + 1 <= nc_B) && 3 <= nc_A) && nc_A <= 4) && nc_B <= j + 1) && i == j) && string_A == 0) && 0 == found)) || ((((((((nc_B == 4 && unknown-#memory_int-unknown[string_B][string_B + 4] == 0) && 4 <= nc_B) && string_B == 0) && j == 0) && ((((3 <= nc_B && j == 0) && 3 <= nc_A) && ((((2 <= nc_B && j == 0) && 2 <= nc_A) && 0 == found) || ((((3 <= nc_B && j + 2 <= nc_B) && 2 <= nc_B) && j + 1 <= nc_B) && 0 == found))) || ((((3 <= nc_B && 4 <= nc_B) && j + 3 <= nc_B) && 3 <= nc_A) && ((((2 <= nc_B && j == 0) && 2 <= nc_A) && 0 == found) || ((((3 <= nc_B && j + 2 <= nc_B) && 2 <= nc_B) && j + 1 <= nc_B) && 0 == found))))) && nc_A <= 4) && string_A == 0) && nc_A <= i + 3)) || (((((((unknown-#memory_int-unknown[string_B][string_B + 4] == 0 && string_B == 0) && 1 <= i) && ((((3 <= nc_B && j == 0) && 3 <= nc_A) && ((((2 <= nc_B && j == 0) && 2 <= nc_A) && 0 == found) || ((((3 <= nc_B && j + 2 <= nc_B) && 2 <= nc_B) && j + 1 <= nc_B) && 0 == found))) || ((((3 <= nc_B && 4 <= nc_B) && j + 3 <= nc_B) && 3 <= nc_A) && ((((2 <= nc_B && j == 0) && 2 <= nc_A) && 0 == found) || ((((3 <= nc_B && j + 2 <= nc_B) && 2 <= nc_B) && j + 1 <= nc_B) && 0 == found))))) && nc_A <= 4) && nc_B <= 4) && i == j) && string_A == 0)) || (((((j + 1 <= nc_B && nc_A <= 2) && nc_A <= i + 1) && i == j) && 2 <= nc_A) && 0 == found)) || (((nc_B <= j && nc_B <= 1) && 1 <= nc_B) && 0 == found)) || (((((3 <= nc_B && j == 0) && 3 <= nc_A) && nc_A <= 3) && ((((2 <= nc_B && j == 0) && 2 <= nc_A) && 0 == found) || ((((3 <= nc_B && j + 2 <= nc_B) && 2 <= nc_B) && j + 1 <= nc_B) && 0 == found))) && i == j)) || ((((3 <= nc_B && nc_B <= j) && 3 <= nc_A) && nc_B <= 4) && 0 == found)) || ((((nc_B <= j && nc_B <= 2) && 1 <= nc_B) && 2 <= nc_A) && 0 == found) - ProcedureContractResult [Line: 28]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 18]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! Received shutdown request...