/usr/bin/java -ea -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-zilu/benchmark18_conjunctive.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 01:34:11,919 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 01:34:11,921 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 01:34:11,964 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 01:34:11,965 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 01:34:11,966 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 01:34:11,968 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 01:34:11,970 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 01:34:11,972 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 01:34:11,976 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 01:34:11,977 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 01:34:11,978 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 01:34:11,978 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 01:34:11,980 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 01:34:11,981 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 01:34:11,984 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 01:34:11,984 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 01:34:11,985 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 01:34:11,987 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 01:34:11,991 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 01:34:11,993 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 01:34:11,994 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 01:34:11,994 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 01:34:11,995 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 01:34:11,996 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 01:34:12,002 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 01:34:12,002 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 01:34:12,003 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 01:34:12,003 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 01:34:12,004 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 01:34:12,005 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 01:34:12,005 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 01:34:12,007 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 01:34:12,007 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 01:34:12,008 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 01:34:12,008 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 01:34:12,009 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 01:34:12,009 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 01:34:12,009 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 01:34:12,009 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 01:34:12,010 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 01:34:12,011 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 01:34:12,012 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 01:34:12,039 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 01:34:12,039 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 01:34:12,040 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 01:34:12,040 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 01:34:12,041 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 01:34:12,041 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 01:34:12,041 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 01:34:12,042 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 01:34:12,042 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 01:34:12,042 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 01:34:12,043 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 01:34:12,043 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 01:34:12,043 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 01:34:12,043 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 01:34:12,043 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 01:34:12,043 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 01:34:12,043 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 01:34:12,044 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 01:34:12,044 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 01:34:12,044 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 01:34:12,044 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 01:34:12,044 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 01:34:12,044 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 01:34:12,044 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 01:34:12,045 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 01:34:12,045 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 01:34:12,045 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 01:34:12,045 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 01:34:12,046 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 01:34:12,046 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-15 01:34:12,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 01:34:12,254 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 01:34:12,256 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 01:34:12,257 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 01:34:12,257 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 01:34:12,258 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark18_conjunctive.i [2022-04-15 01:34:12,308 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c7260fbd/a29aeef0a4304ce993ea4d01da858028/FLAGae98a2eaf [2022-04-15 01:34:12,696 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 01:34:12,696 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark18_conjunctive.i [2022-04-15 01:34:12,701 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c7260fbd/a29aeef0a4304ce993ea4d01da858028/FLAGae98a2eaf [2022-04-15 01:34:12,710 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c7260fbd/a29aeef0a4304ce993ea4d01da858028 [2022-04-15 01:34:12,712 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 01:34:12,713 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 01:34:12,717 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 01:34:12,717 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 01:34:12,720 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 01:34:12,721 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:34:12" (1/1) ... [2022-04-15 01:34:12,722 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40f78080 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:34:12, skipping insertion in model container [2022-04-15 01:34:12,723 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:34:12" (1/1) ... [2022-04-15 01:34:12,728 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 01:34:12,739 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 01:34:12,892 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-zilu/benchmark18_conjunctive.i[873,886] [2022-04-15 01:34:12,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 01:34:12,921 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 01:34:12,931 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-zilu/benchmark18_conjunctive.i[873,886] [2022-04-15 01:34:12,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 01:34:12,944 INFO L208 MainTranslator]: Completed translation [2022-04-15 01:34:12,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:34:12 WrapperNode [2022-04-15 01:34:12,945 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 01:34:12,951 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 01:34:12,951 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 01:34:12,951 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 01:34:12,959 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:34:12" (1/1) ... [2022-04-15 01:34:12,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:34:12" (1/1) ... [2022-04-15 01:34:12,965 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:34:12" (1/1) ... [2022-04-15 01:34:12,965 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:34:12" (1/1) ... [2022-04-15 01:34:12,970 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:34:12" (1/1) ... [2022-04-15 01:34:12,973 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:34:12" (1/1) ... [2022-04-15 01:34:12,974 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:34:12" (1/1) ... [2022-04-15 01:34:12,977 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 01:34:12,978 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 01:34:12,978 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 01:34:12,978 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 01:34:12,979 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:34:12" (1/1) ... [2022-04-15 01:34:12,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 01:34:12,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:34:13,006 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-15 01:34:13,011 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-15 01:34:13,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 01:34:13,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 01:34:13,037 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 01:34:13,037 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 01:34:13,037 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 01:34:13,037 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 01:34:13,037 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 01:34:13,037 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 01:34:13,037 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 01:34:13,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 01:34:13,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 01:34:13,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-15 01:34:13,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 01:34:13,038 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 01:34:13,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 01:34:13,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 01:34:13,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 01:34:13,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 01:34:13,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 01:34:13,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 01:34:13,094 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 01:34:13,095 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 01:34:13,246 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 01:34:13,251 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 01:34:13,251 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 01:34:13,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:34:13 BoogieIcfgContainer [2022-04-15 01:34:13,253 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 01:34:13,254 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 01:34:13,254 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 01:34:13,255 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 01:34:13,257 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:34:13" (1/1) ... [2022-04-15 01:34:13,259 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 01:34:13,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 01:34:13 BasicIcfg [2022-04-15 01:34:13,279 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 01:34:13,281 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 01:34:13,281 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 01:34:13,283 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 01:34:13,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:34:12" (1/4) ... [2022-04-15 01:34:13,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@541c6fec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:34:13, skipping insertion in model container [2022-04-15 01:34:13,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:34:12" (2/4) ... [2022-04-15 01:34:13,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@541c6fec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:34:13, skipping insertion in model container [2022-04-15 01:34:13,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:34:13" (3/4) ... [2022-04-15 01:34:13,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@541c6fec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 01:34:13, skipping insertion in model container [2022-04-15 01:34:13,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 01:34:13" (4/4) ... [2022-04-15 01:34:13,285 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark18_conjunctive.iqvasr [2022-04-15 01:34:13,289 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 01:34:13,290 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 01:34:13,363 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 01:34:13,374 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-15 01:34:13,374 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 01:34:13,394 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 01:34:13,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 01:34:13,399 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:34:13,400 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:34:13,400 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:34:13,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:34:13,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1809217115, now seen corresponding path program 1 times [2022-04-15 01:34:13,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:34:13,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416267198] [2022-04-15 01:34:13,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:34:13,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:34:13,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:34:13,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:34:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:34:13,581 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {23#true} is VALID [2022-04-15 01:34:13,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-15 01:34:13,582 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-15 01:34:13,585 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:34:13,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {23#true} is VALID [2022-04-15 01:34:13,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-15 01:34:13,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-15 01:34:13,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-15 01:34:13,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} [52] mainENTRY-->L23: Formula: (and (= v_main_~n~0_3 |v_main_#t~nondet3_2|) (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~i~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (= v_main_~k~0_3 |v_main_#t~nondet2_2|) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_#t~nondet3, main_#t~nondet2, main_~i~0, main_~n~0] {23#true} is VALID [2022-04-15 01:34:13,587 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} [55] L23-->L24-2: Formula: (and (< 0 v_main_~n~0_6) (= v_main_~k~0_6 0) (= v_main_~i~0_7 0)) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_6, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-15 01:34:13,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {23#true} [57] L24-2-->L24-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-15 01:34:13,588 INFO L272 TraceCheckUtils]: 8: Hoare triple {24#false} [60] L24-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (and (= v_main_~k~0_7 v_main_~n~0_7) (= v_main_~i~0_8 v_main_~k~0_7)) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_7, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {24#false} is VALID [2022-04-15 01:34:13,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} [62] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {24#false} is VALID [2022-04-15 01:34:13,588 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} [63] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-15 01:34:13,589 INFO L290 TraceCheckUtils]: 11: Hoare triple {24#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-15 01:34:13,589 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-15 01:34:13,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:34:13,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416267198] [2022-04-15 01:34:13,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416267198] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 01:34:13,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 01:34:13,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 01:34:13,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057955723] [2022-04-15 01:34:13,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 01:34:13,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 12 [2022-04-15 01:34:13,598 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:34:13,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-15 01:34:13,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:34:13,625 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 01:34:13,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:34:13,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 01:34:13,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 01:34:13,646 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-15 01:34:13,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:34:13,736 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-15 01:34:13,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 01:34:13,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 12 [2022-04-15 01:34:13,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:34:13,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-15 01:34:13,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-04-15 01:34:13,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-15 01:34:13,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-04-15 01:34:13,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2022-04-15 01:34:13,787 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:34:13,793 INFO L225 Difference]: With dead ends: 32 [2022-04-15 01:34:13,794 INFO L226 Difference]: Without dead ends: 13 [2022-04-15 01:34:13,797 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-15 01:34:13,803 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 01:34:13,805 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 01:34:13,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-15 01:34:13,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-15 01:34:13,828 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:34:13,829 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:13,829 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:13,830 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:13,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:34:13,832 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-15 01:34:13,832 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 01:34:13,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:34:13,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:34:13,833 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-15 01:34:13,833 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-15 01:34:13,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:34:13,835 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-15 01:34:13,835 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 01:34:13,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:34:13,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:34:13,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:34:13,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:34:13,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:13,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-15 01:34:13,839 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 12 [2022-04-15 01:34:13,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:34:13,839 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-15 01:34:13,839 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-15 01:34:13,839 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 01:34:13,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 01:34:13,840 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:34:13,840 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:34:13,840 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 01:34:13,840 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:34:13,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:34:13,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1810140636, now seen corresponding path program 1 times [2022-04-15 01:34:13,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:34:13,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840568616] [2022-04-15 01:34:13,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:34:13,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:34:13,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:34:13,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:34:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:34:13,929 INFO L290 TraceCheckUtils]: 0: Hoare triple {124#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {118#true} is VALID [2022-04-15 01:34:13,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {118#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#true} is VALID [2022-04-15 01:34:13,930 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {118#true} {118#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#true} is VALID [2022-04-15 01:34:13,932 INFO L272 TraceCheckUtils]: 0: Hoare triple {118#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:34:13,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {124#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {118#true} is VALID [2022-04-15 01:34:13,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {118#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#true} is VALID [2022-04-15 01:34:13,933 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118#true} {118#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#true} is VALID [2022-04-15 01:34:13,934 INFO L272 TraceCheckUtils]: 4: Hoare triple {118#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#true} is VALID [2022-04-15 01:34:13,934 INFO L290 TraceCheckUtils]: 5: Hoare triple {118#true} [52] mainENTRY-->L23: Formula: (and (= v_main_~n~0_3 |v_main_#t~nondet3_2|) (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~i~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (= v_main_~k~0_3 |v_main_#t~nondet2_2|) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_#t~nondet3, main_#t~nondet2, main_~i~0, main_~n~0] {118#true} is VALID [2022-04-15 01:34:13,939 INFO L290 TraceCheckUtils]: 6: Hoare triple {118#true} [55] L23-->L24-2: Formula: (and (< 0 v_main_~n~0_6) (= v_main_~k~0_6 0) (= v_main_~i~0_7 0)) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_6, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[] {123#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2022-04-15 01:34:13,939 INFO L290 TraceCheckUtils]: 7: Hoare triple {123#(<= (+ main_~i~0 1) main_~n~0)} [58] L24-2-->L24-3: Formula: (not (< v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {119#false} is VALID [2022-04-15 01:34:13,940 INFO L272 TraceCheckUtils]: 8: Hoare triple {119#false} [60] L24-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (and (= v_main_~k~0_7 v_main_~n~0_7) (= v_main_~i~0_8 v_main_~k~0_7)) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_7, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {119#false} is VALID [2022-04-15 01:34:13,940 INFO L290 TraceCheckUtils]: 9: Hoare triple {119#false} [62] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {119#false} is VALID [2022-04-15 01:34:13,940 INFO L290 TraceCheckUtils]: 10: Hoare triple {119#false} [63] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {119#false} is VALID [2022-04-15 01:34:13,940 INFO L290 TraceCheckUtils]: 11: Hoare triple {119#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {119#false} is VALID [2022-04-15 01:34:13,941 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-15 01:34:13,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:34:13,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840568616] [2022-04-15 01:34:13,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840568616] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 01:34:13,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 01:34:13,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 01:34:13,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980423751] [2022-04-15 01:34:13,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 01:34:13,943 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 12 [2022-04-15 01:34:13,943 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:34:13,943 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-15 01:34:13,955 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:34:13,955 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 01:34:13,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:34:13,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 01:34:13,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 01:34:13,956 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-15 01:34:14,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:34:14,023 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-15 01:34:14,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 01:34:14,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 12 [2022-04-15 01:34:14,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:34:14,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-15 01:34:14,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2022-04-15 01:34:14,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-15 01:34:14,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2022-04-15 01:34:14,034 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 19 transitions. [2022-04-15 01:34:14,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:34:14,054 INFO L225 Difference]: With dead ends: 19 [2022-04-15 01:34:14,054 INFO L226 Difference]: Without dead ends: 14 [2022-04-15 01:34:14,054 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 01:34:14,056 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 01:34:14,056 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 19 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 01:34:14,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-15 01:34:14,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-15 01:34:14,060 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:34:14,060 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:14,060 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:14,061 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:14,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:34:14,062 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 01:34:14,062 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 01:34:14,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:34:14,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:34:14,062 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-15 01:34:14,063 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-15 01:34:14,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:34:14,064 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 01:34:14,064 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 01:34:14,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:34:14,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:34:14,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:34:14,064 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:34:14,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:14,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-15 01:34:14,066 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-15 01:34:14,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:34:14,066 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-15 01:34:14,066 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-15 01:34:14,066 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 01:34:14,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 01:34:14,067 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:34:14,067 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:34:14,067 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 01:34:14,067 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:34:14,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:34:14,068 INFO L85 PathProgramCache]: Analyzing trace with hash 306506437, now seen corresponding path program 1 times [2022-04-15 01:34:14,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:34:14,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316850936] [2022-04-15 01:34:14,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:34:14,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:34:14,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:34:14,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:34:14,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:34:14,248 INFO L290 TraceCheckUtils]: 0: Hoare triple {218#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {208#true} is VALID [2022-04-15 01:34:14,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {208#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-15 01:34:14,249 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {208#true} {208#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-15 01:34:14,249 INFO L272 TraceCheckUtils]: 0: Hoare triple {208#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:34:14,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {218#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {208#true} is VALID [2022-04-15 01:34:14,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {208#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-15 01:34:14,250 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {208#true} {208#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-15 01:34:14,250 INFO L272 TraceCheckUtils]: 4: Hoare triple {208#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-15 01:34:14,250 INFO L290 TraceCheckUtils]: 5: Hoare triple {208#true} [52] mainENTRY-->L23: Formula: (and (= v_main_~n~0_3 |v_main_#t~nondet3_2|) (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~i~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (= v_main_~k~0_3 |v_main_#t~nondet2_2|) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_#t~nondet3, main_#t~nondet2, main_~i~0, main_~n~0] {208#true} is VALID [2022-04-15 01:34:14,251 INFO L290 TraceCheckUtils]: 6: Hoare triple {208#true} [55] L23-->L24-2: Formula: (and (< 0 v_main_~n~0_6) (= v_main_~k~0_6 0) (= v_main_~i~0_7 0)) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_6, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[] {213#(and (<= main_~k~0 main_~i~0) (<= main_~i~0 main_~k~0) (<= (+ main_~k~0 1) main_~n~0))} is VALID [2022-04-15 01:34:14,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {213#(and (<= main_~k~0 main_~i~0) (<= main_~i~0 main_~k~0) (<= (+ main_~k~0 1) main_~n~0))} [59] L24-2-->L24-2: Formula: (and (= v_main_~k~0_1 (+ v_main_~k~0_2 1)) (< v_main_~i~0_3 v_main_~n~0_2) (= v_main_~i~0_2 (+ v_main_~i~0_3 1))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_2, main_#t~post5=|v_main_#t~post5_1|, main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_#t~post4, main_~i~0, main_#t~post5] {214#(and (< main_~k~0 (+ main_~n~0 1)) (<= main_~i~0 main_~k~0) (< main_~k~0 (+ main_~i~0 1)))} is VALID [2022-04-15 01:34:14,253 INFO L290 TraceCheckUtils]: 8: Hoare triple {214#(and (< main_~k~0 (+ main_~n~0 1)) (<= main_~i~0 main_~k~0) (< main_~k~0 (+ main_~i~0 1)))} [58] L24-2-->L24-3: Formula: (not (< v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {215#(and (< main_~k~0 (+ main_~n~0 1)) (<= main_~i~0 main_~k~0) (<= main_~n~0 main_~k~0) (< main_~k~0 (+ main_~i~0 1)))} is VALID [2022-04-15 01:34:14,254 INFO L272 TraceCheckUtils]: 9: Hoare triple {215#(and (< main_~k~0 (+ main_~n~0 1)) (<= main_~i~0 main_~k~0) (<= main_~n~0 main_~k~0) (< main_~k~0 (+ main_~i~0 1)))} [60] L24-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (and (= v_main_~k~0_7 v_main_~n~0_7) (= v_main_~i~0_8 v_main_~k~0_7)) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_7, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {216#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 01:34:14,255 INFO L290 TraceCheckUtils]: 10: Hoare triple {216#(not (= |__VERIFIER_assert_#in~cond| 0))} [62] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {217#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 01:34:14,255 INFO L290 TraceCheckUtils]: 11: Hoare triple {217#(not (= __VERIFIER_assert_~cond 0))} [63] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {209#false} is VALID [2022-04-15 01:34:14,256 INFO L290 TraceCheckUtils]: 12: Hoare triple {209#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {209#false} is VALID [2022-04-15 01:34:14,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:34:14,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:34:14,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316850936] [2022-04-15 01:34:14,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316850936] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 01:34:14,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281329638] [2022-04-15 01:34:14,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:34:14,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:34:14,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:34:14,258 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-15 01:34:14,287 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-15 01:34:14,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:34:14,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 01:34:14,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:34:14,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:34:14,711 INFO L272 TraceCheckUtils]: 0: Hoare triple {208#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-15 01:34:14,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {208#true} [50] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {208#true} is VALID [2022-04-15 01:34:14,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {208#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-15 01:34:14,712 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {208#true} {208#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-15 01:34:14,712 INFO L272 TraceCheckUtils]: 4: Hoare triple {208#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-15 01:34:14,712 INFO L290 TraceCheckUtils]: 5: Hoare triple {208#true} [52] mainENTRY-->L23: Formula: (and (= v_main_~n~0_3 |v_main_#t~nondet3_2|) (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~i~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (= v_main_~k~0_3 |v_main_#t~nondet2_2|) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_#t~nondet3, main_#t~nondet2, main_~i~0, main_~n~0] {208#true} is VALID [2022-04-15 01:34:14,713 INFO L290 TraceCheckUtils]: 6: Hoare triple {208#true} [55] L23-->L24-2: Formula: (and (< 0 v_main_~n~0_6) (= v_main_~k~0_6 0) (= v_main_~i~0_7 0)) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_6, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[] {240#(and (< 0 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-15 01:34:14,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {240#(and (< 0 main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} [59] L24-2-->L24-2: Formula: (and (= v_main_~k~0_1 (+ v_main_~k~0_2 1)) (< v_main_~i~0_3 v_main_~n~0_2) (= v_main_~i~0_2 (+ v_main_~i~0_3 1))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_2, main_#t~post5=|v_main_#t~post5_1|, main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_#t~post4, main_~i~0, main_#t~post5] {244#(and (< 0 main_~n~0) (= main_~k~0 1) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-15 01:34:14,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {244#(and (< 0 main_~n~0) (= main_~k~0 1) (= (+ (- 1) main_~i~0) 0))} [58] L24-2-->L24-3: Formula: (not (< v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {248#(and (< 0 main_~n~0) (not (< main_~i~0 main_~n~0)) (= main_~k~0 1) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-15 01:34:14,716 INFO L272 TraceCheckUtils]: 9: Hoare triple {248#(and (< 0 main_~n~0) (not (< main_~i~0 main_~n~0)) (= main_~k~0 1) (= (+ (- 1) main_~i~0) 0))} [60] L24-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (and (= v_main_~k~0_7 v_main_~n~0_7) (= v_main_~i~0_8 v_main_~k~0_7)) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_7, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {252#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:34:14,716 INFO L290 TraceCheckUtils]: 10: Hoare triple {252#(<= 1 |__VERIFIER_assert_#in~cond|)} [62] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {256#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:34:14,717 INFO L290 TraceCheckUtils]: 11: Hoare triple {256#(<= 1 __VERIFIER_assert_~cond)} [63] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {209#false} is VALID [2022-04-15 01:34:14,717 INFO L290 TraceCheckUtils]: 12: Hoare triple {209#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {209#false} is VALID [2022-04-15 01:34:14,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:34:14,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:34:14,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {209#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {209#false} is VALID [2022-04-15 01:34:14,914 INFO L290 TraceCheckUtils]: 11: Hoare triple {256#(<= 1 __VERIFIER_assert_~cond)} [63] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {209#false} is VALID [2022-04-15 01:34:14,914 INFO L290 TraceCheckUtils]: 10: Hoare triple {252#(<= 1 |__VERIFIER_assert_#in~cond|)} [62] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {256#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:34:14,916 INFO L272 TraceCheckUtils]: 9: Hoare triple {215#(and (< main_~k~0 (+ main_~n~0 1)) (<= main_~i~0 main_~k~0) (<= main_~n~0 main_~k~0) (< main_~k~0 (+ main_~i~0 1)))} [60] L24-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (and (= v_main_~k~0_7 v_main_~n~0_7) (= v_main_~i~0_8 v_main_~k~0_7)) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_7, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {252#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:34:14,917 INFO L290 TraceCheckUtils]: 8: Hoare triple {275#(or (< main_~i~0 main_~n~0) (and (< main_~k~0 (+ main_~n~0 1)) (<= main_~i~0 main_~k~0)))} [58] L24-2-->L24-3: Formula: (not (< v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {215#(and (< main_~k~0 (+ main_~n~0 1)) (<= main_~i~0 main_~k~0) (<= main_~n~0 main_~k~0) (< main_~k~0 (+ main_~i~0 1)))} is VALID [2022-04-15 01:34:14,918 INFO L290 TraceCheckUtils]: 7: Hoare triple {279#(or (and (<= main_~i~0 main_~k~0) (< main_~k~0 main_~n~0)) (< (+ main_~i~0 1) main_~n~0))} [59] L24-2-->L24-2: Formula: (and (= v_main_~k~0_1 (+ v_main_~k~0_2 1)) (< v_main_~i~0_3 v_main_~n~0_2) (= v_main_~i~0_2 (+ v_main_~i~0_3 1))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_2, main_#t~post5=|v_main_#t~post5_1|, main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_#t~post4, main_~i~0, main_#t~post5] {275#(or (< main_~i~0 main_~n~0) (and (< main_~k~0 (+ main_~n~0 1)) (<= main_~i~0 main_~k~0)))} is VALID [2022-04-15 01:34:14,919 INFO L290 TraceCheckUtils]: 6: Hoare triple {208#true} [55] L23-->L24-2: Formula: (and (< 0 v_main_~n~0_6) (= v_main_~k~0_6 0) (= v_main_~i~0_7 0)) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_6, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[] {279#(or (and (<= main_~i~0 main_~k~0) (< main_~k~0 main_~n~0)) (< (+ main_~i~0 1) main_~n~0))} is VALID [2022-04-15 01:34:14,919 INFO L290 TraceCheckUtils]: 5: Hoare triple {208#true} [52] mainENTRY-->L23: Formula: (and (= v_main_~n~0_3 |v_main_#t~nondet3_2|) (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~i~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (= v_main_~k~0_3 |v_main_#t~nondet2_2|) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_#t~nondet3, main_#t~nondet2, main_~i~0, main_~n~0] {208#true} is VALID [2022-04-15 01:34:14,920 INFO L272 TraceCheckUtils]: 4: Hoare triple {208#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-15 01:34:14,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {208#true} {208#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-15 01:34:14,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {208#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-15 01:34:14,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {208#true} [50] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {208#true} is VALID [2022-04-15 01:34:14,920 INFO L272 TraceCheckUtils]: 0: Hoare triple {208#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-15 01:34:14,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:34:14,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281329638] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 01:34:14,922 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 01:34:14,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2022-04-15 01:34:14,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763701842] [2022-04-15 01:34:14,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 01:34:14,927 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 01:34:14,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:34:14,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:14,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:34:14,947 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 01:34:14,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:34:14,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 01:34:14,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-04-15 01:34:14,949 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 15 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:15,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:34:15,224 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-04-15 01:34:15,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 01:34:15,224 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 01:34:15,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:34:15,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:15,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2022-04-15 01:34:15,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:15,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2022-04-15 01:34:15,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 17 transitions. [2022-04-15 01:34:15,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:34:15,246 INFO L225 Difference]: With dead ends: 16 [2022-04-15 01:34:15,247 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 01:34:15,247 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2022-04-15 01:34:15,248 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 11 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 01:34:15,249 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 50 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 01:34:15,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 01:34:15,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 01:34:15,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:34:15,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second 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-15 01:34:15,250 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second 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-15 01:34:15,250 INFO L87 Difference]: Start difference. First operand 0 states. Second 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-15 01:34:15,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:34:15,250 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 01:34:15,250 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 01:34:15,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:34:15,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:34:15,251 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 0 states. [2022-04-15 01:34:15,251 INFO L87 Difference]: Start difference. First 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) Second operand 0 states. [2022-04-15 01:34:15,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:34:15,251 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 01:34:15,251 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 01:34:15,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:34:15,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:34:15,252 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:34:15,252 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:34:15,252 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-15 01:34:15,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 01:34:15,252 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2022-04-15 01:34:15,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:34:15,252 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 01:34:15,253 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:15,253 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 01:34:15,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:34:15,256 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 01:34:15,282 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-15 01:34:15,478 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:34:15,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 01:34:15,547 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-15 01:34:15,547 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-15 01:34:15,547 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-15 01:34:15,547 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 01:34:15,547 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 01:34:15,547 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-15 01:34:15,547 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-15 01:34:15,548 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 19 29) the Hoare annotation is: true [2022-04-15 01:34:15,548 INFO L882 garLoopResultBuilder]: For program point L23(line 23) no Hoare annotation was computed. [2022-04-15 01:34:15,548 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 19 29) no Hoare annotation was computed. [2022-04-15 01:34:15,548 INFO L878 garLoopResultBuilder]: At program point L24-2(lines 24 26) the Hoare annotation is: (and (< main_~k~0 (+ main_~n~0 1)) (<= main_~i~0 main_~k~0) (< main_~k~0 (+ main_~i~0 1))) [2022-04-15 01:34:15,548 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 19 29) no Hoare annotation was computed. [2022-04-15 01:34:15,549 INFO L878 garLoopResultBuilder]: At program point L24-3(lines 24 26) the Hoare annotation is: (and (< main_~k~0 (+ main_~n~0 1)) (<= main_~i~0 main_~k~0) (<= main_~n~0 main_~k~0) (< main_~k~0 (+ main_~i~0 1))) [2022-04-15 01:34:15,549 INFO L882 garLoopResultBuilder]: For program point L27(line 27) no Hoare annotation was computed. [2022-04-15 01:34:15,549 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 18) the Hoare annotation is: true [2022-04-15 01:34:15,549 INFO L882 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2022-04-15 01:34:15,549 INFO L882 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-04-15 01:34:15,549 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 18) no Hoare annotation was computed. [2022-04-15 01:34:15,549 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2022-04-15 01:34:15,549 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 18) no Hoare annotation was computed. [2022-04-15 01:34:15,555 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-15 01:34:15,556 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 01:34:15,564 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 01:34:15,564 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-15 01:34:15,565 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 01:34:15,565 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 01:34:15,565 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-15 01:34:15,566 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-15 01:34:15,567 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 01:34:15,570 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 01:34:15,570 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 01:34:15,571 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 01:34:15,575 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-15 01:34:15,575 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-15 01:34:15,575 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-15 01:34:15,575 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 01:34:15,576 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 01:34:15,576 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 01:34:15,576 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-15 01:34:15,576 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 01:34:15,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 01:34:15 BasicIcfg [2022-04-15 01:34:15,587 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 01:34:15,589 INFO L158 Benchmark]: Toolchain (without parser) took 2874.98ms. Allocated memory was 182.5MB in the beginning and 237.0MB in the end (delta: 54.5MB). Free memory was 122.7MB in the beginning and 168.0MB in the end (delta: -45.3MB). Peak memory consumption was 9.0MB. Max. memory is 8.0GB. [2022-04-15 01:34:15,589 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 182.5MB. Free memory is still 138.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 01:34:15,589 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.99ms. Allocated memory was 182.5MB in the beginning and 237.0MB in the end (delta: 54.5MB). Free memory was 122.5MB in the beginning and 208.7MB in the end (delta: -86.2MB). Peak memory consumption was 13.0MB. Max. memory is 8.0GB. [2022-04-15 01:34:15,590 INFO L158 Benchmark]: Boogie Preprocessor took 26.31ms. Allocated memory is still 237.0MB. Free memory was 208.7MB in the beginning and 207.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 01:34:15,590 INFO L158 Benchmark]: RCFGBuilder took 274.81ms. Allocated memory is still 237.0MB. Free memory was 207.1MB in the beginning and 195.0MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-15 01:34:15,590 INFO L158 Benchmark]: IcfgTransformer took 25.73ms. Allocated memory is still 237.0MB. Free memory was 195.0MB in the beginning and 193.8MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 01:34:15,590 INFO L158 Benchmark]: TraceAbstraction took 2306.66ms. Allocated memory is still 237.0MB. Free memory was 192.9MB in the beginning and 168.0MB in the end (delta: 24.9MB). Peak memory consumption was 26.0MB. Max. memory is 8.0GB. [2022-04-15 01:34:15,592 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 182.5MB. Free memory is still 138.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 227.99ms. Allocated memory was 182.5MB in the beginning and 237.0MB in the end (delta: 54.5MB). Free memory was 122.5MB in the beginning and 208.7MB in the end (delta: -86.2MB). Peak memory consumption was 13.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.31ms. Allocated memory is still 237.0MB. Free memory was 208.7MB in the beginning and 207.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 274.81ms. Allocated memory is still 237.0MB. Free memory was 207.1MB in the beginning and 195.0MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 25.73ms. Allocated memory is still 237.0MB. Free memory was 195.0MB in the beginning and 193.8MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 2306.66ms. Allocated memory is still 237.0MB. Free memory was 192.9MB in the beginning and 168.0MB in the end (delta: 24.9MB). Peak memory consumption was 26.0MB. 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: 16]: 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, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30 mSDsluCounter, 92 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 67 IncrementalHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 40 mSDtfsCounter, 67 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 10 PreInvPairs, 14 NumberOfFragments, 42 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 45 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 58 ConstructedInterpolants, 0 QuantifiedInterpolants, 209 SizeOfPredicates, 4 NumberOfNonLiveVariables, 67 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 0/3 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: 24]: Loop Invariant Derived loop invariant: (k < n + 1 && i <= k) && k < i + 1 RESULT: Ultimate proved your program to be correct! [2022-04-15 01:34:15,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...