/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-02 12:21:12,057 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-02 12:21:12,058 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-02 12:21:12,079 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-02 12:21:12,079 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-02 12:21:12,080 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-02 12:21:12,081 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-02 12:21:12,082 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-02 12:21:12,083 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-02 12:21:12,084 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-02 12:21:12,085 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-02 12:21:12,085 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-02 12:21:12,086 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-02 12:21:12,086 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-02 12:21:12,087 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-02 12:21:12,088 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-02 12:21:12,088 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-02 12:21:12,089 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-02 12:21:12,090 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-02 12:21:12,091 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-02 12:21:12,091 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-02 12:21:12,092 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-02 12:21:12,093 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-02 12:21:12,093 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-02 12:21:12,095 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-02 12:21:12,095 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-02 12:21:12,095 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-02 12:21:12,096 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-02 12:21:12,096 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-02 12:21:12,096 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-02 12:21:12,096 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-02 12:21:12,097 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-02 12:21:12,097 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-02 12:21:12,098 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-02 12:21:12,098 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-02 12:21:12,099 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-02 12:21:12,099 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-02 12:21:12,099 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-02 12:21:12,099 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-02 12:21:12,100 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-02 12:21:12,100 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-02 12:21:12,105 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2021-05-02 12:21:12,126 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-02 12:21:12,127 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-02 12:21:12,129 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-05-02 12:21:12,129 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-05-02 12:21:12,129 INFO L138 SettingsManager]: * Use SBE=true [2021-05-02 12:21:12,129 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-02 12:21:12,129 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-02 12:21:12,129 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-02 12:21:12,130 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-02 12:21:12,130 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-02 12:21:12,130 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-02 12:21:12,130 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-02 12:21:12,130 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-02 12:21:12,131 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-02 12:21:12,131 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-02 12:21:12,131 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-02 12:21:12,131 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-02 12:21:12,131 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-02 12:21:12,131 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-02 12:21:12,131 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-02 12:21:12,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 12:21:12,131 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-02 12:21:12,131 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-05-02 12:21:12,132 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-05-02 12:21:12,132 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-05-02 12:21:12,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-05-02 12:21:12,132 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-02 12:21:12,132 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-05-02 12:21:12,132 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 12:21:12,342 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-02 12:21:12,355 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-02 12:21:12,356 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-02 12:21:12,357 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-02 12:21:12,357 INFO L275 PluginConnector]: CDTParser initialized [2021-05-02 12:21:12,358 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i [2021-05-02 12:21:12,413 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46163ae4f/42384c29017a4dee92cab304a530aaa2/FLAG36d20ef94 [2021-05-02 12:21:12,770 INFO L306 CDTParser]: Found 1 translation units. [2021-05-02 12:21:12,770 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i [2021-05-02 12:21:12,778 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46163ae4f/42384c29017a4dee92cab304a530aaa2/FLAG36d20ef94 [2021-05-02 12:21:12,793 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46163ae4f/42384c29017a4dee92cab304a530aaa2 [2021-05-02 12:21:12,796 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-02 12:21:12,797 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-02 12:21:12,799 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-02 12:21:12,799 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-02 12:21:12,801 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-02 12:21:12,802 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 12:21:12" (1/1) ... [2021-05-02 12:21:12,802 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@502e842e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:21:12, skipping insertion in model container [2021-05-02 12:21:12,802 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 12:21:12" (1/1) ... [2021-05-02 12:21:12,807 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-02 12:21:12,819 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-02 12:21:12,933 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i[893,906] [2021-05-02 12:21:12,954 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 12:21:12,969 INFO L203 MainTranslator]: Completed pre-run [2021-05-02 12:21:12,980 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i[893,906] [2021-05-02 12:21:12,998 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 12:21:13,008 INFO L208 MainTranslator]: Completed translation [2021-05-02 12:21:13,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:21:13 WrapperNode [2021-05-02 12:21:13,009 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-02 12:21:13,010 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-02 12:21:13,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-02 12:21:13,011 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-02 12:21:13,031 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:21:13" (1/1) ... [2021-05-02 12:21:13,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:21:13" (1/1) ... [2021-05-02 12:21:13,061 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:21:13" (1/1) ... [2021-05-02 12:21:13,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:21:13" (1/1) ... [2021-05-02 12:21:13,071 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:21:13" (1/1) ... [2021-05-02 12:21:13,074 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:21:13" (1/1) ... [2021-05-02 12:21:13,075 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:21:13" (1/1) ... [2021-05-02 12:21:13,076 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-02 12:21:13,077 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-02 12:21:13,077 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-02 12:21:13,077 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-02 12:21:13,077 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:21:13" (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 12:21:13,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-02 12:21:13,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-02 12:21:13,134 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-02 12:21:13,134 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-05-02 12:21:13,134 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-02 12:21:13,135 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-02 12:21:13,135 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-02 12:21:13,135 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-02 12:21:13,135 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-05-02 12:21:13,135 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-05-02 12:21:13,135 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-02 12:21:13,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-02 12:21:13,136 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-05-02 12:21:13,136 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-02 12:21:13,136 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-05-02 12:21:13,137 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-02 12:21:13,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-02 12:21:13,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-02 12:21:13,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-02 12:21:13,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-02 12:21:13,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-02 12:21:13,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-02 12:21:13,353 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-02 12:21:13,353 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-05-02 12:21:13,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 12:21:13 BoogieIcfgContainer [2021-05-02 12:21:13,354 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-02 12:21:13,355 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-02 12:21:13,355 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-02 12:21:13,357 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-02 12:21:13,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.05 12:21:12" (1/3) ... [2021-05-02 12:21:13,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@124acf99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 12:21:13, skipping insertion in model container [2021-05-02 12:21:13,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:21:13" (2/3) ... [2021-05-02 12:21:13,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@124acf99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 12:21:13, skipping insertion in model container [2021-05-02 12:21:13,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 12:21:13" (3/3) ... [2021-05-02 12:21:13,359 INFO L111 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i [2021-05-02 12:21:13,362 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-05-02 12:21:13,364 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-02 12:21:13,390 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-02 12:21:13,404 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-02 12:21:13,404 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-02 12:21:13,404 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-05-02 12:21:13,404 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-02 12:21:13,404 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-02 12:21:13,405 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-02 12:21:13,405 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-02 12:21:13,405 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-02 12:21:13,416 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-05-02 12:21:13,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-02 12:21:13,419 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:21:13,420 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:21:13,429 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:21:13,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:21:13,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1772946259, now seen corresponding path program 1 times [2021-05-02 12:21:13,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:21:13,443 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102614021] [2021-05-02 12:21:13,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:21:13,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:13,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:21:13,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:13,680 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 12:21:13,680 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:21:13,681 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102614021] [2021-05-02 12:21:13,682 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102614021] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:21:13,682 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:21:13,682 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 12:21:13,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826671155] [2021-05-02 12:21:13,686 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 12:21:13,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:21:13,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 12:21:13,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 12:21:13,699 INFO L87 Difference]: Start difference. First operand has 43 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 12:21:14,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:21:14,095 INFO L93 Difference]: Finished difference Result 88 states and 155 transitions. [2021-05-02 12:21:14,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 12:21:14,096 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 14 [2021-05-02 12:21:14,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:21:14,101 INFO L225 Difference]: With dead ends: 88 [2021-05-02 12:21:14,101 INFO L226 Difference]: Without dead ends: 47 [2021-05-02 12:21:14,103 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 182.3ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-05-02 12:21:14,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-05-02 12:21:14,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2021-05-02 12:21:14,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2021-05-02 12:21:14,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2021-05-02 12:21:14,133 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 14 [2021-05-02 12:21:14,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:21:14,133 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2021-05-02 12:21:14,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 12:21:14,133 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2021-05-02 12:21:14,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-02 12:21:14,134 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:21:14,134 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:21:14,134 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-02 12:21:14,134 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:21:14,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:21:14,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1794902226, now seen corresponding path program 1 times [2021-05-02 12:21:14,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:21:14,136 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905351131] [2021-05-02 12:21:14,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:21:14,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:14,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:21:14,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:14,206 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 12:21:14,206 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:21:14,206 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905351131] [2021-05-02 12:21:14,207 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905351131] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:21:14,207 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:21:14,207 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 12:21:14,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201360071] [2021-05-02 12:21:14,208 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 12:21:14,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:21:14,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 12:21:14,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 12:21:14,209 INFO L87 Difference]: Start difference. First operand 43 states and 61 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 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 12:21:14,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:21:14,464 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2021-05-02 12:21:14,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 12:21:14,465 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 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 14 [2021-05-02 12:21:14,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:21:14,466 INFO L225 Difference]: With dead ends: 55 [2021-05-02 12:21:14,466 INFO L226 Difference]: Without dead ends: 53 [2021-05-02 12:21:14,467 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 98.3ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-05-02 12:21:14,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-05-02 12:21:14,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2021-05-02 12:21:14,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2021-05-02 12:21:14,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 67 transitions. [2021-05-02 12:21:14,475 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 67 transitions. Word has length 14 [2021-05-02 12:21:14,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:21:14,475 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 67 transitions. [2021-05-02 12:21:14,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 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 12:21:14,475 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2021-05-02 12:21:14,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-05-02 12:21:14,476 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:21:14,476 INFO L523 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:21:14,476 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-02 12:21:14,476 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:21:14,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:21:14,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1560251136, now seen corresponding path program 1 times [2021-05-02 12:21:14,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:21:14,477 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590288017] [2021-05-02 12:21:14,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:21:14,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:14,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:21:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:14,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-05-02 12:21:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:14,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:21:14,569 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:21:14,569 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590288017] [2021-05-02 12:21:14,569 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590288017] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:21:14,569 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:21:14,570 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 12:21:14,570 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567847103] [2021-05-02 12:21:14,570 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 12:21:14,570 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:21:14,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 12:21:14,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 12:21:14,571 INFO L87 Difference]: Start difference. First operand 51 states and 67 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 12:21:14,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:21:14,813 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2021-05-02 12:21:14,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 12:21:14,813 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2021-05-02 12:21:14,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:21:14,817 INFO L225 Difference]: With dead ends: 57 [2021-05-02 12:21:14,817 INFO L226 Difference]: Without dead ends: 55 [2021-05-02 12:21:14,817 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 91.2ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-05-02 12:21:14,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-05-02 12:21:14,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2021-05-02 12:21:14,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2021-05-02 12:21:14,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2021-05-02 12:21:14,829 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 19 [2021-05-02 12:21:14,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:21:14,830 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2021-05-02 12:21:14,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 12:21:14,830 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2021-05-02 12:21:14,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-05-02 12:21:14,830 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:21:14,831 INFO L523 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:21:14,831 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-02 12:21:14,831 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:21:14,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:21:14,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1084781042, now seen corresponding path program 1 times [2021-05-02 12:21:14,831 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:21:14,832 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153079117] [2021-05-02 12:21:14,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:21:14,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:14,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:21:14,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:14,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-05-02 12:21:14,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:14,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-05-02 12:21:14,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:14,906 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-05-02 12:21:14,907 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:21:14,907 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153079117] [2021-05-02 12:21:14,907 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153079117] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:21:14,907 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:21:14,907 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 12:21:14,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968004780] [2021-05-02 12:21:14,907 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 12:21:14,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:21:14,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 12:21:14,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-05-02 12:21:14,908 INFO L87 Difference]: Start difference. First operand 55 states and 70 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-02 12:21:15,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:21:15,193 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2021-05-02 12:21:15,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 12:21:15,194 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2021-05-02 12:21:15,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:21:15,195 INFO L225 Difference]: With dead ends: 61 [2021-05-02 12:21:15,195 INFO L226 Difference]: Without dead ends: 59 [2021-05-02 12:21:15,195 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 126.3ms TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-05-02 12:21:15,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-05-02 12:21:15,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2021-05-02 12:21:15,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2021-05-02 12:21:15,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2021-05-02 12:21:15,201 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 24 [2021-05-02 12:21:15,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:21:15,201 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2021-05-02 12:21:15,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-02 12:21:15,202 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2021-05-02 12:21:15,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-05-02 12:21:15,202 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:21:15,202 INFO L523 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:21:15,202 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-02 12:21:15,202 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:21:15,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:21:15,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1893905473, now seen corresponding path program 1 times [2021-05-02 12:21:15,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:21:15,203 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570458613] [2021-05-02 12:21:15,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:21:15,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:15,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:21:15,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:15,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-05-02 12:21:15,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:15,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-05-02 12:21:15,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:15,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-05-02 12:21:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:15,257 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-05-02 12:21:15,257 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:21:15,257 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570458613] [2021-05-02 12:21:15,257 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570458613] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:21:15,258 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:21:15,258 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 12:21:15,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184129324] [2021-05-02 12:21:15,258 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 12:21:15,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:21:15,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 12:21:15,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 12:21:15,259 INFO L87 Difference]: Start difference. First operand 59 states and 73 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-05-02 12:21:15,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:21:15,479 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2021-05-02 12:21:15,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 12:21:15,479 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2021-05-02 12:21:15,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:21:15,480 INFO L225 Difference]: With dead ends: 66 [2021-05-02 12:21:15,480 INFO L226 Difference]: Without dead ends: 64 [2021-05-02 12:21:15,481 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 93.6ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-05-02 12:21:15,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-05-02 12:21:15,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2021-05-02 12:21:15,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2021-05-02 12:21:15,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2021-05-02 12:21:15,487 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 29 [2021-05-02 12:21:15,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:21:15,488 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2021-05-02 12:21:15,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-05-02 12:21:15,488 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2021-05-02 12:21:15,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-05-02 12:21:15,489 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:21:15,489 INFO L523 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 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 12:21:15,489 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-02 12:21:15,489 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:21:15,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:21:15,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1991737873, now seen corresponding path program 1 times [2021-05-02 12:21:15,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:21:15,489 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780050780] [2021-05-02 12:21:15,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:21:15,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:15,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:21:15,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:15,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-05-02 12:21:15,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:15,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-05-02 12:21:15,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:15,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-05-02 12:21:15,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:15,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-05-02 12:21:15,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:15,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-05-02 12:21:15,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:15,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-05-02 12:21:15,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:15,586 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-05-02 12:21:15,587 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:21:15,587 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780050780] [2021-05-02 12:21:15,587 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780050780] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:21:15,587 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:21:15,587 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 12:21:15,587 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244766838] [2021-05-02 12:21:15,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 12:21:15,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:21:15,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 12:21:15,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-02 12:21:15,588 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-05-02 12:21:15,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:21:15,850 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2021-05-02 12:21:15,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 12:21:15,850 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2021-05-02 12:21:15,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:21:15,851 INFO L225 Difference]: With dead ends: 75 [2021-05-02 12:21:15,851 INFO L226 Difference]: Without dead ends: 73 [2021-05-02 12:21:15,852 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 122.5ms TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-05-02 12:21:15,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-05-02 12:21:15,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2021-05-02 12:21:15,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2021-05-02 12:21:15,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2021-05-02 12:21:15,858 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 47 [2021-05-02 12:21:15,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:21:15,859 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2021-05-02 12:21:15,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-05-02 12:21:15,859 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2021-05-02 12:21:15,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-05-02 12:21:15,860 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:21:15,860 INFO L523 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:21:15,860 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-02 12:21:15,860 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:21:15,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:21:15,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1947441265, now seen corresponding path program 1 times [2021-05-02 12:21:15,860 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:21:15,860 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86515414] [2021-05-02 12:21:15,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:21:15,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:15,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:21:15,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:15,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-05-02 12:21:15,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:15,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-05-02 12:21:15,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:15,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-05-02 12:21:15,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:15,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-05-02 12:21:15,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:15,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-05-02 12:21:15,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:15,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-05-02 12:21:15,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:15,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-05-02 12:21:15,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:15,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-05-02 12:21:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:15,932 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2021-05-02 12:21:15,932 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:21:15,932 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86515414] [2021-05-02 12:21:15,932 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86515414] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:21:15,932 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:21:15,932 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-05-02 12:21:15,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019546092] [2021-05-02 12:21:15,932 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-02 12:21:15,932 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:21:15,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-02 12:21:15,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-05-02 12:21:15,933 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-05-02 12:21:16,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:21:16,214 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2021-05-02 12:21:16,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 12:21:16,214 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 57 [2021-05-02 12:21:16,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:21:16,215 INFO L225 Difference]: With dead ends: 75 [2021-05-02 12:21:16,215 INFO L226 Difference]: Without dead ends: 73 [2021-05-02 12:21:16,215 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 135.5ms TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2021-05-02 12:21:16,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-05-02 12:21:16,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2021-05-02 12:21:16,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 42 states have internal predecessors, (45), 19 states have call successors, (19), 11 states have call predecessors, (19), 10 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2021-05-02 12:21:16,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2021-05-02 12:21:16,222 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 57 [2021-05-02 12:21:16,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:21:16,222 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2021-05-02 12:21:16,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-05-02 12:21:16,222 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2021-05-02 12:21:16,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-05-02 12:21:16,223 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:21:16,223 INFO L523 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:21:16,223 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-02 12:21:16,223 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:21:16,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:21:16,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1358511123, now seen corresponding path program 1 times [2021-05-02 12:21:16,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:21:16,224 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653442730] [2021-05-02 12:21:16,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:21:16,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:16,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:21:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:16,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-05-02 12:21:16,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:16,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-05-02 12:21:16,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:16,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-05-02 12:21:16,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:16,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-05-02 12:21:16,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:16,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-05-02 12:21:16,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:16,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-05-02 12:21:16,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:16,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-05-02 12:21:16,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:16,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-05-02 12:21:16,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:16,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-05-02 12:21:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:16,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-05-02 12:21:16,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:16,312 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2021-05-02 12:21:16,313 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:21:16,313 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653442730] [2021-05-02 12:21:16,313 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653442730] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:21:16,313 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:21:16,313 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-02 12:21:16,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638953368] [2021-05-02 12:21:16,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-02 12:21:16,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:21:16,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-02 12:21:16,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-05-02 12:21:16,314 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-05-02 12:21:16,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:21:16,610 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2021-05-02 12:21:16,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-02 12:21:16,610 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 68 [2021-05-02 12:21:16,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:21:16,611 INFO L225 Difference]: With dead ends: 73 [2021-05-02 12:21:16,611 INFO L226 Difference]: Without dead ends: 0 [2021-05-02 12:21:16,611 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 155.7ms TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2021-05-02 12:21:16,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-02 12:21:16,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-02 12:21:16,612 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 12:21:16,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-02 12:21:16,612 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 68 [2021-05-02 12:21:16,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:21:16,612 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-02 12:21:16,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-05-02 12:21:16,612 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-02 12:21:16,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-02 12:21:16,612 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-02 12:21:16,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-05-02 12:21:17,170 INFO L198 CegarLoopUtils]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2021-05-02 12:21:17,171 INFO L198 CegarLoopUtils]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2021-05-02 12:21:17,171 INFO L198 CegarLoopUtils]: For program point L12-1(line 12) no Hoare annotation was computed. [2021-05-02 12:21:17,171 INFO L198 CegarLoopUtils]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2021-05-02 12:21:17,171 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 12:21:17,171 INFO L198 CegarLoopUtils]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2021-05-02 12:21:17,171 INFO L198 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-05-02 12:21:17,171 INFO L201 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-05-02 12:21:17,171 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-05-02 12:21:17,171 INFO L198 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-05-02 12:21:17,171 INFO L198 CegarLoopUtils]: For program point L15(line 15) no Hoare annotation was computed. [2021-05-02 12:21:17,171 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2021-05-02 12:21:17,171 INFO L198 CegarLoopUtils]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2021-05-02 12:21:17,171 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2021-05-02 12:21:17,171 INFO L194 CegarLoopUtils]: At program point L35-2(lines 35 64) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2021-05-02 12:21:17,172 INFO L198 CegarLoopUtils]: For program point L31(line 31) no Hoare annotation was computed. [2021-05-02 12:21:17,172 INFO L198 CegarLoopUtils]: For program point L60(line 60) no Hoare annotation was computed. [2021-05-02 12:21:17,172 INFO L198 CegarLoopUtils]: For program point mainEXIT(lines 24 67) no Hoare annotation was computed. [2021-05-02 12:21:17,172 INFO L194 CegarLoopUtils]: At program point L56(lines 36 63) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (< main_~i~0 main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2021-05-02 12:21:17,172 INFO L194 CegarLoopUtils]: At program point L52(line 52) the Hoare annotation is: (and (<= (+ main_~j~0 3) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2021-05-02 12:21:17,172 INFO L194 CegarLoopUtils]: At program point L52-1(line 52) the Hoare annotation is: (and (<= (+ main_~j~0 3) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2021-05-02 12:21:17,172 INFO L194 CegarLoopUtils]: At program point L48(line 48) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0)) [2021-05-02 12:21:17,172 INFO L194 CegarLoopUtils]: At program point L40(line 40) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2021-05-02 12:21:17,172 INFO L194 CegarLoopUtils]: At program point L40-1(line 40) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2021-05-02 12:21:17,172 INFO L198 CegarLoopUtils]: For program point L36(lines 36 63) no Hoare annotation was computed. [2021-05-02 12:21:17,172 INFO L194 CegarLoopUtils]: At program point L57(line 57) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (< main_~i~0 main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2021-05-02 12:21:17,172 INFO L198 CegarLoopUtils]: For program point L53(line 53) no Hoare annotation was computed. [2021-05-02 12:21:17,172 INFO L198 CegarLoopUtils]: For program point L49(line 49) no Hoare annotation was computed. [2021-05-02 12:21:17,173 INFO L194 CegarLoopUtils]: At program point L41(line 41) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2021-05-02 12:21:17,173 INFO L194 CegarLoopUtils]: At program point L37(line 37) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2021-05-02 12:21:17,173 INFO L194 CegarLoopUtils]: At program point L37-1(line 37) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2021-05-02 12:21:17,173 INFO L194 CegarLoopUtils]: At program point L58(line 58) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (< main_~i~0 main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2021-05-02 12:21:17,173 INFO L194 CegarLoopUtils]: At program point L46(line 46) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0)) [2021-05-02 12:21:17,173 INFO L194 CegarLoopUtils]: At program point L46-1(line 46) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0)) [2021-05-02 12:21:17,173 INFO L198 CegarLoopUtils]: For program point mainFINAL(lines 24 67) no Hoare annotation was computed. [2021-05-02 12:21:17,173 INFO L194 CegarLoopUtils]: At program point L42(line 42) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2021-05-02 12:21:17,173 INFO L198 CegarLoopUtils]: For program point L38(line 38) no Hoare annotation was computed. [2021-05-02 12:21:17,173 INFO L194 CegarLoopUtils]: At program point L34-2(lines 34 65) the Hoare annotation is: (and (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2021-05-02 12:21:17,173 INFO L198 CegarLoopUtils]: For program point L34-3(lines 34 65) no Hoare annotation was computed. [2021-05-02 12:21:17,173 INFO L201 CegarLoopUtils]: At program point mainENTRY(lines 24 67) the Hoare annotation is: true [2021-05-02 12:21:17,173 INFO L194 CegarLoopUtils]: At program point L59(line 59) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (< main_~i~0 main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2021-05-02 12:21:17,173 INFO L194 CegarLoopUtils]: At program point L47(line 47) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0)) [2021-05-02 12:21:17,174 INFO L198 CegarLoopUtils]: For program point L43(line 43) no Hoare annotation was computed. [2021-05-02 12:21:17,174 INFO L198 CegarLoopUtils]: For program point L39(line 39) no Hoare annotation was computed. [2021-05-02 12:21:17,174 INFO L198 CegarLoopUtils]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2021-05-02 12:21:17,174 INFO L201 CegarLoopUtils]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2021-05-02 12:21:17,174 INFO L198 CegarLoopUtils]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2021-05-02 12:21:17,174 INFO L198 CegarLoopUtils]: For program point L19(line 19) no Hoare annotation was computed. [2021-05-02 12:21:17,174 INFO L198 CegarLoopUtils]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-05-02 12:21:17,174 INFO L198 CegarLoopUtils]: For program point L18(lines 18 20) no Hoare annotation was computed. [2021-05-02 12:21:17,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.05 12:21:17 BoogieIcfgContainer [2021-05-02 12:21:17,197 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-02 12:21:17,198 INFO L168 Benchmark]: Toolchain (without parser) took 4400.91 ms. Allocated memory was 215.0 MB in the beginning and 318.8 MB in the end (delta: 103.8 MB). Free memory was 180.4 MB in the beginning and 256.2 MB in the end (delta: -75.8 MB). Peak memory consumption was 137.4 MB. Max. memory is 8.0 GB. [2021-05-02 12:21:17,198 INFO L168 Benchmark]: CDTParser took 0.08 ms. Allocated memory is still 215.0 MB. Free memory is still 197.0 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-02 12:21:17,198 INFO L168 Benchmark]: CACSL2BoogieTranslator took 210.95 ms. Allocated memory is still 215.0 MB. Free memory was 180.2 MB in the beginning and 170.1 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2021-05-02 12:21:17,199 INFO L168 Benchmark]: Boogie Preprocessor took 66.07 ms. Allocated memory is still 215.0 MB. Free memory was 170.1 MB in the beginning and 198.1 MB in the end (delta: -28.0 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-05-02 12:21:17,199 INFO L168 Benchmark]: RCFGBuilder took 277.44 ms. Allocated memory is still 215.0 MB. Free memory was 198.1 MB in the beginning and 180.3 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 8.0 GB. [2021-05-02 12:21:17,199 INFO L168 Benchmark]: TraceAbstraction took 3842.33 ms. Allocated memory was 215.0 MB in the beginning and 318.8 MB in the end (delta: 103.8 MB). Free memory was 179.8 MB in the beginning and 256.2 MB in the end (delta: -76.4 MB). Peak memory consumption was 137.5 MB. Max. memory is 8.0 GB. [2021-05-02 12:21:17,200 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.08 ms. Allocated memory is still 215.0 MB. Free memory is still 197.0 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 210.95 ms. Allocated memory is still 215.0 MB. Free memory was 180.2 MB in the beginning and 170.1 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 66.07 ms. Allocated memory is still 215.0 MB. Free memory was 170.1 MB in the beginning and 198.1 MB in the end (delta: -28.0 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 277.44 ms. Allocated memory is still 215.0 MB. Free memory was 198.1 MB in the beginning and 180.3 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 3842.33 ms. Allocated memory was 215.0 MB in the beginning and 318.8 MB in the end (delta: 103.8 MB). Free memory was 179.8 MB in the beginning and 256.2 MB in the end (delta: -76.4 MB). Peak memory consumption was 137.5 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: 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, 50 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3209.8ms, OverallIterations: 8, TraceHistogramMax: 11, EmptinessCheckTime: 10.7ms, AutomataDifference: 2277.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 557.6ms, InitialAbstractionConstructionTime: 9.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 286 SDtfs, 247 SDslu, 491 SDs, 0 SdLazy, 1162 SolverSat, 485 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1053.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 169 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1005.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=7, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 65.3ms AutomataMinimizationTime, 8 MinimizatonAttempts, 15 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 23 LocationsWithAnnotation, 55 PreInvPairs, 76 NumberOfFragments, 384 HoareAnnotationTreeSize, 55 FomulaSimplifications, 3224 FormulaSimplificationTreeSizeReduction, 109.0ms HoareSimplificationTime, 23 FomulaSimplificationsInter, 697 FormulaSimplificationTreeSizeReductionInter, 434.6ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 12.5ms SsaConstructionTime, 91.5ms SatisfiabilityAnalysisTime, 632.3ms InterpolantComputationTime, 272 NumberOfCodeBlocks, 272 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 264 ConstructedInterpolants, 0 QuantifiedInterpolants, 732 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 428/428 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (0 <= j && 0 <= i) && limit + 4 <= bufsize - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: (((j + 5 <= bufsize && 0 <= j) && i < len) && 0 <= i) && limit + 4 <= bufsize - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: 0 <= i && limit + 4 <= bufsize RESULT: Ultimate proved your program to be correct! Received shutdown request...