./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c3fed411 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/termination-memory-alloca/java_Nested-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash e23f623e36810418f8259db464ff0229ef2650c877ad54b7024836b278c00de1 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-19 17:37:02,778 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-19 17:37:02,779 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-19 17:37:02,833 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-19 17:37:02,833 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-19 17:37:02,834 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-19 17:37:02,835 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-19 17:37:02,836 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-19 17:37:02,837 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-19 17:37:02,837 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-19 17:37:02,838 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-19 17:37:02,838 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-19 17:37:02,839 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-19 17:37:02,839 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-19 17:37:02,840 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-19 17:37:02,841 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-19 17:37:02,841 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-19 17:37:02,842 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-19 17:37:02,843 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-19 17:37:02,844 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-19 17:37:02,846 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-19 17:37:02,851 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-19 17:37:02,852 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-19 17:37:02,853 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-19 17:37:02,854 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-19 17:37:02,856 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-19 17:37:02,857 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-19 17:37:02,857 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-19 17:37:02,859 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-19 17:37:02,860 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-19 17:37:02,860 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-19 17:37:02,861 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-19 17:37:02,861 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-19 17:37:02,862 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-19 17:37:02,863 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-19 17:37:02,864 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-19 17:37:02,864 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-19 17:37:02,865 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-19 17:37:02,865 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-19 17:37:02,865 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-19 17:37:02,866 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-19 17:37:02,866 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-12-19 17:37:02,890 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-19 17:37:02,890 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-19 17:37:02,890 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-19 17:37:02,891 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-19 17:37:02,891 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-19 17:37:02,892 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-19 17:37:02,892 INFO L138 SettingsManager]: * Use SBE=true [2021-12-19 17:37:02,892 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-19 17:37:02,892 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-19 17:37:02,892 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-19 17:37:02,893 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-19 17:37:02,893 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-19 17:37:02,893 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-19 17:37:02,893 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-19 17:37:02,893 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-19 17:37:02,893 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-19 17:37:02,893 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-19 17:37:02,894 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-19 17:37:02,894 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-19 17:37:02,894 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-19 17:37:02,894 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-19 17:37:02,894 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-19 17:37:02,894 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-19 17:37:02,894 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-19 17:37:02,895 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-19 17:37:02,895 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-19 17:37:02,895 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-19 17:37:02,896 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-19 17:37:02,896 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-19 17:37:02,896 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-19 17:37:02,896 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e23f623e36810418f8259db464ff0229ef2650c877ad54b7024836b278c00de1 [2021-12-19 17:37:03,100 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-19 17:37:03,119 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-19 17:37:03,121 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-19 17:37:03,122 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-19 17:37:03,122 INFO L275 PluginConnector]: CDTParser initialized [2021-12-19 17:37:03,123 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i [2021-12-19 17:37:03,164 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/009836449/7d0a0793aabb4bf4b322114efe488dfc/FLAGc58089724 [2021-12-19 17:37:03,488 INFO L306 CDTParser]: Found 1 translation units. [2021-12-19 17:37:03,488 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_Nested-alloca.i [2021-12-19 17:37:03,497 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/009836449/7d0a0793aabb4bf4b322114efe488dfc/FLAGc58089724 [2021-12-19 17:37:03,880 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/009836449/7d0a0793aabb4bf4b322114efe488dfc [2021-12-19 17:37:03,881 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-19 17:37:03,883 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-19 17:37:03,887 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-19 17:37:03,887 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-19 17:37:03,896 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-19 17:37:03,896 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:37:03" (1/1) ... [2021-12-19 17:37:03,897 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@575e00b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:37:03, skipping insertion in model container [2021-12-19 17:37:03,897 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:37:03" (1/1) ... [2021-12-19 17:37:03,904 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-19 17:37:03,935 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-19 17:37:04,167 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 17:37:04,175 INFO L203 MainTranslator]: Completed pre-run [2021-12-19 17:37:04,205 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 17:37:04,221 INFO L208 MainTranslator]: Completed translation [2021-12-19 17:37:04,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:37:04 WrapperNode [2021-12-19 17:37:04,221 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-19 17:37:04,222 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-19 17:37:04,222 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-19 17:37:04,222 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-19 17:37:04,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:37:04" (1/1) ... [2021-12-19 17:37:04,241 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:37:04" (1/1) ... [2021-12-19 17:37:04,256 INFO L137 Inliner]: procedures = 109, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 58 [2021-12-19 17:37:04,257 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-19 17:37:04,258 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-19 17:37:04,258 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-19 17:37:04,258 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-19 17:37:04,263 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:37:04" (1/1) ... [2021-12-19 17:37:04,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:37:04" (1/1) ... [2021-12-19 17:37:04,273 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:37:04" (1/1) ... [2021-12-19 17:37:04,273 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:37:04" (1/1) ... [2021-12-19 17:37:04,279 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:37:04" (1/1) ... [2021-12-19 17:37:04,282 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:37:04" (1/1) ... [2021-12-19 17:37:04,285 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:37:04" (1/1) ... [2021-12-19 17:37:04,286 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-19 17:37:04,287 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-19 17:37:04,287 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-19 17:37:04,287 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-19 17:37:04,291 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:37:04" (1/1) ... [2021-12-19 17:37:04,295 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:37:04,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:37:04,312 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) [2021-12-19 17:37:04,318 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 [2021-12-19 17:37:04,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-19 17:37:04,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-19 17:37:04,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-19 17:37:04,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-19 17:37:04,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-19 17:37:04,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-19 17:37:04,389 INFO L236 CfgBuilder]: Building ICFG [2021-12-19 17:37:04,390 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-19 17:37:04,467 INFO L277 CfgBuilder]: Performing block encoding [2021-12-19 17:37:04,470 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-19 17:37:04,470 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-19 17:37:04,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:37:04 BoogieIcfgContainer [2021-12-19 17:37:04,472 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-19 17:37:04,472 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-19 17:37:04,472 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-19 17:37:04,475 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-19 17:37:04,483 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-19 17:37:04,483 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.12 05:37:03" (1/3) ... [2021-12-19 17:37:04,499 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@18ed9a69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.12 05:37:04, skipping insertion in model container [2021-12-19 17:37:04,499 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-19 17:37:04,499 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:37:04" (2/3) ... [2021-12-19 17:37:04,500 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@18ed9a69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.12 05:37:04, skipping insertion in model container [2021-12-19 17:37:04,504 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-19 17:37:04,504 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:37:04" (3/3) ... [2021-12-19 17:37:04,505 INFO L388 chiAutomizerObserver]: Analyzing ICFG java_Nested-alloca.i [2021-12-19 17:37:04,544 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-19 17:37:04,544 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-19 17:37:04,544 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-19 17:37:04,544 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-19 17:37:04,544 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-19 17:37:04,544 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-19 17:37:04,544 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-19 17:37:04,545 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-19 17:37:04,556 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 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) [2021-12-19 17:37:04,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-12-19 17:37:04,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:37:04,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:37:04,569 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-19 17:37:04,569 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-19 17:37:04,569 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-19 17:37:04,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 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) [2021-12-19 17:37:04,570 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-12-19 17:37:04,571 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:37:04,571 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:37:04,571 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-19 17:37:04,571 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-19 17:37:04,575 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 6#L552-4true [2021-12-19 17:37:04,575 INFO L793 eck$LassoCheckResult]: Loop: 6#L552-4true call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 13#L552-1true assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call write~int(3, main_~j~0#1.base, main_~j~0#1.offset, 4); 12#L553-4true assume !true; 5#L552-3true call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; 6#L552-4true [2021-12-19 17:37:04,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:37:04,579 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-19 17:37:04,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:37:04,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747407237] [2021-12-19 17:37:04,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:37:04,585 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:37:04,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:37:04,669 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:37:04,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:37:04,712 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:37:04,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:37:04,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1113608, now seen corresponding path program 1 times [2021-12-19 17:37:04,714 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:37:04,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130167062] [2021-12-19 17:37:04,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:37:04,715 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:37:04,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:37:04,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:37:04,772 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:37:04,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130167062] [2021-12-19 17:37:04,773 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130167062] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 17:37:04,773 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 17:37:04,773 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-19 17:37:04,773 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613294991] [2021-12-19 17:37:04,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 17:37:04,776 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-19 17:37:04,776 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:37:04,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-19 17:37:04,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-19 17:37:04,801 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 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 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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) [2021-12-19 17:37:04,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:37:04,805 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2021-12-19 17:37:04,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-19 17:37:04,808 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2021-12-19 17:37:04,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-12-19 17:37:04,812 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 8 states and 9 transitions. [2021-12-19 17:37:04,812 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2021-12-19 17:37:04,812 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2021-12-19 17:37:04,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2021-12-19 17:37:04,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 17:37:04,814 INFO L681 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2021-12-19 17:37:04,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2021-12-19 17:37:04,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2021-12-19 17:37:04,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 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) [2021-12-19 17:37:04,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2021-12-19 17:37:04,829 INFO L704 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2021-12-19 17:37:04,829 INFO L587 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2021-12-19 17:37:04,829 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-19 17:37:04,829 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2021-12-19 17:37:04,830 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-12-19 17:37:04,831 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:37:04,831 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:37:04,831 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-19 17:37:04,831 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-12-19 17:37:04,832 INFO L791 eck$LassoCheckResult]: Stem: 32#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 33#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 35#L552-4 [2021-12-19 17:37:04,832 INFO L793 eck$LassoCheckResult]: Loop: 35#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 36#L552-1 assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call write~int(3, main_~j~0#1.base, main_~j~0#1.offset, 4); 38#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 39#L553-1 assume !(main_#t~mem9#1 < 12);havoc main_#t~mem9#1; 34#L552-3 call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; 35#L552-4 [2021-12-19 17:37:04,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:37:04,833 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-12-19 17:37:04,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:37:04,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473061084] [2021-12-19 17:37:04,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:37:04,834 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:37:04,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:37:04,876 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:37:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:37:04,903 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:37:04,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:37:04,904 INFO L85 PathProgramCache]: Analyzing trace with hash 34512977, now seen corresponding path program 1 times [2021-12-19 17:37:04,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:37:04,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802004682] [2021-12-19 17:37:04,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:37:04,904 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:37:04,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:37:04,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:37:04,951 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:37:04,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802004682] [2021-12-19 17:37:04,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802004682] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 17:37:04,952 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 17:37:04,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 17:37:04,952 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877379390] [2021-12-19 17:37:04,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 17:37:04,952 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-19 17:37:04,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:37:04,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 17:37:04,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-19 17:37:04,953 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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) [2021-12-19 17:37:04,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:37:04,985 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2021-12-19 17:37:04,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 17:37:04,986 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2021-12-19 17:37:04,987 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2021-12-19 17:37:04,987 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2021-12-19 17:37:04,988 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-12-19 17:37:04,988 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-12-19 17:37:04,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2021-12-19 17:37:04,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 17:37:04,988 INFO L681 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2021-12-19 17:37:04,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2021-12-19 17:37:04,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2021-12-19 17:37:04,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 9 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) [2021-12-19 17:37:04,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2021-12-19 17:37:04,989 INFO L704 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2021-12-19 17:37:04,989 INFO L587 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2021-12-19 17:37:04,989 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-19 17:37:04,989 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2021-12-19 17:37:04,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-12-19 17:37:04,990 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:37:04,990 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:37:04,991 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-19 17:37:04,991 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2021-12-19 17:37:04,991 INFO L791 eck$LassoCheckResult]: Stem: 62#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 63#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 61#L552-4 [2021-12-19 17:37:04,991 INFO L793 eck$LassoCheckResult]: Loop: 61#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 64#L552-1 assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call write~int(3, main_~j~0#1.base, main_~j~0#1.offset, 4); 68#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 67#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 65#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 66#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 69#L553-1 assume !(main_#t~mem9#1 < 12);havoc main_#t~mem9#1; 60#L552-3 call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; 61#L552-4 [2021-12-19 17:37:04,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:37:04,992 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-12-19 17:37:04,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:37:04,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923807813] [2021-12-19 17:37:04,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:37:04,993 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:37:05,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:37:05,021 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:37:05,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:37:05,046 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:37:05,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:37:05,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1680656940, now seen corresponding path program 1 times [2021-12-19 17:37:05,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:37:05,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527719331] [2021-12-19 17:37:05,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:37:05,047 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:37:05,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:37:05,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:37:05,124 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:37:05,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527719331] [2021-12-19 17:37:05,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527719331] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 17:37:05,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473597808] [2021-12-19 17:37:05,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:37:05,125 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:37:05,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:37:05,128 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:37:05,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-19 17:37:05,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:37:05,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-19 17:37:05,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:37:05,266 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-19 17:37:05,339 INFO L354 Elim1Store]: treesize reduction 16, result has 65.2 percent of original size [2021-12-19 17:37:05,339 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 66 [2021-12-19 17:37:05,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2021-12-19 17:37:05,462 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-19 17:37:05,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:37:05,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:37:05,516 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:37:05,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473597808] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:37:05,516 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 17:37:05,516 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2021-12-19 17:37:05,516 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574997914] [2021-12-19 17:37:05,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 17:37:05,517 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-19 17:37:05,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:37:05,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-19 17:37:05,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-12-19 17:37:05,517 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 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) [2021-12-19 17:37:05,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:37:05,589 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2021-12-19 17:37:05,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-19 17:37:05,591 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 21 transitions. [2021-12-19 17:37:05,592 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2021-12-19 17:37:05,593 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 21 transitions. [2021-12-19 17:37:05,593 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-12-19 17:37:05,594 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-12-19 17:37:05,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 21 transitions. [2021-12-19 17:37:05,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 17:37:05,595 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2021-12-19 17:37:05,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 21 transitions. [2021-12-19 17:37:05,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2021-12-19 17:37:05,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 18 states have internal predecessors, (20), 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) [2021-12-19 17:37:05,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2021-12-19 17:37:05,597 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2021-12-19 17:37:05,598 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2021-12-19 17:37:05,598 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-19 17:37:05,598 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 20 transitions. [2021-12-19 17:37:05,600 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2021-12-19 17:37:05,600 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:37:05,600 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:37:05,600 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-19 17:37:05,601 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 4, 1, 1, 1, 1] [2021-12-19 17:37:05,601 INFO L791 eck$LassoCheckResult]: Stem: 153#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 154#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 152#L552-4 [2021-12-19 17:37:05,601 INFO L793 eck$LassoCheckResult]: Loop: 152#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 155#L552-1 assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call write~int(3, main_~j~0#1.base, main_~j~0#1.offset, 4); 160#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 169#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 156#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 157#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 158#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 159#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 168#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 167#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 166#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 165#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 164#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 162#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 163#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 161#L553-1 assume !(main_#t~mem9#1 < 12);havoc main_#t~mem9#1; 151#L552-3 call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; 152#L552-4 [2021-12-19 17:37:05,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:37:05,602 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-12-19 17:37:05,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:37:05,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54498161] [2021-12-19 17:37:05,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:37:05,603 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:37:05,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:37:05,628 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:37:05,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:37:05,650 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:37:05,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:37:05,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1241080977, now seen corresponding path program 2 times [2021-12-19 17:37:05,654 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:37:05,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006951906] [2021-12-19 17:37:05,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:37:05,654 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:37:05,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:37:06,036 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:37:06,037 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:37:06,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006951906] [2021-12-19 17:37:06,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006951906] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 17:37:06,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080869789] [2021-12-19 17:37:06,038 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-19 17:37:06,038 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:37:06,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:37:06,043 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:37:06,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-19 17:37:06,107 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-19 17:37:06,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 17:37:06,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 65 conjunts are in the unsatisfiable core [2021-12-19 17:37:06,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:37:06,131 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-19 17:37:06,171 INFO L354 Elim1Store]: treesize reduction 16, result has 65.2 percent of original size [2021-12-19 17:37:06,172 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 66 [2021-12-19 17:37:06,275 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 50 treesize of output 30 [2021-12-19 17:37:06,348 INFO L354 Elim1Store]: treesize reduction 16, result has 65.2 percent of original size [2021-12-19 17:37:06,349 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 80 [2021-12-19 17:37:06,429 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 50 treesize of output 30 [2021-12-19 17:37:06,512 INFO L354 Elim1Store]: treesize reduction 16, result has 65.2 percent of original size [2021-12-19 17:37:06,512 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 80 [2021-12-19 17:37:06,682 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 50 treesize of output 30 [2021-12-19 17:37:06,758 INFO L354 Elim1Store]: treesize reduction 16, result has 65.2 percent of original size [2021-12-19 17:37:06,759 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 80 [2021-12-19 17:37:06,844 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2021-12-19 17:37:06,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-19 17:37:06,855 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:37:06,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:44:00,176 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:44:00,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080869789] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:44:00,177 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 17:44:00,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 23 [2021-12-19 17:44:00,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675643688] [2021-12-19 17:44:00,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 17:44:00,177 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-19 17:44:00,178 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:44:00,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-19 17:44:00,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=305, Unknown=28, NotChecked=0, Total=506 [2021-12-19 17:44:00,179 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. cyclomatic complexity: 2 Second operand has 23 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 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) [2021-12-19 17:44:03,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:44:03,980 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2021-12-19 17:44:03,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-19 17:44:03,981 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 24 transitions. [2021-12-19 17:44:03,982 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2021-12-19 17:44:03,982 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 24 transitions. [2021-12-19 17:44:03,982 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2021-12-19 17:44:03,982 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2021-12-19 17:44:03,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 24 transitions. [2021-12-19 17:44:03,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 17:44:03,983 INFO L681 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2021-12-19 17:44:03,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 24 transitions. [2021-12-19 17:44:03,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2021-12-19 17:44:03,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 21 states have internal predecessors, (23), 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) [2021-12-19 17:44:03,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2021-12-19 17:44:03,984 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2021-12-19 17:44:03,984 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2021-12-19 17:44:03,984 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-19 17:44:03,985 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 23 transitions. [2021-12-19 17:44:03,985 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2021-12-19 17:44:03,985 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:44:03,985 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:44:03,985 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-19 17:44:03,986 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 5, 1, 1, 1, 1] [2021-12-19 17:44:03,986 INFO L791 eck$LassoCheckResult]: Stem: 317#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 318#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 320#L552-4 [2021-12-19 17:44:03,986 INFO L793 eck$LassoCheckResult]: Loop: 320#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 321#L552-1 assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call write~int(3, main_~j~0#1.base, main_~j~0#1.offset, 4); 326#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 338#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 322#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 323#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 324#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 325#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 337#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 336#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 335#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 334#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 333#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 332#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 331#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 330#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 328#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 329#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 327#L553-1 assume !(main_#t~mem9#1 < 12);havoc main_#t~mem9#1; 319#L552-3 call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; 320#L552-4 [2021-12-19 17:44:03,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:44:03,986 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-12-19 17:44:03,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:44:03,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395046087] [2021-12-19 17:44:03,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:44:03,987 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:44:03,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:44:03,996 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:44:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:44:04,001 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:44:04,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:44:04,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1966644716, now seen corresponding path program 3 times [2021-12-19 17:44:04,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:44:04,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038973747] [2021-12-19 17:44:04,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:44:04,002 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:44:04,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:44:04,029 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:44:04,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:44:04,042 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:44:04,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:44:04,042 INFO L85 PathProgramCache]: Analyzing trace with hash -872207186, now seen corresponding path program 1 times [2021-12-19 17:44:04,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:44:04,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050731343] [2021-12-19 17:44:04,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:44:04,043 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:44:04,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:44:04,470 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:44:04,471 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:44:04,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050731343] [2021-12-19 17:44:04,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050731343] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 17:44:04,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187572283] [2021-12-19 17:44:04,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:44:04,471 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:44:04,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:44:04,508 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:44:04,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-19 17:44:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:44:04,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 65 conjunts are in the unsatisfiable core [2021-12-19 17:44:04,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:44:04,613 INFO L388 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 14 treesize of output 12 [2021-12-19 17:44:04,640 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-19 17:44:04,660 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2021-12-19 17:44:04,665 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 16 [2021-12-19 17:44:04,694 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 16 [2021-12-19 17:44:04,718 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2021-12-19 17:44:04,722 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 16 [2021-12-19 17:44:04,733 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 16 [2021-12-19 17:44:04,754 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2021-12-19 17:44:04,759 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 16 [2021-12-19 17:44:04,772 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 16 [2021-12-19 17:44:04,794 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2021-12-19 17:44:04,799 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 16 [2021-12-19 17:44:04,814 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 16 [2021-12-19 17:44:04,834 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2021-12-19 17:44:04,839 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 16 [2021-12-19 17:44:04,850 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2021-12-19 17:44:04,859 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-19 17:44:04,866 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:44:04,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:44:04,947 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_478 Int) (v_ArrVal_480 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_478)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_480) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 10) (< (select .cse0 |c_ULTIMATE.start_main_~j~0#1.offset|) (+ v_ArrVal_478 1))))) is different from false [2021-12-19 17:44:04,975 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_478 Int) (v_ArrVal_480 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_478)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_480) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 10) (< (+ (select .cse0 |c_ULTIMATE.start_main_~j~0#1.offset|) 1) v_ArrVal_478)))) is different from false [2021-12-19 17:44:05,099 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_478 Int) (v_ArrVal_480 (Array Int Int)) (v_ArrVal_474 (Array Int Int)) (v_ArrVal_469 Int)) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_469 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_474))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~j~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_478)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_480) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 10) (< (+ (select .cse2 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_469) (< (+ (select .cse1 |c_ULTIMATE.start_main_~j~0#1.offset|) 1) v_ArrVal_478)))))) is different from false [2021-12-19 17:44:05,143 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_478 Int) (v_ArrVal_480 (Array Int Int)) (v_ArrVal_474 (Array Int Int)) (v_ArrVal_467 (Array Int Int)) (v_ArrVal_469 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (store .cse4 |c_ULTIMATE.start_main_~j~0#1.offset| (+ (select .cse4 |c_ULTIMATE.start_main_~j~0#1.offset|) (- 1))))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_467))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse2 (store (store .cse3 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_469 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_474))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~j~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_469) (< (+ (select .cse1 |c_ULTIMATE.start_main_~j~0#1.offset|) 1) v_ArrVal_478) (< (select (select (store (store .cse2 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_478)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_480) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 10))))))) is different from false [2021-12-19 17:44:05,255 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_478 Int) (v_ArrVal_463 Int) (v_ArrVal_480 (Array Int Int)) (v_ArrVal_474 (Array Int Int)) (v_ArrVal_467 (Array Int Int)) (v_ArrVal_469 Int)) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_463 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_467))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse2 (store (store .cse4 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_469 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_474))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_main_~j~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~j~0#1.offset|) 1) v_ArrVal_478) (< (+ (select .cse1 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_463) (< (select (select (store (store .cse2 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_478)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_480) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 10) (< (+ (select .cse3 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_469)))))))) is different from false [2021-12-19 17:44:05,341 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_478 Int) (v_ArrVal_463 Int) (v_ArrVal_480 (Array Int Int)) (v_ArrVal_474 (Array Int Int)) (v_ArrVal_462 (Array Int Int)) (v_ArrVal_467 (Array Int Int)) (v_ArrVal_469 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (store .cse6 |c_ULTIMATE.start_main_~j~0#1.offset| (+ (select .cse6 |c_ULTIMATE.start_main_~j~0#1.offset|) (- 1))))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_462))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_463 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_467))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse0 (store (store .cse4 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_469 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_474))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~j~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_478)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_480) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 10) (< (+ (select .cse1 |c_ULTIMATE.start_main_~j~0#1.offset|) 1) v_ArrVal_478) (< (+ (select .cse2 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_463) (< (+ (select .cse3 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_469))))))))) is different from false [2021-12-19 17:44:05,587 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_478 Int) (v_ArrVal_463 Int) (v_ArrVal_480 (Array Int Int)) (v_ArrVal_474 (Array Int Int)) (v_ArrVal_462 (Array Int Int)) (v_ArrVal_458 Int) (v_ArrVal_467 (Array Int Int)) (v_ArrVal_469 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_458 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_462))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_463 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_467))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse3 (store (store .cse5 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_469 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_474))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~j~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_458) (< (+ (select .cse1 |c_ULTIMATE.start_main_~j~0#1.offset|) 1) v_ArrVal_478) (< (+ (select .cse2 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_469) (< (select (select (store (store .cse3 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_478)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_480) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 10) (< (+ (select .cse4 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_463)))))))))) is different from false [2021-12-19 17:44:05,779 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_478 Int) (v_ArrVal_463 Int) (v_ArrVal_480 (Array Int Int)) (v_ArrVal_474 (Array Int Int)) (v_ArrVal_462 (Array Int Int)) (v_ArrVal_456 (Array Int Int)) (v_ArrVal_458 Int) (v_ArrVal_467 (Array Int Int)) (v_ArrVal_469 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (store .cse8 |c_ULTIMATE.start_main_~j~0#1.offset| (+ (select .cse8 |c_ULTIMATE.start_main_~j~0#1.offset|) (- 1))))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_456))) (let ((.cse0 (select .cse7 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_458 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_462))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_463 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_467))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse1 (store (store .cse5 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_469 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_474))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~j~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_458) (< (select (select (store (store .cse1 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_478)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_480) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 10) (< (+ (select .cse3 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_463) (< (+ (select .cse4 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_469) (< (+ (select .cse2 |c_ULTIMATE.start_main_~j~0#1.offset|) 1) v_ArrVal_478))))))))))) is different from false [2021-12-19 17:44:05,985 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-19 17:44:05,986 INFO L388 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 783 treesize of output 483 [2021-12-19 17:44:06,010 INFO L388 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 869 treesize of output 861 [2021-12-19 17:44:06,026 INFO L388 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 230 treesize of output 214 [2021-12-19 17:44:06,045 INFO L388 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 54 treesize of output 50 [2021-12-19 17:44:06,056 INFO L388 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 118 treesize of output 110 [2021-12-19 17:44:06,067 INFO L388 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 438 treesize of output 406 [2021-12-19 17:44:06,078 INFO L388 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 11 treesize of output 9 [2021-12-19 17:44:06,397 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 38 not checked. [2021-12-19 17:44:06,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187572283] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:44:06,397 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 17:44:06,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 15] total 30 [2021-12-19 17:44:06,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265687466] [2021-12-19 17:44:06,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 17:44:14,855 WARN L227 SmtUtils]: Spent 8.45s on a formula simplification. DAG size of input: 169 DAG size of output: 158 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-19 17:44:16,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:44:16,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-12-19 17:44:16,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=293, Unknown=8, NotChecked=376, Total=870 [2021-12-19 17:44:16,464 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. cyclomatic complexity: 2 Second operand has 30 states, 30 states have (on average 1.7) internal successors, (51), 30 states have internal predecessors, (51), 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) [2021-12-19 17:44:16,853 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_478 Int) (v_ArrVal_480 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_478)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_480) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 10) (< (+ (select .cse0 |c_ULTIMATE.start_main_~j~0#1.offset|) 1) v_ArrVal_478)))) (< (select (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 10)) is different from false [2021-12-19 17:44:16,858 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_478 Int) (v_ArrVal_480 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_478)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_480) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 10) (< (select .cse0 |c_ULTIMATE.start_main_~j~0#1.offset|) (+ v_ArrVal_478 1))))) (< (select (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 12)) is different from false [2021-12-19 17:44:16,863 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_478 Int) (v_ArrVal_480 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_478)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_480) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 10) (< (select .cse0 |c_ULTIMATE.start_main_~j~0#1.offset|) (+ v_ArrVal_478 1))))) (< |c_ULTIMATE.start_main_#t~mem9#1| 12)) is different from false [2021-12-19 17:44:16,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:44:16,971 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2021-12-19 17:44:16,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-19 17:44:16,973 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 49 transitions. [2021-12-19 17:44:16,974 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2021-12-19 17:44:16,974 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 48 states and 49 transitions. [2021-12-19 17:44:16,974 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2021-12-19 17:44:16,975 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2021-12-19 17:44:16,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 49 transitions. [2021-12-19 17:44:16,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 17:44:16,975 INFO L681 BuchiCegarLoop]: Abstraction has 48 states and 49 transitions. [2021-12-19 17:44:16,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 49 transitions. [2021-12-19 17:44:16,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 33. [2021-12-19 17:44:16,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 32 states have internal predecessors, (34), 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) [2021-12-19 17:44:16,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2021-12-19 17:44:16,977 INFO L704 BuchiCegarLoop]: Abstraction has 33 states and 34 transitions. [2021-12-19 17:44:16,977 INFO L587 BuchiCegarLoop]: Abstraction has 33 states and 34 transitions. [2021-12-19 17:44:16,977 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-19 17:44:16,977 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 34 transitions. [2021-12-19 17:44:16,977 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2021-12-19 17:44:16,978 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:44:16,978 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:44:16,979 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 1, 1, 1, 1] [2021-12-19 17:44:16,979 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 5, 1, 1, 1, 1] [2021-12-19 17:44:16,979 INFO L791 eck$LassoCheckResult]: Stem: 581#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 582#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 587#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 589#L552-1 assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call write~int(3, main_~j~0#1.base, main_~j~0#1.offset, 4); 588#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 586#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 584#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 585#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 611#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 610#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 609#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 608#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 607#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 606#L553-4 [2021-12-19 17:44:16,979 INFO L793 eck$LassoCheckResult]: Loop: 606#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 605#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 604#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 603#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 602#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 601#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 600#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 599#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 598#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 597#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 596#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 595#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 594#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 593#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 591#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 592#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 590#L553-1 assume !(main_#t~mem9#1 < 12);havoc main_#t~mem9#1; 579#L552-3 call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; 580#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 583#L552-1 assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call write~int(3, main_~j~0#1.base, main_~j~0#1.offset, 4); 606#L553-4 [2021-12-19 17:44:16,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:44:16,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1642397097, now seen corresponding path program 1 times [2021-12-19 17:44:16,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:44:16,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120792784] [2021-12-19 17:44:16,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:44:16,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:44:17,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:44:17,017 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:44:17,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:44:17,033 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:44:17,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:44:17,034 INFO L85 PathProgramCache]: Analyzing trace with hash 440091564, now seen corresponding path program 4 times [2021-12-19 17:44:17,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:44:17,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494199447] [2021-12-19 17:44:17,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:44:17,035 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:44:17,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:44:17,074 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:44:17,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:44:17,084 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:44:17,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:44:17,085 INFO L85 PathProgramCache]: Analyzing trace with hash 287366484, now seen corresponding path program 2 times [2021-12-19 17:44:17,085 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:44:17,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792304078] [2021-12-19 17:44:17,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:44:17,085 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:44:17,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:44:17,565 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 2 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:44:17,565 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:44:17,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792304078] [2021-12-19 17:44:17,566 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792304078] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 17:44:17,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470570749] [2021-12-19 17:44:17,566 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-19 17:44:17,566 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:44:17,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:44:17,571 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:44:17,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-19 17:44:17,692 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-19 17:44:17,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 17:44:17,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 102 conjunts are in the unsatisfiable core [2021-12-19 17:44:17,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:44:17,707 INFO L388 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 14 treesize of output 12 [2021-12-19 17:44:17,723 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-19 17:44:17,745 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2021-12-19 17:44:17,752 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 16 [2021-12-19 17:44:17,764 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 16 [2021-12-19 17:44:17,784 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2021-12-19 17:44:17,789 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 16 [2021-12-19 17:44:17,806 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 16 [2021-12-19 17:44:17,826 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2021-12-19 17:44:17,831 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 16 [2021-12-19 17:44:17,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 16 [2021-12-19 17:44:17,868 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2021-12-19 17:44:17,872 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 16 [2021-12-19 17:44:17,886 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 16 [2021-12-19 17:44:17,907 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2021-12-19 17:44:17,914 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 16 [2021-12-19 17:44:17,924 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 16 [2021-12-19 17:44:17,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2021-12-19 17:44:17,948 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 16 [2021-12-19 17:44:17,961 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 16 [2021-12-19 17:44:17,976 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2021-12-19 17:44:17,980 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 16 [2021-12-19 17:44:17,996 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 16 [2021-12-19 17:44:18,018 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2021-12-19 17:44:18,023 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 16 [2021-12-19 17:44:18,034 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2021-12-19 17:44:18,043 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-19 17:44:18,052 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 2 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:44:18,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:44:18,095 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 (Array Int Int)) (v_ArrVal_842 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (or (< (select .cse0 |c_ULTIMATE.start_main_~j~0#1.offset|) (+ v_ArrVal_842 1)) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_842)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_841) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 9)))) is different from false [2021-12-19 17:44:18,124 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 (Array Int Int)) (v_ArrVal_842 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~j~0#1.offset|) 1) v_ArrVal_842) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_842)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_841) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 9)))) is different from false [2021-12-19 17:44:18,258 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_832 Int) (v_ArrVal_841 (Array Int Int)) (v_ArrVal_842 Int)) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_832 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_836))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_main_~j~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~j~0#1.offset|) 1) v_ArrVal_842) (< (+ (select .cse1 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_832) (<= (select (select (store (store .cse2 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_842)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_841) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 9)))))) is different from false [2021-12-19 17:44:18,517 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_832 Int) (v_ArrVal_841 (Array Int Int)) (v_ArrVal_842 Int)) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_825 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_828))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse0 (store (store .cse4 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_832 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_836))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~j~0#1.base|))) (or (<= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_842)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_841) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 9) (< (+ (select .cse1 |c_ULTIMATE.start_main_~j~0#1.offset|) 1) v_ArrVal_842) (< (+ (select .cse2 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_832) (< (+ (select .cse3 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_825)))))))) is different from false [2021-12-19 17:44:18,589 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_822 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_832 Int) (v_ArrVal_841 (Array Int Int)) (v_ArrVal_842 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (store .cse6 |c_ULTIMATE.start_main_~j~0#1.offset| (+ (select .cse6 |c_ULTIMATE.start_main_~j~0#1.offset|) (- 1))))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_822))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_825 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_828))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse0 (store (store .cse4 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_832 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_836))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~j~0#1.base|))) (or (<= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_842)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_841) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 9) (< (+ (select .cse2 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_825) (< (+ (select .cse1 |c_ULTIMATE.start_main_~j~0#1.offset|) 1) v_ArrVal_842) (< (+ (select .cse3 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_832))))))))) is different from false [2021-12-19 17:44:18,823 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_822 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_818 Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_832 Int) (v_ArrVal_841 (Array Int Int)) (v_ArrVal_842 Int)) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_818 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_822))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_825 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_828))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse0 (store (store .cse5 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_832 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_836))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~j~0#1.base|))) (or (<= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_842)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_841) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 9) (< (+ (select .cse1 |c_ULTIMATE.start_main_~j~0#1.offset|) 1) v_ArrVal_842) (< (+ (select .cse2 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_818) (< (+ (select .cse3 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_832) (< (+ (select .cse4 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_825)))))))))) is different from false [2021-12-19 17:44:18,998 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_822 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_818 Int) (v_ArrVal_815 (Array Int Int)) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_832 Int) (v_ArrVal_841 (Array Int Int)) (v_ArrVal_842 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (store .cse8 |c_ULTIMATE.start_main_~j~0#1.offset| (+ (select .cse8 |c_ULTIMATE.start_main_~j~0#1.offset|) (- 1))))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_815))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_818 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_822))) (let ((.cse0 (select .cse6 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_825 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_828))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse2 (store (store .cse5 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_832 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_836))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~j~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_825) (< (+ (select .cse1 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_832) (<= (select (select (store (store .cse2 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_842)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_841) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 9) (< (+ (select .cse3 |c_ULTIMATE.start_main_~j~0#1.offset|) 1) v_ArrVal_842) (< (+ (select .cse4 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_818))))))))))) is different from false [2021-12-19 17:44:19,493 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_822 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_818 Int) (v_ArrVal_815 (Array Int Int)) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_812 Int) (v_ArrVal_832 Int) (v_ArrVal_841 (Array Int Int)) (v_ArrVal_842 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_812 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_815))) (let ((.cse1 (select .cse8 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_818 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_822))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_825 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_828))) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse4 (store (store .cse6 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_832 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_836))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~j~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_812) (< (+ (select .cse1 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_818) (< (+ (select .cse2 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_832) (< (+ (select .cse3 |c_ULTIMATE.start_main_~j~0#1.offset|) 1) v_ArrVal_842) (<= (select (select (store (store .cse4 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_842)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_841) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 9) (< (+ (select .cse5 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_825)))))))))))) is different from false [2021-12-19 17:44:19,831 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_822 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_818 Int) (v_ArrVal_815 (Array Int Int)) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_808 (Array Int Int)) (v_ArrVal_812 Int) (v_ArrVal_832 Int) (v_ArrVal_841 (Array Int Int)) (v_ArrVal_842 Int)) (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (store .cse10 |c_ULTIMATE.start_main_~j~0#1.offset| (+ (select .cse10 |c_ULTIMATE.start_main_~j~0#1.offset|) (- 1))))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_808))) (let ((.cse3 (select .cse9 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse8 (store (store .cse9 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_812 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_815))) (let ((.cse4 (select .cse8 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_818 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_822))) (let ((.cse0 (select .cse7 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_825 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_828))) (let ((.cse5 (select .cse6 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse1 (store (store .cse6 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_832 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_836))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~j~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_825) (<= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_842)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_841) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 9) (< (+ (select .cse3 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_812) (< (+ (select .cse4 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_818) (< (+ (select .cse2 |c_ULTIMATE.start_main_~j~0#1.offset|) 1) v_ArrVal_842) (< (+ (select .cse5 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_832))))))))))))) is different from false [2021-12-19 17:44:20,867 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_818 Int) (v_ArrVal_805 Int) (v_ArrVal_825 Int) (v_ArrVal_812 Int) (v_ArrVal_832 Int) (v_ArrVal_841 (Array Int Int)) (v_ArrVal_842 Int) (v_ArrVal_822 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_808 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_805 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_808))) (let ((.cse6 (select .cse10 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse9 (store (store .cse10 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_812 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_815))) (let ((.cse0 (select .cse9 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse8 (store (store .cse9 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_818 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_822))) (let ((.cse5 (select .cse8 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_825 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_828))) (let ((.cse2 (select .cse7 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse3 (store (store .cse7 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_832 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_836))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~j~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_818) (< (+ (select .cse1 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_805) (< (+ (select .cse2 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_832) (<= (select (select (store (store .cse3 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_842)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_841) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 9) (< (+ (select .cse4 |c_ULTIMATE.start_main_~j~0#1.offset|) 1) v_ArrVal_842) (< (+ (select .cse5 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_825) (< (+ (select .cse6 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_812)))))))))))))) is different from false [2021-12-19 17:44:21,552 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_818 Int) (v_ArrVal_805 Int) (v_ArrVal_825 Int) (v_ArrVal_812 Int) (v_ArrVal_832 Int) (v_ArrVal_841 (Array Int Int)) (v_ArrVal_842 Int) (v_ArrVal_801 (Array Int Int)) (v_ArrVal_822 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_808 (Array Int Int))) (let ((.cse11 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (let ((.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (store .cse12 |c_ULTIMATE.start_main_~j~0#1.offset| (+ (select .cse12 |c_ULTIMATE.start_main_~j~0#1.offset|) (- 1))))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_801))) (let ((.cse5 (select .cse11 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse10 (store (store .cse11 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_805 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_808))) (let ((.cse0 (select .cse10 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse9 (store (store .cse10 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_812 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_815))) (let ((.cse3 (select .cse9 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse8 (store (store .cse9 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_818 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_822))) (let ((.cse6 (select .cse8 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_825 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_828))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse2 (store (store .cse7 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_832 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_836))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~j~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_812) (< (+ (select .cse1 |c_ULTIMATE.start_main_~j~0#1.offset|) 1) v_ArrVal_842) (<= (select (select (store (store .cse2 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_842)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_841) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 9) (< (+ (select .cse3 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_818) (< (+ (select .cse4 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_832) (< (+ (select .cse5 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_805) (< (+ (select .cse6 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_825))))))))))))))) is different from false [2021-12-19 17:44:23,641 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_818 Int) (v_ArrVal_805 Int) (v_ArrVal_825 Int) (v_ArrVal_812 Int) (v_ArrVal_799 Int) (v_ArrVal_832 Int) (v_ArrVal_841 (Array Int Int)) (v_ArrVal_842 Int) (v_ArrVal_801 (Array Int Int)) (v_ArrVal_822 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_808 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse12 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_799 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_801))) (let ((.cse5 (select .cse12 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse11 (store (store .cse12 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_805 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_808))) (let ((.cse6 (select .cse11 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse10 (store (store .cse11 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_812 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_815))) (let ((.cse4 (select .cse10 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse9 (store (store .cse10 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_818 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_822))) (let ((.cse7 (select .cse9 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse8 (store (store .cse9 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_825 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_828))) (let ((.cse1 (select .cse8 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse2 (store (store .cse8 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_832 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_836))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~j~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_799) (< (+ (select .cse1 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_832) (<= (select (select (store (store .cse2 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_842)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_841) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 9) (< (+ (select .cse3 |c_ULTIMATE.start_main_~j~0#1.offset|) 1) v_ArrVal_842) (< (+ (select .cse4 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_818) (< (+ (select .cse5 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_805) (< (+ (select .cse6 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_812) (< (+ (select .cse7 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_825)))))))))))))))) is different from false [2021-12-19 17:44:24,988 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_818 Int) (v_ArrVal_805 Int) (v_ArrVal_825 Int) (v_ArrVal_812 Int) (v_ArrVal_799 Int) (v_ArrVal_832 Int) (v_ArrVal_841 (Array Int Int)) (v_ArrVal_796 (Array Int Int)) (v_ArrVal_842 Int) (v_ArrVal_801 (Array Int Int)) (v_ArrVal_822 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_808 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base| (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~j~0#1.base|))) (store .cse14 |c_ULTIMATE.start_main_~j~0#1.offset| (+ (select .cse14 |c_ULTIMATE.start_main_~j~0#1.offset|) (- 1))))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_796))) (let ((.cse2 (select .cse13 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse12 (store (store .cse13 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_799 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_801))) (let ((.cse1 (select .cse12 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse11 (store (store .cse12 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_805 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_808))) (let ((.cse5 (select .cse11 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse10 (store (store .cse11 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_812 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_815))) (let ((.cse7 (select .cse10 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse9 (store (store .cse10 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_818 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_822))) (let ((.cse0 (select .cse9 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse8 (store (store .cse9 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_825 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_828))) (let ((.cse6 (select .cse8 |c_ULTIMATE.start_main_~j~0#1.base|))) (let ((.cse3 (store (store .cse8 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~j~0#1.offset| (+ v_ArrVal_832 (- 1)))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_836))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~j~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_825) (< (+ (select .cse1 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_805) (< (+ (select .cse2 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_799) (<= (select (select (store (store .cse3 |c_ULTIMATE.start_main_~j~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~j~0#1.offset| v_ArrVal_842)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_841) |c_ULTIMATE.start_main_~j~0#1.base|) |c_ULTIMATE.start_main_~j~0#1.offset|) 9) (< (+ (select .cse5 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_812) (< (+ (select .cse6 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_832) (< (+ (select .cse7 |c_ULTIMATE.start_main_~j~0#1.offset|) 2) v_ArrVal_818) (< (+ (select .cse4 |c_ULTIMATE.start_main_~j~0#1.offset|) 1) v_ArrVal_842))))))))))))))))) is different from false [2021-12-19 17:44:26,465 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-19 17:44:26,465 INFO L388 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 6595 treesize of output 4055 [2021-12-19 17:44:27,313 INFO L388 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 7444 treesize of output 7436 [2021-12-19 17:44:27,349 INFO L388 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 246 treesize of output 230 [2021-12-19 17:44:27,381 INFO L388 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 118 treesize of output 110 [2021-12-19 17:44:27,413 INFO L388 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 502 treesize of output 470 [2021-12-19 17:44:27,447 INFO L388 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 1910 treesize of output 1782 [2021-12-19 17:44:27,478 INFO L388 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 1014 treesize of output 950 [2021-12-19 17:44:27,516 INFO L388 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 54 treesize of output 50 [2021-12-19 17:44:27,554 INFO L388 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 3574 treesize of output 3318 [2021-12-19 17:44:27,591 INFO L388 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 11 treesize of output 9 [2021-12-19 17:44:29,269 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 94 not checked. [2021-12-19 17:44:29,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470570749] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:44:29,269 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 17:44:29,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 15, 21] total 37 [2021-12-19 17:44:29,270 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687351801] [2021-12-19 17:44:29,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 17:44:36,547 WARN L227 SmtUtils]: Spent 7.28s on a formula simplification. DAG size of input: 169 DAG size of output: 165 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-19 17:44:38,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:44:38,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-12-19 17:44:38,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=340, Unknown=18, NotChecked=728, Total=1332 [2021-12-19 17:44:38,306 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. cyclomatic complexity: 2 Second operand has 37 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 37 states have internal predecessors, (71), 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) [2021-12-19 17:44:38,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:44:38,902 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2021-12-19 17:44:38,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-19 17:44:38,903 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 61 transitions. [2021-12-19 17:44:38,904 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2021-12-19 17:44:38,904 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 60 states and 61 transitions. [2021-12-19 17:44:38,904 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2021-12-19 17:44:38,904 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2021-12-19 17:44:38,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 61 transitions. [2021-12-19 17:44:38,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 17:44:38,905 INFO L681 BuchiCegarLoop]: Abstraction has 60 states and 61 transitions. [2021-12-19 17:44:38,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 61 transitions. [2021-12-19 17:44:38,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 34. [2021-12-19 17:44:38,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 33 states have internal predecessors, (35), 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) [2021-12-19 17:44:38,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2021-12-19 17:44:38,906 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 35 transitions. [2021-12-19 17:44:38,906 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 35 transitions. [2021-12-19 17:44:38,906 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-19 17:44:38,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 35 transitions. [2021-12-19 17:44:38,907 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2021-12-19 17:44:38,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:44:38,907 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:44:38,907 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-19 17:44:38,907 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [10, 9, 9, 1, 1, 1, 1] [2021-12-19 17:44:38,907 INFO L791 eck$LassoCheckResult]: Stem: 936#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 937#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 935#L552-4 [2021-12-19 17:44:38,907 INFO L793 eck$LassoCheckResult]: Loop: 935#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 938#L552-1 assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call write~int(3, main_~j~0#1.base, main_~j~0#1.offset, 4); 942#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 941#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 939#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 940#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 967#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 966#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 965#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 964#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 963#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 962#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 961#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 960#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 959#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 958#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 957#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 956#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 955#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 954#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 953#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 952#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 951#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 950#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 949#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 948#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 947#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 946#L553-1 assume !!(main_#t~mem9#1 < 12);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(main_#t~mem10#1 - 1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem11#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem11#1; 944#L553-3 call main_#t~mem8#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(2 + main_#t~mem8#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem8#1; 945#L553-4 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 943#L553-1 assume !(main_#t~mem9#1 < 12);havoc main_#t~mem9#1; 934#L552-3 call main_#t~mem5#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; 935#L552-4 [2021-12-19 17:44:38,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:44:38,908 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2021-12-19 17:44:38,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:44:38,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056720206] [2021-12-19 17:44:38,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:44:38,908 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:44:38,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:44:38,914 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:44:38,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:44:38,918 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:44:38,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:44:38,919 INFO L85 PathProgramCache]: Analyzing trace with hash 778359212, now seen corresponding path program 5 times [2021-12-19 17:44:38,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:44:38,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783957614] [2021-12-19 17:44:38,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:44:38,919 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:44:38,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:44:38,962 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:44:38,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:44:38,991 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:44:38,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:44:38,992 INFO L85 PathProgramCache]: Analyzing trace with hash 320163182, now seen corresponding path program 3 times [2021-12-19 17:44:38,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:44:38,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442877661] [2021-12-19 17:44:38,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:44:38,993 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:44:39,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:44:39,025 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:44:39,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:44:39,056 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:45:23,304 WARN L227 SmtUtils]: Spent 44.25s on a formula simplification. DAG size of input: 257 DAG size of output: 247 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-19 17:45:29,886 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:45:29,887 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:45:29,887 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:45:29,887 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:45:29,887 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 17:45:29,887 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:45:29,887 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:45:29,887 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:45:29,887 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_Nested-alloca.i_Iteration7_Lasso [2021-12-19 17:45:29,887 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:45:29,887 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:45:29,892 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.ArithmeticException: integer overflow at java.base/java.lang.Math.toIntExact(Math.java:1074) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis$PreprocessingBenchmark.(LassoAnalysis.java:551) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:255) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:953) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-19 17:45:29,894 INFO L158 Benchmark]: Toolchain (without parser) took 506011.04ms. Allocated memory was 104.9MB in the beginning and 234.9MB in the end (delta: 130.0MB). Free memory was 68.6MB in the beginning and 112.3MB in the end (delta: -43.7MB). Peak memory consumption was 85.6MB. Max. memory is 16.1GB. [2021-12-19 17:45:29,895 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 104.9MB. Free memory was 77.7MB in the beginning and 77.6MB in the end (delta: 25.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-19 17:45:29,895 INFO L158 Benchmark]: CACSL2BoogieTranslator took 334.24ms. Allocated memory is still 104.9MB. Free memory was 68.4MB in the beginning and 75.6MB in the end (delta: -7.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-19 17:45:29,895 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.13ms. Allocated memory is still 104.9MB. Free memory was 75.6MB in the beginning and 74.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-19 17:45:29,896 INFO L158 Benchmark]: Boogie Preprocessor took 28.80ms. Allocated memory is still 104.9MB. Free memory was 74.0MB in the beginning and 72.8MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-19 17:45:29,896 INFO L158 Benchmark]: RCFGBuilder took 184.76ms. Allocated memory is still 104.9MB. Free memory was 72.8MB in the beginning and 62.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-19 17:45:29,896 INFO L158 Benchmark]: BuchiAutomizer took 505421.61ms. Allocated memory was 104.9MB in the beginning and 234.9MB in the end (delta: 130.0MB). Free memory was 62.4MB in the beginning and 112.3MB in the end (delta: -50.0MB). Peak memory consumption was 81.6MB. Max. memory is 16.1GB. [2021-12-19 17:45:29,897 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 104.9MB. Free memory was 77.7MB in the beginning and 77.6MB in the end (delta: 25.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 334.24ms. Allocated memory is still 104.9MB. Free memory was 68.4MB in the beginning and 75.6MB in the end (delta: -7.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.13ms. Allocated memory is still 104.9MB. Free memory was 75.6MB in the beginning and 74.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.80ms. Allocated memory is still 104.9MB. Free memory was 74.0MB in the beginning and 72.8MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 184.76ms. Allocated memory is still 104.9MB. Free memory was 72.8MB in the beginning and 62.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 505421.61ms. Allocated memory was 104.9MB in the beginning and 234.9MB in the end (delta: 130.0MB). Free memory was 62.4MB in the beginning and 112.3MB in the end (delta: -50.0MB). Peak memory consumption was 81.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: ArithmeticException: integer overflow de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: ArithmeticException: integer overflow: java.base/java.lang.Math.toIntExact(Math.java:1074) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-19 17:45:29,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-19 17:45:30,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-19 17:45:30,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-19 17:45:30,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-19 17:45:30,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ArithmeticException: integer overflow