/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/loops/sum01_bug02_sum01_bug02_base.case.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 00:05:35,051 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 00:05:35,052 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 00:05:35,072 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 00:05:35,072 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 00:05:35,073 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 00:05:35,074 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 00:05:35,075 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 00:05:35,076 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 00:05:35,076 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 00:05:35,077 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 00:05:35,077 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 00:05:35,078 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 00:05:35,078 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 00:05:35,079 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 00:05:35,080 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 00:05:35,080 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 00:05:35,080 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 00:05:35,081 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 00:05:35,082 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 00:05:35,083 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 00:05:35,084 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 00:05:35,085 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 00:05:35,085 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 00:05:35,086 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 00:05:35,087 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 00:05:35,087 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 00:05:35,088 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 00:05:35,088 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 00:05:35,088 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 00:05:35,089 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 00:05:35,089 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 00:05:35,089 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 00:05:35,090 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 00:05:35,090 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 00:05:35,091 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 00:05:35,091 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 00:05:35,091 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 00:05:35,091 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 00:05:35,091 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 00:05:35,092 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 00:05:35,094 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 00:05:35,094 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 00:05:35,107 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 00:05:35,107 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 00:05:35,107 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 00:05:35,108 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 00:05:35,108 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 00:05:35,108 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 00:05:35,108 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 00:05:35,108 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 00:05:35,108 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 00:05:35,108 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 00:05:35,108 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 00:05:35,109 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 00:05:35,109 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 00:05:35,109 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 00:05:35,109 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 00:05:35,109 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 00:05:35,109 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 00:05:35,109 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 00:05:35,109 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 00:05:35,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:05:35,110 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 00:05:35,110 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 00:05:35,110 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 00:05:35,110 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 00:05:35,110 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 00:05:35,110 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 00:05:35,110 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 00:05:35,110 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 00:05:35,111 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 00:05:35,111 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 00:05:35,301 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 00:05:35,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 00:05:35,321 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 00:05:35,321 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 00:05:35,322 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 00:05:35,324 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01_bug02_sum01_bug02_base.case.i [2022-04-15 00:05:35,373 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4890e6a8b/4792e973b2904c88acb8117bd760276e/FLAG0ebb69ad0 [2022-04-15 00:05:35,727 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 00:05:35,728 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01_bug02_sum01_bug02_base.case.i [2022-04-15 00:05:35,733 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4890e6a8b/4792e973b2904c88acb8117bd760276e/FLAG0ebb69ad0 [2022-04-15 00:05:35,747 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4890e6a8b/4792e973b2904c88acb8117bd760276e [2022-04-15 00:05:35,749 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 00:05:35,750 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 00:05:35,752 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 00:05:35,752 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 00:05:35,755 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 00:05:35,758 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:05:35" (1/1) ... [2022-04-15 00:05:35,773 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a129829 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:35, skipping insertion in model container [2022-04-15 00:05:35,774 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:05:35" (1/1) ... [2022-04-15 00:05:35,779 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 00:05:35,789 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 00:05:35,919 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01_bug02_sum01_bug02_base.case.i[834,847] [2022-04-15 00:05:35,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:05:35,945 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 00:05:35,953 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01_bug02_sum01_bug02_base.case.i[834,847] [2022-04-15 00:05:35,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:05:35,967 INFO L208 MainTranslator]: Completed translation [2022-04-15 00:05:35,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:35 WrapperNode [2022-04-15 00:05:35,968 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 00:05:35,969 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 00:05:35,969 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 00:05:35,969 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 00:05:35,976 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:35" (1/1) ... [2022-04-15 00:05:35,976 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:35" (1/1) ... [2022-04-15 00:05:35,980 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:35" (1/1) ... [2022-04-15 00:05:35,980 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:35" (1/1) ... [2022-04-15 00:05:35,988 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:35" (1/1) ... [2022-04-15 00:05:35,992 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:35" (1/1) ... [2022-04-15 00:05:35,993 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:35" (1/1) ... [2022-04-15 00:05:35,998 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 00:05:35,999 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 00:05:35,999 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 00:05:35,999 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 00:05:36,000 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:35" (1/1) ... [2022-04-15 00:05:36,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:05:36,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:05:36,052 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 00:05:36,065 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 00:05:36,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 00:05:36,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 00:05:36,087 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 00:05:36,087 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 00:05:36,088 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 00:05:36,088 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 00:05:36,088 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 00:05:36,089 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 00:05:36,089 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 00:05:36,089 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 00:05:36,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 00:05:36,090 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 00:05:36,090 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 00:05:36,090 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 00:05:36,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 00:05:36,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 00:05:36,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 00:05:36,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 00:05:36,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 00:05:36,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 00:05:36,135 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 00:05:36,136 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 00:05:36,275 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 00:05:36,279 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 00:05:36,280 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 00:05:36,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:05:36 BoogieIcfgContainer [2022-04-15 00:05:36,281 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 00:05:36,281 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 00:05:36,282 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 00:05:36,296 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 00:05:36,298 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:05:36" (1/1) ... [2022-04-15 00:05:36,299 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 00:05:36,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:05:36 BasicIcfg [2022-04-15 00:05:36,310 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 00:05:36,311 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 00:05:36,312 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 00:05:36,328 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 00:05:36,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:05:35" (1/4) ... [2022-04-15 00:05:36,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cb548cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:05:36, skipping insertion in model container [2022-04-15 00:05:36,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:35" (2/4) ... [2022-04-15 00:05:36,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cb548cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:05:36, skipping insertion in model container [2022-04-15 00:05:36,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:05:36" (3/4) ... [2022-04-15 00:05:36,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cb548cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:05:36, skipping insertion in model container [2022-04-15 00:05:36,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:05:36" (4/4) ... [2022-04-15 00:05:36,330 INFO L111 eAbstractionObserver]: Analyzing ICFG sum01_bug02_sum01_bug02_base.case.iqvasr [2022-04-15 00:05:36,334 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 00:05:36,334 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 00:05:36,372 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 00:05:36,377 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 00:05:36,378 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 00:05:36,391 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 00:05:36,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 00:05:36,394 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:05:36,395 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:05:36,395 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:05:36,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:05:36,402 INFO L85 PathProgramCache]: Analyzing trace with hash -423489079, now seen corresponding path program 1 times [2022-04-15 00:05:36,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:05:36,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681145549] [2022-04-15 00:05:36,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:05:36,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:05:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:36,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:05:36,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:36,559 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [52] 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) 36) (= (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 00:05:36,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-15 00:05:36,559 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} [70] 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 00:05:36,561 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} [50] 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 00:05:36,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [52] 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) 36) (= (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 00:05:36,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-15 00:05:36,562 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} [70] 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 00:05:36,562 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-15 00:05:36,562 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_2 0) (= v_main_~n~0_1 (let ((.cse0 (mod |v_main_#t~nondet1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) (= v_main_~i~0_5 1)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_1, main_~sn~0=v_main_~sn~0_2} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {23#true} is VALID [2022-04-15 00:05:36,563 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} [56] L24-3-->L24-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-15 00:05:36,563 INFO L272 TraceCheckUtils]: 7: Hoare triple {24#false} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_6 (* v_main_~n~0_5 2)) (= v_main_~sn~0_6 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_6, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {24#false} is VALID [2022-04-15 00:05:36,563 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} [63] __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 00:05:36,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} [65] 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 00:05:36,564 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-15 00:05:36,564 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 00:05:36,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:05:36,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681145549] [2022-04-15 00:05:36,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681145549] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:05:36,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:05:36,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 00:05:36,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128042884] [2022-04-15 00:05:36,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:05:36,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-15 00:05:36,571 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:05:36,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 00:05:36,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:05:36,595 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 00:05:36,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:05:36,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 00:05:36,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 00:05:36,622 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.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 00:05:36,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:05:36,689 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-04-15 00:05:36,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 00:05:36,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-15 00:05:36,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:05:36,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 00:05:36,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-15 00:05:36,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 00:05:36,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-15 00:05:36,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 35 transitions. [2022-04-15 00:05:36,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:05:36,756 INFO L225 Difference]: With dead ends: 31 [2022-04-15 00:05:36,756 INFO L226 Difference]: Without dead ends: 14 [2022-04-15 00:05:36,763 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 00:05:36,765 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 00:05:36,766 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 00:05:36,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-15 00:05:36,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-15 00:05:36,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:05:36,814 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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 00:05:36,814 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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 00:05:36,815 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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 00:05:36,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:05:36,816 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-15 00:05:36,816 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-15 00:05:36,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:05:36,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:05:36,817 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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 00:05:36,817 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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 00:05:36,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:05:36,819 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-15 00:05:36,819 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-15 00:05:36,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:05:36,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:05:36,819 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:05:36,819 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:05:36,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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 00:05:36,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-15 00:05:36,821 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-15 00:05:36,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:05:36,821 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-15 00:05:36,822 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 00:05:36,822 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-15 00:05:36,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 00:05:36,822 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:05:36,822 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:05:36,822 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 00:05:36,823 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:05:36,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:05:36,823 INFO L85 PathProgramCache]: Analyzing trace with hash -422565558, now seen corresponding path program 1 times [2022-04-15 00:05:36,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:05:36,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658298359] [2022-04-15 00:05:36,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:05:36,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:05:36,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:36,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:05:36,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:36,931 INFO L290 TraceCheckUtils]: 0: Hoare triple {128#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [52] 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) 36) (= (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] {120#true} is VALID [2022-04-15 00:05:36,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {120#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {120#true} is VALID [2022-04-15 00:05:36,931 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {120#true} {120#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {120#true} is VALID [2022-04-15 00:05:36,932 INFO L272 TraceCheckUtils]: 0: Hoare triple {120#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {128#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:05:36,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {128#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [52] 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) 36) (= (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] {120#true} is VALID [2022-04-15 00:05:36,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {120#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {120#true} is VALID [2022-04-15 00:05:36,933 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {120#true} {120#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {120#true} is VALID [2022-04-15 00:05:36,933 INFO L272 TraceCheckUtils]: 4: Hoare triple {120#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {120#true} is VALID [2022-04-15 00:05:36,933 INFO L290 TraceCheckUtils]: 5: Hoare triple {120#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_2 0) (= v_main_~n~0_1 (let ((.cse0 (mod |v_main_#t~nondet1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) (= v_main_~i~0_5 1)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_1, main_~sn~0=v_main_~sn~0_2} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {125#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-15 00:05:36,934 INFO L290 TraceCheckUtils]: 6: Hoare triple {125#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {125#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-15 00:05:36,935 INFO L272 TraceCheckUtils]: 7: Hoare triple {125#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_6 (* v_main_~n~0_5 2)) (= v_main_~sn~0_6 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_6, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {126#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 00:05:36,935 INFO L290 TraceCheckUtils]: 8: Hoare triple {126#(not (= |__VERIFIER_assert_#in~cond| 0))} [63] __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] {127#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:05:36,936 INFO L290 TraceCheckUtils]: 9: Hoare triple {127#(not (= __VERIFIER_assert_~cond 0))} [65] 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[] {121#false} is VALID [2022-04-15 00:05:36,936 INFO L290 TraceCheckUtils]: 10: Hoare triple {121#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {121#false} is VALID [2022-04-15 00:05:36,936 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 00:05:36,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:05:36,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658298359] [2022-04-15 00:05:36,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658298359] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:05:36,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:05:36,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 00:05:36,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137168689] [2022-04-15 00:05:36,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:05:36,938 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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 11 [2022-04-15 00:05:36,938 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:05:36,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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 00:05:36,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:05:36,947 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 00:05:36,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:05:36,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 00:05:36,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 00:05:36,948 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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 00:05:37,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:05:37,072 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-15 00:05:37,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 00:05:37,073 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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 11 [2022-04-15 00:05:37,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:05:37,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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 00:05:37,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2022-04-15 00:05:37,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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 00:05:37,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2022-04-15 00:05:37,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 21 transitions. [2022-04-15 00:05:37,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:05:37,118 INFO L225 Difference]: With dead ends: 20 [2022-04-15 00:05:37,119 INFO L226 Difference]: Without dead ends: 15 [2022-04-15 00:05:37,119 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-15 00:05:37,120 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 00:05:37,120 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 29 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 00:05:37,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-15 00:05:37,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-15 00:05:37,123 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:05:37,123 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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 00:05:37,123 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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 00:05:37,123 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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 00:05:37,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:05:37,124 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-15 00:05:37,125 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 00:05:37,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:05:37,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:05:37,125 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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 15 states. [2022-04-15 00:05:37,125 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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 15 states. [2022-04-15 00:05:37,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:05:37,126 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-15 00:05:37,126 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 00:05:37,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:05:37,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:05:37,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:05:37,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:05:37,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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 00:05:37,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-15 00:05:37,128 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2022-04-15 00:05:37,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:05:37,128 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-15 00:05:37,128 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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 00:05:37,128 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 00:05:37,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 00:05:37,129 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:05:37,129 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:05:37,129 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 00:05:37,129 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:05:37,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:05:37,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1744981802, now seen corresponding path program 1 times [2022-04-15 00:05:37,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:05:37,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363929320] [2022-04-15 00:05:37,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:05:37,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:05:37,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:37,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:05:37,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:37,166 INFO L290 TraceCheckUtils]: 0: Hoare triple {226#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [52] 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) 36) (= (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] {220#true} is VALID [2022-04-15 00:05:37,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {220#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {220#true} is VALID [2022-04-15 00:05:37,166 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {220#true} {220#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {220#true} is VALID [2022-04-15 00:05:37,167 INFO L272 TraceCheckUtils]: 0: Hoare triple {220#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:05:37,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {226#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [52] 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) 36) (= (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] {220#true} is VALID [2022-04-15 00:05:37,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {220#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {220#true} is VALID [2022-04-15 00:05:37,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {220#true} {220#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {220#true} is VALID [2022-04-15 00:05:37,167 INFO L272 TraceCheckUtils]: 4: Hoare triple {220#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {220#true} is VALID [2022-04-15 00:05:37,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {220#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_2 0) (= v_main_~n~0_1 (let ((.cse0 (mod |v_main_#t~nondet1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) (= v_main_~i~0_5 1)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_1, main_~sn~0=v_main_~sn~0_2} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {225#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-15 00:05:37,168 INFO L290 TraceCheckUtils]: 6: Hoare triple {225#(= (+ (- 1) main_~i~0) 0)} [58] L24-3-->L26: Formula: (and (= v_main_~sn~0_4 (+ v_main_~sn~0_5 2)) (<= v_main_~i~0_9 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_5} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_4} AuxVars[] AssignedVars[main_~sn~0] {225#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-15 00:05:37,169 INFO L290 TraceCheckUtils]: 7: Hoare triple {225#(= (+ (- 1) main_~i~0) 0)} [60] L26-->L24-2: Formula: (and (= v_main_~sn~0_1 (- 10)) (= v_main_~i~0_1 4)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {221#false} is VALID [2022-04-15 00:05:37,169 INFO L290 TraceCheckUtils]: 8: Hoare triple {221#false} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {221#false} is VALID [2022-04-15 00:05:37,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {221#false} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {221#false} is VALID [2022-04-15 00:05:37,169 INFO L272 TraceCheckUtils]: 10: Hoare triple {221#false} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_6 (* v_main_~n~0_5 2)) (= v_main_~sn~0_6 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_6, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {221#false} is VALID [2022-04-15 00:05:37,170 INFO L290 TraceCheckUtils]: 11: Hoare triple {221#false} [63] __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] {221#false} is VALID [2022-04-15 00:05:37,170 INFO L290 TraceCheckUtils]: 12: Hoare triple {221#false} [65] 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[] {221#false} is VALID [2022-04-15 00:05:37,170 INFO L290 TraceCheckUtils]: 13: Hoare triple {221#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {221#false} is VALID [2022-04-15 00:05:37,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:05:37,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:05:37,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363929320] [2022-04-15 00:05:37,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363929320] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:05:37,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:05:37,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 00:05:37,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846091804] [2022-04-15 00:05:37,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:05:37,171 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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 14 [2022-04-15 00:05:37,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:05:37,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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 00:05:37,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:05:37,181 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 00:05:37,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:05:37,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 00:05:37,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 00:05:37,182 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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 00:05:37,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:05:37,219 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-15 00:05:37,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 00:05:37,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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 14 [2022-04-15 00:05:37,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:05:37,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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 00:05:37,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-15 00:05:37,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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 00:05:37,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-15 00:05:37,222 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 28 transitions. [2022-04-15 00:05:37,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:05:37,243 INFO L225 Difference]: With dead ends: 25 [2022-04-15 00:05:37,243 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 00:05:37,243 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 00:05:37,244 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 00:05:37,244 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 19 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 00:05:37,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 00:05:37,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-04-15 00:05:37,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:05:37,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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 00:05:37,247 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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 00:05:37,247 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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 00:05:37,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:05:37,248 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-15 00:05:37,248 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-15 00:05:37,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:05:37,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:05:37,248 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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 17 states. [2022-04-15 00:05:37,249 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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 17 states. [2022-04-15 00:05:37,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:05:37,250 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-15 00:05:37,250 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-15 00:05:37,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:05:37,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:05:37,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:05:37,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:05:37,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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 00:05:37,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-15 00:05:37,251 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2022-04-15 00:05:37,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:05:37,251 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-15 00:05:37,252 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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 00:05:37,252 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-15 00:05:37,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 00:05:37,252 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:05:37,252 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:05:37,252 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 00:05:37,252 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:05:37,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:05:37,253 INFO L85 PathProgramCache]: Analyzing trace with hash -857478121, now seen corresponding path program 1 times [2022-04-15 00:05:37,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:05:37,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958748478] [2022-04-15 00:05:37,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:05:37,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:05:37,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:37,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:05:37,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:37,401 INFO L290 TraceCheckUtils]: 0: Hoare triple {336#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [52] 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) 36) (= (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] {325#true} is VALID [2022-04-15 00:05:37,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {325#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {325#true} is VALID [2022-04-15 00:05:37,401 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {325#true} {325#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {325#true} is VALID [2022-04-15 00:05:37,402 INFO L272 TraceCheckUtils]: 0: Hoare triple {325#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {336#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:05:37,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {336#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [52] 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) 36) (= (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] {325#true} is VALID [2022-04-15 00:05:37,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {325#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {325#true} is VALID [2022-04-15 00:05:37,402 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {325#true} {325#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {325#true} is VALID [2022-04-15 00:05:37,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {325#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {325#true} is VALID [2022-04-15 00:05:37,403 INFO L290 TraceCheckUtils]: 5: Hoare triple {325#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_2 0) (= v_main_~n~0_1 (let ((.cse0 (mod |v_main_#t~nondet1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) (= v_main_~i~0_5 1)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_1, main_~sn~0=v_main_~sn~0_2} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {330#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-15 00:05:37,404 INFO L290 TraceCheckUtils]: 6: Hoare triple {330#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} [58] L24-3-->L26: Formula: (and (= v_main_~sn~0_4 (+ v_main_~sn~0_5 2)) (<= v_main_~i~0_9 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_5} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_4} AuxVars[] AssignedVars[main_~sn~0] {331#(and (or (<= (* main_~n~0 2) main_~sn~0) (<= 2 main_~sn~0)) (= (+ (- 1) main_~i~0) 0) (not (<= (+ (* main_~n~0 2) 1) main_~sn~0)))} is VALID [2022-04-15 00:05:37,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {331#(and (or (<= (* main_~n~0 2) main_~sn~0) (<= 2 main_~sn~0)) (= (+ (- 1) main_~i~0) 0) (not (<= (+ (* main_~n~0 2) 1) main_~sn~0)))} [61] L26-->L24-2: Formula: (not (= v_main_~i~0_2 4)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {331#(and (or (<= (* main_~n~0 2) main_~sn~0) (<= 2 main_~sn~0)) (= (+ (- 1) main_~i~0) 0) (not (<= (+ (* main_~n~0 2) 1) main_~sn~0)))} is VALID [2022-04-15 00:05:37,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {331#(and (or (<= (* main_~n~0 2) main_~sn~0) (<= 2 main_~sn~0)) (= (+ (- 1) main_~i~0) 0) (not (<= (+ (* main_~n~0 2) 1) main_~sn~0)))} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {332#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0)))} is VALID [2022-04-15 00:05:37,406 INFO L290 TraceCheckUtils]: 9: Hoare triple {332#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0)))} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {333#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-15 00:05:37,407 INFO L272 TraceCheckUtils]: 10: Hoare triple {333#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_6 (* v_main_~n~0_5 2)) (= v_main_~sn~0_6 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_6, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {334#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 00:05:37,407 INFO L290 TraceCheckUtils]: 11: Hoare triple {334#(not (= |__VERIFIER_assert_#in~cond| 0))} [63] __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] {335#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:05:37,408 INFO L290 TraceCheckUtils]: 12: Hoare triple {335#(not (= __VERIFIER_assert_~cond 0))} [65] 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[] {326#false} is VALID [2022-04-15 00:05:37,408 INFO L290 TraceCheckUtils]: 13: Hoare triple {326#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {326#false} is VALID [2022-04-15 00:05:37,408 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 00:05:37,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:05:37,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958748478] [2022-04-15 00:05:37,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958748478] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:05:37,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193132766] [2022-04-15 00:05:37,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:05:37,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:05:37,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:05:37,415 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 00:05:37,445 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 00:05:37,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:37,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 00:05:37,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:37,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:05:37,747 INFO L272 TraceCheckUtils]: 0: Hoare triple {325#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {325#true} is VALID [2022-04-15 00:05:37,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {325#true} [52] 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) 36) (= (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] {325#true} is VALID [2022-04-15 00:05:37,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {325#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {325#true} is VALID [2022-04-15 00:05:37,748 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {325#true} {325#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {325#true} is VALID [2022-04-15 00:05:37,748 INFO L272 TraceCheckUtils]: 4: Hoare triple {325#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {325#true} is VALID [2022-04-15 00:05:37,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {325#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_2 0) (= v_main_~n~0_1 (let ((.cse0 (mod |v_main_#t~nondet1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) (= v_main_~i~0_5 1)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_1, main_~sn~0=v_main_~sn~0_2} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {330#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-15 00:05:37,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {330#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} [58] L24-3-->L26: Formula: (and (= v_main_~sn~0_4 (+ v_main_~sn~0_5 2)) (<= v_main_~i~0_9 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_5} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_4} AuxVars[] AssignedVars[main_~sn~0] {358#(and (<= main_~i~0 main_~n~0) (= 2 main_~sn~0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-15 00:05:37,750 INFO L290 TraceCheckUtils]: 7: Hoare triple {358#(and (<= main_~i~0 main_~n~0) (= 2 main_~sn~0) (= (+ (- 1) main_~i~0) 0))} [61] L26-->L24-2: Formula: (not (= v_main_~i~0_2 4)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {358#(and (<= main_~i~0 main_~n~0) (= 2 main_~sn~0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-15 00:05:37,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {358#(and (<= main_~i~0 main_~n~0) (= 2 main_~sn~0) (= (+ (- 1) main_~i~0) 0))} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {365#(and (<= 1 main_~n~0) (= 2 main_~sn~0) (<= main_~i~0 2))} is VALID [2022-04-15 00:05:37,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {365#(and (<= 1 main_~n~0) (= 2 main_~sn~0) (<= main_~i~0 2))} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {369#(and (<= 1 main_~n~0) (= 2 main_~sn~0) (< main_~n~0 2))} is VALID [2022-04-15 00:05:37,752 INFO L272 TraceCheckUtils]: 10: Hoare triple {369#(and (<= 1 main_~n~0) (= 2 main_~sn~0) (< main_~n~0 2))} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_6 (* v_main_~n~0_5 2)) (= v_main_~sn~0_6 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_6, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {373#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:05:37,752 INFO L290 TraceCheckUtils]: 11: Hoare triple {373#(<= 1 |__VERIFIER_assert_#in~cond|)} [63] __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] {377#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:05:37,753 INFO L290 TraceCheckUtils]: 12: Hoare triple {377#(<= 1 __VERIFIER_assert_~cond)} [65] 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[] {326#false} is VALID [2022-04-15 00:05:37,753 INFO L290 TraceCheckUtils]: 13: Hoare triple {326#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {326#false} is VALID [2022-04-15 00:05:37,753 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 00:05:37,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 00:05:37,987 INFO L290 TraceCheckUtils]: 13: Hoare triple {326#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {326#false} is VALID [2022-04-15 00:05:37,988 INFO L290 TraceCheckUtils]: 12: Hoare triple {377#(<= 1 __VERIFIER_assert_~cond)} [65] 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[] {326#false} is VALID [2022-04-15 00:05:37,988 INFO L290 TraceCheckUtils]: 11: Hoare triple {373#(<= 1 |__VERIFIER_assert_#in~cond|)} [63] __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] {377#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:05:37,989 INFO L272 TraceCheckUtils]: 10: Hoare triple {393#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_6 (* v_main_~n~0_5 2)) (= v_main_~sn~0_6 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_6, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {373#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:05:37,990 INFO L290 TraceCheckUtils]: 9: Hoare triple {397#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {393#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-15 00:05:37,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {401#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {397#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-15 00:05:37,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {401#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} [61] L26-->L24-2: Formula: (not (= v_main_~i~0_2 4)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {401#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-15 00:05:37,992 INFO L290 TraceCheckUtils]: 6: Hoare triple {408#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} [58] L24-3-->L26: Formula: (and (= v_main_~sn~0_4 (+ v_main_~sn~0_5 2)) (<= v_main_~i~0_9 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_5} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_4} AuxVars[] AssignedVars[main_~sn~0] {401#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-15 00:05:37,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {325#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_2 0) (= v_main_~n~0_1 (let ((.cse0 (mod |v_main_#t~nondet1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) (= v_main_~i~0_5 1)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_1, main_~sn~0=v_main_~sn~0_2} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {408#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-15 00:05:37,993 INFO L272 TraceCheckUtils]: 4: Hoare triple {325#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {325#true} is VALID [2022-04-15 00:05:37,993 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {325#true} {325#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {325#true} is VALID [2022-04-15 00:05:37,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {325#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {325#true} is VALID [2022-04-15 00:05:37,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {325#true} [52] 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) 36) (= (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] {325#true} is VALID [2022-04-15 00:05:37,993 INFO L272 TraceCheckUtils]: 0: Hoare triple {325#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {325#true} is VALID [2022-04-15 00:05:37,994 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 00:05:37,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193132766] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 00:05:37,994 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 00:05:37,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-15 00:05:37,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301427513] [2022-04-15 00:05:37,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 00:05:37,995 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 4 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 14 [2022-04-15 00:05:37,995 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:05:37,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 4 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 00:05:38,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:05:38,015 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 00:05:38,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:05:38,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 00:05:38,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-04-15 00:05:38,016 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 18 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 4 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 00:05:38,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:05:38,396 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-15 00:05:38,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 00:05:38,396 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 4 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 14 [2022-04-15 00:05:38,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:05:38,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 4 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 00:05:38,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 31 transitions. [2022-04-15 00:05:38,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 4 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 00:05:38,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 31 transitions. [2022-04-15 00:05:38,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 31 transitions. [2022-04-15 00:05:38,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:05:38,425 INFO L225 Difference]: With dead ends: 28 [2022-04-15 00:05:38,425 INFO L226 Difference]: Without dead ends: 22 [2022-04-15 00:05:38,426 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2022-04-15 00:05:38,426 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 22 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 00:05:38,427 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 41 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 00:05:38,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-15 00:05:38,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-15 00:05:38,432 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:05:38,432 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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 00:05:38,432 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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 00:05:38,432 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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 00:05:38,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:05:38,433 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-15 00:05:38,433 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-15 00:05:38,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:05:38,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:05:38,434 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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 22 states. [2022-04-15 00:05:38,434 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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 22 states. [2022-04-15 00:05:38,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:05:38,435 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-15 00:05:38,435 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-15 00:05:38,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:05:38,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:05:38,435 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:05:38,436 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:05:38,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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 00:05:38,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-04-15 00:05:38,437 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 14 [2022-04-15 00:05:38,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:05:38,437 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-04-15 00:05:38,437 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 4 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 00:05:38,437 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-15 00:05:38,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 00:05:38,437 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:05:38,438 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:05:38,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 00:05:38,651 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:05:38,652 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:05:38,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:05:38,652 INFO L85 PathProgramCache]: Analyzing trace with hash -308814103, now seen corresponding path program 1 times [2022-04-15 00:05:38,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:05:38,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983636779] [2022-04-15 00:05:38,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:05:38,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:05:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:38,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:05:38,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:38,692 INFO L290 TraceCheckUtils]: 0: Hoare triple {570#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [52] 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) 36) (= (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] {563#true} is VALID [2022-04-15 00:05:38,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {563#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {563#true} is VALID [2022-04-15 00:05:38,692 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {563#true} {563#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {563#true} is VALID [2022-04-15 00:05:38,693 INFO L272 TraceCheckUtils]: 0: Hoare triple {563#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {570#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:05:38,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {570#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [52] 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) 36) (= (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] {563#true} is VALID [2022-04-15 00:05:38,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {563#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {563#true} is VALID [2022-04-15 00:05:38,693 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {563#true} {563#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {563#true} is VALID [2022-04-15 00:05:38,694 INFO L272 TraceCheckUtils]: 4: Hoare triple {563#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {563#true} is VALID [2022-04-15 00:05:38,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {563#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_2 0) (= v_main_~n~0_1 (let ((.cse0 (mod |v_main_#t~nondet1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) (= v_main_~i~0_5 1)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_1, main_~sn~0=v_main_~sn~0_2} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {568#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-15 00:05:38,695 INFO L290 TraceCheckUtils]: 6: Hoare triple {568#(= (+ (- 1) main_~i~0) 0)} [58] L24-3-->L26: Formula: (and (= v_main_~sn~0_4 (+ v_main_~sn~0_5 2)) (<= v_main_~i~0_9 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_5} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_4} AuxVars[] AssignedVars[main_~sn~0] {568#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-15 00:05:38,695 INFO L290 TraceCheckUtils]: 7: Hoare triple {568#(= (+ (- 1) main_~i~0) 0)} [61] L26-->L24-2: Formula: (not (= v_main_~i~0_2 4)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {568#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-15 00:05:38,695 INFO L290 TraceCheckUtils]: 8: Hoare triple {568#(= (+ (- 1) main_~i~0) 0)} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {569#(<= main_~i~0 2)} is VALID [2022-04-15 00:05:38,696 INFO L290 TraceCheckUtils]: 9: Hoare triple {569#(<= main_~i~0 2)} [58] L24-3-->L26: Formula: (and (= v_main_~sn~0_4 (+ v_main_~sn~0_5 2)) (<= v_main_~i~0_9 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_5} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_4} AuxVars[] AssignedVars[main_~sn~0] {569#(<= main_~i~0 2)} is VALID [2022-04-15 00:05:38,696 INFO L290 TraceCheckUtils]: 10: Hoare triple {569#(<= main_~i~0 2)} [60] L26-->L24-2: Formula: (and (= v_main_~sn~0_1 (- 10)) (= v_main_~i~0_1 4)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {564#false} is VALID [2022-04-15 00:05:38,696 INFO L290 TraceCheckUtils]: 11: Hoare triple {564#false} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {564#false} is VALID [2022-04-15 00:05:38,696 INFO L290 TraceCheckUtils]: 12: Hoare triple {564#false} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {564#false} is VALID [2022-04-15 00:05:38,697 INFO L272 TraceCheckUtils]: 13: Hoare triple {564#false} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_6 (* v_main_~n~0_5 2)) (= v_main_~sn~0_6 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_6, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {564#false} is VALID [2022-04-15 00:05:38,697 INFO L290 TraceCheckUtils]: 14: Hoare triple {564#false} [63] __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] {564#false} is VALID [2022-04-15 00:05:38,697 INFO L290 TraceCheckUtils]: 15: Hoare triple {564#false} [65] 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[] {564#false} is VALID [2022-04-15 00:05:38,697 INFO L290 TraceCheckUtils]: 16: Hoare triple {564#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {564#false} is VALID [2022-04-15 00:05:38,697 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:05:38,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:05:38,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983636779] [2022-04-15 00:05:38,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983636779] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:05:38,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698636387] [2022-04-15 00:05:38,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:05:38,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:05:38,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:05:38,699 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 00:05:38,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 00:05:38,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:38,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-15 00:05:38,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:38,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:05:38,779 INFO L272 TraceCheckUtils]: 0: Hoare triple {563#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {563#true} is VALID [2022-04-15 00:05:38,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {563#true} [52] 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) 36) (= (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] {563#true} is VALID [2022-04-15 00:05:38,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {563#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {563#true} is VALID [2022-04-15 00:05:38,780 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {563#true} {563#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {563#true} is VALID [2022-04-15 00:05:38,781 INFO L272 TraceCheckUtils]: 4: Hoare triple {563#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {563#true} is VALID [2022-04-15 00:05:38,782 INFO L290 TraceCheckUtils]: 5: Hoare triple {563#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_2 0) (= v_main_~n~0_1 (let ((.cse0 (mod |v_main_#t~nondet1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) (= v_main_~i~0_5 1)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_1, main_~sn~0=v_main_~sn~0_2} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {589#(<= main_~i~0 1)} is VALID [2022-04-15 00:05:38,782 INFO L290 TraceCheckUtils]: 6: Hoare triple {589#(<= main_~i~0 1)} [58] L24-3-->L26: Formula: (and (= v_main_~sn~0_4 (+ v_main_~sn~0_5 2)) (<= v_main_~i~0_9 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_5} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_4} AuxVars[] AssignedVars[main_~sn~0] {589#(<= main_~i~0 1)} is VALID [2022-04-15 00:05:38,784 INFO L290 TraceCheckUtils]: 7: Hoare triple {589#(<= main_~i~0 1)} [61] L26-->L24-2: Formula: (not (= v_main_~i~0_2 4)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {589#(<= main_~i~0 1)} is VALID [2022-04-15 00:05:38,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {589#(<= main_~i~0 1)} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {569#(<= main_~i~0 2)} is VALID [2022-04-15 00:05:38,796 INFO L290 TraceCheckUtils]: 9: Hoare triple {569#(<= main_~i~0 2)} [58] L24-3-->L26: Formula: (and (= v_main_~sn~0_4 (+ v_main_~sn~0_5 2)) (<= v_main_~i~0_9 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_5} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_4} AuxVars[] AssignedVars[main_~sn~0] {569#(<= main_~i~0 2)} is VALID [2022-04-15 00:05:38,797 INFO L290 TraceCheckUtils]: 10: Hoare triple {569#(<= main_~i~0 2)} [60] L26-->L24-2: Formula: (and (= v_main_~sn~0_1 (- 10)) (= v_main_~i~0_1 4)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {564#false} is VALID [2022-04-15 00:05:38,797 INFO L290 TraceCheckUtils]: 11: Hoare triple {564#false} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {564#false} is VALID [2022-04-15 00:05:38,797 INFO L290 TraceCheckUtils]: 12: Hoare triple {564#false} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {564#false} is VALID [2022-04-15 00:05:38,797 INFO L272 TraceCheckUtils]: 13: Hoare triple {564#false} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_6 (* v_main_~n~0_5 2)) (= v_main_~sn~0_6 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_6, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {564#false} is VALID [2022-04-15 00:05:38,797 INFO L290 TraceCheckUtils]: 14: Hoare triple {564#false} [63] __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] {564#false} is VALID [2022-04-15 00:05:38,797 INFO L290 TraceCheckUtils]: 15: Hoare triple {564#false} [65] 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[] {564#false} is VALID [2022-04-15 00:05:38,797 INFO L290 TraceCheckUtils]: 16: Hoare triple {564#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {564#false} is VALID [2022-04-15 00:05:38,798 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:05:38,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 00:05:38,864 INFO L290 TraceCheckUtils]: 16: Hoare triple {564#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {564#false} is VALID [2022-04-15 00:05:38,864 INFO L290 TraceCheckUtils]: 15: Hoare triple {564#false} [65] 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[] {564#false} is VALID [2022-04-15 00:05:38,864 INFO L290 TraceCheckUtils]: 14: Hoare triple {564#false} [63] __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] {564#false} is VALID [2022-04-15 00:05:38,864 INFO L272 TraceCheckUtils]: 13: Hoare triple {564#false} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_6 (* v_main_~n~0_5 2)) (= v_main_~sn~0_6 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_6, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {564#false} is VALID [2022-04-15 00:05:38,864 INFO L290 TraceCheckUtils]: 12: Hoare triple {564#false} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {564#false} is VALID [2022-04-15 00:05:38,865 INFO L290 TraceCheckUtils]: 11: Hoare triple {564#false} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {564#false} is VALID [2022-04-15 00:05:38,865 INFO L290 TraceCheckUtils]: 10: Hoare triple {641#(not (<= 4 main_~i~0))} [60] L26-->L24-2: Formula: (and (= v_main_~sn~0_1 (- 10)) (= v_main_~i~0_1 4)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {564#false} is VALID [2022-04-15 00:05:38,865 INFO L290 TraceCheckUtils]: 9: Hoare triple {641#(not (<= 4 main_~i~0))} [58] L24-3-->L26: Formula: (and (= v_main_~sn~0_4 (+ v_main_~sn~0_5 2)) (<= v_main_~i~0_9 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_5} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_4} AuxVars[] AssignedVars[main_~sn~0] {641#(not (<= 4 main_~i~0))} is VALID [2022-04-15 00:05:38,866 INFO L290 TraceCheckUtils]: 8: Hoare triple {569#(<= main_~i~0 2)} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {641#(not (<= 4 main_~i~0))} is VALID [2022-04-15 00:05:38,866 INFO L290 TraceCheckUtils]: 7: Hoare triple {569#(<= main_~i~0 2)} [61] L26-->L24-2: Formula: (not (= v_main_~i~0_2 4)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {569#(<= main_~i~0 2)} is VALID [2022-04-15 00:05:38,866 INFO L290 TraceCheckUtils]: 6: Hoare triple {569#(<= main_~i~0 2)} [58] L24-3-->L26: Formula: (and (= v_main_~sn~0_4 (+ v_main_~sn~0_5 2)) (<= v_main_~i~0_9 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_5} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_4} AuxVars[] AssignedVars[main_~sn~0] {569#(<= main_~i~0 2)} is VALID [2022-04-15 00:05:38,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {563#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_2 0) (= v_main_~n~0_1 (let ((.cse0 (mod |v_main_#t~nondet1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) (= v_main_~i~0_5 1)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_1, main_~sn~0=v_main_~sn~0_2} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {569#(<= main_~i~0 2)} is VALID [2022-04-15 00:05:38,867 INFO L272 TraceCheckUtils]: 4: Hoare triple {563#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {563#true} is VALID [2022-04-15 00:05:38,867 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {563#true} {563#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {563#true} is VALID [2022-04-15 00:05:38,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {563#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {563#true} is VALID [2022-04-15 00:05:38,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {563#true} [52] 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) 36) (= (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] {563#true} is VALID [2022-04-15 00:05:38,868 INFO L272 TraceCheckUtils]: 0: Hoare triple {563#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {563#true} is VALID [2022-04-15 00:05:38,868 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:05:38,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698636387] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 00:05:38,868 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 00:05:38,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-04-15 00:05:38,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780448484] [2022-04-15 00:05:38,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 00:05:38,872 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 00:05:38,872 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:05:38,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:05:38,887 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:05:38,888 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 00:05:38,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:05:38,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 00:05:38,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-15 00:05:38,888 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:05:38,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:05:38,979 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-04-15 00:05:38,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 00:05:38,979 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 00:05:38,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:05:38,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:05:38,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-04-15 00:05:38,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:05:38,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-04-15 00:05:38,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 35 transitions. [2022-04-15 00:05:39,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:05:39,005 INFO L225 Difference]: With dead ends: 31 [2022-04-15 00:05:39,005 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 00:05:39,005 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-04-15 00:05:39,006 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 00:05:39,006 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 24 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 00:05:39,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 00:05:39,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-04-15 00:05:39,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:05:39,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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 00:05:39,012 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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 00:05:39,012 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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 00:05:39,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:05:39,013 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-04-15 00:05:39,013 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-04-15 00:05:39,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:05:39,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:05:39,013 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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 23 states. [2022-04-15 00:05:39,013 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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 23 states. [2022-04-15 00:05:39,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:05:39,014 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-04-15 00:05:39,014 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-04-15 00:05:39,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:05:39,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:05:39,014 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:05:39,014 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:05:39,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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 00:05:39,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-04-15 00:05:39,015 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 17 [2022-04-15 00:05:39,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:05:39,015 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-04-15 00:05:39,016 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:05:39,016 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-15 00:05:39,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 00:05:39,016 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:05:39,016 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:05:39,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 00:05:39,236 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:05:39,236 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:05:39,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:05:39,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1013592265, now seen corresponding path program 2 times [2022-04-15 00:05:39,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:05:39,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994177722] [2022-04-15 00:05:39,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:05:39,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:05:39,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:39,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:05:39,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:39,425 INFO L290 TraceCheckUtils]: 0: Hoare triple {816#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [52] 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) 36) (= (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] {802#true} is VALID [2022-04-15 00:05:39,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {802#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {802#true} is VALID [2022-04-15 00:05:39,426 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {802#true} {802#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {802#true} is VALID [2022-04-15 00:05:39,426 INFO L272 TraceCheckUtils]: 0: Hoare triple {802#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {816#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:05:39,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {816#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [52] 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) 36) (= (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] {802#true} is VALID [2022-04-15 00:05:39,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {802#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {802#true} is VALID [2022-04-15 00:05:39,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {802#true} {802#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {802#true} is VALID [2022-04-15 00:05:39,427 INFO L272 TraceCheckUtils]: 4: Hoare triple {802#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {802#true} is VALID [2022-04-15 00:05:39,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {802#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_2 0) (= v_main_~n~0_1 (let ((.cse0 (mod |v_main_#t~nondet1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) (= v_main_~i~0_5 1)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_1, main_~sn~0=v_main_~sn~0_2} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {807#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-15 00:05:39,428 INFO L290 TraceCheckUtils]: 6: Hoare triple {807#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} [58] L24-3-->L26: Formula: (and (= v_main_~sn~0_4 (+ v_main_~sn~0_5 2)) (<= v_main_~i~0_9 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_5} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_4} AuxVars[] AssignedVars[main_~sn~0] {808#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} is VALID [2022-04-15 00:05:39,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {808#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} [61] L26-->L24-2: Formula: (not (= v_main_~i~0_2 4)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {808#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} is VALID [2022-04-15 00:05:39,429 INFO L290 TraceCheckUtils]: 8: Hoare triple {808#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {809#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} is VALID [2022-04-15 00:05:39,429 INFO L290 TraceCheckUtils]: 9: Hoare triple {809#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} [58] L24-3-->L26: Formula: (and (= v_main_~sn~0_4 (+ v_main_~sn~0_5 2)) (<= v_main_~i~0_9 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_5} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_4} AuxVars[] AssignedVars[main_~sn~0] {810#(and (<= main_~sn~0 (* main_~i~0 2)) (<= (* main_~i~0 2) main_~sn~0))} is VALID [2022-04-15 00:05:39,430 INFO L290 TraceCheckUtils]: 10: Hoare triple {810#(and (<= main_~sn~0 (* main_~i~0 2)) (<= (* main_~i~0 2) main_~sn~0))} [61] L26-->L24-2: Formula: (not (= v_main_~i~0_2 4)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {810#(and (<= main_~sn~0 (* main_~i~0 2)) (<= (* main_~i~0 2) main_~sn~0))} is VALID [2022-04-15 00:05:39,430 INFO L290 TraceCheckUtils]: 11: Hoare triple {810#(and (<= main_~sn~0 (* main_~i~0 2)) (<= (* main_~i~0 2) main_~sn~0))} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {809#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} is VALID [2022-04-15 00:05:39,431 INFO L290 TraceCheckUtils]: 12: Hoare triple {809#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} [58] L24-3-->L26: Formula: (and (= v_main_~sn~0_4 (+ v_main_~sn~0_5 2)) (<= v_main_~i~0_9 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_5} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_4} AuxVars[] AssignedVars[main_~sn~0] {811#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) main_~sn~0) (<= (* main_~n~0 2) main_~sn~0)))} is VALID [2022-04-15 00:05:39,432 INFO L290 TraceCheckUtils]: 13: Hoare triple {811#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) main_~sn~0) (<= (* main_~n~0 2) main_~sn~0)))} [61] L26-->L24-2: Formula: (not (= v_main_~i~0_2 4)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {811#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) main_~sn~0) (<= (* main_~n~0 2) main_~sn~0)))} is VALID [2022-04-15 00:05:39,432 INFO L290 TraceCheckUtils]: 14: Hoare triple {811#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) main_~sn~0) (<= (* main_~n~0 2) main_~sn~0)))} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {812#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0)))} is VALID [2022-04-15 00:05:39,433 INFO L290 TraceCheckUtils]: 15: Hoare triple {812#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0)))} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {813#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-15 00:05:39,433 INFO L272 TraceCheckUtils]: 16: Hoare triple {813#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_6 (* v_main_~n~0_5 2)) (= v_main_~sn~0_6 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_6, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {814#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 00:05:39,434 INFO L290 TraceCheckUtils]: 17: Hoare triple {814#(not (= |__VERIFIER_assert_#in~cond| 0))} [63] __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] {815#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:05:39,434 INFO L290 TraceCheckUtils]: 18: Hoare triple {815#(not (= __VERIFIER_assert_~cond 0))} [65] 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[] {803#false} is VALID [2022-04-15 00:05:39,434 INFO L290 TraceCheckUtils]: 19: Hoare triple {803#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {803#false} is VALID [2022-04-15 00:05:39,435 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 00:05:39,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:05:39,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994177722] [2022-04-15 00:05:39,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994177722] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:05:39,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213225712] [2022-04-15 00:05:39,435 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 00:05:39,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:05:39,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:05:39,436 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 00:05:39,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 00:05:39,467 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 00:05:39,467 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 00:05:39,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 00:05:39,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:39,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:05:39,878 INFO L272 TraceCheckUtils]: 0: Hoare triple {802#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {802#true} is VALID [2022-04-15 00:05:39,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {802#true} [52] 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) 36) (= (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] {802#true} is VALID [2022-04-15 00:05:39,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {802#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {802#true} is VALID [2022-04-15 00:05:39,878 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {802#true} {802#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {802#true} is VALID [2022-04-15 00:05:39,878 INFO L272 TraceCheckUtils]: 4: Hoare triple {802#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {802#true} is VALID [2022-04-15 00:05:39,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {802#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_2 0) (= v_main_~n~0_1 (let ((.cse0 (mod |v_main_#t~nondet1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) (= v_main_~i~0_5 1)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_1, main_~sn~0=v_main_~sn~0_2} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {807#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-15 00:05:39,882 INFO L290 TraceCheckUtils]: 6: Hoare triple {807#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} [58] L24-3-->L26: Formula: (and (= v_main_~sn~0_4 (+ v_main_~sn~0_5 2)) (<= v_main_~i~0_9 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_5} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_4} AuxVars[] AssignedVars[main_~sn~0] {808#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} is VALID [2022-04-15 00:05:39,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {808#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} [61] L26-->L24-2: Formula: (not (= v_main_~i~0_2 4)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {808#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} is VALID [2022-04-15 00:05:39,883 INFO L290 TraceCheckUtils]: 8: Hoare triple {808#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {844#(and (= (+ (- 2) main_~i~0) 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-15 00:05:39,883 INFO L290 TraceCheckUtils]: 9: Hoare triple {844#(and (= (+ (- 2) main_~i~0) 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} [58] L24-3-->L26: Formula: (and (= v_main_~sn~0_4 (+ v_main_~sn~0_5 2)) (<= v_main_~i~0_9 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_5} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_4} AuxVars[] AssignedVars[main_~sn~0] {848#(and (= (+ (- 2) main_~i~0) 0) (<= 4 main_~sn~0) (<= main_~sn~0 4))} is VALID [2022-04-15 00:05:39,883 INFO L290 TraceCheckUtils]: 10: Hoare triple {848#(and (= (+ (- 2) main_~i~0) 0) (<= 4 main_~sn~0) (<= main_~sn~0 4))} [61] L26-->L24-2: Formula: (not (= v_main_~i~0_2 4)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {848#(and (= (+ (- 2) main_~i~0) 0) (<= 4 main_~sn~0) (<= main_~sn~0 4))} is VALID [2022-04-15 00:05:39,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {848#(and (= (+ (- 2) main_~i~0) 0) (<= 4 main_~sn~0) (<= main_~sn~0 4))} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {855#(and (<= 4 main_~sn~0) (= main_~i~0 3) (<= main_~sn~0 4))} is VALID [2022-04-15 00:05:39,884 INFO L290 TraceCheckUtils]: 12: Hoare triple {855#(and (<= 4 main_~sn~0) (= main_~i~0 3) (<= main_~sn~0 4))} [58] L24-3-->L26: Formula: (and (= v_main_~sn~0_4 (+ v_main_~sn~0_5 2)) (<= v_main_~i~0_9 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_5} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_4} AuxVars[] AssignedVars[main_~sn~0] {859#(and (= main_~i~0 3) (<= 6 main_~sn~0) (<= main_~i~0 main_~n~0) (<= main_~sn~0 6))} is VALID [2022-04-15 00:05:39,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {859#(and (= main_~i~0 3) (<= 6 main_~sn~0) (<= main_~i~0 main_~n~0) (<= main_~sn~0 6))} [61] L26-->L24-2: Formula: (not (= v_main_~i~0_2 4)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {859#(and (= main_~i~0 3) (<= 6 main_~sn~0) (<= main_~i~0 main_~n~0) (<= main_~sn~0 6))} is VALID [2022-04-15 00:05:39,885 INFO L290 TraceCheckUtils]: 14: Hoare triple {859#(and (= main_~i~0 3) (<= 6 main_~sn~0) (<= main_~i~0 main_~n~0) (<= main_~sn~0 6))} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {866#(and (<= 6 main_~sn~0) (<= 3 main_~n~0) (<= main_~sn~0 6) (<= main_~i~0 4))} is VALID [2022-04-15 00:05:39,886 INFO L290 TraceCheckUtils]: 15: Hoare triple {866#(and (<= 6 main_~sn~0) (<= 3 main_~n~0) (<= main_~sn~0 6) (<= main_~i~0 4))} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {870#(and (<= 6 main_~sn~0) (<= 3 main_~n~0) (< main_~n~0 4) (<= main_~sn~0 6))} is VALID [2022-04-15 00:05:39,886 INFO L272 TraceCheckUtils]: 16: Hoare triple {870#(and (<= 6 main_~sn~0) (<= 3 main_~n~0) (< main_~n~0 4) (<= main_~sn~0 6))} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_6 (* v_main_~n~0_5 2)) (= v_main_~sn~0_6 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_6, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {874#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:05:39,887 INFO L290 TraceCheckUtils]: 17: Hoare triple {874#(<= 1 |__VERIFIER_assert_#in~cond|)} [63] __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] {878#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:05:39,887 INFO L290 TraceCheckUtils]: 18: Hoare triple {878#(<= 1 __VERIFIER_assert_~cond)} [65] 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[] {803#false} is VALID [2022-04-15 00:05:39,887 INFO L290 TraceCheckUtils]: 19: Hoare triple {803#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {803#false} is VALID [2022-04-15 00:05:39,887 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:05:39,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 00:05:40,309 INFO L290 TraceCheckUtils]: 19: Hoare triple {803#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {803#false} is VALID [2022-04-15 00:05:40,309 INFO L290 TraceCheckUtils]: 18: Hoare triple {878#(<= 1 __VERIFIER_assert_~cond)} [65] 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[] {803#false} is VALID [2022-04-15 00:05:40,310 INFO L290 TraceCheckUtils]: 17: Hoare triple {874#(<= 1 |__VERIFIER_assert_#in~cond|)} [63] __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] {878#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:05:40,311 INFO L272 TraceCheckUtils]: 16: Hoare triple {894#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_6 (* v_main_~n~0_5 2)) (= v_main_~sn~0_6 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_6, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {874#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:05:40,311 INFO L290 TraceCheckUtils]: 15: Hoare triple {898#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {894#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-15 00:05:40,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {902#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {898#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-15 00:05:40,312 INFO L290 TraceCheckUtils]: 13: Hoare triple {902#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} [61] L26-->L24-2: Formula: (not (= v_main_~i~0_2 4)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {902#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-15 00:05:40,313 INFO L290 TraceCheckUtils]: 12: Hoare triple {909#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} [58] L24-3-->L26: Formula: (and (= v_main_~sn~0_4 (+ v_main_~sn~0_5 2)) (<= v_main_~i~0_9 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_5} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_4} AuxVars[] AssignedVars[main_~sn~0] {902#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-15 00:05:40,313 INFO L290 TraceCheckUtils]: 11: Hoare triple {913#(or (and (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~i~0 1))) (= (+ 2 main_~sn~0) 0))} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {909#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-15 00:05:40,315 INFO L290 TraceCheckUtils]: 10: Hoare triple {913#(or (and (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~i~0 1))) (= (+ 2 main_~sn~0) 0))} [61] L26-->L24-2: Formula: (not (= v_main_~i~0_2 4)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {913#(or (and (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~i~0 1))) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-15 00:05:40,316 INFO L290 TraceCheckUtils]: 9: Hoare triple {920#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 1)) (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} [58] L24-3-->L26: Formula: (and (= v_main_~sn~0_4 (+ v_main_~sn~0_5 2)) (<= v_main_~i~0_9 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_5} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_4} AuxVars[] AssignedVars[main_~sn~0] {913#(or (and (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~i~0 1))) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-15 00:05:40,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {924#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {920#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 1)) (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-15 00:05:40,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {924#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} [61] L26-->L24-2: Formula: (not (= v_main_~i~0_2 4)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {924#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-15 00:05:40,318 INFO L290 TraceCheckUtils]: 6: Hoare triple {931#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 6)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 7)) (- 2)))) (= (+ 6 main_~sn~0) 0))} [58] L24-3-->L26: Formula: (and (= v_main_~sn~0_4 (+ v_main_~sn~0_5 2)) (<= v_main_~i~0_9 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_5} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_4} AuxVars[] AssignedVars[main_~sn~0] {924#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-15 00:05:40,321 INFO L290 TraceCheckUtils]: 5: Hoare triple {802#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_2 0) (= v_main_~n~0_1 (let ((.cse0 (mod |v_main_#t~nondet1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) (= v_main_~i~0_5 1)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_1, main_~sn~0=v_main_~sn~0_2} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {931#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 6)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 7)) (- 2)))) (= (+ 6 main_~sn~0) 0))} is VALID [2022-04-15 00:05:40,321 INFO L272 TraceCheckUtils]: 4: Hoare triple {802#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {802#true} is VALID [2022-04-15 00:05:40,321 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {802#true} {802#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {802#true} is VALID [2022-04-15 00:05:40,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {802#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {802#true} is VALID [2022-04-15 00:05:40,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {802#true} [52] 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) 36) (= (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] {802#true} is VALID [2022-04-15 00:05:40,322 INFO L272 TraceCheckUtils]: 0: Hoare triple {802#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {802#true} is VALID [2022-04-15 00:05:40,322 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:05:40,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213225712] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 00:05:40,322 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 00:05:40,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 28 [2022-04-15 00:05:40,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187173912] [2022-04-15 00:05:40,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 00:05:40,323 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 4 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 20 [2022-04-15 00:05:40,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:05:40,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 4 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 00:05:40,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:05:40,358 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-15 00:05:40,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:05:40,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-15 00:05:40,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2022-04-15 00:05:40,359 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 28 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 4 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 00:05:41,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:05:41,140 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-15 00:05:41,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 00:05:41,140 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 4 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 20 [2022-04-15 00:05:41,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:05:41,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 4 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 00:05:41,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 37 transitions. [2022-04-15 00:05:41,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 4 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 00:05:41,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 37 transitions. [2022-04-15 00:05:41,143 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 37 transitions. [2022-04-15 00:05:41,172 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:05:41,173 INFO L225 Difference]: With dead ends: 34 [2022-04-15 00:05:41,173 INFO L226 Difference]: Without dead ends: 28 [2022-04-15 00:05:41,174 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=269, Invalid=1453, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 00:05:41,174 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 27 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 00:05:41,174 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 81 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 00:05:41,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-15 00:05:41,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-04-15 00:05:41,185 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:05:41,185 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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 00:05:41,186 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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 00:05:41,186 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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 00:05:41,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:05:41,187 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-04-15 00:05:41,187 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-15 00:05:41,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:05:41,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:05:41,187 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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 28 states. [2022-04-15 00:05:41,187 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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 28 states. [2022-04-15 00:05:41,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:05:41,188 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-04-15 00:05:41,188 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-15 00:05:41,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:05:41,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:05:41,188 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:05:41,188 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:05:41,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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 00:05:41,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-15 00:05:41,189 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 20 [2022-04-15 00:05:41,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:05:41,189 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-15 00:05:41,189 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 4 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 00:05:41,189 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 00:05:41,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 00:05:41,190 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:05:41,190 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:05:41,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 00:05:41,407 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:05:41,408 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:05:41,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:05:41,408 INFO L85 PathProgramCache]: Analyzing trace with hash 344303561, now seen corresponding path program 2 times [2022-04-15 00:05:41,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:05:41,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146452107] [2022-04-15 00:05:41,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:05:41,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:05:41,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 00:05:41,423 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 00:05:41,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 00:05:41,505 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 00:05:41,505 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-15 00:05:41,506 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 00:05:41,507 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 00:05:41,509 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2022-04-15 00:05:41,510 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 00:05:41,532 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 00:05:41,532 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-15 00:05:41,532 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-15 00:05:41,532 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-15 00:05:41,532 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 00:05:41,532 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-04-15 00:05:41,532 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-04-15 00:05:41,532 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-04-15 00:05:41,532 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 00:05:41,532 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 00:05:41,532 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 00:05:41,532 WARN L170 areAnnotationChecker]: L24-4 has no Hoare annotation [2022-04-15 00:05:41,532 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-15 00:05:41,533 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-15 00:05:41,533 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-15 00:05:41,533 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-15 00:05:41,533 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-15 00:05:41,533 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 00:05:41,533 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2022-04-15 00:05:41,533 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:05:41,533 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 00:05:41,533 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 00:05:41,533 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 00:05:41,533 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 00:05:41,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:05:41 BasicIcfg [2022-04-15 00:05:41,533 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 00:05:41,534 INFO L158 Benchmark]: Toolchain (without parser) took 5783.94ms. Allocated memory was 203.4MB in the beginning and 244.3MB in the end (delta: 40.9MB). Free memory was 147.6MB in the beginning and 182.0MB in the end (delta: -34.4MB). Peak memory consumption was 6.6MB. Max. memory is 8.0GB. [2022-04-15 00:05:41,534 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 203.4MB. Free memory is still 164.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 00:05:41,534 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.39ms. Allocated memory is still 203.4MB. Free memory was 147.4MB in the beginning and 176.0MB in the end (delta: -28.6MB). Peak memory consumption was 4.7MB. Max. memory is 8.0GB. [2022-04-15 00:05:41,534 INFO L158 Benchmark]: Boogie Preprocessor took 29.18ms. Allocated memory is still 203.4MB. Free memory was 176.0MB in the beginning and 174.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 00:05:41,535 INFO L158 Benchmark]: RCFGBuilder took 282.03ms. Allocated memory is still 203.4MB. Free memory was 174.4MB in the beginning and 164.2MB in the end (delta: 10.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-15 00:05:41,535 INFO L158 Benchmark]: IcfgTransformer took 28.85ms. Allocated memory is still 203.4MB. Free memory was 163.9MB in the beginning and 162.9MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 00:05:41,535 INFO L158 Benchmark]: TraceAbstraction took 5221.95ms. Allocated memory was 203.4MB in the beginning and 244.3MB in the end (delta: 40.9MB). Free memory was 162.3MB in the beginning and 182.0MB in the end (delta: -19.6MB). Peak memory consumption was 22.6MB. Max. memory is 8.0GB. [2022-04-15 00:05:41,536 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.14ms. Allocated memory is still 203.4MB. Free memory is still 164.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 216.39ms. Allocated memory is still 203.4MB. Free memory was 147.4MB in the beginning and 176.0MB in the end (delta: -28.6MB). Peak memory consumption was 4.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.18ms. Allocated memory is still 203.4MB. Free memory was 176.0MB in the beginning and 174.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 282.03ms. Allocated memory is still 203.4MB. Free memory was 174.4MB in the beginning and 164.2MB in the end (delta: 10.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * IcfgTransformer took 28.85ms. Allocated memory is still 203.4MB. Free memory was 163.9MB in the beginning and 162.9MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 5221.95ms. Allocated memory was 203.4MB in the beginning and 244.3MB in the end (delta: 40.9MB). Free memory was 162.3MB in the beginning and 182.0MB in the end (delta: -19.6MB). Peak memory consumption was 22.6MB. 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 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L23] int i, n=__VERIFIER_nondet_uint(), sn=0; [L23] int i, n=__VERIFIER_nondet_uint(), sn=0; [L24] i=1 VAL [i=1, n=0, n=4] [L24] COND TRUE i<=n [L25] sn = sn + (2) VAL [i=1, n=2, n=4] [L26] COND FALSE !(i==4) VAL [i=1, n=2, n=4] [L24] i++ VAL [i=2, n=2, n=4] [L24] COND TRUE i<=n [L25] sn = sn + (2) VAL [i=2, n=4, n=4] [L26] COND FALSE !(i==4) VAL [i=2, n=4, n=4] [L24] i++ VAL [i=3, n=4, n=4] [L24] COND TRUE i<=n [L25] sn = sn + (2) VAL [i=3, n=6, n=4] [L26] COND FALSE !(i==4) VAL [i=3, n=6, n=4] [L24] i++ VAL [i=4, n=4, n=6] [L24] COND TRUE i<=n [L25] sn = sn + (2) VAL [i=4, n=8, n=4] [L26] COND TRUE i==4 [L26] sn=-10 VAL [i=4, n=-10, n=4] [L24] i++ VAL [i=5, n=4, n=-10] [L24] COND FALSE !(i<=n) VAL [i=5, n=-10, n=4] [L28] CALL __VERIFIER_assert(sn==n*(2) || sn == 0) VAL [\old(cond)=0] [L15] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L16] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 7, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 104 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 103 mSDsluCounter, 217 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 143 mSDsCounter, 66 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 418 IncrementalHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66 mSolverCounterUnsat, 74 mSDtfsCounter, 418 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 176 GetRequests, 86 SyntacticMatches, 6 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=6, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 6 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 161 NumberOfCodeBlocks, 161 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 177 ConstructedInterpolants, 0 QuantifiedInterpolants, 1017 SizeOfPredicates, 6 NumberOfNonLiveVariables, 192 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 12 InterpolantComputations, 3 PerfectInterpolantSequences, 11/55 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 RESULT: Ultimate proved your program to be incorrect! [2022-04-15 00:05:41,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...