/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/benchmark17_conjunctive.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 22:35:05,114 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 22:35:05,132 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 22:35:05,163 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 22:35:05,163 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 22:35:05,164 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 22:35:05,164 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 22:35:05,166 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 22:35:05,167 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 22:35:05,167 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 22:35:05,168 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 22:35:05,169 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 22:35:05,169 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 22:35:05,169 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 22:35:05,170 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 22:35:05,172 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 22:35:05,172 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 22:35:05,175 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 22:35:05,179 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 22:35:05,180 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 22:35:05,181 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 22:35:05,183 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 22:35:05,184 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 22:35:05,184 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 22:35:05,185 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 22:35:05,186 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 22:35:05,186 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 22:35:05,186 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 22:35:05,187 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 22:35:05,187 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 22:35:05,187 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 22:35:05,188 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 22:35:05,188 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 22:35:05,189 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 22:35:05,189 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 22:35:05,189 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 22:35:05,190 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 22:35:05,190 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 22:35:05,190 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 22:35:05,190 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 22:35:05,191 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 22:35:05,196 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 22:35:05,197 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 22:35:05,218 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 22:35:05,218 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 22:35:05,219 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 22:35:05,219 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 22:35:05,219 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 22:35:05,219 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 22:35:05,219 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 22:35:05,220 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 22:35:05,220 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 22:35:05,220 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 22:35:05,220 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 22:35:05,220 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 22:35:05,220 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 22:35:05,221 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 22:35:05,221 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 22:35:05,221 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 22:35:05,221 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 22:35:05,221 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 22:35:05,221 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 22:35:05,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 22:35:05,221 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 22:35:05,221 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 22:35:05,221 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 22:35:05,222 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 22:35:05,222 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 22:35:05,222 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 22:35:05,222 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 22:35:05,222 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 22:35:05,223 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 22:35:05,223 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-27 22:35:05,387 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 22:35:05,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 22:35:05,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 22:35:05,404 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 22:35:05,404 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 22:35:05,405 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark17_conjunctive.i [2022-04-27 22:35:05,449 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0ec3001d/d50ef3aaedd64e71b4b1d69cb7ca8854/FLAG5e69c8bba [2022-04-27 22:35:05,781 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 22:35:05,782 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark17_conjunctive.i [2022-04-27 22:35:05,796 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0ec3001d/d50ef3aaedd64e71b4b1d69cb7ca8854/FLAG5e69c8bba [2022-04-27 22:35:05,808 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0ec3001d/d50ef3aaedd64e71b4b1d69cb7ca8854 [2022-04-27 22:35:05,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 22:35:05,811 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 22:35:05,813 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 22:35:05,813 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 22:35:05,816 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 22:35:05,819 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:35:05" (1/1) ... [2022-04-27 22:35:05,820 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6079d55d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:35:05, skipping insertion in model container [2022-04-27 22:35:05,820 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:35:05" (1/1) ... [2022-04-27 22:35:05,825 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 22:35:05,834 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 22:35:05,952 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/benchmark17_conjunctive.i[873,886] [2022-04-27 22:35:05,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 22:35:05,979 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 22:35:05,989 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/benchmark17_conjunctive.i[873,886] [2022-04-27 22:35:05,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 22:35:06,003 INFO L208 MainTranslator]: Completed translation [2022-04-27 22:35:06,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:35:06 WrapperNode [2022-04-27 22:35:06,003 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 22:35:06,004 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 22:35:06,005 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 22:35:06,005 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 22:35:06,011 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:35:06" (1/1) ... [2022-04-27 22:35:06,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:35:06" (1/1) ... [2022-04-27 22:35:06,016 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:35:06" (1/1) ... [2022-04-27 22:35:06,016 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:35:06" (1/1) ... [2022-04-27 22:35:06,025 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:35:06" (1/1) ... [2022-04-27 22:35:06,028 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:35:06" (1/1) ... [2022-04-27 22:35:06,029 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:35:06" (1/1) ... [2022-04-27 22:35:06,030 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 22:35:06,030 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 22:35:06,030 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 22:35:06,030 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 22:35:06,034 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:35:06" (1/1) ... [2022-04-27 22:35:06,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 22:35:06,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:35:06,101 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-27 22:35:06,122 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-27 22:35:06,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 22:35:06,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 22:35:06,141 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 22:35:06,141 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 22:35:06,141 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 22:35:06,141 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 22:35:06,141 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 22:35:06,141 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 22:35:06,141 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 22:35:06,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 22:35:06,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 22:35:06,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-27 22:35:06,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 22:35:06,142 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 22:35:06,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 22:35:06,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 22:35:06,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 22:35:06,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 22:35:06,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 22:35:06,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 22:35:06,201 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 22:35:06,202 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 22:35:06,318 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 22:35:06,324 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 22:35:06,325 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 22:35:06,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:35:06 BoogieIcfgContainer [2022-04-27 22:35:06,326 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 22:35:06,327 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 22:35:06,327 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 22:35:06,328 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 22:35:06,346 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:35:06" (1/1) ... [2022-04-27 22:35:06,348 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 22:35:06,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 10:35:06 BasicIcfg [2022-04-27 22:35:06,388 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 22:35:06,389 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 22:35:06,389 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 22:35:06,392 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 22:35:06,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:35:05" (1/4) ... [2022-04-27 22:35:06,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39c0ba03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:35:06, skipping insertion in model container [2022-04-27 22:35:06,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:35:06" (2/4) ... [2022-04-27 22:35:06,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39c0ba03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:35:06, skipping insertion in model container [2022-04-27 22:35:06,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:35:06" (3/4) ... [2022-04-27 22:35:06,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39c0ba03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:35:06, skipping insertion in model container [2022-04-27 22:35:06,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 10:35:06" (4/4) ... [2022-04-27 22:35:06,394 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark17_conjunctive.iqvasr [2022-04-27 22:35:06,416 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 22:35:06,416 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 22:35:06,474 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 22:35:06,486 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@16ea1ec2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5fdd0c16 [2022-04-27 22:35:06,486 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 22:35:06,493 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-27 22:35:06,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 22:35:06,500 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:35:06,500 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:35:06,501 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:35:06,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:35:06,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1809217115, now seen corresponding path program 1 times [2022-04-27 22:35:06,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:35:06,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901013184] [2022-04-27 22:35:06,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:35:06,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:35:06,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:35:06,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:35:06,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:35:06,693 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-27 22:35:06,694 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-27 22:35:06,694 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-27 22:35:06,696 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-27 22:35:06,696 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-27 22:35:06,697 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-27 22:35:06,697 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-27 22:35:06,698 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-27 22:35:06,698 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-27 22:35:06,698 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} [55] L23-->L24-2: Formula: (and (= v_main_~k~0_6 0) (= v_main_~i~0_6 0)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-27 22:35:06,699 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-27 22:35:06,700 INFO L272 TraceCheckUtils]: 8: Hoare triple {24#false} [60] L24-3-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~n~0_5 v_main_~k~0_7) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {24#false} is VALID [2022-04-27 22:35:06,700 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-27 22:35:06,701 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-27 22:35:06,701 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-27 22:35:06,702 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-27 22:35:06,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:35:06,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901013184] [2022-04-27 22:35:06,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901013184] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 22:35:06,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 22:35:06,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 22:35:06,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60193559] [2022-04-27 22:35:06,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:35:06,710 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-27 22:35:06,711 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:35:06,713 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-27 22:35:06,734 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-27 22:35:06,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 22:35:06,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:35:06,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 22:35:06,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 22:35:06,768 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-27 22:35:06,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:35:06,830 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-27 22:35:06,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 22:35:06,830 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-27 22:35:06,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:35:06,832 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-27 22:35:06,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-04-27 22:35:06,840 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-27 22:35:06,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-04-27 22:35:06,845 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2022-04-27 22:35:06,888 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-27 22:35:06,893 INFO L225 Difference]: With dead ends: 32 [2022-04-27 22:35:06,894 INFO L226 Difference]: Without dead ends: 13 [2022-04-27 22:35:06,896 INFO L412 NwaCegarLoop]: 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-27 22:35:06,899 INFO L413 NwaCegarLoop]: 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-27 22:35:06,901 INFO L414 NwaCegarLoop]: 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-27 22:35:06,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-27 22:35:06,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-27 22:35:06,922 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:35:06,923 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-27 22:35:06,923 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-27 22:35:06,924 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-27 22:35:06,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:35:06,930 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 22:35:06,930 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 22:35:06,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:35:06,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:35:06,931 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-27 22:35:06,931 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-27 22:35:06,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:35:06,936 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 22:35:06,936 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 22:35:06,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:35:06,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:35:06,937 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:35:06,937 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:35:06,937 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-27 22:35:06,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-27 22:35:06,941 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 12 [2022-04-27 22:35:06,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:35:06,947 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-27 22:35:06,948 INFO L496 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-27 22:35:06,948 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 22:35:06,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 22:35:06,948 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:35:06,948 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:35:06,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 22:35:06,949 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:35:06,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:35:06,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1810140636, now seen corresponding path program 1 times [2022-04-27 22:35:06,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:35:06,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612555678] [2022-04-27 22:35:06,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:35:06,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:35:06,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:35:07,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:35:07,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:35:07,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {127#(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-27 22:35:07,084 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-27 22:35:07,085 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-27 22:35:07,086 INFO L272 TraceCheckUtils]: 0: Hoare triple {118#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {127#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:35:07,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {127#(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-27 22:35:07,087 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-27 22:35:07,087 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-27 22:35:07,087 INFO L272 TraceCheckUtils]: 4: Hoare triple {118#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#true} is VALID [2022-04-27 22:35:07,088 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-27 22:35:07,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {118#true} [55] L23-->L24-2: Formula: (and (= v_main_~k~0_6 0) (= v_main_~i~0_6 0)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_6} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[] {123#(<= main_~i~0 main_~k~0)} is VALID [2022-04-27 22:35:07,089 INFO L290 TraceCheckUtils]: 7: Hoare triple {123#(<= 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[] {124#(<= main_~n~0 main_~k~0)} is VALID [2022-04-27 22:35:07,089 INFO L272 TraceCheckUtils]: 8: Hoare triple {124#(<= main_~n~0 main_~k~0)} [60] L24-3-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~n~0_5 v_main_~k~0_7) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {125#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 22:35:07,090 INFO L290 TraceCheckUtils]: 9: Hoare triple {125#(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] {126#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 22:35:07,090 INFO L290 TraceCheckUtils]: 10: Hoare triple {126#(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[] {119#false} is VALID [2022-04-27 22:35:07,090 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-27 22:35:07,091 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-27 22:35:07,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:35:07,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612555678] [2022-04-27 22:35:07,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612555678] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 22:35:07,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 22:35:07,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 22:35:07,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461720776] [2022-04-27 22:35:07,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:35:07,093 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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-27 22:35:07,093 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:35:07,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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-27 22:35:07,104 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-27 22:35:07,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 22:35:07,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:35:07,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 22:35:07,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 22:35:07,108 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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-27 22:35:07,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:35:07,210 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 22:35:07,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 22:35:07,211 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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-27 22:35:07,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:35:07,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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-27 22:35:07,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 13 transitions. [2022-04-27 22:35:07,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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-27 22:35:07,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 13 transitions. [2022-04-27 22:35:07,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 13 transitions. [2022-04-27 22:35:07,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:35:07,229 INFO L225 Difference]: With dead ends: 13 [2022-04-27 22:35:07,229 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 22:35:07,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-04-27 22:35:07,231 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 6 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 22:35:07,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 30 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 22:35:07,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 22:35:07,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 22:35:07,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:35:07,234 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-27 22:35:07,234 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-27 22:35:07,234 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-27 22:35:07,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:35:07,235 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 22:35:07,235 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 22:35:07,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:35:07,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:35:07,235 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-27 22:35:07,235 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-27 22:35:07,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:35:07,248 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 22:35:07,249 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 22:35:07,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:35:07,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:35:07,249 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:35:07,249 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:35:07,249 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-27 22:35:07,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 22:35:07,250 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2022-04-27 22:35:07,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:35:07,250 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 22:35:07,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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-27 22:35:07,251 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 22:35:07,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:35:07,253 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 22:35:07,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 22:35:07,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 22:35:07,275 INFO L895 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-27 22:35:07,275 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 22:35:07,275 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 22:35:07,275 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 22:35:07,275 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 22:35:07,275 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 22:35:07,275 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 22:35:07,275 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 19 30) the Hoare annotation is: true [2022-04-27 22:35:07,276 INFO L899 garLoopResultBuilder]: For program point L23(line 23) no Hoare annotation was computed. [2022-04-27 22:35:07,276 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 19 30) no Hoare annotation was computed. [2022-04-27 22:35:07,276 INFO L895 garLoopResultBuilder]: At program point L24-2(lines 24 27) the Hoare annotation is: (<= main_~i~0 main_~k~0) [2022-04-27 22:35:07,276 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 19 30) no Hoare annotation was computed. [2022-04-27 22:35:07,276 INFO L895 garLoopResultBuilder]: At program point L24-3(lines 24 27) the Hoare annotation is: (and (<= main_~i~0 main_~k~0) (<= main_~n~0 main_~k~0)) [2022-04-27 22:35:07,277 INFO L899 garLoopResultBuilder]: For program point L28(line 28) no Hoare annotation was computed. [2022-04-27 22:35:07,277 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 18) the Hoare annotation is: true [2022-04-27 22:35:07,277 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2022-04-27 22:35:07,277 INFO L899 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-04-27 22:35:07,277 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 18) no Hoare annotation was computed. [2022-04-27 22:35:07,277 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2022-04-27 22:35:07,277 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 18) no Hoare annotation was computed. [2022-04-27 22:35:07,280 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1] [2022-04-27 22:35:07,281 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 22:35:07,288 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 22:35:07,288 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-27 22:35:07,288 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 22:35:07,288 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 22:35:07,288 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-27 22:35:07,289 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-27 22:35:07,289 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 22:35:07,291 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 22:35:07,291 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 22:35:07,292 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 22:35:07,295 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 22:35:07,296 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 22:35:07,296 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-27 22:35:07,296 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 22:35:07,296 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 22:35:07,296 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 22:35:07,296 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 22:35:07,296 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-27 22:35:07,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:35:07 BasicIcfg [2022-04-27 22:35:07,303 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 22:35:07,304 INFO L158 Benchmark]: Toolchain (without parser) took 1492.44ms. Allocated memory was 207.6MB in the beginning and 290.5MB in the end (delta: 82.8MB). Free memory was 152.3MB in the beginning and 257.9MB in the end (delta: -105.6MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 22:35:07,304 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 207.6MB. Free memory is still 168.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 22:35:07,307 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.29ms. Allocated memory was 207.6MB in the beginning and 290.5MB in the end (delta: 82.8MB). Free memory was 152.1MB in the beginning and 262.2MB in the end (delta: -110.0MB). Peak memory consumption was 8.7MB. Max. memory is 8.0GB. [2022-04-27 22:35:07,308 INFO L158 Benchmark]: Boogie Preprocessor took 25.35ms. Allocated memory is still 290.5MB. Free memory was 262.2MB in the beginning and 260.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 22:35:07,308 INFO L158 Benchmark]: RCFGBuilder took 295.97ms. Allocated memory is still 290.5MB. Free memory was 260.5MB in the beginning and 249.3MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 22:35:07,308 INFO L158 Benchmark]: IcfgTransformer took 61.09ms. Allocated memory is still 290.5MB. Free memory was 248.9MB in the beginning and 247.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 22:35:07,308 INFO L158 Benchmark]: TraceAbstraction took 914.10ms. Allocated memory is still 290.5MB. Free memory was 247.2MB in the beginning and 257.9MB in the end (delta: -10.7MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 22:35:07,309 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.09ms. Allocated memory is still 207.6MB. Free memory is still 168.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 190.29ms. Allocated memory was 207.6MB in the beginning and 290.5MB in the end (delta: 82.8MB). Free memory was 152.1MB in the beginning and 262.2MB in the end (delta: -110.0MB). Peak memory consumption was 8.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.35ms. Allocated memory is still 290.5MB. Free memory was 262.2MB in the beginning and 260.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 295.97ms. Allocated memory is still 290.5MB. Free memory was 260.5MB in the beginning and 249.3MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 61.09ms. Allocated memory is still 290.5MB. Free memory was 248.9MB in the beginning and 247.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 914.10ms. Allocated memory is still 290.5MB. Free memory was 247.2MB in the beginning and 257.9MB in the end (delta: -10.7MB). There was no memory consumed. 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: 0.8s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18 mSDsluCounter, 53 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24 IncrementalHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 28 mSDtfsCounter, 24 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 10, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 8 PreInvPairs, 9 NumberOfFragments, 21 HoareAnnotationTreeSize, 8 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 44 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 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: i <= k RESULT: Ultimate proved your program to be correct! [2022-04-27 22:35:07,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...