/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/benchmark11_linear.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 01:34:02,133 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 01:34:02,135 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 01:34:02,159 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 01:34:02,160 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 01:34:02,160 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 01:34:02,161 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 01:34:02,162 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 01:34:02,163 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 01:34:02,164 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 01:34:02,164 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 01:34:02,165 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 01:34:02,165 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 01:34:02,166 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 01:34:02,166 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 01:34:02,167 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 01:34:02,171 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 01:34:02,172 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 01:34:02,173 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 01:34:02,174 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 01:34:02,175 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 01:34:02,186 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 01:34:02,186 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 01:34:02,187 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 01:34:02,187 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 01:34:02,189 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 01:34:02,189 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 01:34:02,189 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 01:34:02,190 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 01:34:02,190 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 01:34:02,191 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 01:34:02,191 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 01:34:02,191 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 01:34:02,192 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 01:34:02,192 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 01:34:02,193 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 01:34:02,193 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 01:34:02,193 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 01:34:02,193 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 01:34:02,194 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 01:34:02,194 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 01:34:02,200 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 01:34:02,201 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:02,229 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 01:34:02,230 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 01:34:02,230 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 01:34:02,230 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 01:34:02,231 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 01:34:02,231 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 01:34:02,231 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 01:34:02,231 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 01:34:02,231 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 01:34:02,232 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 01:34:02,232 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 01:34:02,232 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 01:34:02,232 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 01:34:02,232 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 01:34:02,232 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 01:34:02,232 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 01:34:02,232 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 01:34:02,233 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 01:34:02,233 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 01:34:02,233 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 01:34:02,233 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 01:34:02,233 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 01:34:02,233 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 01:34:02,233 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 01:34:02,233 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 01:34:02,233 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 01:34:02,233 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 01:34:02,233 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 01:34:02,234 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 01:34:02,234 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:02,397 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 01:34:02,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 01:34:02,414 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 01:34:02,415 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 01:34:02,416 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 01:34:02,416 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark11_linear.i [2022-04-15 01:34:02,468 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17ca114da/ba75c1e19bc04f4fa186b4d4cfa5090c/FLAG7ec3c50e7 [2022-04-15 01:34:02,771 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 01:34:02,772 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark11_linear.i [2022-04-15 01:34:02,776 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17ca114da/ba75c1e19bc04f4fa186b4d4cfa5090c/FLAG7ec3c50e7 [2022-04-15 01:34:03,209 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17ca114da/ba75c1e19bc04f4fa186b4d4cfa5090c [2022-04-15 01:34:03,211 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 01:34:03,212 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 01:34:03,214 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 01:34:03,214 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 01:34:03,217 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 01:34:03,217 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:34:03" (1/1) ... [2022-04-15 01:34:03,219 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dc81a31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:34:03, skipping insertion in model container [2022-04-15 01:34:03,219 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:34:03" (1/1) ... [2022-04-15 01:34:03,225 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 01:34:03,234 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 01:34:03,385 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/benchmark11_linear.i[868,881] [2022-04-15 01:34:03,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 01:34:03,408 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 01:34:03,420 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/benchmark11_linear.i[868,881] [2022-04-15 01:34:03,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 01:34:03,435 INFO L208 MainTranslator]: Completed translation [2022-04-15 01:34:03,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:34:03 WrapperNode [2022-04-15 01:34:03,436 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 01:34:03,437 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 01:34:03,438 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 01:34:03,438 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 01:34:03,444 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:03" (1/1) ... [2022-04-15 01:34:03,445 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:03" (1/1) ... [2022-04-15 01:34:03,449 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:03" (1/1) ... [2022-04-15 01:34:03,449 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:03" (1/1) ... [2022-04-15 01:34:03,454 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:03" (1/1) ... [2022-04-15 01:34:03,457 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:03" (1/1) ... [2022-04-15 01:34:03,461 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:03" (1/1) ... [2022-04-15 01:34:03,463 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 01:34:03,464 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 01:34:03,464 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 01:34:03,464 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 01:34:03,465 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:34:03" (1/1) ... [2022-04-15 01:34:03,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 01:34:03,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:34:03,492 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:03,497 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:03,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 01:34:03,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 01:34:03,519 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 01:34:03,519 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 01:34:03,519 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 01:34:03,519 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 01:34:03,519 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 01:34:03,519 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 01:34:03,519 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 01:34:03,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 01:34:03,520 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 01:34:03,520 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-15 01:34:03,520 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 01:34:03,520 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 01:34:03,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 01:34:03,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 01:34:03,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 01:34:03,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 01:34:03,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 01:34:03,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 01:34:03,562 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 01:34:03,563 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 01:34:03,649 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 01:34:03,653 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 01:34:03,653 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 01:34:03,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:34:03 BoogieIcfgContainer [2022-04-15 01:34:03,655 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 01:34:03,655 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 01:34:03,655 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 01:34:03,656 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 01:34:03,658 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:34:03" (1/1) ... [2022-04-15 01:34:03,659 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 01:34:03,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 01:34:03 BasicIcfg [2022-04-15 01:34:03,674 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 01:34:03,675 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 01:34:03,676 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 01:34:03,687 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 01:34:03,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:34:03" (1/4) ... [2022-04-15 01:34:03,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d4c2f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:34:03, skipping insertion in model container [2022-04-15 01:34:03,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:34:03" (2/4) ... [2022-04-15 01:34:03,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d4c2f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:34:03, skipping insertion in model container [2022-04-15 01:34:03,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:34:03" (3/4) ... [2022-04-15 01:34:03,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d4c2f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 01:34:03, skipping insertion in model container [2022-04-15 01:34:03,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 01:34:03" (4/4) ... [2022-04-15 01:34:03,690 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark11_linear.iqvasr [2022-04-15 01:34:03,693 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 01:34:03,693 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 01:34:03,739 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 01:34:03,743 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:03,744 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 01:34:03,777 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:03,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 01:34:03,780 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:34:03,780 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:34:03,780 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:34:03,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:34:03,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1809217115, now seen corresponding path program 1 times [2022-04-15 01:34:03,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:34:03,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237951328] [2022-04-15 01:34:03,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:34:03,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:34:03,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:34:03,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:34:03,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:34:03,933 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) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 21) (= (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:03,933 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:03,934 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:03,941 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:03,941 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) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 21) (= (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:03,942 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:03,942 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:03,942 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:03,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} [52] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~x~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~n~0_3 |v_main_#t~nondet2_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~x~0=v_main_~x~0_4, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_#t~nondet2, main_~n~0] {23#true} is VALID [2022-04-15 01:34:03,943 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} [55] L22-->L23-2: Formula: (and (< 0 v_main_~n~0_6) (= v_main_~x~0_7 0)) InVars {main_~x~0=v_main_~x~0_7, main_~n~0=v_main_~n~0_6} OutVars{main_~x~0=v_main_~x~0_7, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-15 01:34:03,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {23#true} [57] L23-2-->L23-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-15 01:34:03,944 INFO L272 TraceCheckUtils]: 8: Hoare triple {24#false} [60] L23-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~n~0_7 v_main_~x~0_8) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~n~0=v_main_~n~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {24#false} is VALID [2022-04-15 01:34:03,945 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:03,945 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:03,945 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:03,946 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:03,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:34:03,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237951328] [2022-04-15 01:34:03,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237951328] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 01:34:03,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 01:34:03,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 01:34:03,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644273372] [2022-04-15 01:34:03,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 01:34:03,954 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:03,956 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:34:03,958 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:03,974 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:03,974 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 01:34:03,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:34:03,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 01:34:04,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 01:34:04,002 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:04,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:34:04,070 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-15 01:34:04,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 01:34:04,071 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:04,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:34:04,072 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:04,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-04-15 01:34:04,079 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:04,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-04-15 01:34:04,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2022-04-15 01:34:04,123 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:04,129 INFO L225 Difference]: With dead ends: 32 [2022-04-15 01:34:04,129 INFO L226 Difference]: Without dead ends: 13 [2022-04-15 01:34:04,131 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:04,134 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:04,136 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:04,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-15 01:34:04,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-15 01:34:04,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:34:04,156 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:04,157 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:04,158 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:04,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:34:04,163 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-15 01:34:04,163 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 01:34:04,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:34:04,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:34:04,164 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:04,164 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:04,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:34:04,167 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-15 01:34:04,167 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 01:34:04,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:34:04,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:34:04,167 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:34:04,167 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:34:04,168 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:04,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-15 01:34:04,171 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 12 [2022-04-15 01:34:04,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:34:04,175 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-15 01:34:04,175 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:04,176 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 01:34:04,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 01:34:04,176 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:34:04,176 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:34:04,177 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 01:34:04,177 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:34:04,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:34:04,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1810140636, now seen corresponding path program 1 times [2022-04-15 01:34:04,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:34:04,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550277009] [2022-04-15 01:34:04,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:34:04,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:34:04,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:34:04,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:34:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:34:04,256 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) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 21) (= (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:04,256 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:04,256 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:04,257 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:04,257 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) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 21) (= (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:04,258 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:04,259 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:04,259 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:04,259 INFO L290 TraceCheckUtils]: 5: Hoare triple {118#true} [52] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~x~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~n~0_3 |v_main_#t~nondet2_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~x~0=v_main_~x~0_4, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_#t~nondet2, main_~n~0] {118#true} is VALID [2022-04-15 01:34:04,260 INFO L290 TraceCheckUtils]: 6: Hoare triple {118#true} [55] L22-->L23-2: Formula: (and (< 0 v_main_~n~0_6) (= v_main_~x~0_7 0)) InVars {main_~x~0=v_main_~x~0_7, main_~n~0=v_main_~n~0_6} OutVars{main_~x~0=v_main_~x~0_7, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {123#(<= (+ main_~x~0 1) main_~n~0)} is VALID [2022-04-15 01:34:04,260 INFO L290 TraceCheckUtils]: 7: Hoare triple {123#(<= (+ main_~x~0 1) main_~n~0)} [58] L23-2-->L23-3: Formula: (not (< v_main_~x~0_1 v_main_~n~0_1)) InVars {main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {119#false} is VALID [2022-04-15 01:34:04,262 INFO L272 TraceCheckUtils]: 8: Hoare triple {119#false} [60] L23-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~n~0_7 v_main_~x~0_8) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~n~0=v_main_~n~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {119#false} is VALID [2022-04-15 01:34:04,262 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:04,262 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:04,262 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:04,263 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:04,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:34:04,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550277009] [2022-04-15 01:34:04,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550277009] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 01:34:04,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 01:34:04,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 01:34:04,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347042443] [2022-04-15 01:34:04,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 01:34:04,265 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:04,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:34:04,265 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:04,279 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:04,279 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 01:34:04,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:34:04,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 01:34:04,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 01:34:04,281 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:04,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:34:04,326 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-15 01:34:04,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 01:34:04,326 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:04,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:34:04,326 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:04,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2022-04-15 01:34:04,332 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:04,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2022-04-15 01:34:04,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 19 transitions. [2022-04-15 01:34:04,376 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:04,378 INFO L225 Difference]: With dead ends: 19 [2022-04-15 01:34:04,378 INFO L226 Difference]: Without dead ends: 14 [2022-04-15 01:34:04,381 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:04,383 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:04,384 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:04,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-15 01:34:04,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-15 01:34:04,389 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:34:04,389 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:04,389 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:04,389 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:04,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:34:04,390 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 01:34:04,390 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 01:34:04,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:34:04,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:34:04,391 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:04,391 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:04,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:34:04,392 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 01:34:04,392 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 01:34:04,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:34:04,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:34:04,392 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:34:04,392 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:34:04,392 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:04,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-15 01:34:04,393 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-15 01:34:04,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:34:04,393 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-15 01:34:04,394 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:04,394 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 01:34:04,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 01:34:04,394 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:34:04,394 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:34:04,394 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 01:34:04,394 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:34:04,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:34:04,395 INFO L85 PathProgramCache]: Analyzing trace with hash 306506437, now seen corresponding path program 1 times [2022-04-15 01:34:04,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:34:04,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594009373] [2022-04-15 01:34:04,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:34:04,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:34:04,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:34:04,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:34:04,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:34:04,524 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) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 21) (= (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:04,524 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:04,524 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:04,525 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:04,525 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) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 21) (= (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:04,525 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:04,525 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:04,526 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:04,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {208#true} [52] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~x~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~n~0_3 |v_main_#t~nondet2_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~x~0=v_main_~x~0_4, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_#t~nondet2, main_~n~0] {208#true} is VALID [2022-04-15 01:34:04,526 INFO L290 TraceCheckUtils]: 6: Hoare triple {208#true} [55] L22-->L23-2: Formula: (and (< 0 v_main_~n~0_6) (= v_main_~x~0_7 0)) InVars {main_~x~0=v_main_~x~0_7, main_~n~0=v_main_~n~0_6} OutVars{main_~x~0=v_main_~x~0_7, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {213#(<= (+ main_~x~0 1) main_~n~0)} is VALID [2022-04-15 01:34:04,527 INFO L290 TraceCheckUtils]: 7: Hoare triple {213#(<= (+ main_~x~0 1) main_~n~0)} [59] L23-2-->L23-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_2) (< v_main_~x~0_3 v_main_~n~0_2)) InVars {main_~x~0=v_main_~x~0_3, main_~n~0=v_main_~n~0_2} OutVars{main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {214#(< main_~x~0 (+ main_~n~0 1))} is VALID [2022-04-15 01:34:04,528 INFO L290 TraceCheckUtils]: 8: Hoare triple {214#(< main_~x~0 (+ main_~n~0 1))} [58] L23-2-->L23-3: Formula: (not (< v_main_~x~0_1 v_main_~n~0_1)) InVars {main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {215#(and (< main_~x~0 (+ main_~n~0 1)) (<= main_~n~0 main_~x~0))} is VALID [2022-04-15 01:34:04,528 INFO L272 TraceCheckUtils]: 9: Hoare triple {215#(and (< main_~x~0 (+ main_~n~0 1)) (<= main_~n~0 main_~x~0))} [60] L23-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~n~0_7 v_main_~x~0_8) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~n~0=v_main_~n~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {216#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 01:34:04,529 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:04,529 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:04,529 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:04,530 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:04,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:34:04,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594009373] [2022-04-15 01:34:04,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594009373] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 01:34:04,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476908834] [2022-04-15 01:34:04,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:34:04,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:34:04,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:34:04,555 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:04,562 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:04,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:34:04,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 01:34:04,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:34:04,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:34:04,904 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:04,905 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) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 21) (= (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:04,905 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:04,905 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:04,906 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:04,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {208#true} [52] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~x~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~n~0_3 |v_main_#t~nondet2_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~x~0=v_main_~x~0_4, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_#t~nondet2, main_~n~0] {208#true} is VALID [2022-04-15 01:34:04,908 INFO L290 TraceCheckUtils]: 6: Hoare triple {208#true} [55] L22-->L23-2: Formula: (and (< 0 v_main_~n~0_6) (= v_main_~x~0_7 0)) InVars {main_~x~0=v_main_~x~0_7, main_~n~0=v_main_~n~0_6} OutVars{main_~x~0=v_main_~x~0_7, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {240#(and (< 0 main_~n~0) (<= main_~x~0 0))} is VALID [2022-04-15 01:34:04,909 INFO L290 TraceCheckUtils]: 7: Hoare triple {240#(and (< 0 main_~n~0) (<= main_~x~0 0))} [59] L23-2-->L23-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_2) (< v_main_~x~0_3 v_main_~n~0_2)) InVars {main_~x~0=v_main_~x~0_3, main_~n~0=v_main_~n~0_2} OutVars{main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {244#(and (< 0 main_~n~0) (<= main_~x~0 1))} is VALID [2022-04-15 01:34:04,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {244#(and (< 0 main_~n~0) (<= main_~x~0 1))} [58] L23-2-->L23-3: Formula: (not (< v_main_~x~0_1 v_main_~n~0_1)) InVars {main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {248#(and (< 0 main_~n~0) (not (< main_~x~0 main_~n~0)) (<= main_~x~0 1))} is VALID [2022-04-15 01:34:04,910 INFO L272 TraceCheckUtils]: 9: Hoare triple {248#(and (< 0 main_~n~0) (not (< main_~x~0 main_~n~0)) (<= main_~x~0 1))} [60] L23-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~n~0_7 v_main_~x~0_8) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~n~0=v_main_~n~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {252#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:34:04,911 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:04,911 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:04,911 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:04,912 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:04,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:34:05,032 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:05,033 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:05,034 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:05,035 INFO L272 TraceCheckUtils]: 9: Hoare triple {215#(and (< main_~x~0 (+ main_~n~0 1)) (<= main_~n~0 main_~x~0))} [60] L23-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~n~0_7 v_main_~x~0_8) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~n~0=v_main_~n~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {252#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:34:05,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {214#(< main_~x~0 (+ main_~n~0 1))} [58] L23-2-->L23-3: Formula: (not (< v_main_~x~0_1 v_main_~n~0_1)) InVars {main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {215#(and (< main_~x~0 (+ main_~n~0 1)) (<= main_~n~0 main_~x~0))} is VALID [2022-04-15 01:34:05,036 INFO L290 TraceCheckUtils]: 7: Hoare triple {213#(<= (+ main_~x~0 1) main_~n~0)} [59] L23-2-->L23-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_2) (< v_main_~x~0_3 v_main_~n~0_2)) InVars {main_~x~0=v_main_~x~0_3, main_~n~0=v_main_~n~0_2} OutVars{main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0, main_#t~post3] {214#(< main_~x~0 (+ main_~n~0 1))} is VALID [2022-04-15 01:34:05,037 INFO L290 TraceCheckUtils]: 6: Hoare triple {208#true} [55] L22-->L23-2: Formula: (and (< 0 v_main_~n~0_6) (= v_main_~x~0_7 0)) InVars {main_~x~0=v_main_~x~0_7, main_~n~0=v_main_~n~0_6} OutVars{main_~x~0=v_main_~x~0_7, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {213#(<= (+ main_~x~0 1) main_~n~0)} is VALID [2022-04-15 01:34:05,037 INFO L290 TraceCheckUtils]: 5: Hoare triple {208#true} [52] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~x~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~n~0_3 |v_main_#t~nondet2_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~x~0=v_main_~x~0_4, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_#t~nondet2, main_~n~0] {208#true} is VALID [2022-04-15 01:34:05,037 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:05,037 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:05,038 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:05,038 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) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 21) (= (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:05,038 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:05,038 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:05,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476908834] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 01:34:05,039 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 01:34:05,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-04-15 01:34:05,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127836862] [2022-04-15 01:34:05,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 01:34:05,040 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 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:05,040 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:34:05,040 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 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:05,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:34:05,054 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 01:34:05,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:34:05,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 01:34:05,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-04-15 01:34:05,056 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 13 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 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:05,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:34:05,206 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-04-15 01:34:05,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 01:34:05,206 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 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:05,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:34:05,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 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:05,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2022-04-15 01:34:05,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 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:05,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2022-04-15 01:34:05,208 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 17 transitions. [2022-04-15 01:34:05,221 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:05,221 INFO L225 Difference]: With dead ends: 16 [2022-04-15 01:34:05,221 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 01:34:05,222 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2022-04-15 01:34:05,222 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 9 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 01:34:05,223 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 30 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 01:34:05,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 01:34:05,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 01:34:05,223 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:34:05,223 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:05,223 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:05,224 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:05,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:34:05,224 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 01:34:05,224 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 01:34:05,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:34:05,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:34:05,224 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:05,224 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:05,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:34:05,224 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 01:34:05,224 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 01:34:05,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:34:05,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:34:05,225 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:34:05,225 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:34:05,225 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:05,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 01:34:05,225 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2022-04-15 01:34:05,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:34:05,225 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 01:34:05,225 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 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:05,225 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 01:34:05,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:34:05,227 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 01:34:05,247 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:05,443 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:05,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 01:34:05,479 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:05,480 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-15 01:34:05,480 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-15 01:34:05,480 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 01:34:05,480 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 01:34:05,480 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-15 01:34:05,480 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-15 01:34:05,480 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 19 28) the Hoare annotation is: true [2022-04-15 01:34:05,480 INFO L882 garLoopResultBuilder]: For program point L22(line 22) no Hoare annotation was computed. [2022-04-15 01:34:05,480 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 19 28) no Hoare annotation was computed. [2022-04-15 01:34:05,480 INFO L878 garLoopResultBuilder]: At program point L23-2(lines 23 25) the Hoare annotation is: (< main_~x~0 (+ main_~n~0 1)) [2022-04-15 01:34:05,480 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 19 28) no Hoare annotation was computed. [2022-04-15 01:34:05,481 INFO L878 garLoopResultBuilder]: At program point L23-3(lines 23 25) the Hoare annotation is: (and (< main_~x~0 (+ main_~n~0 1)) (<= main_~n~0 main_~x~0)) [2022-04-15 01:34:05,481 INFO L882 garLoopResultBuilder]: For program point L26(line 26) no Hoare annotation was computed. [2022-04-15 01:34:05,481 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 18) the Hoare annotation is: true [2022-04-15 01:34:05,481 INFO L882 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2022-04-15 01:34:05,481 INFO L882 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-04-15 01:34:05,481 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 18) no Hoare annotation was computed. [2022-04-15 01:34:05,481 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2022-04-15 01:34:05,481 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 18) no Hoare annotation was computed. [2022-04-15 01:34:05,483 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-15 01:34:05,484 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 01:34:05,486 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 01:34:05,486 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-15 01:34:05,487 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 01:34:05,487 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 01:34:05,487 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-15 01:34:05,487 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-15 01:34:05,487 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 01:34:05,487 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 01:34:05,487 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 01:34:05,487 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 01:34:05,489 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-15 01:34:05,489 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-15 01:34:05,489 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-15 01:34:05,489 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 01:34:05,489 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 01:34:05,489 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 01:34:05,489 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-15 01:34:05,489 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:05,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 01:34:05 BasicIcfg [2022-04-15 01:34:05,495 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 01:34:05,496 INFO L158 Benchmark]: Toolchain (without parser) took 2284.34ms. Allocated memory was 172.0MB in the beginning and 206.6MB in the end (delta: 34.6MB). Free memory was 119.7MB in the beginning and 106.5MB in the end (delta: 13.3MB). Peak memory consumption was 48.5MB. Max. memory is 8.0GB. [2022-04-15 01:34:05,496 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 172.0MB. Free memory was 135.7MB in the beginning and 135.5MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 01:34:05,497 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.94ms. Allocated memory is still 172.0MB. Free memory was 119.5MB in the beginning and 148.1MB in the end (delta: -28.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-15 01:34:05,497 INFO L158 Benchmark]: Boogie Preprocessor took 25.89ms. Allocated memory is still 172.0MB. Free memory was 148.1MB in the beginning and 146.7MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 01:34:05,497 INFO L158 Benchmark]: RCFGBuilder took 190.72ms. Allocated memory is still 172.0MB. Free memory was 146.7MB in the beginning and 135.9MB in the end (delta: 10.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 01:34:05,497 INFO L158 Benchmark]: IcfgTransformer took 18.77ms. Allocated memory is still 172.0MB. Free memory was 135.9MB in the beginning and 134.4MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 01:34:05,498 INFO L158 Benchmark]: TraceAbstraction took 1819.94ms. Allocated memory was 172.0MB in the beginning and 206.6MB in the end (delta: 34.6MB). Free memory was 134.2MB in the beginning and 106.5MB in the end (delta: 27.7MB). Peak memory consumption was 63.3MB. Max. memory is 8.0GB. [2022-04-15 01:34:05,499 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 172.0MB. Free memory was 135.7MB in the beginning and 135.5MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 222.94ms. Allocated memory is still 172.0MB. Free memory was 119.5MB in the beginning and 148.1MB in the end (delta: -28.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.89ms. Allocated memory is still 172.0MB. Free memory was 148.1MB in the beginning and 146.7MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 190.72ms. Allocated memory is still 172.0MB. Free memory was 146.7MB in the beginning and 135.9MB in the end (delta: 10.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 18.77ms. Allocated memory is still 172.0MB. Free memory was 135.9MB in the beginning and 134.4MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 1819.94ms. Allocated memory was 172.0MB in the beginning and 206.6MB in the end (delta: 34.6MB). Free memory was 134.2MB in the beginning and 106.5MB in the end (delta: 27.7MB). Peak memory consumption was 63.3MB. 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: 1.7s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 29 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 72 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 43 IncrementalHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 40 mSDtfsCounter, 43 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s 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, 25 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 32 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 58 ConstructedInterpolants, 0 QuantifiedInterpolants, 148 SizeOfPredicates, 3 NumberOfNonLiveVariables, 59 ConjunctsInSsa, 7 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: 23]: Loop Invariant Derived loop invariant: x < n + 1 RESULT: Ultimate proved your program to be correct! [2022-04-15 01:34:05,520 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...