/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-6253b08 [2021-05-06 11:33:45,025 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-06 11:33:45,027 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-06 11:33:45,063 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-06 11:33:45,063 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-06 11:33:45,066 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-06 11:33:45,069 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-06 11:33:45,073 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-06 11:33:45,076 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-06 11:33:45,081 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-06 11:33:45,082 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-06 11:33:45,083 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-06 11:33:45,083 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-06 11:33:45,085 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-06 11:33:45,086 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-06 11:33:45,088 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-06 11:33:45,091 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-06 11:33:45,091 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-06 11:33:45,094 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-06 11:33:45,098 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-06 11:33:45,099 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-06 11:33:45,100 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-06 11:33:45,102 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-06 11:33:45,103 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-06 11:33:45,109 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-06 11:33:45,109 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-06 11:33:45,110 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-06 11:33:45,110 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-06 11:33:45,111 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-06 11:33:45,111 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-06 11:33:45,112 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-06 11:33:45,112 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-06 11:33:45,113 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-06 11:33:45,113 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-06 11:33:45,114 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-06 11:33:45,114 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-06 11:33:45,115 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-06 11:33:45,115 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-06 11:33:45,115 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-06 11:33:45,116 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-06 11:33:45,116 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-06 11:33:45,122 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2021-05-06 11:33:45,137 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-06 11:33:45,137 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-06 11:33:45,141 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-06 11:33:45,141 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-06 11:33:45,142 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-06 11:33:45,142 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-06 11:33:45,142 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-06 11:33:45,142 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-06 11:33:45,142 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-06 11:33:45,142 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-06 11:33:45,143 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-06 11:33:45,143 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-06 11:33:45,143 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-06 11:33:45,144 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-06 11:33:45,144 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-06 11:33:45,144 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-06 11:33:45,144 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-06 11:33:45,144 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-06 11:33:45,144 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-06 11:33:45,144 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-06 11:33:45,145 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-06 11:33:45,145 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-06 11:33:45,145 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-06 11:33:45,145 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2021-05-06 11:33:45,407 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-06 11:33:45,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-06 11:33:45,434 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-06 11:33:45,435 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-06 11:33:45,435 INFO L275 PluginConnector]: CDTParser initialized [2021-05-06 11:33:45,436 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-06 11:33:45,496 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d04f6681/0d074d5129d34bf59732cecdec794a7a/FLAG01bf82bfb [2021-05-06 11:33:45,859 INFO L306 CDTParser]: Found 1 translation units. [2021-05-06 11:33:45,860 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i [2021-05-06 11:33:45,866 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d04f6681/0d074d5129d34bf59732cecdec794a7a/FLAG01bf82bfb [2021-05-06 11:33:46,244 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d04f6681/0d074d5129d34bf59732cecdec794a7a [2021-05-06 11:33:46,250 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-06 11:33:46,252 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-06 11:33:46,255 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-06 11:33:46,256 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-06 11:33:46,259 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-06 11:33:46,259 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 11:33:46" (1/1) ... [2021-05-06 11:33:46,260 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59c1fcb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:46, skipping insertion in model container [2021-05-06 11:33:46,260 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 11:33:46" (1/1) ... [2021-05-06 11:33:46,267 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-06 11:33:46,283 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-06 11:33:46,408 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-06 11:33:46,432 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-06 11:33:46,440 INFO L203 MainTranslator]: Completed pre-run [2021-05-06 11:33:46,452 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-06 11:33:46,466 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-06 11:33:46,486 INFO L208 MainTranslator]: Completed translation [2021-05-06 11:33:46,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:46 WrapperNode [2021-05-06 11:33:46,486 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-06 11:33:46,487 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-06 11:33:46,487 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-06 11:33:46,487 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-06 11:33:46,508 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:46" (1/1) ... [2021-05-06 11:33:46,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:46" (1/1) ... [2021-05-06 11:33:46,521 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:46" (1/1) ... [2021-05-06 11:33:46,521 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:46" (1/1) ... [2021-05-06 11:33:46,533 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:46" (1/1) ... [2021-05-06 11:33:46,538 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:46" (1/1) ... [2021-05-06 11:33:46,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:46" (1/1) ... [2021-05-06 11:33:46,548 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-06 11:33:46,549 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-06 11:33:46,549 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-06 11:33:46,549 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-06 11:33:46,550 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:46" (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-06 11:33:46,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-06 11:33:46,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-06 11:33:46,615 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-06 11:33:46,615 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-05-06 11:33:46,615 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-06 11:33:46,615 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-06 11:33:46,615 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-06 11:33:46,616 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-06 11:33:46,616 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-05-06 11:33:46,616 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-05-06 11:33:46,616 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-06 11:33:46,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-06 11:33:46,617 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-05-06 11:33:46,617 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-06 11:33:46,617 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-05-06 11:33:46,617 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-06 11:33:46,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-06 11:33:46,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-06 11:33:46,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-06 11:33:46,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-06 11:33:46,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-06 11:33:46,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-06 11:33:46,974 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-06 11:33:46,974 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-05-06 11:33:46,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 11:33:46 BoogieIcfgContainer [2021-05-06 11:33:46,976 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-06 11:33:46,979 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-06 11:33:46,979 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-06 11:33:46,982 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-06 11:33:46,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 11:33:46" (1/3) ... [2021-05-06 11:33:46,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8f0dea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 11:33:46, skipping insertion in model container [2021-05-06 11:33:46,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:46" (2/3) ... [2021-05-06 11:33:46,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8f0dea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 11:33:46, skipping insertion in model container [2021-05-06 11:33:46,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 11:33:46" (3/3) ... [2021-05-06 11:33:46,984 INFO L111 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i [2021-05-06 11:33:46,989 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-06 11:33:46,992 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-06 11:33:47,008 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-06 11:33:47,031 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-06 11:33:47,031 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-06 11:33:47,032 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-06 11:33:47,032 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-06 11:33:47,032 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-06 11:33:47,032 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-06 11:33:47,032 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-06 11:33:47,032 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-06 11:33:47,050 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-06 11:33:47,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-06 11:33:47,060 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:47,060 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:33:47,061 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:33:47,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:47,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1772946259, now seen corresponding path program 1 times [2021-05-06 11:33:47,072 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:47,073 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1323321989] [2021-05-06 11:33:47,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:47,130 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:47,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:47,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:47,375 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-06 11:33:47,377 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:47,377 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1323321989] [2021-05-06 11:33:47,378 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1323321989] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:47,379 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:47,379 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 11:33:47,379 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126828995] [2021-05-06 11:33:47,382 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 11:33:47,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:47,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 11:33:47,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-06 11:33:47,393 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-06 11:33:47,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:47,873 INFO L93 Difference]: Finished difference Result 88 states and 155 transitions. [2021-05-06 11:33:47,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-06 11:33:47,875 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-06 11:33:47,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:47,882 INFO L225 Difference]: With dead ends: 88 [2021-05-06 11:33:47,882 INFO L226 Difference]: Without dead ends: 47 [2021-05-06 11:33:47,886 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 249.1ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-05-06 11:33:47,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-05-06 11:33:47,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2021-05-06 11:33:47,928 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-06 11:33:47,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2021-05-06 11:33:47,931 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 14 [2021-05-06 11:33:47,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:47,931 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2021-05-06 11:33:47,931 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-06 11:33:47,931 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2021-05-06 11:33:47,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-06 11:33:47,933 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:47,933 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:33:47,933 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-06 11:33:47,933 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:33:47,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:47,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1794902226, now seen corresponding path program 1 times [2021-05-06 11:33:47,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:47,934 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1289253756] [2021-05-06 11:33:47,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:47,937 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:47,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:48,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:48,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:48,011 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-06 11:33:48,012 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:48,012 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1289253756] [2021-05-06 11:33:48,012 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1289253756] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:48,012 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:48,012 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 11:33:48,013 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976978353] [2021-05-06 11:33:48,013 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 11:33:48,013 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:48,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 11:33:48,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-06 11:33:48,014 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-06 11:33:48,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:48,312 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2021-05-06 11:33:48,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-06 11:33:48,312 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-06 11:33:48,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:48,315 INFO L225 Difference]: With dead ends: 55 [2021-05-06 11:33:48,315 INFO L226 Difference]: Without dead ends: 53 [2021-05-06 11:33:48,316 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 113.0ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-05-06 11:33:48,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-05-06 11:33:48,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2021-05-06 11:33:48,328 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-06 11:33:48,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 67 transitions. [2021-05-06 11:33:48,329 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 67 transitions. Word has length 14 [2021-05-06 11:33:48,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:48,330 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 67 transitions. [2021-05-06 11:33:48,330 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-06 11:33:48,330 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2021-05-06 11:33:48,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-05-06 11:33:48,331 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:48,331 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-06 11:33:48,331 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-06 11:33:48,331 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:33:48,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:48,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1560251136, now seen corresponding path program 1 times [2021-05-06 11:33:48,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:48,332 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [239466462] [2021-05-06 11:33:48,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:48,337 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:48,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:48,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:48,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:48,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-05-06 11:33:48,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:48,472 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-06 11:33:48,473 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:48,473 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [239466462] [2021-05-06 11:33:48,473 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [239466462] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:48,473 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:48,473 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 11:33:48,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605970981] [2021-05-06 11:33:48,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 11:33:48,474 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:48,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 11:33:48,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-06 11:33:48,475 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-06 11:33:48,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:48,779 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2021-05-06 11:33:48,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-06 11:33:48,780 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-06 11:33:48,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:48,784 INFO L225 Difference]: With dead ends: 57 [2021-05-06 11:33:48,784 INFO L226 Difference]: Without dead ends: 55 [2021-05-06 11:33:48,785 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 126.1ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-05-06 11:33:48,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-05-06 11:33:48,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2021-05-06 11:33:48,815 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-06 11:33:48,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2021-05-06 11:33:48,817 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 19 [2021-05-06 11:33:48,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:48,817 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2021-05-06 11:33:48,817 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-06 11:33:48,817 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2021-05-06 11:33:48,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-05-06 11:33:48,818 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:48,818 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-06 11:33:48,818 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-06 11:33:48,818 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:33:48,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:48,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1084781042, now seen corresponding path program 1 times [2021-05-06 11:33:48,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:48,819 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [79166358] [2021-05-06 11:33:48,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:48,821 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:48,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:48,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:48,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:48,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-05-06 11:33:48,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:48,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-05-06 11:33:48,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:48,900 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-06 11:33:48,900 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:48,900 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [79166358] [2021-05-06 11:33:48,901 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [79166358] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:48,901 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:48,901 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-06 11:33:48,901 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920636866] [2021-05-06 11:33:48,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-06 11:33:48,901 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:48,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-06 11:33:48,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-05-06 11:33:48,902 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-06 11:33:49,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:49,221 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2021-05-06 11:33:49,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-06 11:33:49,222 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-06 11:33:49,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:49,222 INFO L225 Difference]: With dead ends: 61 [2021-05-06 11:33:49,223 INFO L226 Difference]: Without dead ends: 59 [2021-05-06 11:33:49,223 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 148.6ms TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-05-06 11:33:49,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-05-06 11:33:49,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2021-05-06 11:33:49,235 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-06 11:33:49,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2021-05-06 11:33:49,236 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 24 [2021-05-06 11:33:49,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:49,236 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2021-05-06 11:33:49,236 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-06 11:33:49,236 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2021-05-06 11:33:49,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-05-06 11:33:49,237 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:49,237 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-06 11:33:49,238 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-06 11:33:49,238 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:33:49,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:49,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1893905473, now seen corresponding path program 1 times [2021-05-06 11:33:49,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:49,239 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [341415442] [2021-05-06 11:33:49,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:49,240 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:49,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:49,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:49,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:49,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-05-06 11:33:49,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:49,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-05-06 11:33:49,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:49,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-05-06 11:33:49,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:49,340 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-06 11:33:49,340 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:49,341 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [341415442] [2021-05-06 11:33:49,341 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [341415442] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:49,341 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:49,341 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 11:33:49,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606779013] [2021-05-06 11:33:49,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 11:33:49,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:49,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 11:33:49,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-06 11:33:49,342 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-06 11:33:49,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:49,612 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2021-05-06 11:33:49,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-06 11:33:49,612 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-06 11:33:49,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:49,617 INFO L225 Difference]: With dead ends: 66 [2021-05-06 11:33:49,617 INFO L226 Difference]: Without dead ends: 64 [2021-05-06 11:33:49,618 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 109.5ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-05-06 11:33:49,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-05-06 11:33:49,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2021-05-06 11:33:49,638 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-06 11:33:49,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2021-05-06 11:33:49,639 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 29 [2021-05-06 11:33:49,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:49,639 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2021-05-06 11:33:49,640 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-06 11:33:49,640 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2021-05-06 11:33:49,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-05-06 11:33:49,644 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:49,650 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-06 11:33:49,650 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-06 11:33:49,650 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:33:49,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:49,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1991737873, now seen corresponding path program 1 times [2021-05-06 11:33:49,651 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:49,651 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1843111345] [2021-05-06 11:33:49,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:49,653 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:49,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:49,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:49,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:49,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-05-06 11:33:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:49,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-05-06 11:33:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:49,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-05-06 11:33:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:49,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-05-06 11:33:49,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:49,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-05-06 11:33:49,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:49,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-05-06 11:33:49,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:49,782 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-05-06 11:33:49,782 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:49,782 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1843111345] [2021-05-06 11:33:49,782 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1843111345] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:49,783 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:49,783 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-06 11:33:49,783 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622341506] [2021-05-06 11:33:49,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-06 11:33:49,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:49,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-06 11:33:49,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-06 11:33:49,784 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-06 11:33:50,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:50,093 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2021-05-06 11:33:50,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-06 11:33:50,094 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-06 11:33:50,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:50,095 INFO L225 Difference]: With dead ends: 75 [2021-05-06 11:33:50,095 INFO L226 Difference]: Without dead ends: 73 [2021-05-06 11:33:50,096 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 116.2ms TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-05-06 11:33:50,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-05-06 11:33:50,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2021-05-06 11:33:50,106 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-06 11:33:50,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2021-05-06 11:33:50,107 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 47 [2021-05-06 11:33:50,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:50,108 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2021-05-06 11:33:50,108 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-06 11:33:50,108 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2021-05-06 11:33:50,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-05-06 11:33:50,109 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:50,109 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-06 11:33:50,109 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-06 11:33:50,110 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:33:50,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:50,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1947441265, now seen corresponding path program 1 times [2021-05-06 11:33:50,110 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:50,110 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [841444154] [2021-05-06 11:33:50,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:50,112 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:50,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:50,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:50,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-05-06 11:33:50,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:50,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-05-06 11:33:50,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:50,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-05-06 11:33:50,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:50,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-05-06 11:33:50,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:50,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-05-06 11:33:50,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:50,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-05-06 11:33:50,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:50,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-05-06 11:33:50,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:50,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-05-06 11:33:50,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:50,203 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-05-06 11:33:50,203 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:50,203 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [841444154] [2021-05-06 11:33:50,204 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [841444154] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:50,204 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:50,204 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-05-06 11:33:50,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766944590] [2021-05-06 11:33:50,204 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-06 11:33:50,204 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:50,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-06 11:33:50,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-05-06 11:33:50,205 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-06 11:33:50,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:50,533 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2021-05-06 11:33:50,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-06 11:33:50,534 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-06 11:33:50,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:50,535 INFO L225 Difference]: With dead ends: 75 [2021-05-06 11:33:50,535 INFO L226 Difference]: Without dead ends: 73 [2021-05-06 11:33:50,538 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 163.8ms TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2021-05-06 11:33:50,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-05-06 11:33:50,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2021-05-06 11:33:50,557 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-06 11:33:50,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2021-05-06 11:33:50,561 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 57 [2021-05-06 11:33:50,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:50,562 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2021-05-06 11:33:50,563 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-06 11:33:50,563 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2021-05-06 11:33:50,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-05-06 11:33:50,570 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:50,570 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-06 11:33:50,570 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-06 11:33:50,570 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:33:50,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:50,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1358511123, now seen corresponding path program 1 times [2021-05-06 11:33:50,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:50,571 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [667184371] [2021-05-06 11:33:50,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:50,576 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:50,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:50,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:50,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:50,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-05-06 11:33:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:50,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-05-06 11:33:50,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:50,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-05-06 11:33:50,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:50,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-05-06 11:33:50,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:50,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-05-06 11:33:50,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:50,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-05-06 11:33:50,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:50,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-05-06 11:33:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:50,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-05-06 11:33:50,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:50,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-05-06 11:33:50,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:50,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-05-06 11:33:50,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:50,681 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-05-06 11:33:50,682 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:50,682 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [667184371] [2021-05-06 11:33:50,682 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [667184371] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:50,682 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:50,682 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-06 11:33:50,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051153639] [2021-05-06 11:33:50,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-06 11:33:50,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:50,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-06 11:33:50,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-05-06 11:33:50,683 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-06 11:33:51,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:51,037 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2021-05-06 11:33:51,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-06 11:33:51,037 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-06 11:33:51,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:51,038 INFO L225 Difference]: With dead ends: 73 [2021-05-06 11:33:51,038 INFO L226 Difference]: Without dead ends: 0 [2021-05-06 11:33:51,038 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 186.7ms TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2021-05-06 11:33:51,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-06 11:33:51,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-06 11:33:51,039 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-06 11:33:51,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-06 11:33:51,039 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 68 [2021-05-06 11:33:51,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:51,039 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-06 11:33:51,039 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-06 11:33:51,039 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-06 11:33:51,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-06 11:33:51,039 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-06 11:33:51,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-05-06 11:33:52,059 INFO L198 CegarLoopUtils]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2021-05-06 11:33:52,059 INFO L198 CegarLoopUtils]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2021-05-06 11:33:52,059 INFO L198 CegarLoopUtils]: For program point L12-1(line 12) no Hoare annotation was computed. [2021-05-06 11:33:52,059 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2021-05-06 11:33:52,060 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-06 11:33:52,060 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-05-06 11:33:52,060 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-05-06 11:33:52,060 INFO L201 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-05-06 11:33:52,060 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-05-06 11:33:52,060 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-05-06 11:33:52,060 INFO L198 CegarLoopUtils]: For program point L15(line 15) no Hoare annotation was computed. [2021-05-06 11:33:52,060 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2021-05-06 11:33:52,060 INFO L198 CegarLoopUtils]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2021-05-06 11:33:52,060 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2021-05-06 11:33:52,061 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-06 11:33:52,061 INFO L201 CegarLoopUtils]: At program point L31(line 31) the Hoare annotation is: true [2021-05-06 11:33:52,062 INFO L194 CegarLoopUtils]: At program point L60(line 60) 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-06 11:33:52,062 INFO L201 CegarLoopUtils]: At program point mainEXIT(lines 24 67) the Hoare annotation is: true [2021-05-06 11:33:52,062 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-06 11:33:52,062 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-06 11:33:52,062 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-06 11:33:52,062 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-06 11:33:52,063 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-06 11:33:52,063 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-06 11:33:52,063 INFO L194 CegarLoopUtils]: At program point L36(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-06 11:33:52,063 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-06 11:33:52,063 INFO L194 CegarLoopUtils]: At program point L53(line 53) 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-06 11:33:52,063 INFO L194 CegarLoopUtils]: At program point L49(line 49) 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-06 11:33:52,063 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-06 11:33:52,064 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-06 11:33:52,064 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-06 11:33:52,064 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-06 11:33:52,064 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-06 11:33:52,064 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-06 11:33:52,064 INFO L201 CegarLoopUtils]: At program point mainFINAL(lines 24 67) the Hoare annotation is: true [2021-05-06 11:33:52,064 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-06 11:33:52,065 INFO L194 CegarLoopUtils]: At program point L38(line 38) 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-06 11:33:52,065 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-06 11:33:52,065 INFO L201 CegarLoopUtils]: At program point L34-3(lines 34 65) the Hoare annotation is: true [2021-05-06 11:33:52,065 INFO L201 CegarLoopUtils]: At program point mainENTRY(lines 24 67) the Hoare annotation is: true [2021-05-06 11:33:52,065 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-06 11:33:52,065 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-06 11:33:52,065 INFO L194 CegarLoopUtils]: At program point L43(line 43) 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-06 11:33:52,065 INFO L194 CegarLoopUtils]: At program point L39(line 39) 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-06 11:33:52,065 INFO L194 CegarLoopUtils]: At program point L18-2(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2021-05-06 11:33:52,065 INFO L201 CegarLoopUtils]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2021-05-06 11:33:52,066 INFO L194 CegarLoopUtils]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2021-05-06 11:33:52,066 INFO L194 CegarLoopUtils]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-05-06 11:33:52,066 INFO L194 CegarLoopUtils]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-05-06 11:33:52,066 INFO L194 CegarLoopUtils]: At program point L18(lines 18 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2021-05-06 11:33:52,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 11:33:52 BoogieIcfgContainer [2021-05-06 11:33:52,082 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-06 11:33:52,083 INFO L168 Benchmark]: Toolchain (without parser) took 5831.19 ms. Allocated memory was 185.6 MB in the beginning and 268.4 MB in the end (delta: 82.8 MB). Free memory was 150.2 MB in the beginning and 145.8 MB in the end (delta: 4.4 MB). Peak memory consumption was 137.0 MB. Max. memory is 8.0 GB. [2021-05-06 11:33:52,083 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 185.6 MB. Free memory is still 166.5 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-06 11:33:52,084 INFO L168 Benchmark]: CACSL2BoogieTranslator took 231.18 ms. Allocated memory is still 185.6 MB. Free memory was 150.1 MB in the beginning and 169.7 MB in the end (delta: -19.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. [2021-05-06 11:33:52,084 INFO L168 Benchmark]: Boogie Preprocessor took 61.40 ms. Allocated memory is still 185.6 MB. Free memory was 169.7 MB in the beginning and 168.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-05-06 11:33:52,086 INFO L168 Benchmark]: RCFGBuilder took 426.37 ms. Allocated memory is still 185.6 MB. Free memory was 167.6 MB in the beginning and 150.1 MB in the end (delta: 17.4 MB). Peak memory consumption was 16.8 MB. Max. memory is 8.0 GB. [2021-05-06 11:33:52,088 INFO L168 Benchmark]: TraceAbstraction took 5103.08 ms. Allocated memory was 185.6 MB in the beginning and 268.4 MB in the end (delta: 82.8 MB). Free memory was 149.4 MB in the beginning and 145.8 MB in the end (delta: 3.6 MB). Peak memory consumption was 135.9 MB. Max. memory is 8.0 GB. [2021-05-06 11:33:52,089 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.17 ms. Allocated memory is still 185.6 MB. Free memory is still 166.5 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 231.18 ms. Allocated memory is still 185.6 MB. Free memory was 150.1 MB in the beginning and 169.7 MB in the end (delta: -19.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 61.40 ms. Allocated memory is still 185.6 MB. Free memory was 169.7 MB in the beginning and 168.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 426.37 ms. Allocated memory is still 185.6 MB. Free memory was 167.6 MB in the beginning and 150.1 MB in the end (delta: 17.4 MB). Peak memory consumption was 16.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 5103.08 ms. Allocated memory was 185.6 MB in the beginning and 268.4 MB in the end (delta: 82.8 MB). Free memory was 149.4 MB in the beginning and 145.8 MB in the end (delta: 3.6 MB). Peak memory consumption was 135.9 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: 4010.6ms, OverallIterations: 8, TraceHistogramMax: 11, EmptinessCheckTime: 30.1ms, AutomataDifference: 2712.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 1018.7ms, InitialAbstractionConstructionTime: 12.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 286 SDtfs, 248 SDslu, 495 SDs, 0 SdLazy, 1159 SolverSat, 485 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1253.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 169 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1213.3ms 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: 147.0ms AutomataMinimizationTime, 8 MinimizatonAttempts, 15 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 43 LocationsWithAnnotation, 235 PreInvPairs, 302 NumberOfFragments, 567 HoareAnnotationTreeSize, 235 FomulaSimplifications, 3399 FormulaSimplificationTreeSizeReduction, 229.9ms HoareSimplificationTime, 43 FomulaSimplificationsInter, 1104 FormulaSimplificationTreeSizeReductionInter, 761.5ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 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 - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) RESULT: Ultimate proved your program to be correct! Received shutdown request...