/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/array-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 00:03:49,754 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 00:03:49,757 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 00:03:49,785 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 00:03:49,785 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 00:03:49,786 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 00:03:49,787 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 00:03:49,789 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 00:03:49,790 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 00:03:49,791 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 00:03:49,792 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 00:03:49,793 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 00:03:49,793 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 00:03:49,794 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 00:03:49,795 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 00:03:49,796 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 00:03:49,796 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 00:03:49,797 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 00:03:49,798 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 00:03:49,800 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 00:03:49,801 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 00:03:49,802 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 00:03:49,803 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 00:03:49,804 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 00:03:49,804 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 00:03:49,807 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 00:03:49,807 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 00:03:49,807 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 00:03:49,808 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 00:03:49,808 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 00:03:49,809 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 00:03:49,810 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 00:03:49,810 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 00:03:49,811 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 00:03:49,811 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 00:03:49,812 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 00:03:49,813 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 00:03:49,813 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 00:03:49,813 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 00:03:49,813 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 00:03:49,814 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 00:03:49,815 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 00:03:49,815 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:03:49,835 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 00:03:49,835 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 00:03:49,836 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 00:03:49,836 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 00:03:49,837 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 00:03:49,837 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 00:03:49,837 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 00:03:49,837 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 00:03:49,837 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 00:03:49,838 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 00:03:49,838 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 00:03:49,838 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 00:03:49,838 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 00:03:49,838 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 00:03:49,838 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 00:03:49,838 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 00:03:49,839 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 00:03:49,839 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 00:03:49,839 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 00:03:49,839 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:03:49,839 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 00:03:49,839 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 00:03:49,840 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 00:03:49,840 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 00:03:49,840 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 00:03:49,840 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 00:03:49,840 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 00:03:49,840 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 00:03:49,841 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 00:03:49,841 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:03:50,067 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 00:03:50,094 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 00:03:50,096 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 00:03:50,097 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 00:03:50,099 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 00:03:50,101 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/array-1.c [2022-04-15 00:03:50,165 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac1ee19c9/df7d93d0d6344ba2b5c17d4813b5debd/FLAGea3fe2fc3 [2022-04-15 00:03:50,542 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 00:03:50,542 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/array-1.c [2022-04-15 00:03:50,546 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac1ee19c9/df7d93d0d6344ba2b5c17d4813b5debd/FLAGea3fe2fc3 [2022-04-15 00:03:50,965 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac1ee19c9/df7d93d0d6344ba2b5c17d4813b5debd [2022-04-15 00:03:50,967 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 00:03:50,968 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 00:03:50,970 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 00:03:50,970 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 00:03:50,974 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 00:03:50,975 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:03:50" (1/1) ... [2022-04-15 00:03:50,976 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11897e99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:50, skipping insertion in model container [2022-04-15 00:03:50,976 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:03:50" (1/1) ... [2022-04-15 00:03:51,002 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 00:03:51,012 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 00:03:51,186 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/array-1.c[319,332] [2022-04-15 00:03:51,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:03:51,231 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 00:03:51,248 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/array-1.c[319,332] [2022-04-15 00:03:51,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:03:51,274 INFO L208 MainTranslator]: Completed translation [2022-04-15 00:03:51,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:51 WrapperNode [2022-04-15 00:03:51,277 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 00:03:51,278 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 00:03:51,278 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 00:03:51,279 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 00:03:51,288 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:51" (1/1) ... [2022-04-15 00:03:51,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:51" (1/1) ... [2022-04-15 00:03:51,296 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:51" (1/1) ... [2022-04-15 00:03:51,296 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:51" (1/1) ... [2022-04-15 00:03:51,313 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:51" (1/1) ... [2022-04-15 00:03:51,317 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:51" (1/1) ... [2022-04-15 00:03:51,318 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:51" (1/1) ... [2022-04-15 00:03:51,324 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 00:03:51,325 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 00:03:51,325 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 00:03:51,325 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 00:03:51,326 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:51" (1/1) ... [2022-04-15 00:03:51,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:03:51,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:03:51,357 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:03:51,373 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:03:51,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 00:03:51,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 00:03:51,392 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 00:03:51,392 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 00:03:51,392 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 00:03:51,392 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 00:03:51,392 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 00:03:51,393 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 00:03:51,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 00:03:51,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 00:03:51,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 00:03:51,393 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 00:03:51,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-15 00:03:51,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 00:03:51,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 00:03:51,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 00:03:51,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 00:03:51,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 00:03:51,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 00:03:51,456 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 00:03:51,458 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 00:03:51,640 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 00:03:51,647 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 00:03:51,647 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 00:03:51,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:03:51 BoogieIcfgContainer [2022-04-15 00:03:51,648 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 00:03:51,649 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 00:03:51,649 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 00:03:51,650 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 00:03:51,652 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:03:51" (1/1) ... [2022-04-15 00:03:51,654 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 00:03:51,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:03:51 BasicIcfg [2022-04-15 00:03:51,683 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 00:03:51,684 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 00:03:51,684 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 00:03:51,687 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 00:03:51,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:03:50" (1/4) ... [2022-04-15 00:03:51,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37848a28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:03:51, skipping insertion in model container [2022-04-15 00:03:51,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:51" (2/4) ... [2022-04-15 00:03:51,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37848a28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:03:51, skipping insertion in model container [2022-04-15 00:03:51,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:03:51" (3/4) ... [2022-04-15 00:03:51,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37848a28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:03:51, skipping insertion in model container [2022-04-15 00:03:51,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:03:51" (4/4) ... [2022-04-15 00:03:51,689 INFO L111 eAbstractionObserver]: Analyzing ICFG array-1.cqvasr [2022-04-15 00:03:51,694 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 00:03:51,694 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 00:03:51,731 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 00:03:51,737 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:03:51,737 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 00:03:51,757 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 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:03:51,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 00:03:51,761 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:03:51,761 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:03:51,762 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:03:51,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:03:51,766 INFO L85 PathProgramCache]: Analyzing trace with hash -822380801, now seen corresponding path program 1 times [2022-04-15 00:03:51,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:03:51,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81164112] [2022-04-15 00:03:51,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:03:51,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:03:51,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:03:52,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:03:52,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:03:52,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select |v_#length_3| 2) 10) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {25#true} is VALID [2022-04-15 00:03:52,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-15 00:03:52,064 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} [69] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-15 00:03:52,096 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:03:52,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select |v_#length_3| 2) 10) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {25#true} is VALID [2022-04-15 00:03:52,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-15 00:03:52,098 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} [69] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-15 00:03:52,098 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-15 00:03:52,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} [51] mainENTRY-->L21-3: Formula: (and (= |v_main_#t~nondet4_2| v_main_~menor~0_1) (= (store |v_#length_2| |v_main_~#array~0.base_1| (* (mod v_main_~SIZE~0_1 4294967296) 4)) |v_#length_1|) (not (= |v_main_~#array~0.base_1| 0)) (= |v_#valid_1| (store |v_#valid_2| |v_main_~#array~0.base_1| 1)) (= v_main_~j~0_3 0) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_1|) (= (select |v_#valid_2| |v_main_~#array~0.base_1|) 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (= v_main_~SIZE~0_1 1) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_~#array~0.offset_1| 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{main_~SIZE~0=v_main_~SIZE~0_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#array~0.base=|v_main_~#array~0.base_1|, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, #length=|v_#length_1|, main_~menor~0=v_main_~menor~0_1} AuxVars[] AssignedVars[main_~SIZE~0, main_#t~nondet4, main_~#array~0.base, main_~k~0, main_~j~0, #valid, main_~#array~0.offset, #length, main_~menor~0] {25#true} is VALID [2022-04-15 00:03:52,102 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} [53] L21-3-->L21-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-15 00:03:52,102 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#false} [56] L21-4-->L28: Formula: (= |v_main_#t~mem9_1| (select (select |v_#memory_int_1| |v_main_~#array~0.base_2|) |v_main_~#array~0.offset_2|)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~#array~0.base=|v_main_~#array~0.base_2|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~#array~0.base=|v_main_~#array~0.base_2|, main_#t~mem9=|v_main_#t~mem9_1|} AuxVars[] AssignedVars[main_#t~mem9] {26#false} is VALID [2022-04-15 00:03:52,103 INFO L272 TraceCheckUtils]: 8: Hoare triple {26#false} [59] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~menor~0_7 |v_main_#t~mem9_4|) 1 0)) InVars {main_#t~mem9=|v_main_#t~mem9_4|, main_~menor~0=v_main_~menor~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~menor~0, main_#t~mem9] {26#false} is VALID [2022-04-15 00:03:52,103 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} [62] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {26#false} is VALID [2022-04-15 00:03:52,103 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} [64] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-15 00:03:52,105 INFO L290 TraceCheckUtils]: 11: Hoare triple {26#false} [66] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-15 00:03:52,106 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:03:52,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:03:52,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81164112] [2022-04-15 00:03:52,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81164112] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:03:52,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:03:52,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 00:03:52,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025007378] [2022-04-15 00:03:52,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:03:52,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 00:03:52,133 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:03:52,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:03:52,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:03:52,173 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 00:03:52,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:03:52,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 00:03:52,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 00:03:52,211 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:03:52,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:03:52,367 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-15 00:03:52,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 00:03:52,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 00:03:52,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:03:52,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:03:52,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-04-15 00:03:52,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:03:52,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-04-15 00:03:52,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 39 transitions. [2022-04-15 00:03:52,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:03:52,470 INFO L225 Difference]: With dead ends: 35 [2022-04-15 00:03:52,471 INFO L226 Difference]: Without dead ends: 15 [2022-04-15 00:03:52,473 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:03:52,475 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 25 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:03:52,476 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 25 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 00:03:52,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-15 00:03:52,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-15 00:03:52,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:03:52,510 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:03:52,510 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:03:52,511 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:03:52,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:03:52,513 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-15 00:03:52,513 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 00:03:52,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:03:52,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:03:52,514 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:03:52,514 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:03:52,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:03:52,516 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-15 00:03:52,517 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 00:03:52,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:03:52,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:03:52,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:03:52,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:03:52,518 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:03:52,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-15 00:03:52,520 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2022-04-15 00:03:52,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:03:52,520 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-15 00:03:52,521 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:03:52,521 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 00:03:52,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 00:03:52,522 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:03:52,522 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:03:52,522 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 00:03:52,522 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:03:52,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:03:52,523 INFO L85 PathProgramCache]: Analyzing trace with hash -793751650, now seen corresponding path program 1 times [2022-04-15 00:03:52,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:03:52,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369742534] [2022-04-15 00:03:52,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:03:52,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:03:52,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:03:52,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:03:52,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:03:52,668 INFO L290 TraceCheckUtils]: 0: Hoare triple {135#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select |v_#length_3| 2) 10) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {129#true} is VALID [2022-04-15 00:03:52,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {129#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {129#true} is VALID [2022-04-15 00:03:52,669 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {129#true} {129#true} [69] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {129#true} is VALID [2022-04-15 00:03:52,670 INFO L272 TraceCheckUtils]: 0: Hoare triple {129#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {135#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:03:52,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {135#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select |v_#length_3| 2) 10) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {129#true} is VALID [2022-04-15 00:03:52,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {129#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {129#true} is VALID [2022-04-15 00:03:52,670 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {129#true} {129#true} [69] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {129#true} is VALID [2022-04-15 00:03:52,671 INFO L272 TraceCheckUtils]: 4: Hoare triple {129#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {129#true} is VALID [2022-04-15 00:03:52,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {129#true} [51] mainENTRY-->L21-3: Formula: (and (= |v_main_#t~nondet4_2| v_main_~menor~0_1) (= (store |v_#length_2| |v_main_~#array~0.base_1| (* (mod v_main_~SIZE~0_1 4294967296) 4)) |v_#length_1|) (not (= |v_main_~#array~0.base_1| 0)) (= |v_#valid_1| (store |v_#valid_2| |v_main_~#array~0.base_1| 1)) (= v_main_~j~0_3 0) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_1|) (= (select |v_#valid_2| |v_main_~#array~0.base_1|) 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (= v_main_~SIZE~0_1 1) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_~#array~0.offset_1| 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{main_~SIZE~0=v_main_~SIZE~0_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#array~0.base=|v_main_~#array~0.base_1|, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, #length=|v_#length_1|, main_~menor~0=v_main_~menor~0_1} AuxVars[] AssignedVars[main_~SIZE~0, main_#t~nondet4, main_~#array~0.base, main_~k~0, main_~j~0, #valid, main_~#array~0.offset, #length, main_~menor~0] {134#(and (= main_~j~0 0) (<= 1 main_~SIZE~0) (<= (div main_~SIZE~0 4294967296) 0))} is VALID [2022-04-15 00:03:52,684 INFO L290 TraceCheckUtils]: 6: Hoare triple {134#(and (= main_~j~0 0) (<= 1 main_~SIZE~0) (<= (div main_~SIZE~0 4294967296) 0))} [54] L21-3-->L21-4: Formula: (not (< (mod v_main_~j~0_5 4294967296) (mod v_main_~SIZE~0_2 4294967296))) InVars {main_~SIZE~0=v_main_~SIZE~0_2, main_~j~0=v_main_~j~0_5} OutVars{main_~SIZE~0=v_main_~SIZE~0_2, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {130#false} is VALID [2022-04-15 00:03:52,684 INFO L290 TraceCheckUtils]: 7: Hoare triple {130#false} [56] L21-4-->L28: Formula: (= |v_main_#t~mem9_1| (select (select |v_#memory_int_1| |v_main_~#array~0.base_2|) |v_main_~#array~0.offset_2|)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~#array~0.base=|v_main_~#array~0.base_2|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~#array~0.base=|v_main_~#array~0.base_2|, main_#t~mem9=|v_main_#t~mem9_1|} AuxVars[] AssignedVars[main_#t~mem9] {130#false} is VALID [2022-04-15 00:03:52,684 INFO L272 TraceCheckUtils]: 8: Hoare triple {130#false} [59] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~menor~0_7 |v_main_#t~mem9_4|) 1 0)) InVars {main_#t~mem9=|v_main_#t~mem9_4|, main_~menor~0=v_main_~menor~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~menor~0, main_#t~mem9] {130#false} is VALID [2022-04-15 00:03:52,684 INFO L290 TraceCheckUtils]: 9: Hoare triple {130#false} [62] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {130#false} is VALID [2022-04-15 00:03:52,685 INFO L290 TraceCheckUtils]: 10: Hoare triple {130#false} [64] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {130#false} is VALID [2022-04-15 00:03:52,685 INFO L290 TraceCheckUtils]: 11: Hoare triple {130#false} [66] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {130#false} is VALID [2022-04-15 00:03:52,685 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:03:52,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:03:52,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369742534] [2022-04-15 00:03:52,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369742534] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:03:52,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:03:52,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 00:03:52,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598407371] [2022-04-15 00:03:52,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:03:52,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 00:03:52,688 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:03:52,688 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:03:52,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:03:52,707 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 00:03:52,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:03:52,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 00:03:52,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 00:03:52,708 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:03:52,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:03:52,810 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-15 00:03:52,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 00:03:52,810 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 00:03:52,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:03:52,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:03:52,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-15 00:03:52,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:03:52,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-15 00:03:52,817 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 26 transitions. [2022-04-15 00:03:52,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:03:52,851 INFO L225 Difference]: With dead ends: 24 [2022-04-15 00:03:52,851 INFO L226 Difference]: Without dead ends: 18 [2022-04-15 00:03:52,856 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 00:03:52,860 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 16 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 00:03:52,860 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 20 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 00:03:52,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-15 00:03:52,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2022-04-15 00:03:52,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:03:52,882 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 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:03:52,882 INFO L74 IsIncluded]: Start isIncluded. First operand 18 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:03:52,883 INFO L87 Difference]: Start difference. First operand 18 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:03:52,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:03:52,885 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-15 00:03:52,885 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-15 00:03:52,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:03:52,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:03:52,887 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 18 states. [2022-04-15 00:03:52,887 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 18 states. [2022-04-15 00:03:52,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:03:52,888 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-15 00:03:52,888 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-15 00:03:52,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:03:52,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:03:52,889 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:03:52,889 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:03:52,889 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:03:52,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-15 00:03:52,890 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2022-04-15 00:03:52,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:03:52,891 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-15 00:03:52,891 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:03:52,895 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-15 00:03:52,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 00:03:52,896 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:03:52,896 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:03:52,897 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 00:03:52,897 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:03:52,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:03:52,899 INFO L85 PathProgramCache]: Analyzing trace with hash 2020817898, now seen corresponding path program 1 times [2022-04-15 00:03:52,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:03:52,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578522873] [2022-04-15 00:03:52,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:03:52,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:03:52,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:03:53,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:03:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:03:53,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {246#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select |v_#length_3| 2) 10) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {234#true} is VALID [2022-04-15 00:03:53,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {234#true} is VALID [2022-04-15 00:03:53,292 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {234#true} {234#true} [69] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {234#true} is VALID [2022-04-15 00:03:53,293 INFO L272 TraceCheckUtils]: 0: Hoare triple {234#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {246#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:03:53,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {246#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select |v_#length_3| 2) 10) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {234#true} is VALID [2022-04-15 00:03:53,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {234#true} is VALID [2022-04-15 00:03:53,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} [69] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {234#true} is VALID [2022-04-15 00:03:53,295 INFO L272 TraceCheckUtils]: 4: Hoare triple {234#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {234#true} is VALID [2022-04-15 00:03:53,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#true} [51] mainENTRY-->L21-3: Formula: (and (= |v_main_#t~nondet4_2| v_main_~menor~0_1) (= (store |v_#length_2| |v_main_~#array~0.base_1| (* (mod v_main_~SIZE~0_1 4294967296) 4)) |v_#length_1|) (not (= |v_main_~#array~0.base_1| 0)) (= |v_#valid_1| (store |v_#valid_2| |v_main_~#array~0.base_1| 1)) (= v_main_~j~0_3 0) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_1|) (= (select |v_#valid_2| |v_main_~#array~0.base_1|) 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (= v_main_~SIZE~0_1 1) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_~#array~0.offset_1| 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{main_~SIZE~0=v_main_~SIZE~0_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#array~0.base=|v_main_~#array~0.base_1|, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, #length=|v_#length_1|, main_~menor~0=v_main_~menor~0_1} AuxVars[] AssignedVars[main_~SIZE~0, main_#t~nondet4, main_~#array~0.base, main_~k~0, main_~j~0, #valid, main_~#array~0.offset, #length, main_~menor~0] {239#(and (= |main_~#array~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-15 00:03:53,297 INFO L290 TraceCheckUtils]: 6: Hoare triple {239#(and (= |main_~#array~0.offset| 0) (= main_~j~0 0))} [55] L21-3-->L24: Formula: (let ((.cse1 (mod v_main_~j~0_6 4294967296))) (let ((.cse0 (+ (* .cse1 4) |v_main_~#array~0.offset_5|))) (and (= |v_main_#t~mem7_1| (select (select |v_#memory_int_2| |v_main_~#array~0.base_5|) .cse0)) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= (store |v_#memory_int_3| |v_main_~#array~0.base_5| (store (select |v_#memory_int_3| |v_main_~#array~0.base_5|) .cse0 |v_main_#t~nondet6_2|)) |v_#memory_int_2|) (< .cse1 (mod v_main_~SIZE~0_3 4294967296))))) InVars {main_~SIZE~0=v_main_~SIZE~0_3, main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#array~0.base=|v_main_~#array~0.base_5|, main_~j~0=v_main_~j~0_6, #memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_5|} OutVars{main_~SIZE~0=v_main_~SIZE~0_3, main_~#array~0.base=|v_main_~#array~0.base_5|, main_~j~0=v_main_~j~0_6, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_5|} AuxVars[] AssignedVars[main_#t~nondet6, main_#t~mem7, #memory_int] {240#(and (= |main_~#array~0.offset| 0) (= main_~j~0 0) (= |main_#t~mem7| (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~j~0 4) (* (- 17179869184) (div main_~j~0 4294967296)) |main_~#array~0.offset|))))} is VALID [2022-04-15 00:03:53,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {240#(and (= |main_~#array~0.offset| 0) (= main_~j~0 0) (= |main_#t~mem7| (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~j~0 4) (* (- 17179869184) (div main_~j~0 4294967296)) |main_~#array~0.offset|))))} [57] L24-->L21-2: Formula: (and (<= |v_main_#t~mem7_3| v_main_~menor~0_5) (= (select (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (mod v_main_~j~0_7 4294967296)) |v_main_~#array~0.offset_6|)) v_main_~menor~0_4)) InVars {main_~#array~0.base=|v_main_~#array~0.base_6|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_4|, main_#t~mem7=|v_main_#t~mem7_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~menor~0=v_main_~menor~0_5} OutVars{main_~#array~0.base=|v_main_~#array~0.base_6|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_4|, main_#t~mem8=|v_main_#t~mem8_1|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~menor~0=v_main_~menor~0_4} AuxVars[] AssignedVars[main_#t~mem7, main_#t~mem8, main_~menor~0] {241#(and (= |main_~#array~0.offset| 0) (= main_~j~0 0) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} is VALID [2022-04-15 00:03:53,299 INFO L290 TraceCheckUtils]: 8: Hoare triple {241#(and (= |main_~#array~0.offset| 0) (= main_~j~0 0) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} [60] L21-2-->L21-3: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {242#(and (= |main_~#array~0.offset| 0) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} is VALID [2022-04-15 00:03:53,299 INFO L290 TraceCheckUtils]: 9: Hoare triple {242#(and (= |main_~#array~0.offset| 0) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} [54] L21-3-->L21-4: Formula: (not (< (mod v_main_~j~0_5 4294967296) (mod v_main_~SIZE~0_2 4294967296))) InVars {main_~SIZE~0=v_main_~SIZE~0_2, main_~j~0=v_main_~j~0_5} OutVars{main_~SIZE~0=v_main_~SIZE~0_2, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {242#(and (= |main_~#array~0.offset| 0) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} is VALID [2022-04-15 00:03:53,300 INFO L290 TraceCheckUtils]: 10: Hoare triple {242#(and (= |main_~#array~0.offset| 0) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} [56] L21-4-->L28: Formula: (= |v_main_#t~mem9_1| (select (select |v_#memory_int_1| |v_main_~#array~0.base_2|) |v_main_~#array~0.offset_2|)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~#array~0.base=|v_main_~#array~0.base_2|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~#array~0.base=|v_main_~#array~0.base_2|, main_#t~mem9=|v_main_#t~mem9_1|} AuxVars[] AssignedVars[main_#t~mem9] {243#(<= main_~menor~0 |main_#t~mem9|)} is VALID [2022-04-15 00:03:53,301 INFO L272 TraceCheckUtils]: 11: Hoare triple {243#(<= main_~menor~0 |main_#t~mem9|)} [59] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~menor~0_7 |v_main_#t~mem9_4|) 1 0)) InVars {main_#t~mem9=|v_main_#t~mem9_4|, main_~menor~0=v_main_~menor~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~menor~0, main_#t~mem9] {244#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 00:03:53,302 INFO L290 TraceCheckUtils]: 12: Hoare triple {244#(not (= |__VERIFIER_assert_#in~cond| 0))} [62] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {245#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:03:53,302 INFO L290 TraceCheckUtils]: 13: Hoare triple {245#(not (= __VERIFIER_assert_~cond 0))} [64] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {235#false} is VALID [2022-04-15 00:03:53,303 INFO L290 TraceCheckUtils]: 14: Hoare triple {235#false} [66] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {235#false} is VALID [2022-04-15 00:03:53,304 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:03:53,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:03:53,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578522873] [2022-04-15 00:03:53,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578522873] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:03:53,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446744574] [2022-04-15 00:03:53,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:03:53,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:03:53,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:03:53,319 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:03:53,324 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:03:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:03:53,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 00:03:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:03:53,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:03:53,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-04-15 00:03:53,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-04-15 00:03:53,728 INFO L272 TraceCheckUtils]: 0: Hoare triple {234#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {234#true} is VALID [2022-04-15 00:03:53,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select |v_#length_3| 2) 10) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {234#true} is VALID [2022-04-15 00:03:53,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {234#true} is VALID [2022-04-15 00:03:53,729 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} [69] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {234#true} is VALID [2022-04-15 00:03:53,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {234#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {234#true} is VALID [2022-04-15 00:03:53,732 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#true} [51] mainENTRY-->L21-3: Formula: (and (= |v_main_#t~nondet4_2| v_main_~menor~0_1) (= (store |v_#length_2| |v_main_~#array~0.base_1| (* (mod v_main_~SIZE~0_1 4294967296) 4)) |v_#length_1|) (not (= |v_main_~#array~0.base_1| 0)) (= |v_#valid_1| (store |v_#valid_2| |v_main_~#array~0.base_1| 1)) (= v_main_~j~0_3 0) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_1|) (= (select |v_#valid_2| |v_main_~#array~0.base_1|) 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (= v_main_~SIZE~0_1 1) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_~#array~0.offset_1| 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{main_~SIZE~0=v_main_~SIZE~0_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#array~0.base=|v_main_~#array~0.base_1|, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, #length=|v_#length_1|, main_~menor~0=v_main_~menor~0_1} AuxVars[] AssignedVars[main_~SIZE~0, main_#t~nondet4, main_~#array~0.base, main_~k~0, main_~j~0, #valid, main_~#array~0.offset, #length, main_~menor~0] {265#(= main_~j~0 0)} is VALID [2022-04-15 00:03:53,732 INFO L290 TraceCheckUtils]: 6: Hoare triple {265#(= main_~j~0 0)} [55] L21-3-->L24: Formula: (let ((.cse1 (mod v_main_~j~0_6 4294967296))) (let ((.cse0 (+ (* .cse1 4) |v_main_~#array~0.offset_5|))) (and (= |v_main_#t~mem7_1| (select (select |v_#memory_int_2| |v_main_~#array~0.base_5|) .cse0)) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= (store |v_#memory_int_3| |v_main_~#array~0.base_5| (store (select |v_#memory_int_3| |v_main_~#array~0.base_5|) .cse0 |v_main_#t~nondet6_2|)) |v_#memory_int_2|) (< .cse1 (mod v_main_~SIZE~0_3 4294967296))))) InVars {main_~SIZE~0=v_main_~SIZE~0_3, main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#array~0.base=|v_main_~#array~0.base_5|, main_~j~0=v_main_~j~0_6, #memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_5|} OutVars{main_~SIZE~0=v_main_~SIZE~0_3, main_~#array~0.base=|v_main_~#array~0.base_5|, main_~j~0=v_main_~j~0_6, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_5|} AuxVars[] AssignedVars[main_#t~nondet6, main_#t~mem7, #memory_int] {265#(= main_~j~0 0)} is VALID [2022-04-15 00:03:53,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {265#(= main_~j~0 0)} [57] L24-->L21-2: Formula: (and (<= |v_main_#t~mem7_3| v_main_~menor~0_5) (= (select (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (mod v_main_~j~0_7 4294967296)) |v_main_~#array~0.offset_6|)) v_main_~menor~0_4)) InVars {main_~#array~0.base=|v_main_~#array~0.base_6|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_4|, main_#t~mem7=|v_main_#t~mem7_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~menor~0=v_main_~menor~0_5} OutVars{main_~#array~0.base=|v_main_~#array~0.base_6|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_4|, main_#t~mem8=|v_main_#t~mem8_1|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~menor~0=v_main_~menor~0_4} AuxVars[] AssignedVars[main_#t~mem7, main_#t~mem8, main_~menor~0] {272#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} is VALID [2022-04-15 00:03:53,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {272#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} [60] L21-2-->L21-3: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {272#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} is VALID [2022-04-15 00:03:53,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {272#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} [54] L21-3-->L21-4: Formula: (not (< (mod v_main_~j~0_5 4294967296) (mod v_main_~SIZE~0_2 4294967296))) InVars {main_~SIZE~0=v_main_~SIZE~0_2, main_~j~0=v_main_~j~0_5} OutVars{main_~SIZE~0=v_main_~SIZE~0_2, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {272#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} is VALID [2022-04-15 00:03:53,735 INFO L290 TraceCheckUtils]: 10: Hoare triple {272#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} [56] L21-4-->L28: Formula: (= |v_main_#t~mem9_1| (select (select |v_#memory_int_1| |v_main_~#array~0.base_2|) |v_main_~#array~0.offset_2|)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~#array~0.base=|v_main_~#array~0.base_2|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~#array~0.base=|v_main_~#array~0.base_2|, main_#t~mem9=|v_main_#t~mem9_1|} AuxVars[] AssignedVars[main_#t~mem9] {243#(<= main_~menor~0 |main_#t~mem9|)} is VALID [2022-04-15 00:03:53,736 INFO L272 TraceCheckUtils]: 11: Hoare triple {243#(<= main_~menor~0 |main_#t~mem9|)} [59] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~menor~0_7 |v_main_#t~mem9_4|) 1 0)) InVars {main_#t~mem9=|v_main_#t~mem9_4|, main_~menor~0=v_main_~menor~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~menor~0, main_#t~mem9] {285#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:03:53,736 INFO L290 TraceCheckUtils]: 12: Hoare triple {285#(<= 1 |__VERIFIER_assert_#in~cond|)} [62] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {289#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:03:53,737 INFO L290 TraceCheckUtils]: 13: Hoare triple {289#(<= 1 __VERIFIER_assert_~cond)} [64] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {235#false} is VALID [2022-04-15 00:03:53,737 INFO L290 TraceCheckUtils]: 14: Hoare triple {235#false} [66] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {235#false} is VALID [2022-04-15 00:03:53,737 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:03:53,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 00:03:53,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-04-15 00:03:53,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2022-04-15 00:03:53,980 INFO L290 TraceCheckUtils]: 14: Hoare triple {235#false} [66] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {235#false} is VALID [2022-04-15 00:03:53,981 INFO L290 TraceCheckUtils]: 13: Hoare triple {289#(<= 1 __VERIFIER_assert_~cond)} [64] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {235#false} is VALID [2022-04-15 00:03:53,981 INFO L290 TraceCheckUtils]: 12: Hoare triple {285#(<= 1 |__VERIFIER_assert_#in~cond|)} [62] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {289#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:03:53,982 INFO L272 TraceCheckUtils]: 11: Hoare triple {243#(<= main_~menor~0 |main_#t~mem9|)} [59] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~menor~0_7 |v_main_#t~mem9_4|) 1 0)) InVars {main_#t~mem9=|v_main_#t~mem9_4|, main_~menor~0=v_main_~menor~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~menor~0, main_#t~mem9] {285#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:03:53,983 INFO L290 TraceCheckUtils]: 10: Hoare triple {272#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} [56] L21-4-->L28: Formula: (= |v_main_#t~mem9_1| (select (select |v_#memory_int_1| |v_main_~#array~0.base_2|) |v_main_~#array~0.offset_2|)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~#array~0.base=|v_main_~#array~0.base_2|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~#array~0.base=|v_main_~#array~0.base_2|, main_#t~mem9=|v_main_#t~mem9_1|} AuxVars[] AssignedVars[main_#t~mem9] {243#(<= main_~menor~0 |main_#t~mem9|)} is VALID [2022-04-15 00:03:53,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {272#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} [54] L21-3-->L21-4: Formula: (not (< (mod v_main_~j~0_5 4294967296) (mod v_main_~SIZE~0_2 4294967296))) InVars {main_~SIZE~0=v_main_~SIZE~0_2, main_~j~0=v_main_~j~0_5} OutVars{main_~SIZE~0=v_main_~SIZE~0_2, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {272#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} is VALID [2022-04-15 00:03:53,984 INFO L290 TraceCheckUtils]: 8: Hoare triple {272#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} [60] L21-2-->L21-3: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {272#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} is VALID [2022-04-15 00:03:53,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {317#(<= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod main_~j~0 4294967296) 4) |main_~#array~0.offset|)) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} [57] L24-->L21-2: Formula: (and (<= |v_main_#t~mem7_3| v_main_~menor~0_5) (= (select (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (mod v_main_~j~0_7 4294967296)) |v_main_~#array~0.offset_6|)) v_main_~menor~0_4)) InVars {main_~#array~0.base=|v_main_~#array~0.base_6|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_4|, main_#t~mem7=|v_main_#t~mem7_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~menor~0=v_main_~menor~0_5} OutVars{main_~#array~0.base=|v_main_~#array~0.base_6|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_4|, main_#t~mem8=|v_main_#t~mem8_1|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~menor~0=v_main_~menor~0_4} AuxVars[] AssignedVars[main_#t~mem7, main_#t~mem8, main_~menor~0] {272#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} is VALID [2022-04-15 00:03:53,986 INFO L290 TraceCheckUtils]: 6: Hoare triple {321#(= (* (mod main_~j~0 4294967296) 4) 0)} [55] L21-3-->L24: Formula: (let ((.cse1 (mod v_main_~j~0_6 4294967296))) (let ((.cse0 (+ (* .cse1 4) |v_main_~#array~0.offset_5|))) (and (= |v_main_#t~mem7_1| (select (select |v_#memory_int_2| |v_main_~#array~0.base_5|) .cse0)) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= (store |v_#memory_int_3| |v_main_~#array~0.base_5| (store (select |v_#memory_int_3| |v_main_~#array~0.base_5|) .cse0 |v_main_#t~nondet6_2|)) |v_#memory_int_2|) (< .cse1 (mod v_main_~SIZE~0_3 4294967296))))) InVars {main_~SIZE~0=v_main_~SIZE~0_3, main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#array~0.base=|v_main_~#array~0.base_5|, main_~j~0=v_main_~j~0_6, #memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_5|} OutVars{main_~SIZE~0=v_main_~SIZE~0_3, main_~#array~0.base=|v_main_~#array~0.base_5|, main_~j~0=v_main_~j~0_6, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_5|} AuxVars[] AssignedVars[main_#t~nondet6, main_#t~mem7, #memory_int] {317#(<= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod main_~j~0 4294967296) 4) |main_~#array~0.offset|)) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} is VALID [2022-04-15 00:03:53,987 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#true} [51] mainENTRY-->L21-3: Formula: (and (= |v_main_#t~nondet4_2| v_main_~menor~0_1) (= (store |v_#length_2| |v_main_~#array~0.base_1| (* (mod v_main_~SIZE~0_1 4294967296) 4)) |v_#length_1|) (not (= |v_main_~#array~0.base_1| 0)) (= |v_#valid_1| (store |v_#valid_2| |v_main_~#array~0.base_1| 1)) (= v_main_~j~0_3 0) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_1|) (= (select |v_#valid_2| |v_main_~#array~0.base_1|) 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (= v_main_~SIZE~0_1 1) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_~#array~0.offset_1| 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{main_~SIZE~0=v_main_~SIZE~0_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#array~0.base=|v_main_~#array~0.base_1|, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, #length=|v_#length_1|, main_~menor~0=v_main_~menor~0_1} AuxVars[] AssignedVars[main_~SIZE~0, main_#t~nondet4, main_~#array~0.base, main_~k~0, main_~j~0, #valid, main_~#array~0.offset, #length, main_~menor~0] {321#(= (* (mod main_~j~0 4294967296) 4) 0)} is VALID [2022-04-15 00:03:53,987 INFO L272 TraceCheckUtils]: 4: Hoare triple {234#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {234#true} is VALID [2022-04-15 00:03:53,987 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} [69] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {234#true} is VALID [2022-04-15 00:03:53,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {234#true} is VALID [2022-04-15 00:03:53,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select |v_#length_3| 2) 10) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {234#true} is VALID [2022-04-15 00:03:53,988 INFO L272 TraceCheckUtils]: 0: Hoare triple {234#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {234#true} is VALID [2022-04-15 00:03:53,988 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:03:53,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446744574] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 00:03:53,988 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 00:03:53,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 8] total 16 [2022-04-15 00:03:53,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796273778] [2022-04-15 00:03:53,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 00:03:53,990 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 00:03:53,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:03:53,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:03:54,014 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:03:54,014 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 00:03:54,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:03:54,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 00:03:54,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-04-15 00:03:54,016 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:03:54,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:03:54,484 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-15 00:03:54,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 00:03:54,486 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 00:03:54,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:03:54,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:03:54,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 27 transitions. [2022-04-15 00:03:54,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:03:54,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 27 transitions. [2022-04-15 00:03:54,494 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 27 transitions. [2022-04-15 00:03:54,526 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:03:54,527 INFO L225 Difference]: With dead ends: 25 [2022-04-15 00:03:54,527 INFO L226 Difference]: Without dead ends: 19 [2022-04-15 00:03:54,528 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2022-04-15 00:03:54,530 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 18 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 00:03:54,531 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 58 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 00:03:54,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-15 00:03:54,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-15 00:03:54,539 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:03:54,539 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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:03:54,539 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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:03:54,539 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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:03:54,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:03:54,541 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-15 00:03:54,541 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 00:03:54,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:03:54,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:03:54,542 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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 19 states. [2022-04-15 00:03:54,542 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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 19 states. [2022-04-15 00:03:54,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:03:54,546 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-15 00:03:54,547 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 00:03:54,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:03:54,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:03:54,547 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:03:54,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:03:54,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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:03:54,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-15 00:03:54,552 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2022-04-15 00:03:54,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:03:54,553 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-15 00:03:54,553 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:03:54,554 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 00:03:54,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 00:03:54,554 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:03:54,554 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:03:54,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 00:03:54,775 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:03:54,776 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:03:54,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:03:54,776 INFO L85 PathProgramCache]: Analyzing trace with hash 215702558, now seen corresponding path program 2 times [2022-04-15 00:03:54,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:03:54,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572303093] [2022-04-15 00:03:54,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:03:54,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:03:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:03:54,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:03:54,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:03:54,893 INFO L290 TraceCheckUtils]: 0: Hoare triple {465#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select |v_#length_3| 2) 10) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {458#true} is VALID [2022-04-15 00:03:54,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {458#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-15 00:03:54,893 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {458#true} {458#true} [69] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-15 00:03:54,894 INFO L272 TraceCheckUtils]: 0: Hoare triple {458#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {465#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:03:54,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {465#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select |v_#length_3| 2) 10) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {458#true} is VALID [2022-04-15 00:03:54,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {458#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-15 00:03:54,895 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {458#true} {458#true} [69] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-15 00:03:54,895 INFO L272 TraceCheckUtils]: 4: Hoare triple {458#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-15 00:03:54,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {458#true} [51] mainENTRY-->L21-3: Formula: (and (= |v_main_#t~nondet4_2| v_main_~menor~0_1) (= (store |v_#length_2| |v_main_~#array~0.base_1| (* (mod v_main_~SIZE~0_1 4294967296) 4)) |v_#length_1|) (not (= |v_main_~#array~0.base_1| 0)) (= |v_#valid_1| (store |v_#valid_2| |v_main_~#array~0.base_1| 1)) (= v_main_~j~0_3 0) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_1|) (= (select |v_#valid_2| |v_main_~#array~0.base_1|) 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (= v_main_~SIZE~0_1 1) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_~#array~0.offset_1| 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{main_~SIZE~0=v_main_~SIZE~0_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#array~0.base=|v_main_~#array~0.base_1|, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, #length=|v_#length_1|, main_~menor~0=v_main_~menor~0_1} AuxVars[] AssignedVars[main_~SIZE~0, main_#t~nondet4, main_~#array~0.base, main_~k~0, main_~j~0, #valid, main_~#array~0.offset, #length, main_~menor~0] {463#(and (= main_~j~0 0) (= main_~SIZE~0 1))} is VALID [2022-04-15 00:03:54,899 INFO L290 TraceCheckUtils]: 6: Hoare triple {463#(and (= main_~j~0 0) (= main_~SIZE~0 1))} [55] L21-3-->L24: Formula: (let ((.cse1 (mod v_main_~j~0_6 4294967296))) (let ((.cse0 (+ (* .cse1 4) |v_main_~#array~0.offset_5|))) (and (= |v_main_#t~mem7_1| (select (select |v_#memory_int_2| |v_main_~#array~0.base_5|) .cse0)) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= (store |v_#memory_int_3| |v_main_~#array~0.base_5| (store (select |v_#memory_int_3| |v_main_~#array~0.base_5|) .cse0 |v_main_#t~nondet6_2|)) |v_#memory_int_2|) (< .cse1 (mod v_main_~SIZE~0_3 4294967296))))) InVars {main_~SIZE~0=v_main_~SIZE~0_3, main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#array~0.base=|v_main_~#array~0.base_5|, main_~j~0=v_main_~j~0_6, #memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_5|} OutVars{main_~SIZE~0=v_main_~SIZE~0_3, main_~#array~0.base=|v_main_~#array~0.base_5|, main_~j~0=v_main_~j~0_6, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_5|} AuxVars[] AssignedVars[main_#t~nondet6, main_#t~mem7, #memory_int] {463#(and (= main_~j~0 0) (= main_~SIZE~0 1))} is VALID [2022-04-15 00:03:54,899 INFO L290 TraceCheckUtils]: 7: Hoare triple {463#(and (= main_~j~0 0) (= main_~SIZE~0 1))} [57] L24-->L21-2: Formula: (and (<= |v_main_#t~mem7_3| v_main_~menor~0_5) (= (select (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (mod v_main_~j~0_7 4294967296)) |v_main_~#array~0.offset_6|)) v_main_~menor~0_4)) InVars {main_~#array~0.base=|v_main_~#array~0.base_6|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_4|, main_#t~mem7=|v_main_#t~mem7_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~menor~0=v_main_~menor~0_5} OutVars{main_~#array~0.base=|v_main_~#array~0.base_6|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_4|, main_#t~mem8=|v_main_#t~mem8_1|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~menor~0=v_main_~menor~0_4} AuxVars[] AssignedVars[main_#t~mem7, main_#t~mem8, main_~menor~0] {463#(and (= main_~j~0 0) (= main_~SIZE~0 1))} is VALID [2022-04-15 00:03:54,900 INFO L290 TraceCheckUtils]: 8: Hoare triple {463#(and (= main_~j~0 0) (= main_~SIZE~0 1))} [60] L21-2-->L21-3: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {464#(and (<= 1 main_~j~0) (= (+ (- 1) main_~SIZE~0) 0) (<= (+ main_~SIZE~0 main_~j~0) (+ (* (div main_~SIZE~0 4294967296) 4294967296) 4294967296)))} is VALID [2022-04-15 00:03:54,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {464#(and (<= 1 main_~j~0) (= (+ (- 1) main_~SIZE~0) 0) (<= (+ main_~SIZE~0 main_~j~0) (+ (* (div main_~SIZE~0 4294967296) 4294967296) 4294967296)))} [55] L21-3-->L24: Formula: (let ((.cse1 (mod v_main_~j~0_6 4294967296))) (let ((.cse0 (+ (* .cse1 4) |v_main_~#array~0.offset_5|))) (and (= |v_main_#t~mem7_1| (select (select |v_#memory_int_2| |v_main_~#array~0.base_5|) .cse0)) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= (store |v_#memory_int_3| |v_main_~#array~0.base_5| (store (select |v_#memory_int_3| |v_main_~#array~0.base_5|) .cse0 |v_main_#t~nondet6_2|)) |v_#memory_int_2|) (< .cse1 (mod v_main_~SIZE~0_3 4294967296))))) InVars {main_~SIZE~0=v_main_~SIZE~0_3, main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#array~0.base=|v_main_~#array~0.base_5|, main_~j~0=v_main_~j~0_6, #memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_5|} OutVars{main_~SIZE~0=v_main_~SIZE~0_3, main_~#array~0.base=|v_main_~#array~0.base_5|, main_~j~0=v_main_~j~0_6, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_5|} AuxVars[] AssignedVars[main_#t~nondet6, main_#t~mem7, #memory_int] {459#false} is VALID [2022-04-15 00:03:54,901 INFO L290 TraceCheckUtils]: 10: Hoare triple {459#false} [57] L24-->L21-2: Formula: (and (<= |v_main_#t~mem7_3| v_main_~menor~0_5) (= (select (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (mod v_main_~j~0_7 4294967296)) |v_main_~#array~0.offset_6|)) v_main_~menor~0_4)) InVars {main_~#array~0.base=|v_main_~#array~0.base_6|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_4|, main_#t~mem7=|v_main_#t~mem7_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~menor~0=v_main_~menor~0_5} OutVars{main_~#array~0.base=|v_main_~#array~0.base_6|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_4|, main_#t~mem8=|v_main_#t~mem8_1|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~menor~0=v_main_~menor~0_4} AuxVars[] AssignedVars[main_#t~mem7, main_#t~mem8, main_~menor~0] {459#false} is VALID [2022-04-15 00:03:54,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {459#false} [60] L21-2-->L21-3: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {459#false} is VALID [2022-04-15 00:03:54,902 INFO L290 TraceCheckUtils]: 12: Hoare triple {459#false} [54] L21-3-->L21-4: Formula: (not (< (mod v_main_~j~0_5 4294967296) (mod v_main_~SIZE~0_2 4294967296))) InVars {main_~SIZE~0=v_main_~SIZE~0_2, main_~j~0=v_main_~j~0_5} OutVars{main_~SIZE~0=v_main_~SIZE~0_2, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {459#false} is VALID [2022-04-15 00:03:54,902 INFO L290 TraceCheckUtils]: 13: Hoare triple {459#false} [56] L21-4-->L28: Formula: (= |v_main_#t~mem9_1| (select (select |v_#memory_int_1| |v_main_~#array~0.base_2|) |v_main_~#array~0.offset_2|)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~#array~0.base=|v_main_~#array~0.base_2|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~#array~0.base=|v_main_~#array~0.base_2|, main_#t~mem9=|v_main_#t~mem9_1|} AuxVars[] AssignedVars[main_#t~mem9] {459#false} is VALID [2022-04-15 00:03:54,902 INFO L272 TraceCheckUtils]: 14: Hoare triple {459#false} [59] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~menor~0_7 |v_main_#t~mem9_4|) 1 0)) InVars {main_#t~mem9=|v_main_#t~mem9_4|, main_~menor~0=v_main_~menor~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~menor~0, main_#t~mem9] {459#false} is VALID [2022-04-15 00:03:54,902 INFO L290 TraceCheckUtils]: 15: Hoare triple {459#false} [62] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {459#false} is VALID [2022-04-15 00:03:54,903 INFO L290 TraceCheckUtils]: 16: Hoare triple {459#false} [64] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {459#false} is VALID [2022-04-15 00:03:54,903 INFO L290 TraceCheckUtils]: 17: Hoare triple {459#false} [66] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {459#false} is VALID [2022-04-15 00:03:54,903 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:03:54,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:03:54,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572303093] [2022-04-15 00:03:54,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572303093] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:03:54,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135600031] [2022-04-15 00:03:54,904 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 00:03:54,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:03:54,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:03:54,905 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:03:54,906 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:03:54,954 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 00:03:54,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 00:03:54,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 00:03:54,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:03:54,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:03:55,036 INFO L272 TraceCheckUtils]: 0: Hoare triple {458#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-15 00:03:55,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {458#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select |v_#length_3| 2) 10) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {458#true} is VALID [2022-04-15 00:03:55,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {458#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-15 00:03:55,039 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {458#true} {458#true} [69] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-15 00:03:55,039 INFO L272 TraceCheckUtils]: 4: Hoare triple {458#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-15 00:03:55,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {458#true} [51] mainENTRY-->L21-3: Formula: (and (= |v_main_#t~nondet4_2| v_main_~menor~0_1) (= (store |v_#length_2| |v_main_~#array~0.base_1| (* (mod v_main_~SIZE~0_1 4294967296) 4)) |v_#length_1|) (not (= |v_main_~#array~0.base_1| 0)) (= |v_#valid_1| (store |v_#valid_2| |v_main_~#array~0.base_1| 1)) (= v_main_~j~0_3 0) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_1|) (= (select |v_#valid_2| |v_main_~#array~0.base_1|) 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (= v_main_~SIZE~0_1 1) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_~#array~0.offset_1| 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{main_~SIZE~0=v_main_~SIZE~0_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#array~0.base=|v_main_~#array~0.base_1|, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, #length=|v_#length_1|, main_~menor~0=v_main_~menor~0_1} AuxVars[] AssignedVars[main_~SIZE~0, main_#t~nondet4, main_~#array~0.base, main_~k~0, main_~j~0, #valid, main_~#array~0.offset, #length, main_~menor~0] {463#(and (= main_~j~0 0) (= main_~SIZE~0 1))} is VALID [2022-04-15 00:03:55,041 INFO L290 TraceCheckUtils]: 6: Hoare triple {463#(and (= main_~j~0 0) (= main_~SIZE~0 1))} [55] L21-3-->L24: Formula: (let ((.cse1 (mod v_main_~j~0_6 4294967296))) (let ((.cse0 (+ (* .cse1 4) |v_main_~#array~0.offset_5|))) (and (= |v_main_#t~mem7_1| (select (select |v_#memory_int_2| |v_main_~#array~0.base_5|) .cse0)) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= (store |v_#memory_int_3| |v_main_~#array~0.base_5| (store (select |v_#memory_int_3| |v_main_~#array~0.base_5|) .cse0 |v_main_#t~nondet6_2|)) |v_#memory_int_2|) (< .cse1 (mod v_main_~SIZE~0_3 4294967296))))) InVars {main_~SIZE~0=v_main_~SIZE~0_3, main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#array~0.base=|v_main_~#array~0.base_5|, main_~j~0=v_main_~j~0_6, #memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_5|} OutVars{main_~SIZE~0=v_main_~SIZE~0_3, main_~#array~0.base=|v_main_~#array~0.base_5|, main_~j~0=v_main_~j~0_6, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_5|} AuxVars[] AssignedVars[main_#t~nondet6, main_#t~mem7, #memory_int] {463#(and (= main_~j~0 0) (= main_~SIZE~0 1))} is VALID [2022-04-15 00:03:55,041 INFO L290 TraceCheckUtils]: 7: Hoare triple {463#(and (= main_~j~0 0) (= main_~SIZE~0 1))} [57] L24-->L21-2: Formula: (and (<= |v_main_#t~mem7_3| v_main_~menor~0_5) (= (select (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (mod v_main_~j~0_7 4294967296)) |v_main_~#array~0.offset_6|)) v_main_~menor~0_4)) InVars {main_~#array~0.base=|v_main_~#array~0.base_6|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_4|, main_#t~mem7=|v_main_#t~mem7_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~menor~0=v_main_~menor~0_5} OutVars{main_~#array~0.base=|v_main_~#array~0.base_6|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_4|, main_#t~mem8=|v_main_#t~mem8_1|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~menor~0=v_main_~menor~0_4} AuxVars[] AssignedVars[main_#t~mem7, main_#t~mem8, main_~menor~0] {463#(and (= main_~j~0 0) (= main_~SIZE~0 1))} is VALID [2022-04-15 00:03:55,042 INFO L290 TraceCheckUtils]: 8: Hoare triple {463#(and (= main_~j~0 0) (= main_~SIZE~0 1))} [60] L21-2-->L21-3: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {493#(and (= main_~j~0 1) (= main_~SIZE~0 1))} is VALID [2022-04-15 00:03:55,043 INFO L290 TraceCheckUtils]: 9: Hoare triple {493#(and (= main_~j~0 1) (= main_~SIZE~0 1))} [55] L21-3-->L24: Formula: (let ((.cse1 (mod v_main_~j~0_6 4294967296))) (let ((.cse0 (+ (* .cse1 4) |v_main_~#array~0.offset_5|))) (and (= |v_main_#t~mem7_1| (select (select |v_#memory_int_2| |v_main_~#array~0.base_5|) .cse0)) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= (store |v_#memory_int_3| |v_main_~#array~0.base_5| (store (select |v_#memory_int_3| |v_main_~#array~0.base_5|) .cse0 |v_main_#t~nondet6_2|)) |v_#memory_int_2|) (< .cse1 (mod v_main_~SIZE~0_3 4294967296))))) InVars {main_~SIZE~0=v_main_~SIZE~0_3, main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#array~0.base=|v_main_~#array~0.base_5|, main_~j~0=v_main_~j~0_6, #memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_5|} OutVars{main_~SIZE~0=v_main_~SIZE~0_3, main_~#array~0.base=|v_main_~#array~0.base_5|, main_~j~0=v_main_~j~0_6, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_5|} AuxVars[] AssignedVars[main_#t~nondet6, main_#t~mem7, #memory_int] {459#false} is VALID [2022-04-15 00:03:55,043 INFO L290 TraceCheckUtils]: 10: Hoare triple {459#false} [57] L24-->L21-2: Formula: (and (<= |v_main_#t~mem7_3| v_main_~menor~0_5) (= (select (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (mod v_main_~j~0_7 4294967296)) |v_main_~#array~0.offset_6|)) v_main_~menor~0_4)) InVars {main_~#array~0.base=|v_main_~#array~0.base_6|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_4|, main_#t~mem7=|v_main_#t~mem7_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~menor~0=v_main_~menor~0_5} OutVars{main_~#array~0.base=|v_main_~#array~0.base_6|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_4|, main_#t~mem8=|v_main_#t~mem8_1|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~menor~0=v_main_~menor~0_4} AuxVars[] AssignedVars[main_#t~mem7, main_#t~mem8, main_~menor~0] {459#false} is VALID [2022-04-15 00:03:55,044 INFO L290 TraceCheckUtils]: 11: Hoare triple {459#false} [60] L21-2-->L21-3: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {459#false} is VALID [2022-04-15 00:03:55,045 INFO L290 TraceCheckUtils]: 12: Hoare triple {459#false} [54] L21-3-->L21-4: Formula: (not (< (mod v_main_~j~0_5 4294967296) (mod v_main_~SIZE~0_2 4294967296))) InVars {main_~SIZE~0=v_main_~SIZE~0_2, main_~j~0=v_main_~j~0_5} OutVars{main_~SIZE~0=v_main_~SIZE~0_2, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {459#false} is VALID [2022-04-15 00:03:55,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {459#false} [56] L21-4-->L28: Formula: (= |v_main_#t~mem9_1| (select (select |v_#memory_int_1| |v_main_~#array~0.base_2|) |v_main_~#array~0.offset_2|)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~#array~0.base=|v_main_~#array~0.base_2|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~#array~0.base=|v_main_~#array~0.base_2|, main_#t~mem9=|v_main_#t~mem9_1|} AuxVars[] AssignedVars[main_#t~mem9] {459#false} is VALID [2022-04-15 00:03:55,046 INFO L272 TraceCheckUtils]: 14: Hoare triple {459#false} [59] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~menor~0_7 |v_main_#t~mem9_4|) 1 0)) InVars {main_#t~mem9=|v_main_#t~mem9_4|, main_~menor~0=v_main_~menor~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~menor~0, main_#t~mem9] {459#false} is VALID [2022-04-15 00:03:55,047 INFO L290 TraceCheckUtils]: 15: Hoare triple {459#false} [62] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {459#false} is VALID [2022-04-15 00:03:55,048 INFO L290 TraceCheckUtils]: 16: Hoare triple {459#false} [64] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {459#false} is VALID [2022-04-15 00:03:55,056 INFO L290 TraceCheckUtils]: 17: Hoare triple {459#false} [66] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {459#false} is VALID [2022-04-15 00:03:55,056 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:03:55,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 00:03:55,135 INFO L290 TraceCheckUtils]: 17: Hoare triple {459#false} [66] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {459#false} is VALID [2022-04-15 00:03:55,135 INFO L290 TraceCheckUtils]: 16: Hoare triple {459#false} [64] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {459#false} is VALID [2022-04-15 00:03:55,135 INFO L290 TraceCheckUtils]: 15: Hoare triple {459#false} [62] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {459#false} is VALID [2022-04-15 00:03:55,135 INFO L272 TraceCheckUtils]: 14: Hoare triple {459#false} [59] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~menor~0_7 |v_main_#t~mem9_4|) 1 0)) InVars {main_#t~mem9=|v_main_#t~mem9_4|, main_~menor~0=v_main_~menor~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~menor~0, main_#t~mem9] {459#false} is VALID [2022-04-15 00:03:55,136 INFO L290 TraceCheckUtils]: 13: Hoare triple {459#false} [56] L21-4-->L28: Formula: (= |v_main_#t~mem9_1| (select (select |v_#memory_int_1| |v_main_~#array~0.base_2|) |v_main_~#array~0.offset_2|)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~#array~0.base=|v_main_~#array~0.base_2|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~#array~0.base=|v_main_~#array~0.base_2|, main_#t~mem9=|v_main_#t~mem9_1|} AuxVars[] AssignedVars[main_#t~mem9] {459#false} is VALID [2022-04-15 00:03:55,137 INFO L290 TraceCheckUtils]: 12: Hoare triple {459#false} [54] L21-3-->L21-4: Formula: (not (< (mod v_main_~j~0_5 4294967296) (mod v_main_~SIZE~0_2 4294967296))) InVars {main_~SIZE~0=v_main_~SIZE~0_2, main_~j~0=v_main_~j~0_5} OutVars{main_~SIZE~0=v_main_~SIZE~0_2, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {459#false} is VALID [2022-04-15 00:03:55,137 INFO L290 TraceCheckUtils]: 11: Hoare triple {459#false} [60] L21-2-->L21-3: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {459#false} is VALID [2022-04-15 00:03:55,137 INFO L290 TraceCheckUtils]: 10: Hoare triple {459#false} [57] L24-->L21-2: Formula: (and (<= |v_main_#t~mem7_3| v_main_~menor~0_5) (= (select (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (mod v_main_~j~0_7 4294967296)) |v_main_~#array~0.offset_6|)) v_main_~menor~0_4)) InVars {main_~#array~0.base=|v_main_~#array~0.base_6|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_4|, main_#t~mem7=|v_main_#t~mem7_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~menor~0=v_main_~menor~0_5} OutVars{main_~#array~0.base=|v_main_~#array~0.base_6|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_4|, main_#t~mem8=|v_main_#t~mem8_1|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~menor~0=v_main_~menor~0_4} AuxVars[] AssignedVars[main_#t~mem7, main_#t~mem8, main_~menor~0] {459#false} is VALID [2022-04-15 00:03:55,137 INFO L290 TraceCheckUtils]: 9: Hoare triple {545#(not (< (mod main_~j~0 4294967296) (mod main_~SIZE~0 4294967296)))} [55] L21-3-->L24: Formula: (let ((.cse1 (mod v_main_~j~0_6 4294967296))) (let ((.cse0 (+ (* .cse1 4) |v_main_~#array~0.offset_5|))) (and (= |v_main_#t~mem7_1| (select (select |v_#memory_int_2| |v_main_~#array~0.base_5|) .cse0)) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= (store |v_#memory_int_3| |v_main_~#array~0.base_5| (store (select |v_#memory_int_3| |v_main_~#array~0.base_5|) .cse0 |v_main_#t~nondet6_2|)) |v_#memory_int_2|) (< .cse1 (mod v_main_~SIZE~0_3 4294967296))))) InVars {main_~SIZE~0=v_main_~SIZE~0_3, main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#array~0.base=|v_main_~#array~0.base_5|, main_~j~0=v_main_~j~0_6, #memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_5|} OutVars{main_~SIZE~0=v_main_~SIZE~0_3, main_~#array~0.base=|v_main_~#array~0.base_5|, main_~j~0=v_main_~j~0_6, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_5|} AuxVars[] AssignedVars[main_#t~nondet6, main_#t~mem7, #memory_int] {459#false} is VALID [2022-04-15 00:03:55,138 INFO L290 TraceCheckUtils]: 8: Hoare triple {549#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} [60] L21-2-->L21-3: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {545#(not (< (mod main_~j~0 4294967296) (mod main_~SIZE~0 4294967296)))} is VALID [2022-04-15 00:03:55,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {549#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} [57] L24-->L21-2: Formula: (and (<= |v_main_#t~mem7_3| v_main_~menor~0_5) (= (select (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (mod v_main_~j~0_7 4294967296)) |v_main_~#array~0.offset_6|)) v_main_~menor~0_4)) InVars {main_~#array~0.base=|v_main_~#array~0.base_6|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_4|, main_#t~mem7=|v_main_#t~mem7_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~menor~0=v_main_~menor~0_5} OutVars{main_~#array~0.base=|v_main_~#array~0.base_6|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_4|, main_#t~mem8=|v_main_#t~mem8_1|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~menor~0=v_main_~menor~0_4} AuxVars[] AssignedVars[main_#t~mem7, main_#t~mem8, main_~menor~0] {549#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} is VALID [2022-04-15 00:03:55,139 INFO L290 TraceCheckUtils]: 6: Hoare triple {549#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} [55] L21-3-->L24: Formula: (let ((.cse1 (mod v_main_~j~0_6 4294967296))) (let ((.cse0 (+ (* .cse1 4) |v_main_~#array~0.offset_5|))) (and (= |v_main_#t~mem7_1| (select (select |v_#memory_int_2| |v_main_~#array~0.base_5|) .cse0)) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= (store |v_#memory_int_3| |v_main_~#array~0.base_5| (store (select |v_#memory_int_3| |v_main_~#array~0.base_5|) .cse0 |v_main_#t~nondet6_2|)) |v_#memory_int_2|) (< .cse1 (mod v_main_~SIZE~0_3 4294967296))))) InVars {main_~SIZE~0=v_main_~SIZE~0_3, main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#array~0.base=|v_main_~#array~0.base_5|, main_~j~0=v_main_~j~0_6, #memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_5|} OutVars{main_~SIZE~0=v_main_~SIZE~0_3, main_~#array~0.base=|v_main_~#array~0.base_5|, main_~j~0=v_main_~j~0_6, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_5|} AuxVars[] AssignedVars[main_#t~nondet6, main_#t~mem7, #memory_int] {549#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} is VALID [2022-04-15 00:03:55,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {458#true} [51] mainENTRY-->L21-3: Formula: (and (= |v_main_#t~nondet4_2| v_main_~menor~0_1) (= (store |v_#length_2| |v_main_~#array~0.base_1| (* (mod v_main_~SIZE~0_1 4294967296) 4)) |v_#length_1|) (not (= |v_main_~#array~0.base_1| 0)) (= |v_#valid_1| (store |v_#valid_2| |v_main_~#array~0.base_1| 1)) (= v_main_~j~0_3 0) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_1|) (= (select |v_#valid_2| |v_main_~#array~0.base_1|) 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (= v_main_~SIZE~0_1 1) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_~#array~0.offset_1| 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{main_~SIZE~0=v_main_~SIZE~0_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#array~0.base=|v_main_~#array~0.base_1|, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, #length=|v_#length_1|, main_~menor~0=v_main_~menor~0_1} AuxVars[] AssignedVars[main_~SIZE~0, main_#t~nondet4, main_~#array~0.base, main_~k~0, main_~j~0, #valid, main_~#array~0.offset, #length, main_~menor~0] {549#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} is VALID [2022-04-15 00:03:55,140 INFO L272 TraceCheckUtils]: 4: Hoare triple {458#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-15 00:03:55,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {458#true} {458#true} [69] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-15 00:03:55,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {458#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-15 00:03:55,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {458#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select |v_#length_3| 2) 10) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {458#true} is VALID [2022-04-15 00:03:55,141 INFO L272 TraceCheckUtils]: 0: Hoare triple {458#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-15 00:03:55,141 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:03:55,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135600031] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 00:03:55,142 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 00:03:55,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-15 00:03:55,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422110600] [2022-04-15 00:03:55,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 00:03:55,142 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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 18 [2022-04-15 00:03:55,144 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:03:55,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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:03:55,166 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:03:55,167 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 00:03:55,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:03:55,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 00:03:55,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-15 00:03:55,169 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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:03:55,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:03:55,232 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-15 00:03:55,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 00:03:55,232 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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 18 [2022-04-15 00:03:55,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:03:55,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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:03:55,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2022-04-15 00:03:55,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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:03:55,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2022-04-15 00:03:55,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 21 transitions. [2022-04-15 00:03:55,254 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:03:55,254 INFO L225 Difference]: With dead ends: 19 [2022-04-15 00:03:55,254 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 00:03:55,255 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-04-15 00:03:55,257 INFO L913 BasicCegarLoop]: 7 mSDtfsCounter, 5 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 29 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:03:55,259 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 29 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 00:03:55,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 00:03:55,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 00:03:55,260 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:03:55,260 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 00:03:55,260 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 00:03:55,260 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 00:03:55,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:03:55,261 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 00:03:55,261 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:03:55,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:03:55,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:03:55,261 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 00:03:55,261 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 00:03:55,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:03:55,261 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 00:03:55,261 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:03:55,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:03:55,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:03:55,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:03:55,262 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:03:55,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 00:03:55,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 00:03:55,262 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2022-04-15 00:03:55,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:03:55,262 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 00:03:55,262 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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:03:55,262 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:03:55,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:03:55,265 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 00:03:55,292 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:03:55,483 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-15 00:03:55,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 00:03:55,538 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 00:03:55,539 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-15 00:03:55,539 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-15 00:03:55,539 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 00:03:55,539 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 00:03:55,539 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-15 00:03:55,539 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-15 00:03:55,539 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 13 31) the Hoare annotation is: true [2022-04-15 00:03:55,539 INFO L878 garLoopResultBuilder]: At program point L21-3(lines 21 26) the Hoare annotation is: (let ((.cse0 (= |main_~#array~0.offset| 0)) (.cse1 (= main_~SIZE~0 1))) (or (and .cse0 (= main_~j~0 0) .cse1) (and .cse0 (= main_~j~0 1) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) .cse1))) [2022-04-15 00:03:55,539 INFO L882 garLoopResultBuilder]: For program point L21-4(lines 21 26) no Hoare annotation was computed. [2022-04-15 00:03:55,540 INFO L882 garLoopResultBuilder]: For program point L24(lines 24 25) no Hoare annotation was computed. [2022-04-15 00:03:55,540 INFO L878 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (and (<= main_~menor~0 |main_#t~mem9|) (= |main_~#array~0.offset| 0) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) [2022-04-15 00:03:55,540 INFO L882 garLoopResultBuilder]: For program point L21-2(lines 21 26) no Hoare annotation was computed. [2022-04-15 00:03:55,540 INFO L882 garLoopResultBuilder]: For program point L28-1(line 28) no Hoare annotation was computed. [2022-04-15 00:03:55,540 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 13 31) no Hoare annotation was computed. [2022-04-15 00:03:55,540 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 13 31) no Hoare annotation was computed. [2022-04-15 00:03:55,541 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-04-15 00:03:55,541 INFO L882 garLoopResultBuilder]: For program point L6(lines 6 8) no Hoare annotation was computed. [2022-04-15 00:03:55,541 INFO L882 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-15 00:03:55,541 INFO L882 garLoopResultBuilder]: For program point L6-2(lines 5 10) no Hoare annotation was computed. [2022-04-15 00:03:55,541 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2022-04-15 00:03:55,541 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 5 10) no Hoare annotation was computed. [2022-04-15 00:03:55,544 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2022-04-15 00:03:55,545 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 00:03:55,550 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 00:03:55,550 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-15 00:03:55,551 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 00:03:55,551 WARN L170 areAnnotationChecker]: L21-4 has no Hoare annotation [2022-04-15 00:03:55,551 WARN L170 areAnnotationChecker]: L21-4 has no Hoare annotation [2022-04-15 00:03:55,551 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-15 00:03:55,551 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-15 00:03:55,551 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-15 00:03:55,551 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 00:03:55,551 WARN L170 areAnnotationChecker]: L21-4 has no Hoare annotation [2022-04-15 00:03:55,551 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-15 00:03:55,551 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-15 00:03:55,551 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-15 00:03:55,551 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-15 00:03:55,551 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-15 00:03:55,551 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2022-04-15 00:03:55,551 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:03:55,551 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-15 00:03:55,551 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 00:03:55,552 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 00:03:55,552 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 00:03:55,552 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 00:03:55,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:03:55 BasicIcfg [2022-04-15 00:03:55,563 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 00:03:55,566 INFO L158 Benchmark]: Toolchain (without parser) took 4595.67ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 113.6MB in the beginning and 116.4MB in the end (delta: -2.7MB). Peak memory consumption was 31.8MB. Max. memory is 8.0GB. [2022-04-15 00:03:55,566 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 165.7MB. Free memory is still 130.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 00:03:55,566 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.36ms. Allocated memory is still 165.7MB. Free memory was 113.5MB in the beginning and 142.8MB in the end (delta: -29.3MB). Peak memory consumption was 6.1MB. Max. memory is 8.0GB. [2022-04-15 00:03:55,568 INFO L158 Benchmark]: Boogie Preprocessor took 46.44ms. Allocated memory is still 165.7MB. Free memory was 142.8MB in the beginning and 141.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 00:03:55,568 INFO L158 Benchmark]: RCFGBuilder took 323.42ms. Allocated memory is still 165.7MB. Free memory was 141.1MB in the beginning and 129.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 00:03:55,569 INFO L158 Benchmark]: IcfgTransformer took 33.67ms. Allocated memory is still 165.7MB. Free memory was 129.6MB in the beginning and 128.2MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 00:03:55,569 INFO L158 Benchmark]: TraceAbstraction took 3879.13ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 127.5MB in the beginning and 116.4MB in the end (delta: 11.1MB). Peak memory consumption was 45.8MB. Max. memory is 8.0GB. [2022-04-15 00:03:55,571 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.15ms. Allocated memory is still 165.7MB. Free memory is still 130.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 307.36ms. Allocated memory is still 165.7MB. Free memory was 113.5MB in the beginning and 142.8MB in the end (delta: -29.3MB). Peak memory consumption was 6.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.44ms. Allocated memory is still 165.7MB. Free memory was 142.8MB in the beginning and 141.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 323.42ms. Allocated memory is still 165.7MB. Free memory was 141.1MB in the beginning and 129.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 33.67ms. Allocated memory is still 165.7MB. Free memory was 129.6MB in the beginning and 128.2MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 3879.13ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 127.5MB in the beginning and 116.4MB in the end (delta: 11.1MB). Peak memory consumption was 45.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 7]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 54 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 53 mSDsluCounter, 132 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 80 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 157 IncrementalHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 52 mSDtfsCounter, 157 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, InterpolantAutomatonStates: 22, 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, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 10 PreInvPairs, 13 NumberOfFragments, 53 HoareAnnotationTreeSize, 10 FomulaSimplifications, 3 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 5 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 90 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 115 ConstructedInterpolants, 0 QuantifiedInterpolants, 388 SizeOfPredicates, 10 NumberOfNonLiveVariables, 192 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 12/18 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: ((array == 0 && j == 0) && SIZE == 1) || (((array == 0 && j == 1) && menor <= unknown-#memory_int-unknown[array][array]) && SIZE == 1) RESULT: Ultimate proved your program to be correct! [2022-04-15 00:03:55,623 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...