./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/ldv-regression/test27-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/ldv-regression/test27-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8b17e864f5b8145df67cb2b3dc045f82af33b1bd3c9c5e4c95275bcb385f71da --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 03:56:58,804 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 03:56:58,809 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 03:56:58,841 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 03:56:58,842 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 03:56:58,843 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 03:56:58,846 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 03:56:58,851 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 03:56:58,853 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 03:56:58,856 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 03:56:58,857 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 03:56:58,859 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 03:56:58,859 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 03:56:58,865 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 03:56:58,866 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 03:56:58,867 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 03:56:58,868 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 03:56:58,869 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 03:56:58,872 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 03:56:58,877 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 03:56:58,879 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 03:56:58,879 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 03:56:58,880 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 03:56:58,881 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 03:56:58,882 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 03:56:58,888 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 03:56:58,889 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 03:56:58,889 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 03:56:58,890 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 03:56:58,891 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 03:56:58,891 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 03:56:58,892 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 03:56:58,893 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 03:56:58,894 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 03:56:58,894 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 03:56:58,895 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 03:56:58,895 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 03:56:58,896 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 03:56:58,896 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 03:56:58,897 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 03:56:58,898 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 03:56:58,900 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 03:56:58,901 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-13 03:56:58,937 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 03:56:58,938 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 03:56:58,938 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 03:56:58,938 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 03:56:58,939 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 03:56:58,940 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 03:56:58,940 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 03:56:58,940 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-13 03:56:58,940 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-13 03:56:58,941 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-13 03:56:58,941 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-13 03:56:58,941 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-13 03:56:58,942 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-13 03:56:58,942 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 03:56:58,942 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 03:56:58,942 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 03:56:58,943 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 03:56:58,943 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 03:56:58,944 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 03:56:58,944 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-13 03:56:58,944 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-13 03:56:58,944 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-13 03:56:58,944 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 03:56:58,944 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 03:56:58,945 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-13 03:56:58,945 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 03:56:58,945 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-13 03:56:58,945 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 03:56:58,945 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 03:56:58,946 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 03:56:58,946 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 03:56:58,947 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-13 03:56:58,947 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8b17e864f5b8145df67cb2b3dc045f82af33b1bd3c9c5e4c95275bcb385f71da [2022-07-13 03:56:59,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 03:56:59,171 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 03:56:59,173 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 03:56:59,174 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 03:56:59,174 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 03:56:59,175 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test27-2.c [2022-07-13 03:56:59,241 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43f6f2cb1/2db1bcf4d2584747a53b6968d3c9d1eb/FLAGdd8373608 [2022-07-13 03:56:59,644 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 03:56:59,645 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test27-2.c [2022-07-13 03:56:59,650 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43f6f2cb1/2db1bcf4d2584747a53b6968d3c9d1eb/FLAGdd8373608 [2022-07-13 03:56:59,659 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43f6f2cb1/2db1bcf4d2584747a53b6968d3c9d1eb [2022-07-13 03:56:59,661 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 03:56:59,662 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 03:56:59,664 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 03:56:59,664 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 03:56:59,667 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 03:56:59,668 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:56:59" (1/1) ... [2022-07-13 03:56:59,669 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41519018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:59, skipping insertion in model container [2022-07-13 03:56:59,670 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:56:59" (1/1) ... [2022-07-13 03:56:59,675 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 03:56:59,692 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 03:56:59,807 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test27-2.c[1224,1237] [2022-07-13 03:56:59,808 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:56:59,819 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 03:56:59,843 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test27-2.c[1224,1237] [2022-07-13 03:56:59,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:56:59,863 INFO L208 MainTranslator]: Completed translation [2022-07-13 03:56:59,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:59 WrapperNode [2022-07-13 03:56:59,863 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 03:56:59,864 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 03:56:59,865 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 03:56:59,865 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 03:56:59,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:59" (1/1) ... [2022-07-13 03:56:59,890 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:59" (1/1) ... [2022-07-13 03:56:59,917 INFO L137 Inliner]: procedures = 16, calls = 42, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 110 [2022-07-13 03:56:59,917 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 03:56:59,919 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 03:56:59,919 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 03:56:59,919 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 03:56:59,926 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:59" (1/1) ... [2022-07-13 03:56:59,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:59" (1/1) ... [2022-07-13 03:56:59,932 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:59" (1/1) ... [2022-07-13 03:56:59,933 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:59" (1/1) ... [2022-07-13 03:56:59,948 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:59" (1/1) ... [2022-07-13 03:56:59,954 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:59" (1/1) ... [2022-07-13 03:56:59,959 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:59" (1/1) ... [2022-07-13 03:56:59,961 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 03:56:59,962 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 03:56:59,962 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 03:56:59,962 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 03:56:59,964 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:59" (1/1) ... [2022-07-13 03:56:59,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:56:59,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:57:00,022 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:57:00,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-13 03:57:00,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 03:57:00,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 03:57:00,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 03:57:00,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 03:57:00,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 03:57:00,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 03:57:00,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 03:57:00,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 03:57:00,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 03:57:00,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 03:57:00,133 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 03:57:00,134 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 03:57:00,424 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 03:57:00,432 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 03:57:00,433 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 03:57:00,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:57:00 BoogieIcfgContainer [2022-07-13 03:57:00,434 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 03:57:00,435 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-13 03:57:00,435 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-13 03:57:00,440 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-13 03:57:00,441 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:57:00,441 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.07 03:56:59" (1/3) ... [2022-07-13 03:57:00,442 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@333686a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:57:00, skipping insertion in model container [2022-07-13 03:57:00,442 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:57:00,443 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:59" (2/3) ... [2022-07-13 03:57:00,443 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@333686a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:57:00, skipping insertion in model container [2022-07-13 03:57:00,443 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:57:00,443 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:57:00" (3/3) ... [2022-07-13 03:57:00,446 INFO L354 chiAutomizerObserver]: Analyzing ICFG test27-2.c [2022-07-13 03:57:00,515 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-13 03:57:00,516 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-13 03:57:00,516 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-13 03:57:00,516 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-13 03:57:00,516 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-13 03:57:00,517 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-13 03:57:00,517 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-13 03:57:00,517 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-13 03:57:00,522 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 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-07-13 03:57:00,546 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-07-13 03:57:00,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:57:00,546 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:57:00,552 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:57:00,553 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:57:00,553 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-13 03:57:00,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 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-07-13 03:57:00,556 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-07-13 03:57:00,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:57:00,556 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:57:00,557 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:57:00,557 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:57:00,563 INFO L752 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet10#1, main_#t~post9#1, main_~j~0#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~pre19#1, main_#t~mem18#1, main_#t~ret20#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~pa~0#1.base, main_~pa~0#1.offset;call main_~#cont~0#1.base, main_~#cont~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0#1.base, main_~#dummy~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0#1.base, main_~#dummies~0#1.offset := #Ultimate.allocOnStack(40);call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~i~0#1;havoc main_~pa~0#1.base, main_~pa~0#1.offset;main_~i~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~j~0#1 := 0; 14#L29-3true [2022-07-13 03:57:00,563 INFO L754 eck$LassoCheckResult]: Loop: 14#L29-3true assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 16#L29-2true main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 14#L29-3true [2022-07-13 03:57:00,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:57:00,572 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-13 03:57:00,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:57:00,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107048864] [2022-07-13 03:57:00,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:57:00,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:57:00,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:57:00,718 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:57:00,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:57:00,772 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:57:00,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:57:00,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2022-07-13 03:57:00,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:57:00,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964786084] [2022-07-13 03:57:00,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:57:00,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:57:00,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:57:00,818 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:57:00,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:57:00,835 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:57:00,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:57:00,836 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-07-13 03:57:00,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:57:00,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636849391] [2022-07-13 03:57:00,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:57:00,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:57:00,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:57:00,890 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:57:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:57:00,938 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:57:01,786 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:57:01,787 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:57:01,787 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:57:01,787 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:57:01,787 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:57:01,788 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:57:01,788 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:57:01,788 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:57:01,788 INFO L133 ssoRankerPreferences]: Filename of dumped script: test27-2.c_Iteration1_Lasso [2022-07-13 03:57:01,789 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:57:01,789 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:57:01,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:57:01,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:57:01,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:57:01,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:57:02,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:57:02,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:57:02,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:57:02,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:57:02,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:57:02,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:57:02,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:57:02,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:57:02,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:57:02,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:57:02,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:57:02,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:57:02,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:57:02,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:57:02,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:57:02,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:57:02,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:57:02,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:57:02,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:57:02,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:57:02,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:57:02,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:57:02,658 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:57:02,661 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 03:57:02,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:57:02,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:57:02,667 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:57:02,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-13 03:57:02,679 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:57:02,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:57:02,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:57:02,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:57:02,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:57:02,693 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:57:02,693 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:57:02,696 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:57:02,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-13 03:57:02,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:57:02,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:57:02,721 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:57:02,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-13 03:57:02,724 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:57:02,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:57:02,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:57:02,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:57:02,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:57:02,738 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:57:02,738 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:57:02,741 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:57:02,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-13 03:57:02,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:57:02,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:57:02,766 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:57:02,778 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:57:02,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:57:02,786 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:57:02,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:57:02,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:57:02,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:57:02,788 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:57:02,788 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:57:02,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-13 03:57:02,799 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:57:02,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-13 03:57:02,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:57:02,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:57:02,818 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:57:02,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-13 03:57:02,823 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:57:02,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:57:02,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:57:02,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:57:02,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:57:02,839 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:57:02,839 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:57:02,858 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 03:57:02,925 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2022-07-13 03:57:02,925 INFO L444 ModelExtractionUtils]: 0 out of 19 variables were initially zero. Simplification set additionally 16 variables to zero. [2022-07-13 03:57:02,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:57:02,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:57:02,944 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:57:02,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-13 03:57:02,969 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 03:57:02,996 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-13 03:57:02,996 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 03:57:02,997 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1, v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1) = -8*ULTIMATE.start_main_~j~0#1 + 19*v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1 Supporting invariants [] [2022-07-13 03:57:03,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-13 03:57:03,117 INFO L293 tatePredicateManager]: 26 out of 26 supporting invariants were superfluous and have been removed [2022-07-13 03:57:03,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:57:03,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:57:03,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 03:57:03,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:57:03,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:57:03,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 03:57:03,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:57:03,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:57:03,304 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-13 03:57:03,306 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 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 has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-07-13 03:57:03,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-13 03:57:03,423 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 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 has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Result 39 states and 56 transitions. Complement of second has 8 states. [2022-07-13 03:57:03,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-13 03:57:03,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-07-13 03:57:03,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-07-13 03:57:03,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 2 letters. Loop has 2 letters. [2022-07-13 03:57:03,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:57:03,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 4 letters. Loop has 2 letters. [2022-07-13 03:57:03,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:57:03,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 2 letters. Loop has 4 letters. [2022-07-13 03:57:03,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:57:03,434 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 56 transitions. [2022-07-13 03:57:03,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-13 03:57:03,443 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 9 states and 11 transitions. [2022-07-13 03:57:03,444 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-07-13 03:57:03,445 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-07-13 03:57:03,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2022-07-13 03:57:03,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:57:03,446 INFO L369 hiAutomatonCegarLoop]: Abstraction has 9 states and 11 transitions. [2022-07-13 03:57:03,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2022-07-13 03:57:03,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-07-13 03:57:03,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 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-07-13 03:57:03,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2022-07-13 03:57:03,467 INFO L392 hiAutomatonCegarLoop]: Abstraction has 9 states and 11 transitions. [2022-07-13 03:57:03,467 INFO L374 stractBuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2022-07-13 03:57:03,467 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-13 03:57:03,467 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2022-07-13 03:57:03,468 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-13 03:57:03,468 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:57:03,468 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:57:03,469 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-13 03:57:03,469 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:57:03,470 INFO L752 eck$LassoCheckResult]: Stem: 199#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 200#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet10#1, main_#t~post9#1, main_~j~0#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~pre19#1, main_#t~mem18#1, main_#t~ret20#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~pa~0#1.base, main_~pa~0#1.offset;call main_~#cont~0#1.base, main_~#cont~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0#1.base, main_~#dummy~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0#1.base, main_~#dummies~0#1.offset := #Ultimate.allocOnStack(40);call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~i~0#1;havoc main_~pa~0#1.base, main_~pa~0#1.offset;main_~i~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~j~0#1 := 0; 201#L29-3 assume !(main_~j~0#1 < 10); 202#L29-4 assume main_~i~0#1 >= 0 && main_~i~0#1 < 9;call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, main_~#dummy~0#1.base, main_~#dummy~0#1.offset, 4);call write~$Pointer$(main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * (1 + main_~i~0#1), 4);call write~$Pointer$(main_~#dummies~0#1.base, main_~#dummies~0#1.offset, main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_#t~mem11#1.base, main_#t~mem11#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_#t~mem12#1.base, main_#t~mem12#1.offset, 4);main_~pa~0#1.base, main_~pa~0#1.offset := main_#t~mem13#1.base, main_#t~mem13#1.offset + 4 * main_~i~0#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset;call main_#t~mem14#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 205#L42 assume main_#t~mem14#1 > 0;havoc main_#t~mem14#1;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * (1 + main_~i~0#1), 4);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_#t~mem15#1.base, main_#t~mem15#1.offset, 4);call main_#t~mem17#1 := read~int(main_#t~mem16#1.base, main_#t~mem16#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := main_#t~mem17#1 - 10;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem17#1; 206#L44-3 [2022-07-13 03:57:03,470 INFO L754 eck$LassoCheckResult]: Loop: 206#L44-3 call main_#t~mem18#1 := read~int(main_~pa~0#1.base, main_~pa~0#1.offset, 4); 207#L44-1 assume !!(main_~i~0#1 < main_#t~mem18#1);havoc main_#t~mem18#1;main_#t~pre19#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre19#1; 206#L44-3 [2022-07-13 03:57:03,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:57:03,471 INFO L85 PathProgramCache]: Analyzing trace with hash 28697000, now seen corresponding path program 1 times [2022-07-13 03:57:03,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:57:03,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206513732] [2022-07-13 03:57:03,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:57:03,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:57:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:57:03,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:57:03,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:57:03,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206513732] [2022-07-13 03:57:03,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206513732] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:57:03,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:57:03,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:57:03,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358857903] [2022-07-13 03:57:03,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:57:03,545 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:57:03,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:57:03,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 1 times [2022-07-13 03:57:03,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:57:03,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305161919] [2022-07-13 03:57:03,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:57:03,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:57:03,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:57:03,550 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:57:03,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:57:03,553 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:57:03,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:57:03,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:57:03,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:57:03,579 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-07-13 03:57:03,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:57:03,589 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2022-07-13 03:57:03,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:57:03,590 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2022-07-13 03:57:03,591 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-13 03:57:03,591 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 11 transitions. [2022-07-13 03:57:03,591 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-07-13 03:57:03,591 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-07-13 03:57:03,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2022-07-13 03:57:03,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:57:03,592 INFO L369 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2022-07-13 03:57:03,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2022-07-13 03:57:03,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2022-07-13 03:57:03,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 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-07-13 03:57:03,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2022-07-13 03:57:03,593 INFO L392 hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions. [2022-07-13 03:57:03,593 INFO L374 stractBuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2022-07-13 03:57:03,594 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-13 03:57:03,594 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2022-07-13 03:57:03,594 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-13 03:57:03,594 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:57:03,594 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:57:03,594 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:57:03,595 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:57:03,595 INFO L752 eck$LassoCheckResult]: Stem: 224#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 225#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet10#1, main_#t~post9#1, main_~j~0#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~pre19#1, main_#t~mem18#1, main_#t~ret20#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~pa~0#1.base, main_~pa~0#1.offset;call main_~#cont~0#1.base, main_~#cont~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0#1.base, main_~#dummy~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0#1.base, main_~#dummies~0#1.offset := #Ultimate.allocOnStack(40);call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~i~0#1;havoc main_~pa~0#1.base, main_~pa~0#1.offset;main_~i~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~j~0#1 := 0; 226#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 227#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 228#L29-3 assume !(main_~j~0#1 < 10); 229#L29-4 assume main_~i~0#1 >= 0 && main_~i~0#1 < 9;call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, main_~#dummy~0#1.base, main_~#dummy~0#1.offset, 4);call write~$Pointer$(main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * (1 + main_~i~0#1), 4);call write~$Pointer$(main_~#dummies~0#1.base, main_~#dummies~0#1.offset, main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_#t~mem11#1.base, main_#t~mem11#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_#t~mem12#1.base, main_#t~mem12#1.offset, 4);main_~pa~0#1.base, main_~pa~0#1.offset := main_#t~mem13#1.base, main_#t~mem13#1.offset + 4 * main_~i~0#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset;call main_#t~mem14#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 230#L42 assume main_#t~mem14#1 > 0;havoc main_#t~mem14#1;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * (1 + main_~i~0#1), 4);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_#t~mem15#1.base, main_#t~mem15#1.offset, 4);call main_#t~mem17#1 := read~int(main_#t~mem16#1.base, main_#t~mem16#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := main_#t~mem17#1 - 10;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem17#1; 231#L44-3 [2022-07-13 03:57:03,595 INFO L754 eck$LassoCheckResult]: Loop: 231#L44-3 call main_#t~mem18#1 := read~int(main_~pa~0#1.base, main_~pa~0#1.offset, 4); 232#L44-1 assume !!(main_~i~0#1 < main_#t~mem18#1);havoc main_#t~mem18#1;main_#t~pre19#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre19#1; 231#L44-3 [2022-07-13 03:57:03,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:57:03,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1809669606, now seen corresponding path program 1 times [2022-07-13 03:57:03,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:57:03,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069024995] [2022-07-13 03:57:03,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:57:03,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:57:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:57:03,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:57:03,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:57:03,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069024995] [2022-07-13 03:57:03,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069024995] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:57:03,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188147906] [2022-07-13 03:57:03,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:57:03,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:57:03,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:57:03,639 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:57:03,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 03:57:03,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:57:03,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 03:57:03,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:57:03,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:57:03,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:57:03,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:57:03,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188147906] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:57:03,780 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:57:03,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-13 03:57:03,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687036774] [2022-07-13 03:57:03,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:57:03,781 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:57:03,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:57:03,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 2 times [2022-07-13 03:57:03,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:57:03,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897637206] [2022-07-13 03:57:03,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:57:03,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:57:03,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:57:03,786 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:57:03,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:57:03,790 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:57:03,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:57:03,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 03:57:03,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-13 03:57:03,816 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 3 Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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-07-13 03:57:03,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:57:03,843 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-07-13 03:57:03,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 03:57:03,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 16 transitions. [2022-07-13 03:57:03,845 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-13 03:57:03,845 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 16 transitions. [2022-07-13 03:57:03,845 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-07-13 03:57:03,845 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-07-13 03:57:03,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 16 transitions. [2022-07-13 03:57:03,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:57:03,846 INFO L369 hiAutomatonCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-07-13 03:57:03,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 16 transitions. [2022-07-13 03:57:03,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-07-13 03:57:03,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 14 states have internal predecessors, (16), 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-07-13 03:57:03,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-07-13 03:57:03,848 INFO L392 hiAutomatonCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-07-13 03:57:03,848 INFO L374 stractBuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-07-13 03:57:03,848 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-13 03:57:03,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2022-07-13 03:57:03,848 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-13 03:57:03,848 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:57:03,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:57:03,850 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1] [2022-07-13 03:57:03,850 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:57:03,850 INFO L752 eck$LassoCheckResult]: Stem: 298#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 299#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet10#1, main_#t~post9#1, main_~j~0#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~pre19#1, main_#t~mem18#1, main_#t~ret20#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~pa~0#1.base, main_~pa~0#1.offset;call main_~#cont~0#1.base, main_~#cont~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0#1.base, main_~#dummy~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0#1.base, main_~#dummies~0#1.offset := #Ultimate.allocOnStack(40);call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~i~0#1;havoc main_~pa~0#1.base, main_~pa~0#1.offset;main_~i~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~j~0#1 := 0; 294#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 295#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 296#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 297#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 304#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 308#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 307#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 306#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 305#L29-3 assume !(main_~j~0#1 < 10); 300#L29-4 assume main_~i~0#1 >= 0 && main_~i~0#1 < 9;call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, main_~#dummy~0#1.base, main_~#dummy~0#1.offset, 4);call write~$Pointer$(main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * (1 + main_~i~0#1), 4);call write~$Pointer$(main_~#dummies~0#1.base, main_~#dummies~0#1.offset, main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_#t~mem11#1.base, main_#t~mem11#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_#t~mem12#1.base, main_#t~mem12#1.offset, 4);main_~pa~0#1.base, main_~pa~0#1.offset := main_#t~mem13#1.base, main_#t~mem13#1.offset + 4 * main_~i~0#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset;call main_#t~mem14#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 301#L42 assume main_#t~mem14#1 > 0;havoc main_#t~mem14#1;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * (1 + main_~i~0#1), 4);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_#t~mem15#1.base, main_#t~mem15#1.offset, 4);call main_#t~mem17#1 := read~int(main_#t~mem16#1.base, main_#t~mem16#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := main_#t~mem17#1 - 10;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem17#1; 302#L44-3 [2022-07-13 03:57:03,850 INFO L754 eck$LassoCheckResult]: Loop: 302#L44-3 call main_#t~mem18#1 := read~int(main_~pa~0#1.base, main_~pa~0#1.offset, 4); 303#L44-1 assume !!(main_~i~0#1 < main_#t~mem18#1);havoc main_#t~mem18#1;main_#t~pre19#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre19#1; 302#L44-3 [2022-07-13 03:57:03,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:57:03,850 INFO L85 PathProgramCache]: Analyzing trace with hash 82232736, now seen corresponding path program 2 times [2022-07-13 03:57:03,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:57:03,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516434659] [2022-07-13 03:57:03,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:57:03,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:57:03,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:57:03,962 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:57:03,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:57:03,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516434659] [2022-07-13 03:57:03,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516434659] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:57:03,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844428656] [2022-07-13 03:57:03,966 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 03:57:03,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:57:03,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:57:03,968 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:57:03,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 03:57:04,176 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 03:57:04,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 03:57:04,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 03:57:04,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:57:04,198 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:57:04,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:57:04,253 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:57:04,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844428656] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:57:04,253 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:57:04,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-07-13 03:57:04,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228094631] [2022-07-13 03:57:04,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:57:04,254 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:57:04,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:57:04,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 3 times [2022-07-13 03:57:04,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:57:04,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051409777] [2022-07-13 03:57:04,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:57:04,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:57:04,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:57:04,259 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:57:04,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:57:04,262 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:57:04,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:57:04,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 03:57:04,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-07-13 03:57:04,287 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 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-07-13 03:57:04,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:57:04,332 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-07-13 03:57:04,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 03:57:04,333 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 28 transitions. [2022-07-13 03:57:04,334 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-13 03:57:04,335 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 28 transitions. [2022-07-13 03:57:04,335 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-07-13 03:57:04,335 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-07-13 03:57:04,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 28 transitions. [2022-07-13 03:57:04,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:57:04,335 INFO L369 hiAutomatonCegarLoop]: Abstraction has 27 states and 28 transitions. [2022-07-13 03:57:04,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 28 transitions. [2022-07-13 03:57:04,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-07-13 03:57:04,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.037037037037037) internal successors, (28), 26 states have internal predecessors, (28), 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-07-13 03:57:04,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2022-07-13 03:57:04,337 INFO L392 hiAutomatonCegarLoop]: Abstraction has 27 states and 28 transitions. [2022-07-13 03:57:04,337 INFO L374 stractBuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2022-07-13 03:57:04,337 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-13 03:57:04,337 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 28 transitions. [2022-07-13 03:57:04,338 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-13 03:57:04,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:57:04,338 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:57:04,339 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1] [2022-07-13 03:57:04,339 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:57:04,339 INFO L752 eck$LassoCheckResult]: Stem: 424#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 425#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet10#1, main_#t~post9#1, main_~j~0#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~pre19#1, main_#t~mem18#1, main_#t~ret20#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~pa~0#1.base, main_~pa~0#1.offset;call main_~#cont~0#1.base, main_~#cont~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0#1.base, main_~#dummy~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0#1.base, main_~#dummies~0#1.offset := #Ultimate.allocOnStack(40);call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~i~0#1;havoc main_~pa~0#1.base, main_~pa~0#1.offset;main_~i~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~j~0#1 := 0; 426#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 427#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 428#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 429#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 434#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 450#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 449#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 448#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 447#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 446#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 445#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 444#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 443#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 442#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 441#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 440#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 439#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 438#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 437#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 436#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 435#L29-3 assume !(main_~j~0#1 < 10); 430#L29-4 assume main_~i~0#1 >= 0 && main_~i~0#1 < 9;call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, main_~#dummy~0#1.base, main_~#dummy~0#1.offset, 4);call write~$Pointer$(main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * (1 + main_~i~0#1), 4);call write~$Pointer$(main_~#dummies~0#1.base, main_~#dummies~0#1.offset, main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_#t~mem11#1.base, main_#t~mem11#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_#t~mem12#1.base, main_#t~mem12#1.offset, 4);main_~pa~0#1.base, main_~pa~0#1.offset := main_#t~mem13#1.base, main_#t~mem13#1.offset + 4 * main_~i~0#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset;call main_#t~mem14#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 431#L42 assume main_#t~mem14#1 > 0;havoc main_#t~mem14#1;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * (1 + main_~i~0#1), 4);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_#t~mem15#1.base, main_#t~mem15#1.offset, 4);call main_#t~mem17#1 := read~int(main_#t~mem16#1.base, main_#t~mem16#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := main_#t~mem17#1 - 10;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem17#1; 432#L44-3 [2022-07-13 03:57:04,339 INFO L754 eck$LassoCheckResult]: Loop: 432#L44-3 call main_#t~mem18#1 := read~int(main_~pa~0#1.base, main_~pa~0#1.offset, 4); 433#L44-1 assume !!(main_~i~0#1 < main_#t~mem18#1);havoc main_#t~mem18#1;main_#t~pre19#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre19#1; 432#L44-3 [2022-07-13 03:57:04,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:57:04,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1520933524, now seen corresponding path program 3 times [2022-07-13 03:57:04,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:57:04,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860099811] [2022-07-13 03:57:04,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:57:04,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:57:04,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:57:07,225 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 12 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:57:07,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:57:07,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860099811] [2022-07-13 03:57:07,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860099811] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:57:07,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920194686] [2022-07-13 03:57:07,226 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 03:57:07,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:57:07,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:57:07,257 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:57:07,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-13 03:57:24,947 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-07-13 03:57:24,947 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 03:57:24,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 122 conjunts are in the unsatisfiable core [2022-07-13 03:57:24,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:57:25,057 INFO L356 Elim1Store]: treesize reduction 117, result has 12.0 percent of original size [2022-07-13 03:57:25,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 60 treesize of output 62 [2022-07-13 03:57:25,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2022-07-13 03:57:25,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-13 03:57:25,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:25,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2022-07-13 03:57:25,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:25,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 24 [2022-07-13 03:57:25,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:25,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2022-07-13 03:57:25,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:25,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:25,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:25,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 36 [2022-07-13 03:57:25,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:25,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2022-07-13 03:57:25,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:25,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:25,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:25,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:25,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:25,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:25,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2022-07-13 03:57:26,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:26,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 46 [2022-07-13 03:57:26,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:26,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:26,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:26,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:26,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:26,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:26,161 INFO L356 Elim1Store]: treesize reduction 96, result has 38.9 percent of original size [2022-07-13 03:57:26,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 84 [2022-07-13 03:57:26,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:26,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 110 [2022-07-13 03:57:26,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:26,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:26,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:26,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:26,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:26,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:26,569 INFO L356 Elim1Store]: treesize reduction 96, result has 38.9 percent of original size [2022-07-13 03:57:26,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 105 treesize of output 124 [2022-07-13 03:57:27,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:27,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 211 treesize of output 174 [2022-07-13 03:57:27,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:27,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:27,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:27,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:27,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:27,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:27,572 INFO L356 Elim1Store]: treesize reduction 96, result has 38.9 percent of original size [2022-07-13 03:57:27,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 169 treesize of output 156 [2022-07-13 03:57:28,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:28,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 129 [2022-07-13 03:57:28,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:28,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:28,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:28,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:28,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:28,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:28,615 INFO L356 Elim1Store]: treesize reduction 96, result has 38.9 percent of original size [2022-07-13 03:57:28,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 124 treesize of output 135 [2022-07-13 03:57:29,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:29,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 161 [2022-07-13 03:57:29,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:29,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:29,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:29,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:29,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:29,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:29,370 INFO L356 Elim1Store]: treesize reduction 96, result has 38.9 percent of original size [2022-07-13 03:57:29,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 156 treesize of output 167 [2022-07-13 03:57:30,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:30,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:30,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:30,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:30,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:30,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:30,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 63 [2022-07-13 03:57:30,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:30,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:30,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:30,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 41 [2022-07-13 03:57:30,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-07-13 03:57:30,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:30,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:30,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:30,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-13 03:57:30,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 41 [2022-07-13 03:57:30,304 INFO L356 Elim1Store]: treesize reduction 32, result has 43.9 percent of original size [2022-07-13 03:57:30,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 34 [2022-07-13 03:57:30,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:30,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:30,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:30,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:30,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:30,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 03:57:30,367 INFO L356 Elim1Store]: treesize reduction 122, result has 26.1 percent of original size [2022-07-13 03:57:30,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 67 [2022-07-13 03:57:30,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 47 [2022-07-13 03:57:30,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2022-07-13 03:57:30,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 18 [2022-07-13 03:57:30,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-13 03:57:30,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-07-13 03:57:30,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 treesize of output 12 [2022-07-13 03:57:30,594 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:57:30,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:57:30,856 INFO L356 Elim1Store]: treesize reduction 42, result has 55.3 percent of original size [2022-07-13 03:57:30,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 2442 treesize of output 2170 [2022-07-13 03:57:30,885 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 03:57:30,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 2118 treesize of output 2034 [2022-07-13 03:57:31,010 INFO L356 Elim1Store]: treesize reduction 75, result has 66.8 percent of original size [2022-07-13 03:57:31,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 20958 treesize of output 19882 [2022-07-13 03:57:31,194 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 03:57:31,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 19714 treesize of output 19581 [2022-07-13 03:57:31,397 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 03:57:31,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 25149 treesize of output 24762 [2022-07-13 03:57:31,662 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 03:57:31,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 30346 treesize of output 29952 [2022-07-13 03:57:31,953 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 03:57:31,955 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-07-13 03:57:32,119 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 1234 treesize of output 1162 [2022-07-13 03:57:32,365 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 1158 treesize of output 966 [2022-07-13 03:57:32,534 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 966 treesize of output 870 [2022-07-13 03:57:32,686 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 459 treesize of output 411 [2022-07-13 03:57:39,590 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 03:57:39,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 11 treesize of output 10 [2022-07-13 03:57:41,958 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 03:57:41,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 3450 treesize of output 3556