/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-02 12:33:19,002 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-02 12:33:19,003 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-02 12:33:19,036 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-02 12:33:19,037 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-02 12:33:19,040 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-02 12:33:19,043 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-02 12:33:19,048 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-02 12:33:19,050 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-02 12:33:19,054 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-02 12:33:19,055 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-02 12:33:19,056 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-02 12:33:19,057 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-02 12:33:19,058 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-02 12:33:19,060 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-02 12:33:19,061 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-02 12:33:19,062 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-02 12:33:19,062 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-02 12:33:19,068 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-02 12:33:19,073 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-02 12:33:19,074 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-02 12:33:19,076 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-02 12:33:19,077 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-02 12:33:19,079 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-02 12:33:19,085 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-02 12:33:19,085 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-02 12:33:19,085 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-02 12:33:19,087 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-02 12:33:19,087 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-02 12:33:19,088 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-02 12:33:19,088 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-02 12:33:19,089 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-02 12:33:19,090 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-02 12:33:19,091 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-02 12:33:19,091 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-02 12:33:19,092 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-02 12:33:19,092 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-02 12:33:19,092 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-02 12:33:19,093 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-02 12:33:19,093 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-02 12:33:19,094 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-02 12:33:19,095 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2021-05-02 12:33:19,132 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-02 12:33:19,132 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-02 12:33:19,140 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-05-02 12:33:19,140 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-05-02 12:33:19,140 INFO L138 SettingsManager]: * Use SBE=true [2021-05-02 12:33:19,140 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-02 12:33:19,140 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-02 12:33:19,140 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-02 12:33:19,140 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-02 12:33:19,141 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-02 12:33:19,142 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-02 12:33:19,142 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-02 12:33:19,142 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-02 12:33:19,142 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-02 12:33:19,142 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-02 12:33:19,142 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-02 12:33:19,142 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-02 12:33:19,143 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-02 12:33:19,143 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-02 12:33:19,143 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-02 12:33:19,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 12:33:19,143 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-02 12:33:19,143 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-05-02 12:33:19,144 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-05-02 12:33:19,144 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-05-02 12:33:19,144 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-05-02 12:33:19,144 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-02 12:33:19,144 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-05-02 12:33:19,144 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2021-05-02 12:33:19,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-02 12:33:19,479 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-02 12:33:19,481 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-02 12:33:19,482 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-02 12:33:19,483 INFO L275 PluginConnector]: CDTParser initialized [2021-05-02 12:33:19,483 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2021-05-02 12:33:19,544 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b668a11db/f398dc454a824d928be8cb9db42e418c/FLAGe32993639 [2021-05-02 12:33:19,971 INFO L306 CDTParser]: Found 1 translation units. [2021-05-02 12:33:19,971 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2021-05-02 12:33:19,981 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b668a11db/f398dc454a824d928be8cb9db42e418c/FLAGe32993639 [2021-05-02 12:33:20,367 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b668a11db/f398dc454a824d928be8cb9db42e418c [2021-05-02 12:33:20,369 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-02 12:33:20,371 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-02 12:33:20,375 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-02 12:33:20,375 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-02 12:33:20,378 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-02 12:33:20,380 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 12:33:20" (1/1) ... [2021-05-02 12:33:20,381 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1df36a48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:33:20, skipping insertion in model container [2021-05-02 12:33:20,381 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 12:33:20" (1/1) ... [2021-05-02 12:33:20,388 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-02 12:33:20,406 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-02 12:33:20,541 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/sendmail-close-angle.i[893,906] [2021-05-02 12:33:20,553 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 12:33:20,560 INFO L203 MainTranslator]: Completed pre-run [2021-05-02 12:33:20,588 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/sendmail-close-angle.i[893,906] [2021-05-02 12:33:20,605 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 12:33:20,627 INFO L208 MainTranslator]: Completed translation [2021-05-02 12:33:20,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:33:20 WrapperNode [2021-05-02 12:33:20,628 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-02 12:33:20,629 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-02 12:33:20,629 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-02 12:33:20,631 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-02 12:33:20,640 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:33:20" (1/1) ... [2021-05-02 12:33:20,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:33:20" (1/1) ... [2021-05-02 12:33:20,648 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:33:20" (1/1) ... [2021-05-02 12:33:20,648 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:33:20" (1/1) ... [2021-05-02 12:33:20,661 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:33:20" (1/1) ... [2021-05-02 12:33:20,665 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:33:20" (1/1) ... [2021-05-02 12:33:20,670 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:33:20" (1/1) ... [2021-05-02 12:33:20,674 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-02 12:33:20,675 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-02 12:33:20,676 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-02 12:33:20,676 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-02 12:33:20,676 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:33:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 12:33:20,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-02 12:33:20,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-02 12:33:20,745 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-02 12:33:20,745 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-05-02 12:33:20,745 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-02 12:33:20,745 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-02 12:33:20,746 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-02 12:33:20,746 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-02 12:33:20,746 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-05-02 12:33:20,747 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-05-02 12:33:20,747 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-02 12:33:20,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-02 12:33:20,747 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-05-02 12:33:20,747 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-02 12:33:20,748 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-05-02 12:33:20,748 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-02 12:33:20,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-02 12:33:20,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-02 12:33:20,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-02 12:33:20,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-02 12:33:20,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-02 12:33:20,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-02 12:33:21,078 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-02 12:33:21,078 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-05-02 12:33:21,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 12:33:21 BoogieIcfgContainer [2021-05-02 12:33:21,080 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-02 12:33:21,081 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-02 12:33:21,081 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-02 12:33:21,084 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-02 12:33:21,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.05 12:33:20" (1/3) ... [2021-05-02 12:33:21,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65a55def and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 12:33:21, skipping insertion in model container [2021-05-02 12:33:21,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:33:20" (2/3) ... [2021-05-02 12:33:21,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65a55def and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 12:33:21, skipping insertion in model container [2021-05-02 12:33:21,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 12:33:21" (3/3) ... [2021-05-02 12:33:21,089 INFO L111 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2021-05-02 12:33:21,094 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-05-02 12:33:21,097 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-02 12:33:21,113 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-02 12:33:21,132 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-02 12:33:21,132 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-02 12:33:21,132 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-05-02 12:33:21,133 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-02 12:33:21,133 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-02 12:33:21,133 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-02 12:33:21,133 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-02 12:33:21,133 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-02 12:33:21,154 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 21 states have (on average 1.380952380952381) internal successors, (29), 23 states have internal predecessors, (29), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2021-05-02 12:33:21,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-05-02 12:33:21,158 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:33:21,159 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:33:21,159 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:33:21,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:33:21,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1361038294, now seen corresponding path program 1 times [2021-05-02 12:33:21,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:33:21,177 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911729640] [2021-05-02 12:33:21,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:33:21,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:21,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:33:21,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:21,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:33:21,373 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:33:21,374 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911729640] [2021-05-02 12:33:21,374 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911729640] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:33:21,374 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:33:21,375 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-02 12:33:21,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391847438] [2021-05-02 12:33:21,379 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-02 12:33:21,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:33:21,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-02 12:33:21,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-02 12:33:21,391 INFO L87 Difference]: Start difference. First operand has 36 states, 21 states have (on average 1.380952380952381) internal successors, (29), 23 states have internal predecessors, (29), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:33:21,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:33:21,503 INFO L93 Difference]: Finished difference Result 62 states and 93 transitions. [2021-05-02 12:33:21,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-02 12:33:21,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 15 [2021-05-02 12:33:21,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:33:21,511 INFO L225 Difference]: With dead ends: 62 [2021-05-02 12:33:21,512 INFO L226 Difference]: Without dead ends: 30 [2021-05-02 12:33:21,520 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 47.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-02 12:33:21,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-05-02 12:33:21,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-05-02 12:33:21,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-05-02 12:33:21,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2021-05-02 12:33:21,583 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 15 [2021-05-02 12:33:21,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:33:21,585 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2021-05-02 12:33:21,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:33:21,586 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2021-05-02 12:33:21,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-02 12:33:21,587 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:33:21,587 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:33:21,588 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-02 12:33:21,588 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:33:21,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:33:21,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1347976123, now seen corresponding path program 1 times [2021-05-02 12:33:21,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:33:21,589 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257261771] [2021-05-02 12:33:21,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:33:21,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:21,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:33:21,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:21,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:33:21,782 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:33:21,782 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257261771] [2021-05-02 12:33:21,783 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257261771] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:33:21,783 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:33:21,783 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 12:33:21,783 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718026657] [2021-05-02 12:33:21,785 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 12:33:21,785 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:33:21,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 12:33:21,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 12:33:21,790 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:33:22,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:33:22,087 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2021-05-02 12:33:22,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 12:33:22,088 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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 16 [2021-05-02 12:33:22,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:33:22,089 INFO L225 Difference]: With dead ends: 36 [2021-05-02 12:33:22,089 INFO L226 Difference]: Without dead ends: 34 [2021-05-02 12:33:22,090 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 178.1ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-05-02 12:33:22,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-05-02 12:33:22,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2021-05-02 12:33:22,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-05-02 12:33:22,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2021-05-02 12:33:22,098 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 16 [2021-05-02 12:33:22,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:33:22,098 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2021-05-02 12:33:22,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:33:22,098 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2021-05-02 12:33:22,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-02 12:33:22,099 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:33:22,099 INFO L523 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:33:22,099 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-02 12:33:22,099 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:33:22,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:33:22,100 INFO L82 PathProgramCache]: Analyzing trace with hash -863391162, now seen corresponding path program 1 times [2021-05-02 12:33:22,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:33:22,100 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133490914] [2021-05-02 12:33:22,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:33:22,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:22,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:33:22,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:22,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-05-02 12:33:22,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:22,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:33:22,232 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:33:22,232 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133490914] [2021-05-02 12:33:22,232 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133490914] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:33:22,232 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:33:22,232 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 12:33:22,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326828594] [2021-05-02 12:33:22,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 12:33:22,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:33:22,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 12:33:22,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-05-02 12:33:22,234 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 12:33:22,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:33:22,614 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2021-05-02 12:33:22,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 12:33:22,614 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 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 21 [2021-05-02 12:33:22,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:33:22,618 INFO L225 Difference]: With dead ends: 49 [2021-05-02 12:33:22,618 INFO L226 Difference]: Without dead ends: 47 [2021-05-02 12:33:22,620 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 176.6ms TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-05-02 12:33:22,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-05-02 12:33:22,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2021-05-02 12:33:22,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 29 states have internal predecessors, (31), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2021-05-02 12:33:22,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2021-05-02 12:33:22,647 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 21 [2021-05-02 12:33:22,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:33:22,647 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2021-05-02 12:33:22,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 12:33:22,648 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2021-05-02 12:33:22,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-05-02 12:33:22,650 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:33:22,650 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, 1, 1, 1, 1, 1] [2021-05-02 12:33:22,650 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-02 12:33:22,651 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:33:22,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:33:22,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1742477006, now seen corresponding path program 1 times [2021-05-02 12:33:22,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:33:22,653 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022530758] [2021-05-02 12:33:22,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:33:22,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:22,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:33:22,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:22,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-05-02 12:33:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:22,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-02 12:33:22,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:22,777 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-05-02 12:33:22,777 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:33:22,778 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022530758] [2021-05-02 12:33:22,778 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022530758] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:33:22,778 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:33:22,778 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 12:33:22,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971076694] [2021-05-02 12:33:22,779 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 12:33:22,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:33:22,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 12:33:22,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-05-02 12:33:22,780 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-02 12:33:23,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:33:23,091 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2021-05-02 12:33:23,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 12:33:23,092 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 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 29 [2021-05-02 12:33:23,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:33:23,096 INFO L225 Difference]: With dead ends: 56 [2021-05-02 12:33:23,096 INFO L226 Difference]: Without dead ends: 54 [2021-05-02 12:33:23,096 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 141.2ms TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-05-02 12:33:23,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-05-02 12:33:23,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2021-05-02 12:33:23,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 32 states have internal predecessors, (34), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2021-05-02 12:33:23,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2021-05-02 12:33:23,118 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 29 [2021-05-02 12:33:23,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:33:23,118 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2021-05-02 12:33:23,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-02 12:33:23,119 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2021-05-02 12:33:23,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-05-02 12:33:23,120 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:33:23,120 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, 1, 1, 1] [2021-05-02 12:33:23,121 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-02 12:33:23,121 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:33:23,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:33:23,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1571308956, now seen corresponding path program 1 times [2021-05-02 12:33:23,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:33:23,123 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403968808] [2021-05-02 12:33:23,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:33:23,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:23,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:33:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:23,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-05-02 12:33:23,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:23,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-05-02 12:33:23,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:23,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-05-02 12:33:23,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:23,271 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-05-02 12:33:23,271 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:33:23,271 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403968808] [2021-05-02 12:33:23,271 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403968808] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:33:23,271 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:33:23,271 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-05-02 12:33:23,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946579327] [2021-05-02 12:33:23,272 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-02 12:33:23,272 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:33:23,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-02 12:33:23,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-05-02 12:33:23,273 INFO L87 Difference]: Start difference. First operand 49 states and 60 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, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-05-02 12:33:23,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:33:23,641 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2021-05-02 12:33:23,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 12:33:23,642 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, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2021-05-02 12:33:23,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:33:23,646 INFO L225 Difference]: With dead ends: 75 [2021-05-02 12:33:23,646 INFO L226 Difference]: Without dead ends: 68 [2021-05-02 12:33:23,647 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 158.6ms TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2021-05-02 12:33:23,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-05-02 12:33:23,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2021-05-02 12:33:23,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 40 states have (on average 1.125) internal successors, (45), 43 states have internal predecessors, (45), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2021-05-02 12:33:23,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2021-05-02 12:33:23,670 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 79 transitions. Word has length 32 [2021-05-02 12:33:23,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:33:23,674 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 79 transitions. [2021-05-02 12:33:23,676 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, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-05-02 12:33:23,676 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2021-05-02 12:33:23,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-05-02 12:33:23,677 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:33:23,680 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, 1, 1, 1, 1, 1] [2021-05-02 12:33:23,681 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-02 12:33:23,681 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:33:23,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:33:23,681 INFO L82 PathProgramCache]: Analyzing trace with hash 173943289, now seen corresponding path program 1 times [2021-05-02 12:33:23,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:33:23,682 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289063407] [2021-05-02 12:33:23,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:33:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:23,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:33:23,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:23,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-05-02 12:33:23,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:23,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-02 12:33:23,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:23,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-05-02 12:33:23,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:23,830 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-05-02 12:33:23,830 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:33:23,830 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289063407] [2021-05-02 12:33:23,830 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289063407] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:33:23,830 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:33:23,831 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-02 12:33:23,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257285585] [2021-05-02 12:33:23,833 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-02 12:33:23,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:33:23,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-02 12:33:23,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-05-02 12:33:23,834 INFO L87 Difference]: Start difference. First operand 66 states and 79 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-05-02 12:33:24,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:33:24,221 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2021-05-02 12:33:24,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-02 12:33:24,222 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 34 [2021-05-02 12:33:24,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:33:24,223 INFO L225 Difference]: With dead ends: 77 [2021-05-02 12:33:24,223 INFO L226 Difference]: Without dead ends: 75 [2021-05-02 12:33:24,223 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 194.4ms TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2021-05-02 12:33:24,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-05-02 12:33:24,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2021-05-02 12:33:24,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 46 states have internal predecessors, (48), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2021-05-02 12:33:24,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2021-05-02 12:33:24,245 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 34 [2021-05-02 12:33:24,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:33:24,245 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2021-05-02 12:33:24,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-05-02 12:33:24,245 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2021-05-02 12:33:24,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-05-02 12:33:24,247 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:33:24,247 INFO L523 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:33:24,247 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-02 12:33:24,247 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:33:24,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:33:24,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1755534668, now seen corresponding path program 1 times [2021-05-02 12:33:24,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:33:24,248 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487370190] [2021-05-02 12:33:24,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:33:24,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:24,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:33:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:24,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-05-02 12:33:24,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:24,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-02 12:33:24,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:24,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-05-02 12:33:24,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:24,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-05-02 12:33:24,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:24,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-05-02 12:33:24,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:24,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-05-02 12:33:24,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:24,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-05-02 12:33:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:24,467 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-05-02 12:33:24,467 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:33:24,467 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487370190] [2021-05-02 12:33:24,467 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487370190] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 12:33:24,468 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638845331] [2021-05-02 12:33:24,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 12:33:24,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:24,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 19 conjunts are in the unsatisfiable core [2021-05-02 12:33:24,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 12:33:24,673 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:24,676 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:24,735 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:24,738 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:24,779 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:24,781 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:24,785 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:24,788 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:24,817 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:24,818 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:24,821 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:24,822 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:24,845 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:24,846 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:24,848 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:24,849 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:24,880 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:24,881 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:24,884 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:24,885 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:24,907 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:24,911 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:24,935 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:24,936 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:24,937 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:24,939 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:24,954 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:24,958 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:24,967 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:24,974 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:24,989 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:25,025 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-05-02 12:33:25,026 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638845331] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 12:33:25,026 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 12:33:25,026 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2021-05-02 12:33:25,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357282853] [2021-05-02 12:33:25,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-05-02 12:33:25,027 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:33:25,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-05-02 12:33:25,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2021-05-02 12:33:25,027 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand has 16 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 6 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2021-05-02 12:33:25,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:33:25,663 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2021-05-02 12:33:25,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-05-02 12:33:25,664 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 6 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 57 [2021-05-02 12:33:25,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:33:25,665 INFO L225 Difference]: With dead ends: 92 [2021-05-02 12:33:25,665 INFO L226 Difference]: Without dead ends: 85 [2021-05-02 12:33:25,666 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 419.8ms TimeCoverageRelationStatistics Valid=129, Invalid=521, Unknown=0, NotChecked=0, Total=650 [2021-05-02 12:33:25,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-05-02 12:33:25,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2021-05-02 12:33:25,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 54 states have internal predecessors, (56), 22 states have call successors, (22), 10 states have call predecessors, (22), 9 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2021-05-02 12:33:25,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 98 transitions. [2021-05-02 12:33:25,686 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 98 transitions. Word has length 57 [2021-05-02 12:33:25,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:33:25,688 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 98 transitions. [2021-05-02 12:33:25,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 6 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2021-05-02 12:33:25,688 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 98 transitions. [2021-05-02 12:33:25,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-05-02 12:33:25,691 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:33:25,691 INFO L523 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:33:25,897 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-05-02 12:33:25,897 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:33:25,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:33:25,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1121193385, now seen corresponding path program 1 times [2021-05-02 12:33:25,899 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:33:25,899 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157813018] [2021-05-02 12:33:25,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:33:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:26,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:33:26,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:26,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-05-02 12:33:26,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:26,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-02 12:33:26,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:26,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-05-02 12:33:26,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:26,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-05-02 12:33:26,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:26,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-05-02 12:33:26,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:26,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-05-02 12:33:26,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:26,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-05-02 12:33:26,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:26,088 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-05-02 12:33:26,088 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:33:26,088 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157813018] [2021-05-02 12:33:26,088 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157813018] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 12:33:26,088 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970258903] [2021-05-02 12:33:26,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 12:33:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:26,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 11 conjunts are in the unsatisfiable core [2021-05-02 12:33:26,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 12:33:26,202 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:26,251 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:26,252 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:26,254 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:26,254 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:26,265 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:26,266 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:26,267 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:26,268 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:26,280 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:26,283 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:26,300 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:26,300 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:26,306 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:26,307 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:26,321 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:26,323 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:26,324 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:26,325 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:26,342 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:26,343 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:26,348 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:26,349 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:26,365 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:26,368 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:26,377 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:26,378 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:26,394 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:26,396 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:26,413 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:26,414 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:26,416 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:26,417 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:26,428 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:26,430 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:26,436 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:26,440 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:26,445 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:26,467 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-05-02 12:33:26,467 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970258903] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 12:33:26,467 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 12:33:26,467 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2021-05-02 12:33:26,467 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677656298] [2021-05-02 12:33:26,469 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-05-02 12:33:26,469 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:33:26,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-05-02 12:33:26,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2021-05-02 12:33:26,470 INFO L87 Difference]: Start difference. First operand 83 states and 98 transitions. Second operand has 15 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 7 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (15), 7 states have call predecessors, (15), 7 states have call successors, (15) [2021-05-02 12:33:26,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:33:26,910 INFO L93 Difference]: Finished difference Result 94 states and 109 transitions. [2021-05-02 12:33:26,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-02 12:33:26,911 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 7 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (15), 7 states have call predecessors, (15), 7 states have call successors, (15) Word has length 59 [2021-05-02 12:33:26,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:33:26,912 INFO L225 Difference]: With dead ends: 94 [2021-05-02 12:33:26,912 INFO L226 Difference]: Without dead ends: 92 [2021-05-02 12:33:26,913 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 263.2ms TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2021-05-02 12:33:26,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-05-02 12:33:26,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 87. [2021-05-02 12:33:26,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 57 states have internal predecessors, (59), 22 states have call successors, (22), 11 states have call predecessors, (22), 10 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2021-05-02 12:33:26,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 101 transitions. [2021-05-02 12:33:26,924 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 101 transitions. Word has length 59 [2021-05-02 12:33:26,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:33:26,924 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 101 transitions. [2021-05-02 12:33:26,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 7 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (15), 7 states have call predecessors, (15), 7 states have call successors, (15) [2021-05-02 12:33:26,925 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2021-05-02 12:33:26,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-05-02 12:33:26,926 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:33:26,926 INFO L523 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:33:27,142 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-05-02 12:33:27,142 INFO L428 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:33:27,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:33:27,143 INFO L82 PathProgramCache]: Analyzing trace with hash 525355932, now seen corresponding path program 2 times [2021-05-02 12:33:27,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:33:27,143 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37564425] [2021-05-02 12:33:27,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:33:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:27,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:33:27,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:27,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-05-02 12:33:27,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:27,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-02 12:33:27,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:27,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-05-02 12:33:27,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:27,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-05-02 12:33:27,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:27,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-05-02 12:33:27,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:27,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-05-02 12:33:27,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:27,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-05-02 12:33:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:27,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-05-02 12:33:27,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:27,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-05-02 12:33:27,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:27,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-05-02 12:33:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:27,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-05-02 12:33:27,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:27,410 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 48 proven. 17 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2021-05-02 12:33:27,410 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:33:27,410 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37564425] [2021-05-02 12:33:27,411 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37564425] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 12:33:27,411 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238982595] [2021-05-02 12:33:27,411 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 12:33:27,478 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-02 12:33:27,479 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 12:33:27,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 23 conjunts are in the unsatisfiable core [2021-05-02 12:33:27,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 12:33:27,532 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:27,534 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:27,545 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:27,552 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:27,555 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:27,576 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:27,581 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:27,591 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:27,593 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:27,610 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:27,618 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:27,619 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:27,620 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:27,621 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:27,631 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:27,632 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:27,634 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:27,635 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:27,650 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:27,651 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:27,652 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:27,653 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:27,662 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:27,663 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:27,664 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:27,665 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:27,680 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:27,681 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:27,682 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:27,682 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:27,694 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:27,695 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:27,696 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:27,697 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:27,708 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:27,711 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:27,713 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:27,715 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:27,727 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:27,730 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:27,759 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 44 proven. 45 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2021-05-02 12:33:27,759 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238982595] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 12:33:27,759 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 12:33:27,759 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 15 [2021-05-02 12:33:27,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907374007] [2021-05-02 12:33:27,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-05-02 12:33:27,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:33:27,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-05-02 12:33:27,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-05-02 12:33:27,761 INFO L87 Difference]: Start difference. First operand 87 states and 101 transitions. Second operand has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 7 states have call successors, (19), 4 states have call predecessors, (19), 2 states have return successors, (15), 7 states have call predecessors, (15), 7 states have call successors, (15) [2021-05-02 12:33:28,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:33:28,394 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2021-05-02 12:33:28,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-02 12:33:28,395 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 7 states have call successors, (19), 4 states have call predecessors, (19), 2 states have return successors, (15), 7 states have call predecessors, (15), 7 states have call successors, (15) Word has length 82 [2021-05-02 12:33:28,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:33:28,399 INFO L225 Difference]: With dead ends: 93 [2021-05-02 12:33:28,399 INFO L226 Difference]: Without dead ends: 84 [2021-05-02 12:33:28,400 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 103 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 506.1ms TimeCoverageRelationStatistics Valid=142, Invalid=560, Unknown=0, NotChecked=0, Total=702 [2021-05-02 12:33:28,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-05-02 12:33:28,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 75. [2021-05-02 12:33:28,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.02) internal successors, (51), 51 states have internal predecessors, (51), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2021-05-02 12:33:28,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2021-05-02 12:33:28,415 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 82 [2021-05-02 12:33:28,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:33:28,415 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2021-05-02 12:33:28,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 7 states have call successors, (19), 4 states have call predecessors, (19), 2 states have return successors, (15), 7 states have call predecessors, (15), 7 states have call successors, (15) [2021-05-02 12:33:28,416 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2021-05-02 12:33:28,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-05-02 12:33:28,420 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:33:28,421 INFO L523 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:33:28,644 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-05-02 12:33:28,644 INFO L428 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:33:28,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:33:28,645 INFO L82 PathProgramCache]: Analyzing trace with hash 35434489, now seen corresponding path program 2 times [2021-05-02 12:33:28,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:33:28,645 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116152676] [2021-05-02 12:33:28,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:33:28,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:28,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:33:28,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:28,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-05-02 12:33:28,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:28,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-02 12:33:28,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:28,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-05-02 12:33:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:28,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-05-02 12:33:28,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:28,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-05-02 12:33:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:28,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-05-02 12:33:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:28,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-05-02 12:33:28,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:28,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-05-02 12:33:28,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:28,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-05-02 12:33:28,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:28,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-05-02 12:33:28,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:28,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-05-02 12:33:28,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:33:28,832 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 48 proven. 24 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2021-05-02 12:33:28,832 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:33:28,832 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116152676] [2021-05-02 12:33:28,833 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116152676] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 12:33:28,833 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017860072] [2021-05-02 12:33:28,833 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 12:33:28,892 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-02 12:33:28,892 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 12:33:28,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 24 conjunts are in the unsatisfiable core [2021-05-02 12:33:28,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 12:33:28,969 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:28,969 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:28,970 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:28,973 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:28,974 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:28,976 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:28,988 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:28,989 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:28,989 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:28,991 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:28,991 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:28,992 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,002 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,004 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,025 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,026 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,048 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,049 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,050 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,051 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,052 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,053 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,064 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,065 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,065 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,066 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,067 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,068 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,084 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,085 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,086 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,087 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,088 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,090 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,102 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,103 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,104 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,105 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,106 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,106 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,119 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,120 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,142 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,144 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,165 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,166 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,167 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,168 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,169 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,169 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,183 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,184 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,185 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,186 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,186 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,187 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,207 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,207 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,208 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,210 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,210 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,211 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,221 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,222 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,222 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,223 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,224 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,225 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,234 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,253 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,255 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,272 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,273 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,274 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,275 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,284 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,286 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,288 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,293 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,296 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:33:29,325 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 44 proven. 59 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2021-05-02 12:33:29,326 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017860072] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 12:33:29,326 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 12:33:29,326 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 22 [2021-05-02 12:33:29,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015853517] [2021-05-02 12:33:29,326 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-05-02 12:33:29,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:33:29,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-05-02 12:33:29,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2021-05-02 12:33:29,327 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 22 states, 20 states have (on average 2.35) internal successors, (47), 20 states have internal predecessors, (47), 8 states have call successors, (23), 4 states have call predecessors, (23), 2 states have return successors, (20), 10 states have call predecessors, (20), 8 states have call successors, (20) [2021-05-02 12:33:30,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:33:30,301 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2021-05-02 12:33:30,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-05-02 12:33:30,302 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.35) internal successors, (47), 20 states have internal predecessors, (47), 8 states have call successors, (23), 4 states have call predecessors, (23), 2 states have return successors, (20), 10 states have call predecessors, (20), 8 states have call successors, (20) Word has length 84 [2021-05-02 12:33:30,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:33:30,302 INFO L225 Difference]: With dead ends: 95 [2021-05-02 12:33:30,302 INFO L226 Difference]: Without dead ends: 0 [2021-05-02 12:33:30,304 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 777.8ms TimeCoverageRelationStatistics Valid=287, Invalid=1435, Unknown=0, NotChecked=0, Total=1722 [2021-05-02 12:33:30,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-02 12:33:30,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-02 12:33:30,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-02 12:33:30,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-02 12:33:30,305 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 84 [2021-05-02 12:33:30,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:33:30,305 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-02 12:33:30,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 22 states, 20 states have (on average 2.35) internal successors, (47), 20 states have internal predecessors, (47), 8 states have call successors, (23), 4 states have call predecessors, (23), 2 states have return successors, (20), 10 states have call predecessors, (20), 8 states have call successors, (20) [2021-05-02 12:33:30,305 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-02 12:33:30,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-02 12:33:30,512 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 12:33:30,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-05-02 12:33:30,790 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 27 [2021-05-02 12:33:31,022 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 25 [2021-05-02 12:33:31,267 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 25 [2021-05-02 12:33:31,534 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 25 [2021-05-02 12:33:31,620 INFO L198 CegarLoopUtils]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2021-05-02 12:33:31,620 INFO L198 CegarLoopUtils]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2021-05-02 12:33:31,620 INFO L198 CegarLoopUtils]: For program point L12-1(line 12) no Hoare annotation was computed. [2021-05-02 12:33:31,620 INFO L198 CegarLoopUtils]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2021-05-02 12:33:31,621 INFO L194 CegarLoopUtils]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string0.offset| |old(#t~string0.offset)|) (= |old(#length)| |#length|) (= |#t~string1.base| |old(#t~string1.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string0.base| |old(#t~string0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|) (= |#t~string1.offset| |old(#t~string1.offset)|)) [2021-05-02 12:33:31,622 INFO L198 CegarLoopUtils]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2021-05-02 12:33:31,622 INFO L198 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-05-02 12:33:31,622 INFO L201 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-05-02 12:33:31,622 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-05-02 12:33:31,622 INFO L198 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-05-02 12:33:31,622 INFO L198 CegarLoopUtils]: For program point L15(line 15) no Hoare annotation was computed. [2021-05-02 12:33:31,622 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2021-05-02 12:33:31,622 INFO L198 CegarLoopUtils]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2021-05-02 12:33:31,622 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2021-05-02 12:33:31,622 INFO L198 CegarLoopUtils]: For program point L31(line 31) no Hoare annotation was computed. [2021-05-02 12:33:31,623 INFO L198 CegarLoopUtils]: For program point L31-1(lines 25 56) no Hoare annotation was computed. [2021-05-02 12:33:31,623 INFO L198 CegarLoopUtils]: For program point mainEXIT(lines 24 56) no Hoare annotation was computed. [2021-05-02 12:33:31,623 INFO L194 CegarLoopUtils]: At program point L52(line 52) the Hoare annotation is: (and (let ((.cse0 (<= 0 main_~buf~0)) (.cse1 (<= 2 main_~bufferlen~0))) (or (and .cse0 (<= 1 main_~in~0) .cse1) (and .cse0 (= main_~in~0 0) .cse1))) (<= (+ main_~buf~0 1) main_~bufferlen~0)) [2021-05-02 12:33:31,624 INFO L194 CegarLoopUtils]: At program point L52-1(line 52) the Hoare annotation is: (and (let ((.cse0 (<= 0 main_~buf~0)) (.cse1 (<= 2 main_~bufferlen~0))) (or (and .cse0 (<= 1 main_~in~0) .cse1) (and .cse0 (= main_~in~0 0) .cse1))) (<= (+ main_~buf~0 1) main_~bufferlen~0)) [2021-05-02 12:33:31,624 INFO L198 CegarLoopUtils]: For program point L44(lines 44 45) no Hoare annotation was computed. [2021-05-02 12:33:31,624 INFO L198 CegarLoopUtils]: For program point L32(lines 25 56) no Hoare annotation was computed. [2021-05-02 12:33:31,624 INFO L198 CegarLoopUtils]: For program point L53(line 53) no Hoare annotation was computed. [2021-05-02 12:33:31,625 INFO L194 CegarLoopUtils]: At program point L49(line 49) the Hoare annotation is: (let ((.cse0 (<= 0 main_~buf~0)) (.cse1 (<= 1 main_~in~0))) (or (and .cse0 (<= 3 main_~bufferlen~0) .cse1 (<= (+ main_~in~0 2) main_~inlen~0) (<= main_~buf~0 1)) (and .cse0 (= main_~bufferlen~0 (+ main_~buflim~0 2)) (<= 3 main_~inlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) .cse1) (and (= main_~in~0 0) (= main_~buf~0 0) (<= 2 main_~bufferlen~0)))) [2021-05-02 12:33:31,625 INFO L194 CegarLoopUtils]: At program point L41(line 41) the Hoare annotation is: (let ((.cse0 (<= (+ main_~buf~0 3) main_~bufferlen~0)) (.cse1 (= main_~bufferlen~0 (+ main_~buflim~0 2))) (.cse2 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= 0 main_~buf~0) .cse0 .cse1 (<= 1 main_~in~0) .cse2) (and (= main_~in~0 0) .cse0 .cse1 (= main_~buf~0 0) .cse2))) [2021-05-02 12:33:31,625 INFO L194 CegarLoopUtils]: At program point L41-1(line 41) the Hoare annotation is: (let ((.cse0 (<= (+ main_~buf~0 3) main_~bufferlen~0)) (.cse1 (= main_~bufferlen~0 (+ main_~buflim~0 2))) (.cse2 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= 0 main_~buf~0) .cse0 .cse1 (<= 1 main_~in~0) .cse2) (and (= main_~in~0 0) .cse0 .cse1 (= main_~buf~0 0) .cse2))) [2021-05-02 12:33:31,626 INFO L198 CegarLoopUtils]: For program point L37-1(lines 37 48) no Hoare annotation was computed. [2021-05-02 12:33:31,626 INFO L194 CegarLoopUtils]: At program point L37-3(lines 37 48) the Hoare annotation is: (let ((.cse0 (<= 0 main_~buf~0)) (.cse1 (<= 1 main_~in~0))) (or (and .cse0 (<= 3 main_~bufferlen~0) .cse1 (<= (+ main_~in~0 2) main_~inlen~0) (<= main_~buf~0 1)) (and .cse0 (= main_~bufferlen~0 (+ main_~buflim~0 2)) (<= 3 main_~inlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) .cse1) (and (= main_~in~0 0) (= main_~buf~0 0) (<= 2 main_~bufferlen~0)))) [2021-05-02 12:33:31,626 INFO L198 CegarLoopUtils]: For program point L33(line 33) no Hoare annotation was computed. [2021-05-02 12:33:31,626 INFO L198 CegarLoopUtils]: For program point L50(line 50) no Hoare annotation was computed. [2021-05-02 12:33:31,626 INFO L194 CegarLoopUtils]: At program point L46(line 46) the Hoare annotation is: (and (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= 0 main_~buf~0) (= main_~bufferlen~0 (+ main_~buflim~0 2)) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 1 main_~in~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2021-05-02 12:33:31,626 INFO L194 CegarLoopUtils]: At program point L46-1(line 46) the Hoare annotation is: (and (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= 0 main_~buf~0) (= main_~bufferlen~0 (+ main_~buflim~0 2)) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 1 main_~in~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2021-05-02 12:33:31,626 INFO L198 CegarLoopUtils]: For program point mainFINAL(lines 24 56) no Hoare annotation was computed. [2021-05-02 12:33:31,626 INFO L198 CegarLoopUtils]: For program point L42(line 42) no Hoare annotation was computed. [2021-05-02 12:33:31,626 INFO L201 CegarLoopUtils]: At program point mainENTRY(lines 24 56) the Hoare annotation is: true [2021-05-02 12:33:31,626 INFO L201 CegarLoopUtils]: At program point L55(lines 25 56) the Hoare annotation is: true [2021-05-02 12:33:31,627 INFO L194 CegarLoopUtils]: At program point L47(lines 37 48) the Hoare annotation is: (let ((.cse0 (= main_~bufferlen~0 (+ main_~buflim~0 2))) (.cse1 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and (= main_~in~0 0) .cse0 (= main_~buf~0 0) (<= 2 main_~bufferlen~0) .cse1) (and (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= 0 main_~buf~0) .cse0 (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 1 main_~in~0) .cse1))) [2021-05-02 12:33:31,627 INFO L198 CegarLoopUtils]: For program point L39(lines 39 40) no Hoare annotation was computed. [2021-05-02 12:33:31,627 INFO L198 CegarLoopUtils]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2021-05-02 12:33:31,627 INFO L201 CegarLoopUtils]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2021-05-02 12:33:31,627 INFO L198 CegarLoopUtils]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2021-05-02 12:33:31,627 INFO L198 CegarLoopUtils]: For program point L19(line 19) no Hoare annotation was computed. [2021-05-02 12:33:31,627 INFO L198 CegarLoopUtils]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-05-02 12:33:31,627 INFO L198 CegarLoopUtils]: For program point L18(lines 18 20) no Hoare annotation was computed. [2021-05-02 12:33:31,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.05 12:33:31 BoogieIcfgContainer [2021-05-02 12:33:31,644 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-02 12:33:31,645 INFO L168 Benchmark]: Toolchain (without parser) took 11273.77 ms. Allocated memory was 179.3 MB in the beginning and 312.5 MB in the end (delta: 133.2 MB). Free memory was 143.2 MB in the beginning and 290.6 MB in the end (delta: -147.4 MB). Peak memory consumption was 165.5 MB. Max. memory is 8.0 GB. [2021-05-02 12:33:31,645 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 179.3 MB. Free memory is still 159.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-02 12:33:31,645 INFO L168 Benchmark]: CACSL2BoogieTranslator took 253.82 ms. Allocated memory is still 179.3 MB. Free memory was 143.0 MB in the beginning and 162.7 MB in the end (delta: -19.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 8.0 GB. [2021-05-02 12:33:31,645 INFO L168 Benchmark]: Boogie Preprocessor took 44.74 ms. Allocated memory is still 179.3 MB. Free memory was 162.7 MB in the beginning and 161.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-05-02 12:33:31,645 INFO L168 Benchmark]: RCFGBuilder took 404.52 ms. Allocated memory is still 179.3 MB. Free memory was 161.3 MB in the beginning and 144.9 MB in the end (delta: 16.4 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. [2021-05-02 12:33:31,646 INFO L168 Benchmark]: TraceAbstraction took 10563.28 ms. Allocated memory was 179.3 MB in the beginning and 312.5 MB in the end (delta: 133.2 MB). Free memory was 144.5 MB in the beginning and 290.6 MB in the end (delta: -146.1 MB). Peak memory consumption was 166.2 MB. Max. memory is 8.0 GB. [2021-05-02 12:33:31,646 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.15 ms. Allocated memory is still 179.3 MB. Free memory is still 159.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 253.82 ms. Allocated memory is still 179.3 MB. Free memory was 143.0 MB in the beginning and 162.7 MB in the end (delta: -19.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 44.74 ms. Allocated memory is still 179.3 MB. Free memory was 162.7 MB in the beginning and 161.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 404.52 ms. Allocated memory is still 179.3 MB. Free memory was 161.3 MB in the beginning and 144.9 MB in the end (delta: 16.4 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 10563.28 ms. Allocated memory was 179.3 MB in the beginning and 312.5 MB in the end (delta: 133.2 MB). Free memory was 144.5 MB in the beginning and 290.6 MB in the end (delta: -146.1 MB). Peak memory consumption was 166.2 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, 43 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 9383.5ms, OverallIterations: 10, TraceHistogramMax: 12, EmptinessCheckTime: 29.0ms, AutomataDifference: 4609.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 1106.2ms, InitialAbstractionConstructionTime: 12.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 296 SDtfs, 607 SDslu, 709 SDs, 0 SdLazy, 2119 SolverSat, 713 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1846.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 547 GetRequests, 375 SyntacticMatches, 7 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 796 ImplicationChecksByTransitivity, 2863.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=8, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 182.4ms AutomataMinimizationTime, 10 MinimizatonAttempts, 30 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 15 LocationsWithAnnotation, 54 PreInvPairs, 92 NumberOfFragments, 399 HoareAnnotationTreeSize, 54 FomulaSimplifications, 1670 FormulaSimplificationTreeSizeReduction, 151.2ms HoareSimplificationTime, 15 FomulaSimplificationsInter, 2654 FormulaSimplificationTreeSizeReductionInter, 944.2ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 74.1ms SsaConstructionTime, 281.4ms SatisfiabilityAnalysisTime, 3024.5ms InterpolantComputationTime, 711 NumberOfCodeBlocks, 711 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 697 ConstructedInterpolants, 0 QuantifiedInterpolants, 2614 SizeOfPredicates, 15 NumberOfNonLiveVariables, 740 ConjunctsInSsa, 77 ConjunctsInUnsatCore, 14 InterpolantComputations, 6 PerfectInterpolantSequences, 1322/1508 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: ((((in == 0 && bufferlen == buflim + 2) && buf == 0) && 2 <= bufferlen) && bufferlen + 1 <= inlen) || (((((in + bufferlen + 1 <= buf + inlen && 0 <= buf) && bufferlen == buflim + 2) && buf + 2 <= bufferlen) && 1 <= in) && bufferlen + 1 <= inlen) RESULT: Ultimate proved your program to be correct! Received shutdown request...