/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-06 09:42:28,590 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-06 09:42:28,592 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-06 09:42:28,625 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-06 09:42:28,625 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-06 09:42:28,626 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-06 09:42:28,628 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-06 09:42:28,630 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-06 09:42:28,631 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-06 09:42:28,634 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-06 09:42:28,634 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-06 09:42:28,635 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-06 09:42:28,635 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-06 09:42:28,637 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-06 09:42:28,638 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-06 09:42:28,640 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-06 09:42:28,640 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-06 09:42:28,640 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-06 09:42:28,642 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-06 09:42:28,646 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-06 09:42:28,647 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-06 09:42:28,648 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-06 09:42:28,648 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-06 09:42:28,649 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-06 09:42:28,650 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-06 09:42:28,654 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-06 09:42:28,654 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-06 09:42:28,654 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-06 09:42:28,655 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-06 09:42:28,655 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-06 09:42:28,656 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-06 09:42:28,656 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-06 09:42:28,657 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-06 09:42:28,658 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-06 09:42:28,658 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-06 09:42:28,659 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-06 09:42:28,659 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-06 09:42:28,659 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-06 09:42:28,659 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-06 09:42:28,659 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-06 09:42:28,660 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-06 09:42:28,661 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-06 09:42:28,661 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-06 09:42:28,679 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-06 09:42:28,679 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-06 09:42:28,679 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-06 09:42:28,680 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-06 09:42:28,680 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-06 09:42:28,680 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-06 09:42:28,680 INFO L138 SettingsManager]: * Use SBE=true [2022-04-06 09:42:28,681 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-06 09:42:28,681 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-06 09:42:28,681 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-06 09:42:28,681 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-06 09:42:28,681 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-06 09:42:28,682 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-06 09:42:28,682 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-06 09:42:28,682 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-06 09:42:28,682 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-06 09:42:28,682 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-06 09:42:28,682 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-06 09:42:28,682 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-06 09:42:28,682 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-06 09:42:28,682 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-06 09:42:28,682 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-06 09:42:28,683 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-06 09:42:28,683 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-06 09:42:28,683 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-06 09:42:28,683 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-06 09:42:28,683 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-06 09:42:28,683 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-06 09:42:28,685 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-06 09:42:28,685 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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; [2022-04-06 09:42:28,852 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-06 09:42:28,880 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-06 09:42:28,881 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-06 09:42:28,882 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-06 09:42:28,883 INFO L275 PluginConnector]: CDTParser initialized [2022-04-06 09:42:28,884 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 [2022-04-06 09:42:28,935 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5df7ad155/34cf92ca569645aeab240ebbd047f07a/FLAGc0382a325 [2022-04-06 09:42:29,354 INFO L306 CDTParser]: Found 1 translation units. [2022-04-06 09:42:29,354 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2022-04-06 09:42:29,358 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5df7ad155/34cf92ca569645aeab240ebbd047f07a/FLAGc0382a325 [2022-04-06 09:42:29,374 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5df7ad155/34cf92ca569645aeab240ebbd047f07a [2022-04-06 09:42:29,376 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-06 09:42:29,377 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-06 09:42:29,378 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-06 09:42:29,378 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-06 09:42:29,380 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-06 09:42:29,380 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 09:42:29" (1/1) ... [2022-04-06 09:42:29,381 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2879d360 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:42:29, skipping insertion in model container [2022-04-06 09:42:29,381 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 09:42:29" (1/1) ... [2022-04-06 09:42:29,385 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-06 09:42:29,394 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-06 09:42:29,497 WARN L230 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] [2022-04-06 09:42:29,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-06 09:42:29,520 INFO L203 MainTranslator]: Completed pre-run [2022-04-06 09:42:29,527 WARN L230 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] [2022-04-06 09:42:29,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-06 09:42:29,538 INFO L208 MainTranslator]: Completed translation [2022-04-06 09:42:29,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:42:29 WrapperNode [2022-04-06 09:42:29,539 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-06 09:42:29,540 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-06 09:42:29,540 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-06 09:42:29,540 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-06 09:42:29,547 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:42:29" (1/1) ... [2022-04-06 09:42:29,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:42:29" (1/1) ... [2022-04-06 09:42:29,551 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:42:29" (1/1) ... [2022-04-06 09:42:29,551 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:42:29" (1/1) ... [2022-04-06 09:42:29,554 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:42:29" (1/1) ... [2022-04-06 09:42:29,556 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:42:29" (1/1) ... [2022-04-06 09:42:29,557 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:42:29" (1/1) ... [2022-04-06 09:42:29,558 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-06 09:42:29,559 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-06 09:42:29,559 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-06 09:42:29,559 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-06 09:42:29,559 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:42:29" (1/1) ... [2022-04-06 09:42:29,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-06 09:42:29,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 09:42:29,592 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-06 09:42:29,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-06 09:42:29,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-06 09:42:29,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-06 09:42:29,618 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-06 09:42:29,618 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-06 09:42:29,618 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-06 09:42:29,618 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-06 09:42:29,618 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-06 09:42:29,618 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-06 09:42:29,618 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-06 09:42:29,618 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-06 09:42:29,618 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-06 09:42:29,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-06 09:42:29,619 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-06 09:42:29,619 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-06 09:42:29,619 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-06 09:42:29,619 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-06 09:42:29,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-06 09:42:29,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-06 09:42:29,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-06 09:42:29,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-06 09:42:29,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-06 09:42:29,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-06 09:42:29,661 INFO L234 CfgBuilder]: Building ICFG [2022-04-06 09:42:29,663 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-06 09:42:29,765 INFO L275 CfgBuilder]: Performing block encoding [2022-04-06 09:42:29,769 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-06 09:42:29,769 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-06 09:42:29,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 09:42:29 BoogieIcfgContainer [2022-04-06 09:42:29,770 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-06 09:42:29,771 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-06 09:42:29,771 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-06 09:42:29,772 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-06 09:42:29,774 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 09:42:29" (1/1) ... [2022-04-06 09:42:29,787 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-06 09:42:29,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 06.04 09:42:29 BasicIcfg [2022-04-06 09:42:29,808 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-06 09:42:29,809 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-06 09:42:29,809 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-06 09:42:29,811 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-06 09:42:29,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.04 09:42:29" (1/4) ... [2022-04-06 09:42:29,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56ce8269 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 09:42:29, skipping insertion in model container [2022-04-06 09:42:29,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:42:29" (2/4) ... [2022-04-06 09:42:29,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56ce8269 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 09:42:29, skipping insertion in model container [2022-04-06 09:42:29,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 09:42:29" (3/4) ... [2022-04-06 09:42:29,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56ce8269 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 09:42:29, skipping insertion in model container [2022-04-06 09:42:29,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 06.04 09:42:29" (4/4) ... [2022-04-06 09:42:29,817 INFO L111 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.iqvasr [2022-04-06 09:42:29,820 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-06 09:42:29,821 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-06 09:42:29,854 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-06 09:42:29,862 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-06 09:42:29,863 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-06 09:42:29,874 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) [2022-04-06 09:42:29,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-06 09:42:29,878 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:42:29,878 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:42:29,878 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 09:42:29,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:42:29,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1933732557, now seen corresponding path program 1 times [2022-04-06 09:42:29,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:42:29,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504976389] [2022-04-06 09:42:29,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:42:29,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:42:29,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:29,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:42:29,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:30,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 09:42:30,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:42:30,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504976389] [2022-04-06 09:42:30,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504976389] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:42:30,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:42:30,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-06 09:42:30,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282319223] [2022-04-06 09:42:30,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:42:30,008 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-06 09:42:30,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:42:30,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-06 09:42:30,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-06 09:42:30,026 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) [2022-04-06 09:42:30,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:42:30,073 INFO L93 Difference]: Finished difference Result 62 states and 93 transitions. [2022-04-06 09:42:30,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-06 09:42:30,075 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 [2022-04-06 09:42:30,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:42:30,080 INFO L225 Difference]: With dead ends: 62 [2022-04-06 09:42:30,080 INFO L226 Difference]: Without dead ends: 30 [2022-04-06 09:42:30,082 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-06 09:42:30,086 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 24 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 09:42:30,087 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 42 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 09:42:30,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-06 09:42:30,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-06 09:42:30,115 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) [2022-04-06 09:42:30,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2022-04-06 09:42:30,117 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 15 [2022-04-06 09:42:30,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:42:30,117 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2022-04-06 09:42:30,117 INFO L479 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) [2022-04-06 09:42:30,117 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-04-06 09:42:30,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-06 09:42:30,118 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:42:30,118 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:42:30,118 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-06 09:42:30,119 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 09:42:30,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:42:30,119 INFO L85 PathProgramCache]: Analyzing trace with hash 213262551, now seen corresponding path program 1 times [2022-04-06 09:42:30,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:42:30,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512716428] [2022-04-06 09:42:30,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:42:30,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:42:30,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:30,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:42:30,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:30,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 09:42:30,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:42:30,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512716428] [2022-04-06 09:42:30,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512716428] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:42:30,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:42:30,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 09:42:30,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563360110] [2022-04-06 09:42:30,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:42:30,205 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 09:42:30,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:42:30,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 09:42:30,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-06 09:42:30,206 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) [2022-04-06 09:42:30,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:42:30,305 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-06 09:42:30,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-06 09:42:30,305 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 [2022-04-06 09:42:30,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:42:30,306 INFO L225 Difference]: With dead ends: 36 [2022-04-06 09:42:30,306 INFO L226 Difference]: Without dead ends: 34 [2022-04-06 09:42:30,307 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-06 09:42:30,308 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 29 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 09:42:30,308 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 42 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 09:42:30,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-06 09:42:30,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-06 09:42:30,314 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) [2022-04-06 09:42:30,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2022-04-06 09:42:30,315 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 16 [2022-04-06 09:42:30,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:42:30,315 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-04-06 09:42:30,315 INFO L479 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) [2022-04-06 09:42:30,316 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-06 09:42:30,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-06 09:42:30,316 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:42:30,316 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:42:30,316 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-06 09:42:30,317 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 09:42:30,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:42:30,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1077134525, now seen corresponding path program 1 times [2022-04-06 09:42:30,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:42:30,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990963944] [2022-04-06 09:42:30,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:42:30,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:42:30,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:30,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:42:30,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:30,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-06 09:42:30,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:30,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 09:42:30,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:42:30,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990963944] [2022-04-06 09:42:30,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990963944] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:42:30,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:42:30,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-06 09:42:30,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676093354] [2022-04-06 09:42:30,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:42:30,385 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-06 09:42:30,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:42:30,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-06 09:42:30,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-06 09:42:30,386 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) [2022-04-06 09:42:30,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:42:30,561 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2022-04-06 09:42:30,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-06 09:42:30,561 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 [2022-04-06 09:42:30,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:42:30,562 INFO L225 Difference]: With dead ends: 49 [2022-04-06 09:42:30,562 INFO L226 Difference]: Without dead ends: 47 [2022-04-06 09:42:30,562 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-06 09:42:30,563 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 44 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 09:42:30,563 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 48 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 09:42:30,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-06 09:42:30,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2022-04-06 09:42:30,583 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) [2022-04-06 09:42:30,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2022-04-06 09:42:30,584 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 21 [2022-04-06 09:42:30,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:42:30,585 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2022-04-06 09:42:30,585 INFO L479 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) [2022-04-06 09:42:30,585 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2022-04-06 09:42:30,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-06 09:42:30,586 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:42:30,586 INFO L499 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] [2022-04-06 09:42:30,586 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-06 09:42:30,586 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 09:42:30,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:42:30,587 INFO L85 PathProgramCache]: Analyzing trace with hash -2113482804, now seen corresponding path program 1 times [2022-04-06 09:42:30,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:42:30,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920083] [2022-04-06 09:42:30,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:42:30,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:42:30,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:30,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:42:30,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:30,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-06 09:42:30,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:30,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-06 09:42:30,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:30,643 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-06 09:42:30,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:42:30,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920083] [2022-04-06 09:42:30,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920083] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:42:30,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:42:30,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-06 09:42:30,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233584785] [2022-04-06 09:42:30,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:42:30,644 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-06 09:42:30,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:42:30,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-06 09:42:30,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-06 09:42:30,654 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) [2022-04-06 09:42:30,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:42:30,788 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2022-04-06 09:42:30,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-06 09:42:30,788 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 [2022-04-06 09:42:30,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:42:30,789 INFO L225 Difference]: With dead ends: 56 [2022-04-06 09:42:30,789 INFO L226 Difference]: Without dead ends: 54 [2022-04-06 09:42:30,789 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-06 09:42:30,790 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 38 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 09:42:30,791 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 66 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 09:42:30,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-06 09:42:30,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2022-04-06 09:42:30,796 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) [2022-04-06 09:42:30,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2022-04-06 09:42:30,797 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 29 [2022-04-06 09:42:30,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:42:30,797 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2022-04-06 09:42:30,797 INFO L479 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) [2022-04-06 09:42:30,797 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2022-04-06 09:42:30,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-06 09:42:30,798 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:42:30,798 INFO L499 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] [2022-04-06 09:42:30,798 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-06 09:42:30,798 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 09:42:30,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:42:30,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1308577884, now seen corresponding path program 1 times [2022-04-06 09:42:30,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:42:30,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278991473] [2022-04-06 09:42:30,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:42:30,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:42:30,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:30,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:42:30,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:30,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-06 09:42:30,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:30,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-06 09:42:30,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:30,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-06 09:42:30,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:30,881 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-06 09:42:30,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:42:30,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278991473] [2022-04-06 09:42:30,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278991473] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:42:30,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:42:30,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-06 09:42:30,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819130172] [2022-04-06 09:42:30,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:42:30,883 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-06 09:42:30,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:42:30,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-06 09:42:30,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-04-06 09:42:30,883 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) [2022-04-06 09:42:31,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:42:31,076 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2022-04-06 09:42:31,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-06 09:42:31,077 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 [2022-04-06 09:42:31,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:42:31,079 INFO L225 Difference]: With dead ends: 75 [2022-04-06 09:42:31,079 INFO L226 Difference]: Without dead ends: 68 [2022-04-06 09:42:31,080 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-04-06 09:42:31,085 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 72 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 09:42:31,085 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 45 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 09:42:31,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-06 09:42:31,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2022-04-06 09:42:31,100 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) [2022-04-06 09:42:31,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2022-04-06 09:42:31,103 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 79 transitions. Word has length 32 [2022-04-06 09:42:31,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:42:31,103 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 79 transitions. [2022-04-06 09:42:31,104 INFO L479 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) [2022-04-06 09:42:31,104 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2022-04-06 09:42:31,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-06 09:42:31,105 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:42:31,105 INFO L499 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] [2022-04-06 09:42:31,105 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-06 09:42:31,106 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 09:42:31,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:42:31,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1447644068, now seen corresponding path program 1 times [2022-04-06 09:42:31,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:42:31,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371424738] [2022-04-06 09:42:31,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:42:31,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:42:31,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:31,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:42:31,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:31,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-06 09:42:31,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:31,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-06 09:42:31,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:31,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-06 09:42:31,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:31,184 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-06 09:42:31,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:42:31,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371424738] [2022-04-06 09:42:31,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371424738] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:42:31,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:42:31,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-06 09:42:31,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968601803] [2022-04-06 09:42:31,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:42:31,185 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-06 09:42:31,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:42:31,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-06 09:42:31,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-06 09:42:31,185 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) [2022-04-06 09:42:31,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:42:31,380 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2022-04-06 09:42:31,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-06 09:42:31,380 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 [2022-04-06 09:42:31,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:42:31,381 INFO L225 Difference]: With dead ends: 77 [2022-04-06 09:42:31,381 INFO L226 Difference]: Without dead ends: 75 [2022-04-06 09:42:31,381 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-04-06 09:42:31,382 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 85 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 09:42:31,382 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 61 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 09:42:31,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-06 09:42:31,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2022-04-06 09:42:31,388 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) [2022-04-06 09:42:31,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2022-04-06 09:42:31,389 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 34 [2022-04-06 09:42:31,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:42:31,389 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2022-04-06 09:42:31,389 INFO L479 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) [2022-04-06 09:42:31,389 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2022-04-06 09:42:31,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-06 09:42:31,390 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:42:31,390 INFO L499 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] [2022-04-06 09:42:31,391 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-06 09:42:31,391 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 09:42:31,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:42:31,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1060067119, now seen corresponding path program 1 times [2022-04-06 09:42:31,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:42:31,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031098767] [2022-04-06 09:42:31,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:42:31,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:42:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:31,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:42:31,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:31,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-06 09:42:31,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:31,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-06 09:42:31,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:31,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-06 09:42:31,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:31,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-06 09:42:31,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:31,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-06 09:42:31,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:31,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-06 09:42:31,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:31,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-06 09:42:31,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:31,508 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-06 09:42:31,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:42:31,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031098767] [2022-04-06 09:42:31,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031098767] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 09:42:31,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394626693] [2022-04-06 09:42:31,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:42:31,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 09:42:31,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 09:42:31,510 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 09:42:31,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-06 09:42:31,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:31,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-06 09:42:31,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 09:42:31,802 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-06 09:42:31,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 09:42:31,930 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-06 09:42:31,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394626693] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 09:42:31,930 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 09:42:31,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-06 09:42:31,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819566442] [2022-04-06 09:42:31,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-06 09:42:31,931 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-06 09:42:31,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:42:31,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-06 09:42:31,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2022-04-06 09:42:31,932 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand has 18 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 8 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) [2022-04-06 09:42:32,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:42:32,422 INFO L93 Difference]: Finished difference Result 115 states and 150 transitions. [2022-04-06 09:42:32,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-06 09:42:32,423 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 8 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) Word has length 57 [2022-04-06 09:42:32,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:42:32,424 INFO L225 Difference]: With dead ends: 115 [2022-04-06 09:42:32,424 INFO L226 Difference]: Without dead ends: 100 [2022-04-06 09:42:32,425 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 120 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=219, Invalid=773, Unknown=0, NotChecked=0, Total=992 [2022-04-06 09:42:32,425 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 97 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-06 09:42:32,426 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 75 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-06 09:42:32,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-06 09:42:32,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 92. [2022-04-06 09:42:32,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 56 states have (on average 1.0892857142857142) internal successors, (61), 59 states have internal predecessors, (61), 26 states have call successors, (26), 10 states have call predecessors, (26), 9 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-06 09:42:32,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 111 transitions. [2022-04-06 09:42:32,434 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 111 transitions. Word has length 57 [2022-04-06 09:42:32,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:42:32,435 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 111 transitions. [2022-04-06 09:42:32,435 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 8 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) [2022-04-06 09:42:32,435 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 111 transitions. [2022-04-06 09:42:32,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-06 09:42:32,435 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:42:32,436 INFO L499 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] [2022-04-06 09:42:32,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-06 09:42:32,648 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 09:42:32,649 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 09:42:32,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:42:32,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1512463065, now seen corresponding path program 1 times [2022-04-06 09:42:32,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:42:32,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280608944] [2022-04-06 09:42:32,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:42:32,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:42:32,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:32,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:42:32,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:32,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-06 09:42:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:32,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-06 09:42:32,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:32,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-06 09:42:32,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:32,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-06 09:42:32,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:32,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-06 09:42:32,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:32,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-06 09:42:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:32,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-06 09:42:32,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:32,781 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-06 09:42:32,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:42:32,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280608944] [2022-04-06 09:42:32,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280608944] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 09:42:32,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832996787] [2022-04-06 09:42:32,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:42:32,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 09:42:32,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 09:42:32,782 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 09:42:32,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-06 09:42:32,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:32,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-06 09:42:32,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 09:42:33,022 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-06 09:42:33,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 09:42:33,120 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-06 09:42:33,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832996787] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 09:42:33,120 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 09:42:33,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 16 [2022-04-06 09:42:33,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919764812] [2022-04-06 09:42:33,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-06 09:42:33,121 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-06 09:42:33,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:42:33,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-06 09:42:33,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-04-06 09:42:33,121 INFO L87 Difference]: Start difference. First operand 92 states and 111 transitions. Second operand has 16 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 8 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) [2022-04-06 09:42:33,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:42:33,378 INFO L93 Difference]: Finished difference Result 98 states and 116 transitions. [2022-04-06 09:42:33,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-06 09:42:33,379 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 8 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) Word has length 59 [2022-04-06 09:42:33,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:42:33,381 INFO L225 Difference]: With dead ends: 98 [2022-04-06 09:42:33,381 INFO L226 Difference]: Without dead ends: 96 [2022-04-06 09:42:33,381 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 125 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2022-04-06 09:42:33,381 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 103 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-06 09:42:33,382 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 76 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-06 09:42:33,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-06 09:42:33,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-04-06 09:42:33,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 62 states have internal predecessors, (64), 26 states have call successors, (26), 11 states have call predecessors, (26), 10 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-06 09:42:33,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 114 transitions. [2022-04-06 09:42:33,390 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 114 transitions. Word has length 59 [2022-04-06 09:42:33,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:42:33,390 INFO L478 AbstractCegarLoop]: Abstraction has 96 states and 114 transitions. [2022-04-06 09:42:33,390 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 8 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) [2022-04-06 09:42:33,390 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 114 transitions. [2022-04-06 09:42:33,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-06 09:42:33,391 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:42:33,391 INFO L499 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] [2022-04-06 09:42:33,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-06 09:42:33,606 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-04-06 09:42:33,607 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 09:42:33,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:42:33,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1765383868, now seen corresponding path program 2 times [2022-04-06 09:42:33,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:42:33,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966641011] [2022-04-06 09:42:33,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:42:33,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:42:33,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:33,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:42:33,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:33,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-06 09:42:33,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:33,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-06 09:42:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:33,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-06 09:42:33,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:33,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-06 09:42:33,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:33,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-06 09:42:33,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:33,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-06 09:42:33,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:33,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-06 09:42:33,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:33,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-04-06 09:42:33,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:33,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-04-06 09:42:33,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:33,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-04-06 09:42:33,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:33,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-04-06 09:42:33,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:33,792 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 48 proven. 31 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-04-06 09:42:33,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:42:33,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966641011] [2022-04-06 09:42:33,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966641011] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 09:42:33,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224530761] [2022-04-06 09:42:33,792 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 09:42:33,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 09:42:33,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 09:42:33,793 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 09:42:33,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-06 09:42:33,864 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-06 09:42:33,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 09:42:33,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-06 09:42:33,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 09:42:34,187 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-06 09:42:34,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 09:42:34,411 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-06 09:42:34,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224530761] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 09:42:34,411 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 09:42:34,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 27 [2022-04-06 09:42:34,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119305926] [2022-04-06 09:42:34,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-06 09:42:34,412 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-06 09:42:34,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:42:34,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-06 09:42:34,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2022-04-06 09:42:34,413 INFO L87 Difference]: Start difference. First operand 96 states and 114 transitions. Second operand has 27 states, 25 states have (on average 2.72) internal successors, (68), 25 states have internal predecessors, (68), 12 states have call successors, (38), 4 states have call predecessors, (38), 2 states have return successors, (33), 12 states have call predecessors, (33), 12 states have call successors, (33) [2022-04-06 09:42:35,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:42:35,192 INFO L93 Difference]: Finished difference Result 113 states and 135 transitions. [2022-04-06 09:42:35,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-06 09:42:35,193 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 2.72) internal successors, (68), 25 states have internal predecessors, (68), 12 states have call successors, (38), 4 states have call predecessors, (38), 2 states have return successors, (33), 12 states have call predecessors, (33), 12 states have call successors, (33) Word has length 84 [2022-04-06 09:42:35,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:42:35,194 INFO L225 Difference]: With dead ends: 113 [2022-04-06 09:42:35,194 INFO L226 Difference]: Without dead ends: 111 [2022-04-06 09:42:35,196 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 177 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=479, Invalid=1971, Unknown=0, NotChecked=0, Total=2450 [2022-04-06 09:42:35,197 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 106 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-06 09:42:35,197 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 92 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-06 09:42:35,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-06 09:42:35,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2022-04-06 09:42:35,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 62 states have (on average 1.0806451612903225) internal successors, (67), 65 states have internal predecessors, (67), 26 states have call successors, (26), 12 states have call predecessors, (26), 11 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-06 09:42:35,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 117 transitions. [2022-04-06 09:42:35,206 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 117 transitions. Word has length 84 [2022-04-06 09:42:35,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:42:35,207 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 117 transitions. [2022-04-06 09:42:35,207 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 2.72) internal successors, (68), 25 states have internal predecessors, (68), 12 states have call successors, (38), 4 states have call predecessors, (38), 2 states have return successors, (33), 12 states have call predecessors, (33), 12 states have call successors, (33) [2022-04-06 09:42:35,207 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 117 transitions. [2022-04-06 09:42:35,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-06 09:42:35,208 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:42:35,208 INFO L499 BasicCegarLoop]: trace histogram [16, 15, 15, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:42:35,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-06 09:42:35,435 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 09:42:35,435 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 09:42:35,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:42:35,436 INFO L85 PathProgramCache]: Analyzing trace with hash 446349519, now seen corresponding path program 2 times [2022-04-06 09:42:35,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:42:35,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873106493] [2022-04-06 09:42:35,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:42:35,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:42:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:35,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:42:35,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:35,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-06 09:42:35,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:35,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-06 09:42:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:35,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-06 09:42:35,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:35,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-06 09:42:35,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:35,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-06 09:42:35,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:35,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-06 09:42:35,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:35,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-06 09:42:35,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:35,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-04-06 09:42:35,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:35,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-04-06 09:42:35,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:35,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-04-06 09:42:35,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:35,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-04-06 09:42:35,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:35,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-04-06 09:42:35,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:35,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-04-06 09:42:35,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:35,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-04-06 09:42:35,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:35,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-04-06 09:42:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:42:35,618 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 68 proven. 31 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2022-04-06 09:42:35,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:42:35,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873106493] [2022-04-06 09:42:35,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873106493] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 09:42:35,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60887079] [2022-04-06 09:42:35,618 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 09:42:35,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 09:42:35,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 09:42:35,619 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 09:42:35,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-06 09:42:35,663 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-06 09:42:35,663 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 09:42:35,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-06 09:42:35,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 09:42:35,893 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 68 proven. 22 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2022-04-06 09:42:35,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 09:42:36,121 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 68 proven. 22 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2022-04-06 09:42:36,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60887079] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 09:42:36,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 09:42:36,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 15 [2022-04-06 09:42:36,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058130790] [2022-04-06 09:42:36,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-06 09:42:36,122 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-06 09:42:36,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:42:36,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-06 09:42:36,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-04-06 09:42:36,122 INFO L87 Difference]: Start difference. First operand 100 states and 117 transitions. Second operand has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 12 states have internal predecessors, (37), 6 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-06 09:42:36,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:42:36,411 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2022-04-06 09:42:36,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-06 09:42:36,412 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 12 states have internal predecessors, (37), 6 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) Word has length 107 [2022-04-06 09:42:36,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:42:36,412 INFO L225 Difference]: With dead ends: 100 [2022-04-06 09:42:36,412 INFO L226 Difference]: Without dead ends: 0 [2022-04-06 09:42:36,413 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 240 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2022-04-06 09:42:36,413 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 43 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 09:42:36,413 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 78 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 09:42:36,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-06 09:42:36,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-06 09:42:36,414 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) [2022-04-06 09:42:36,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-06 09:42:36,414 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 107 [2022-04-06 09:42:36,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:42:36,414 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-06 09:42:36,414 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 12 states have internal predecessors, (37), 6 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-06 09:42:36,414 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-06 09:42:36,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-06 09:42:36,416 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-06 09:42:36,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-06 09:42:36,632 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 09:42:36,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-06 09:42:37,123 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-06 09:42:37,123 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-06 09:42:37,123 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-06 09:42:37,123 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-06 09:42:37,123 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-06 09:42:37,123 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-06 09:42:37,123 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-06 09:42:37,123 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 24 56) the Hoare annotation is: true [2022-04-06 09:42:37,123 INFO L882 garLoopResultBuilder]: For program point L31(line 31) no Hoare annotation was computed. [2022-04-06 09:42:37,124 INFO L882 garLoopResultBuilder]: For program point L31-1(lines 25 56) no Hoare annotation was computed. [2022-04-06 09:42:37,124 INFO L885 garLoopResultBuilder]: At program point L55(lines 25 56) the Hoare annotation is: true [2022-04-06 09:42:37,124 INFO L882 garLoopResultBuilder]: For program point L32(lines 25 56) no Hoare annotation was computed. [2022-04-06 09:42:37,124 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 24 56) no Hoare annotation was computed. [2022-04-06 09:42:37,124 INFO L882 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2022-04-06 09:42:37,124 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 24 56) no Hoare annotation was computed. [2022-04-06 09:42:37,124 INFO L878 garLoopResultBuilder]: At program point L47(lines 37 48) the Hoare annotation is: (let ((.cse1 (< main_~bufferlen~0 main_~inlen~0)) (.cse0 (+ 2 main_~buflim~0))) (or (and (= .cse0 main_~bufferlen~0) (= main_~in~0 0) (<= 2 main_~bufferlen~0) (= main_~buf~0 0) .cse1) (and (<= (+ main_~bufferlen~0 main_~in~0 1) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 1 main_~in~0) (<= 0 main_~buf~0) (<= main_~bufferlen~0 .cse0) .cse1 (<= .cse0 main_~bufferlen~0)))) [2022-04-06 09:42:37,124 INFO L878 garLoopResultBuilder]: At program point L37-3(lines 37 48) the Hoare annotation is: (let ((.cse0 (<= (+ main_~buf~0 2) main_~bufferlen~0)) (.cse1 (<= 1 main_~in~0)) (.cse2 (<= 0 main_~buf~0))) (or (and (= main_~in~0 0) (<= 2 main_~bufferlen~0) (= main_~buf~0 0)) (and .cse0 .cse1 .cse2 (<= main_~buf~0 2) (<= 3 main_~inlen~0)) (let ((.cse3 (+ 2 main_~buflim~0))) (and (<= (+ main_~bufferlen~0 main_~in~0 1) (+ main_~buf~0 main_~inlen~0)) .cse0 .cse1 .cse2 (<= main_~bufferlen~0 .cse3) (< main_~bufferlen~0 main_~inlen~0) (<= .cse3 main_~bufferlen~0))))) [2022-04-06 09:42:37,124 INFO L882 garLoopResultBuilder]: For program point L37-1(lines 37 48) no Hoare annotation was computed. [2022-04-06 09:42:37,124 INFO L878 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (let ((.cse0 (<= (+ main_~buf~0 2) main_~bufferlen~0)) (.cse1 (<= 1 main_~in~0)) (.cse2 (<= 0 main_~buf~0))) (or (and (= main_~in~0 0) (<= 2 main_~bufferlen~0) (= main_~buf~0 0)) (and .cse0 .cse1 .cse2 (<= main_~buf~0 2) (<= 3 main_~inlen~0)) (let ((.cse3 (+ 2 main_~buflim~0))) (and (<= (+ main_~bufferlen~0 main_~in~0 1) (+ main_~buf~0 main_~inlen~0)) .cse0 .cse1 .cse2 (<= main_~bufferlen~0 .cse3) (< main_~bufferlen~0 main_~inlen~0) (<= .cse3 main_~bufferlen~0))))) [2022-04-06 09:42:37,124 INFO L882 garLoopResultBuilder]: For program point L39(lines 39 40) no Hoare annotation was computed. [2022-04-06 09:42:37,124 INFO L882 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2022-04-06 09:42:37,124 INFO L878 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (let ((.cse0 (+ 2 main_~buflim~0)) (.cse1 (< main_~bufferlen~0 main_~inlen~0))) (or (and (<= (+ main_~bufferlen~0 main_~in~0 1) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 3) main_~bufferlen~0) (<= 1 main_~in~0) (<= 0 main_~buf~0) (<= main_~bufferlen~0 .cse0) .cse1 (<= .cse0 main_~bufferlen~0)) (and (= .cse0 main_~bufferlen~0) (= main_~in~0 0) (<= 3 main_~bufferlen~0) (= main_~buf~0 0) .cse1))) [2022-04-06 09:42:37,124 INFO L878 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (and (<= (+ main_~buf~0 1) main_~bufferlen~0) (let ((.cse0 (<= 2 main_~bufferlen~0)) (.cse1 (<= 0 main_~buf~0))) (or (and .cse0 (<= 1 main_~in~0) .cse1) (and (= main_~in~0 0) .cse0 .cse1)))) [2022-04-06 09:42:37,125 INFO L878 garLoopResultBuilder]: At program point L41-1(line 41) the Hoare annotation is: (let ((.cse0 (+ 2 main_~buflim~0)) (.cse1 (< main_~bufferlen~0 main_~inlen~0))) (or (and (<= (+ main_~bufferlen~0 main_~in~0 1) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 3) main_~bufferlen~0) (<= 1 main_~in~0) (<= 0 main_~buf~0) (<= main_~bufferlen~0 .cse0) .cse1 (<= .cse0 main_~bufferlen~0)) (and (= .cse0 main_~bufferlen~0) (= main_~in~0 0) (<= 3 main_~bufferlen~0) (= main_~buf~0 0) .cse1))) [2022-04-06 09:42:37,125 INFO L878 garLoopResultBuilder]: At program point L52-1(line 52) the Hoare annotation is: (and (<= (+ main_~buf~0 1) main_~bufferlen~0) (let ((.cse0 (<= 2 main_~bufferlen~0)) (.cse1 (<= 0 main_~buf~0))) (or (and .cse0 (<= 1 main_~in~0) .cse1) (and (= main_~in~0 0) .cse0 .cse1)))) [2022-04-06 09:42:37,125 INFO L882 garLoopResultBuilder]: For program point L42(line 42) no Hoare annotation was computed. [2022-04-06 09:42:37,125 INFO L882 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2022-04-06 09:42:37,125 INFO L878 garLoopResultBuilder]: At program point L46-1(line 46) the Hoare annotation is: (let ((.cse0 (+ 2 main_~buflim~0))) (and (<= (+ main_~bufferlen~0 main_~in~0 1) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 1 main_~in~0) (<= 0 main_~buf~0) (<= main_~bufferlen~0 .cse0) (< main_~bufferlen~0 main_~inlen~0) (<= .cse0 main_~bufferlen~0))) [2022-04-06 09:42:37,125 INFO L882 garLoopResultBuilder]: For program point L44(lines 44 45) no Hoare annotation was computed. [2022-04-06 09:42:37,125 INFO L878 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (let ((.cse0 (+ 2 main_~buflim~0))) (and (<= (+ main_~bufferlen~0 main_~in~0 1) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 1 main_~in~0) (<= 0 main_~buf~0) (<= main_~bufferlen~0 .cse0) (< main_~bufferlen~0 main_~inlen~0) (<= .cse0 main_~bufferlen~0))) [2022-04-06 09:42:37,125 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-06 09:42:37,125 INFO L882 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-04-06 09:42:37,125 INFO L882 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-04-06 09:42:37,125 INFO L882 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-04-06 09:42:37,125 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-04-06 09:42:37,125 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-04-06 09:42:37,127 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2022-04-06 09:42:37,128 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-06 09:42:37,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 09:42:37 BasicIcfg [2022-04-06 09:42:37,137 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-06 09:42:37,137 INFO L158 Benchmark]: Toolchain (without parser) took 7760.38ms. Allocated memory was 222.3MB in the beginning and 330.3MB in the end (delta: 108.0MB). Free memory was 167.2MB in the beginning and 261.7MB in the end (delta: -94.4MB). Peak memory consumption was 162.9MB. Max. memory is 8.0GB. [2022-04-06 09:42:37,137 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 222.3MB. Free memory is still 183.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-06 09:42:37,138 INFO L158 Benchmark]: CACSL2BoogieTranslator took 161.31ms. Allocated memory was 222.3MB in the beginning and 274.7MB in the end (delta: 52.4MB). Free memory was 167.0MB in the beginning and 247.5MB in the end (delta: -80.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-04-06 09:42:37,138 INFO L158 Benchmark]: Boogie Preprocessor took 18.15ms. Allocated memory is still 274.7MB. Free memory was 247.5MB in the beginning and 246.3MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-06 09:42:37,138 INFO L158 Benchmark]: RCFGBuilder took 211.78ms. Allocated memory is still 274.7MB. Free memory was 245.9MB in the beginning and 235.0MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-06 09:42:37,138 INFO L158 Benchmark]: IcfgTransformer took 36.65ms. Allocated memory is still 274.7MB. Free memory was 235.0MB in the beginning and 233.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-06 09:42:37,138 INFO L158 Benchmark]: TraceAbstraction took 7328.38ms. Allocated memory was 274.7MB in the beginning and 330.3MB in the end (delta: 55.6MB). Free memory was 232.9MB in the beginning and 261.7MB in the end (delta: -28.8MB). Peak memory consumption was 177.5MB. Max. memory is 8.0GB. [2022-04-06 09:42:37,139 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.08ms. Allocated memory is still 222.3MB. Free memory is still 183.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 161.31ms. Allocated memory was 222.3MB in the beginning and 274.7MB in the end (delta: 52.4MB). Free memory was 167.0MB in the beginning and 247.5MB in the end (delta: -80.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.15ms. Allocated memory is still 274.7MB. Free memory was 247.5MB in the beginning and 246.3MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 211.78ms. Allocated memory is still 274.7MB. Free memory was 245.9MB in the beginning and 235.0MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 36.65ms. Allocated memory is still 274.7MB. Free memory was 235.0MB in the beginning and 233.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 7328.38ms. Allocated memory was 274.7MB in the beginning and 330.3MB in the end (delta: 55.6MB). Free memory was 232.9MB in the beginning and 261.7MB in the end (delta: -28.8MB). Peak memory consumption was 177.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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 4 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.3s, OverallIterations: 10, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 649 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 641 mSDsluCounter, 625 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 326 mSDsCounter, 861 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2875 IncrementalHoareTripleChecker+Invalid, 3736 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 861 mSolverCounterUnsat, 299 mSDtfsCounter, 2875 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 893 GetRequests, 699 SyntacticMatches, 14 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1096 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=100occurred in iteration=9, InterpolantAutomatonStates: 114, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 33 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 60 PreInvPairs, 104 NumberOfFragments, 412 HoareAnnotationTreeSize, 60 FomulaSimplifications, 382 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 15 FomulaSimplificationsInter, 2197 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 761 NumberOfCodeBlocks, 761 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1050 ConstructedInterpolants, 0 QuantifiedInterpolants, 3625 SizeOfPredicates, 16 NumberOfNonLiveVariables, 688 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 2730/2923 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: ((((2 + buflim == bufferlen && in == 0) && 2 <= bufferlen) && buf == 0) && bufferlen < inlen) || ((((((bufferlen + in + 1 <= buf + inlen && buf + 2 <= bufferlen) && 1 <= in) && 0 <= buf) && bufferlen <= 2 + buflim) && bufferlen < inlen) && 2 + buflim <= bufferlen) RESULT: Ultimate proved your program to be correct! [2022-04-06 09:42:37,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...