./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/java_Sequence-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3a877d22 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_Sequence-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 d628f3524885345eb9e2318f2d0dbb026e233c3bcc51319b2ad8fc1a71d35580 --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:03:21,782 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:03:21,797 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:03:21,885 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:03:21,886 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:03:21,888 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:03:21,889 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:03:21,893 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:03:21,894 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:03:21,897 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:03:21,898 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:03:21,899 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:03:21,899 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:03:21,901 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:03:21,902 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:03:21,906 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:03:21,908 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:03:21,908 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:03:21,910 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:03:21,912 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:03:21,913 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:03:21,928 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:03:21,929 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:03:21,930 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:03:21,935 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:03:21,936 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:03:21,936 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:03:21,937 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:03:21,937 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:03:21,938 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:03:21,938 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:03:21,939 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:03:21,940 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:03:21,941 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:03:21,942 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:03:21,942 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:03:21,943 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:03:21,943 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:03:21,943 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:03:21,944 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:03:21,944 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:03:21,945 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-12-15 17:03:21,982 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:03:21,983 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:03:21,984 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:03:21,999 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:03:22,000 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:03:22,001 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:03:22,001 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:03:22,001 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:03:22,001 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:03:22,001 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:03:22,002 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:03:22,002 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:03:22,002 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:03:22,002 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:03:22,003 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:03:22,003 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:03:22,003 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:03:22,003 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:03:22,003 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:03:22,003 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:03:22,003 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:03:22,003 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:03:22,004 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:03:22,004 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:03:22,004 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:03:22,004 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:03:22,004 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:03:22,004 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:03:22,004 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:03:22,005 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:03:22,005 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 -> d628f3524885345eb9e2318f2d0dbb026e233c3bcc51319b2ad8fc1a71d35580 [2021-12-15 17:03:22,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:03:22,368 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:03:22,369 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:03:22,381 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:03:22,382 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:03:22,383 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/java_Sequence-alloca.i [2021-12-15 17:03:22,461 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d098828d/22b64837cd7649c3b7f6dc35f02a1da0/FLAGeb2cfcc5a [2021-12-15 17:03:23,233 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:03:23,235 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_Sequence-alloca.i [2021-12-15 17:03:23,249 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d098828d/22b64837cd7649c3b7f6dc35f02a1da0/FLAGeb2cfcc5a [2021-12-15 17:03:23,272 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d098828d/22b64837cd7649c3b7f6dc35f02a1da0 [2021-12-15 17:03:23,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:03:23,276 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:03:23,278 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:03:23,278 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:03:23,295 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:03:23,296 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:03:23" (1/1) ... [2021-12-15 17:03:23,297 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34cc2ced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:03:23, skipping insertion in model container [2021-12-15 17:03:23,297 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:03:23" (1/1) ... [2021-12-15 17:03:23,302 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:03:23,349 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:03:23,738 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:03:23,746 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:03:23,796 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:03:23,814 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:03:23,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:03:23 WrapperNode [2021-12-15 17:03:23,814 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:03:23,815 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:03:23,815 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:03:23,815 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:03:23,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:03:23" (1/1) ... [2021-12-15 17:03:23,836 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:03:23" (1/1) ... [2021-12-15 17:03:23,874 INFO L137 Inliner]: procedures = 109, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 58 [2021-12-15 17:03:23,874 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:03:23,875 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:03:23,875 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:03:23,880 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:03:23,885 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:03:23" (1/1) ... [2021-12-15 17:03:23,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:03:23" (1/1) ... [2021-12-15 17:03:23,917 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:03:23" (1/1) ... [2021-12-15 17:03:23,918 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:03:23" (1/1) ... [2021-12-15 17:03:23,920 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:03:23" (1/1) ... [2021-12-15 17:03:23,927 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:03:23" (1/1) ... [2021-12-15 17:03:23,930 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:03:23" (1/1) ... [2021-12-15 17:03:23,935 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:03:23,936 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:03:23,936 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:03:23,936 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:03:23,937 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:03:23" (1/1) ... [2021-12-15 17:03:23,947 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:23,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:23,993 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-15 17:03:24,031 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-15 17:03:24,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 17:03:24,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 17:03:24,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-15 17:03:24,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 17:03:24,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:03:24,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:03:24,202 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:03:24,204 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:03:24,349 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:03:24,353 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:03:24,359 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-15 17:03:24,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:03:24 BoogieIcfgContainer [2021-12-15 17:03:24,361 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:03:24,361 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:03:24,369 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:03:24,373 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:03:24,373 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:03:24,374 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:03:23" (1/3) ... [2021-12-15 17:03:24,374 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a295ed5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:03:24, skipping insertion in model container [2021-12-15 17:03:24,375 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:03:24,375 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:03:23" (2/3) ... [2021-12-15 17:03:24,375 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a295ed5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:03:24, skipping insertion in model container [2021-12-15 17:03:24,375 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:03:24,375 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:03:24" (3/3) ... [2021-12-15 17:03:24,376 INFO L388 chiAutomizerObserver]: Analyzing ICFG java_Sequence-alloca.i [2021-12-15 17:03:24,434 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:03:24,435 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:03:24,435 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:03:24,435 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:03:24,435 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:03:24,435 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:03:24,435 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:03:24,436 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:03:24,460 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:03:24,488 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-15 17:03:24,488 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:03:24,488 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:03:24,492 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:03:24,492 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:03:24,492 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:03:24,492 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:03:24,493 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-15 17:03:24,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:03:24,493 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:03:24,493 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:03:24,493 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:03:24,498 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; 8#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~mem8#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~mem10#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-15 17:03:24,498 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); 11#L552-1true assume !!(main_#t~mem7#1 < 100);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 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-15 17:03:24,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:24,511 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-15 17:03:24,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:24,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129936700] [2021-12-15 17:03:24,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:24,521 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:24,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:24,643 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:03:24,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:24,686 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:03:24,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:24,689 INFO L85 PathProgramCache]: Analyzing trace with hash 35911, now seen corresponding path program 1 times [2021-12-15 17:03:24,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:24,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261305166] [2021-12-15 17:03:24,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:24,690 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:24,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:24,707 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:03:24,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:24,713 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:03:24,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:24,717 INFO L85 PathProgramCache]: Analyzing trace with hash 28694853, now seen corresponding path program 1 times [2021-12-15 17:03:24,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:24,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114999650] [2021-12-15 17:03:24,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:24,717 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:24,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:24,771 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:03:24,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:24,813 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:03:25,452 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:03:25,452 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:03:25,452 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:03:25,453 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:03:25,453 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:03:25,453 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:25,454 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:03:25,454 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:03:25,454 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_Sequence-alloca.i_Iteration1_Lasso [2021-12-15 17:03:25,454 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:03:25,454 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:03:25,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:03:25,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:03:25,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:03:25,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:03:25,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:03:25,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:03:25,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:03:25,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:03:25,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:03:25,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:03:25,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:03:25,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:03:25,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:03:25,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:03:25,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:03:25,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:03:25,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:03:26,015 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:03:26,018 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:03:26,019 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:26,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:26,050 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:03:26,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-12-15 17:03:26,056 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:03:26,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:26,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:26,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:26,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:26,067 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:03:26,067 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:03:26,080 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:26,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2021-12-15 17:03:26,101 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:26,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:26,116 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:03:26,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-12-15 17:03:26,120 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:03:26,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:26,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:26,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:26,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:26,133 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:03:26,133 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:03:26,149 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:26,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-12-15 17:03:26,165 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:26,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:26,170 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:03:26,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-12-15 17:03:26,175 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:03:26,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:26,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:26,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:26,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:26,197 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:03:26,197 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:03:26,215 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:26,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-12-15 17:03:26,234 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:26,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:26,235 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:03:26,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-12-15 17:03:26,237 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:03:26,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:26,243 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:03:26,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:26,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:26,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:26,244 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:03:26,244 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:03:26,245 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:26,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2021-12-15 17:03:26,261 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:26,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:26,263 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:03:26,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-12-15 17:03:26,265 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:03:26,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:26,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:26,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:26,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:26,277 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:03:26,277 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:03:26,288 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:26,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-12-15 17:03:26,305 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:26,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:26,306 INFO L229 MonitoredProcess]: Starting monitored process 7 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-15 17:03:26,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-12-15 17:03:26,308 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:03:26,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:26,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:26,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:26,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:26,337 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:03:26,337 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:03:26,340 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:26,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2021-12-15 17:03:26,356 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:26,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:26,359 INFO L229 MonitoredProcess]: Starting monitored process 8 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-15 17:03:26,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-12-15 17:03:26,361 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:03:26,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:26,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:26,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:26,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:26,369 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:03:26,369 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:03:26,395 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:26,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-12-15 17:03:26,413 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:26,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:26,414 INFO L229 MonitoredProcess]: Starting monitored process 9 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-15 17:03:26,416 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:03:26,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-12-15 17:03:26,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:26,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:26,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:26,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:26,434 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:03:26,434 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:03:26,449 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:26,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-12-15 17:03:26,465 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:26,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:26,466 INFO L229 MonitoredProcess]: Starting monitored process 10 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-15 17:03:26,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-12-15 17:03:26,469 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:03:26,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:26,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:26,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:26,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:26,478 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:03:26,478 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:03:26,486 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:26,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-12-15 17:03:26,505 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:26,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:26,506 INFO L229 MonitoredProcess]: Starting monitored process 11 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-15 17:03:26,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-12-15 17:03:26,508 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:03:26,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:26,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:26,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:26,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:26,521 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:03:26,521 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:03:26,536 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:26,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2021-12-15 17:03:26,555 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:26,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:26,556 INFO L229 MonitoredProcess]: Starting monitored process 12 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-15 17:03:26,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-12-15 17:03:26,559 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:03:26,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:26,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:26,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:26,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:26,566 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:03:26,566 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:03:26,582 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:03:26,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-12-15 17:03:26,600 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:26,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:26,601 INFO L229 MonitoredProcess]: Starting monitored process 13 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-15 17:03:26,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-12-15 17:03:26,603 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:03:26,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:03:26,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:03:26,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:03:26,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:03:26,614 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:03:26,614 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:03:26,620 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:03:26,656 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2021-12-15 17:03:26,657 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2021-12-15 17:03:26,658 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:03:26,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:26,672 INFO L229 MonitoredProcess]: Starting monitored process 14 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-15 17:03:26,718 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:03:26,727 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:03:26,727 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:03:26,728 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_1 + 199 Supporting invariants [] [2021-12-15 17:03:26,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-12-15 17:03:26,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-12-15 17:03:26,787 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2021-12-15 17:03:26,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:26,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:03:26,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-15 17:03:26,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:03:26,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:03:26,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-15 17:03:26,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:03:26,903 INFO L354 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2021-12-15 17:03:26,904 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 2 case distinctions, treesize of input 39 treesize of output 50 [2021-12-15 17:03:26,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-12-15 17:03:27,010 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-15 17:03:27,030 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2021-12-15 17:03:27,031 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-15 17:03:27,068 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). 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) Result 25 states and 31 transitions. Complement of second has 10 states. [2021-12-15 17:03:27,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2021-12-15 17:03:27,072 INFO L82 GeneralOperation]: Start removeUnreachable. 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-15 17:03:27,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 16 transitions. [2021-12-15 17:03:27,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 16 transitions. Stem has 2 letters. Loop has 3 letters. [2021-12-15 17:03:27,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:03:27,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 16 transitions. Stem has 5 letters. Loop has 3 letters. [2021-12-15 17:03:27,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:03:27,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 16 transitions. Stem has 2 letters. Loop has 6 letters. [2021-12-15 17:03:27,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:03:27,075 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. [2021-12-15 17:03:27,076 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:03:27,078 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 11 states and 13 transitions. [2021-12-15 17:03:27,079 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2021-12-15 17:03:27,079 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2021-12-15 17:03:27,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2021-12-15 17:03:27,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:03:27,079 INFO L681 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2021-12-15 17:03:27,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2021-12-15 17:03:27,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2021-12-15 17:03:27,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 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-15 17:03:27,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2021-12-15 17:03:27,096 INFO L704 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2021-12-15 17:03:27,096 INFO L587 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2021-12-15 17:03:27,096 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:03:27,096 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2021-12-15 17:03:27,096 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:03:27,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:03:27,097 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:03:27,097 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-12-15 17:03:27,097 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:03:27,097 INFO L791 eck$LassoCheckResult]: Stem: 151#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 152#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~mem8#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~mem10#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); 153#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 < 100);havoc main_#t~mem7#1; 156#L552-5 call write~int(5, main_~j~0#1.base, main_~j~0#1.offset, 4); 157#L553-4 [2021-12-15 17:03:27,097 INFO L793 eck$LassoCheckResult]: Loop: 157#L553-4 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 159#L553-1 assume !!(main_#t~mem10#1 < 21);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; 158#L553-3 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(3 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1; 157#L553-4 [2021-12-15 17:03:27,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:27,098 INFO L85 PathProgramCache]: Analyzing trace with hash 28694795, now seen corresponding path program 1 times [2021-12-15 17:03:27,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:27,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785697881] [2021-12-15 17:03:27,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:27,098 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:27,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:03:27,138 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-15 17:03:27,139 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:03:27,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785697881] [2021-12-15 17:03:27,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785697881] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:03:27,139 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:03:27,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 17:03:27,140 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574806964] [2021-12-15 17:03:27,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:03:27,142 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:03:27,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:27,142 INFO L85 PathProgramCache]: Analyzing trace with hash 50806, now seen corresponding path program 1 times [2021-12-15 17:03:27,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:27,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602403751] [2021-12-15 17:03:27,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:27,143 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:27,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:27,148 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:03:27,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:27,151 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:03:27,205 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:03:27,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 17:03:27,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 17:03:27,208 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. cyclomatic complexity: 4 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-15 17:03:27,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:03:27,229 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2021-12-15 17:03:27,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 17:03:27,230 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2021-12-15 17:03:27,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:03:27,231 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 13 transitions. [2021-12-15 17:03:27,231 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2021-12-15 17:03:27,231 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2021-12-15 17:03:27,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2021-12-15 17:03:27,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:03:27,231 INFO L681 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2021-12-15 17:03:27,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2021-12-15 17:03:27,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2021-12-15 17:03:27,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 10 states have internal predecessors, (12), 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-15 17:03:27,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2021-12-15 17:03:27,232 INFO L704 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2021-12-15 17:03:27,233 INFO L587 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2021-12-15 17:03:27,233 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:03:27,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2021-12-15 17:03:27,233 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:03:27,233 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:03:27,233 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:03:27,234 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2021-12-15 17:03:27,234 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:03:27,234 INFO L791 eck$LassoCheckResult]: Stem: 182#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 183#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~mem8#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~mem10#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); 186#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 187#L552-1 assume !!(main_#t~mem7#1 < 100);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 184#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; 185#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 188#L552-1 assume !(main_#t~mem7#1 < 100);havoc main_#t~mem7#1; 189#L552-5 call write~int(5, main_~j~0#1.base, main_~j~0#1.offset, 4); 190#L553-4 [2021-12-15 17:03:27,234 INFO L793 eck$LassoCheckResult]: Loop: 190#L553-4 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 192#L553-1 assume !!(main_#t~mem10#1 < 21);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; 191#L553-3 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(3 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1; 190#L553-4 [2021-12-15 17:03:27,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:27,234 INFO L85 PathProgramCache]: Analyzing trace with hash 149879881, now seen corresponding path program 1 times [2021-12-15 17:03:27,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:27,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041434232] [2021-12-15 17:03:27,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:27,235 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:27,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:03:27,293 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-15 17:03:27,294 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:03:27,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041434232] [2021-12-15 17:03:27,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041434232] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:03:27,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593568921] [2021-12-15 17:03:27,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:27,295 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:03:27,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:27,296 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:03:27,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-15 17:03:27,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:03:27,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-15 17:03:27,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:03:27,392 INFO L354 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2021-12-15 17:03:27,393 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 51 [2021-12-15 17:03:27,398 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2021-12-15 17:03:27,403 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-12-15 17:03:27,422 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 11 treesize of output 7 [2021-12-15 17:03:27,433 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-12-15 17:03:27,436 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 15 treesize of output 11 [2021-12-15 17:03:27,474 INFO L354 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2021-12-15 17:03:27,474 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 2 case distinctions, treesize of input 28 treesize of output 35 [2021-12-15 17:03:27,549 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 17:03:27,550 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 1 case distinctions, treesize of input 28 treesize of output 26 [2021-12-15 17:03:27,562 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-15 17:03:27,566 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-15 17:03:27,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:03:27,649 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-15 17:03:27,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593568921] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:03:27,650 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:03:27,650 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2021-12-15 17:03:27,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962677223] [2021-12-15 17:03:27,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:03:27,650 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:03:27,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:27,651 INFO L85 PathProgramCache]: Analyzing trace with hash 50806, now seen corresponding path program 2 times [2021-12-15 17:03:27,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:27,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113057952] [2021-12-15 17:03:27,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:27,651 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:27,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:27,655 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:03:27,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:27,658 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:03:27,735 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:03:27,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-15 17:03:27,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-12-15 17:03:27,736 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 3 Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 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-15 17:03:27,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:03:27,795 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2021-12-15 17:03:27,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 17:03:27,796 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 21 transitions. [2021-12-15 17:03:27,797 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:03:27,797 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 19 transitions. [2021-12-15 17:03:27,797 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2021-12-15 17:03:27,797 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2021-12-15 17:03:27,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 19 transitions. [2021-12-15 17:03:27,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:03:27,798 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 19 transitions. [2021-12-15 17:03:27,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 19 transitions. [2021-12-15 17:03:27,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2021-12-15 17:03:27,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 16 states have internal predecessors, (18), 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-15 17:03:27,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2021-12-15 17:03:27,799 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2021-12-15 17:03:27,799 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2021-12-15 17:03:27,799 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:03:27,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2021-12-15 17:03:27,799 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:03:27,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:03:27,799 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:03:27,800 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 1, 1, 1, 1] [2021-12-15 17:03:27,800 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:03:27,800 INFO L791 eck$LassoCheckResult]: Stem: 281#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 282#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~mem8#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~mem10#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); 283#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 284#L552-1 assume !!(main_#t~mem7#1 < 100);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 279#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; 280#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 285#L552-1 assume !!(main_#t~mem7#1 < 100);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 295#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; 294#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 292#L552-1 assume !!(main_#t~mem7#1 < 100);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 293#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; 291#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 290#L552-1 assume !(main_#t~mem7#1 < 100);havoc main_#t~mem7#1; 286#L552-5 call write~int(5, main_~j~0#1.base, main_~j~0#1.offset, 4); 287#L553-4 [2021-12-15 17:03:27,800 INFO L793 eck$LassoCheckResult]: Loop: 287#L553-4 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 289#L553-1 assume !!(main_#t~mem10#1 < 21);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; 288#L553-3 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(3 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1; 287#L553-4 [2021-12-15 17:03:27,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:27,800 INFO L85 PathProgramCache]: Analyzing trace with hash -579836663, now seen corresponding path program 2 times [2021-12-15 17:03:27,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:27,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203317056] [2021-12-15 17:03:27,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:27,801 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:03:27,959 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:03:27,959 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:03:27,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203317056] [2021-12-15 17:03:27,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203317056] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:03:27,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867005212] [2021-12-15 17:03:27,960 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 17:03:27,960 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:03:27,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:28,012 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:03:28,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-15 17:03:28,067 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 17:03:28,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 17:03:28,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 33 conjunts are in the unsatisfiable core [2021-12-15 17:03:28,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:03:28,100 INFO L354 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2021-12-15 17:03:28,100 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 51 [2021-12-15 17:03:28,104 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2021-12-15 17:03:28,109 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-12-15 17:03:28,124 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-12-15 17:03:28,126 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 9 treesize of output 7 [2021-12-15 17:03:28,136 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 19 treesize of output 11 [2021-12-15 17:03:28,145 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-15 17:03:28,161 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-15 17:03:28,172 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-15 17:03:28,190 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-15 17:03:28,203 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-15 17:03:28,236 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-15 17:03:28,252 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-15 17:03:28,267 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-15 17:03:28,276 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:03:28,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:03:28,311 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_210 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_210) |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) 99)) is different from false [2021-12-15 17:03:28,323 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_210 (Array Int Int)) (v_ArrVal_208 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_208)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_210) |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) 99) (< (+ (select .cse0 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_208)))) is different from false [2021-12-15 17:03:28,335 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_207 (Array Int Int)) (v_ArrVal_210 (Array Int Int)) (v_ArrVal_208 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_207))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~i~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_208)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_210) |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) 99) (< (+ (select .cse1 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_208))))) is different from false [2021-12-15 17:03:28,367 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_207 (Array Int Int)) (v_ArrVal_210 (Array Int Int)) (v_ArrVal_208 Int) (v_ArrVal_206 Int)) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_206)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_207))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~i~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_208) (< (select (select (store (store .cse1 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_208)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_210) |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) 99) (< (+ (select .cse2 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_206)))))) is different from false [2021-12-15 17:03:28,391 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_204 (Array Int Int)) (v_ArrVal_207 (Array Int Int)) (v_ArrVal_210 (Array Int Int)) (v_ArrVal_208 Int) (v_ArrVal_206 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_204))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse2 (store (store .cse3 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_206)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_207))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_main_~i~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_208) (< (+ (select .cse1 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_206) (< (select (select (store (store .cse2 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_208)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_210) |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) 99))))))) is different from false [2021-12-15 17:03:28,431 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2021-12-15 17:03:28,431 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867005212] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:03:28,431 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:03:28,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 10] total 24 [2021-12-15 17:03:28,432 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251902581] [2021-12-15 17:03:28,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:03:28,432 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:03:28,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:28,432 INFO L85 PathProgramCache]: Analyzing trace with hash 50806, now seen corresponding path program 3 times [2021-12-15 17:03:28,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:28,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800521784] [2021-12-15 17:03:28,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:28,433 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:28,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:28,437 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:03:28,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:28,440 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:03:28,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:03:28,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-15 17:03:28,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=229, Unknown=5, NotChecked=190, Total=552 [2021-12-15 17:03:28,491 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. cyclomatic complexity: 3 Second operand has 24 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 states have internal predecessors, (38), 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-15 17:03:28,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:03:28,686 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2021-12-15 17:03:28,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-15 17:03:28,687 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 31 transitions. [2021-12-15 17:03:28,688 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:03:28,688 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 28 transitions. [2021-12-15 17:03:28,688 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2021-12-15 17:03:28,688 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2021-12-15 17:03:28,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 28 transitions. [2021-12-15 17:03:28,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:03:28,689 INFO L681 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2021-12-15 17:03:28,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 28 transitions. [2021-12-15 17:03:28,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2021-12-15 17:03:28,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 25 states have internal predecessors, (27), 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-15 17:03:28,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2021-12-15 17:03:28,690 INFO L704 BuchiCegarLoop]: Abstraction has 26 states and 27 transitions. [2021-12-15 17:03:28,690 INFO L587 BuchiCegarLoop]: Abstraction has 26 states and 27 transitions. [2021-12-15 17:03:28,690 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-15 17:03:28,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 27 transitions. [2021-12-15 17:03:28,691 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:03:28,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:03:28,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:03:28,692 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 6, 1, 1, 1, 1] [2021-12-15 17:03:28,692 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:03:28,693 INFO L791 eck$LassoCheckResult]: Stem: 449#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 450#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~mem8#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~mem10#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); 453#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 454#L552-1 assume !!(main_#t~mem7#1 < 100);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 474#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; 455#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 456#L552-1 assume !!(main_#t~mem7#1 < 100);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 451#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; 452#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 473#L552-1 assume !!(main_#t~mem7#1 < 100);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 472#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; 471#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 470#L552-1 assume !!(main_#t~mem7#1 < 100);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 469#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; 468#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 467#L552-1 assume !!(main_#t~mem7#1 < 100);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 466#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; 465#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 463#L552-1 assume !!(main_#t~mem7#1 < 100);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 464#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; 462#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 461#L552-1 assume !(main_#t~mem7#1 < 100);havoc main_#t~mem7#1; 459#L552-5 call write~int(5, main_~j~0#1.base, main_~j~0#1.offset, 4); 458#L553-4 [2021-12-15 17:03:28,693 INFO L793 eck$LassoCheckResult]: Loop: 458#L553-4 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 460#L553-1 assume !!(main_#t~mem10#1 < 21);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; 457#L553-3 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(3 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1; 458#L553-4 [2021-12-15 17:03:28,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:28,693 INFO L85 PathProgramCache]: Analyzing trace with hash -733972789, now seen corresponding path program 3 times [2021-12-15 17:03:28,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:28,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980941754] [2021-12-15 17:03:28,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:28,694 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:28,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:03:29,180 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:03:29,181 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:03:29,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980941754] [2021-12-15 17:03:29,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980941754] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:03:29,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018928432] [2021-12-15 17:03:29,181 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 17:03:29,181 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:03:29,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:29,195 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:03:29,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-15 17:03:29,305 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2021-12-15 17:03:29,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 17:03:29,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 45 conjunts are in the unsatisfiable core [2021-12-15 17:03:29,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:03:29,337 INFO L354 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2021-12-15 17:03:29,337 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 51 [2021-12-15 17:03:29,341 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2021-12-15 17:03:29,345 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-12-15 17:03:29,359 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 11 treesize of output 7 [2021-12-15 17:03:29,378 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-12-15 17:03:29,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 15 treesize of output 11 [2021-12-15 17:03:29,385 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-15 17:03:29,405 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-15 17:03:29,413 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-15 17:03:29,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, 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-15 17:03:29,438 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-15 17:03:29,464 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-15 17:03:29,473 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-15 17:03:29,510 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-15 17:03:29,519 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-15 17:03:29,539 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-15 17:03:29,552 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-15 17:03:29,577 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-15 17:03:29,596 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-15 17:03:29,612 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-15 17:03:29,623 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:03:29,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:03:29,667 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_323 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_323) |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) 99)) is different from false [2021-12-15 17:03:29,684 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_322 Int) (v_ArrVal_323 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_322) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_322)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_323) |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) 99)))) is different from false [2021-12-15 17:03:29,697 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_322 Int) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_323 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_320))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~i~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_322)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_323) |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) 99) (< (+ (select .cse1 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_322))))) is different from false [2021-12-15 17:03:29,731 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_322 Int) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_318 Int) (v_ArrVal_323 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_318)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_320))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~i~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_322) (< (select (select (store (store .cse1 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_322)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_323) |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) 99) (< (+ (select .cse2 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_318)))))) is different from false [2021-12-15 17:03:29,757 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_317 (Array Int Int)) (v_ArrVal_322 Int) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_318 Int) (v_ArrVal_323 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_317))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse0 (store (store .cse3 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_318)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_320))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~i~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_322)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_323) |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) 99) (< (+ (select .cse1 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_322) (< (+ (select .cse2 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_318))))))) is different from false [2021-12-15 17:03:29,821 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_317 (Array Int Int)) (v_ArrVal_322 Int) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_318 Int) (v_ArrVal_315 Int) (v_ArrVal_323 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_315)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_317))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse0 (store (store .cse4 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_318)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_320))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~i~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_322)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_323) |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) 99) (< (+ (select .cse2 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_315) (< (+ (select .cse1 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_322) (< (+ (select .cse3 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_318)))))))) is different from false [2021-12-15 17:03:29,862 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_314 (Array Int Int)) (v_ArrVal_317 (Array Int Int)) (v_ArrVal_322 Int) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_318 Int) (v_ArrVal_315 Int) (v_ArrVal_323 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_314))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_315)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_317))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse2 (store (store .cse4 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_318)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_320))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~i~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_315) (< (+ (select .cse1 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_318) (< (select (select (store (store .cse2 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_322)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_323) |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) 99) (< (+ (select .cse3 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_322))))))))) is different from false [2021-12-15 17:03:30,002 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_312 Int) (v_ArrVal_314 (Array Int Int)) (v_ArrVal_317 (Array Int Int)) (v_ArrVal_322 Int) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_318 Int) (v_ArrVal_315 Int) (v_ArrVal_323 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_312)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_314))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_315)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_317))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse0 (store (store .cse5 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_318)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_320))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~i~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_322)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_323) |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) 99) (< (+ (select .cse2 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_318) (< (+ (select .cse3 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_315) (< (+ (select .cse4 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_312) (< (+ (select .cse1 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_322)))))))))) is different from false [2021-12-15 17:03:30,097 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_312 Int) (v_ArrVal_314 (Array Int Int)) (v_ArrVal_317 (Array Int Int)) (v_ArrVal_322 Int) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_318 Int) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_315 Int) (v_ArrVal_323 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_311))) (let ((.cse0 (select .cse7 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_312)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_314))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_315)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_317))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse2 (store (store .cse5 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_318)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_320))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~i~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_312) (< (+ (select .cse1 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_322) (< (select (select (store (store .cse2 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_322)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_323) |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) 99) (< (+ (select .cse3 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_318) (< (+ (select .cse4 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_315))))))))))) is different from false [2021-12-15 17:03:30,479 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_312 Int) (v_ArrVal_314 (Array Int Int)) (v_ArrVal_317 (Array Int Int)) (v_ArrVal_322 Int) (v_ArrVal_309 Int) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_318 Int) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_315 Int) (v_ArrVal_323 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_309)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_311))) (let ((.cse4 (select .cse8 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_312)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_314))) (let ((.cse1 (select .cse7 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_315)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_317))) (let ((.cse0 (select .cse6 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse2 (store (store .cse6 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_318)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_320))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~i~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_318) (< (+ (select .cse1 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_315) (< (select (select (store (store .cse2 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_322)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_323) |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) 99) (< (+ (select .cse3 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_322) (< (+ (select .cse4 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_312) (< (+ (select .cse5 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_309)))))))))))) is different from false [2021-12-15 17:03:30,695 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_312 Int) (v_ArrVal_314 (Array Int Int)) (v_ArrVal_317 (Array Int Int)) (v_ArrVal_322 Int) (v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 Int) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_318 Int) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_315 Int) (v_ArrVal_323 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_308))) (let ((.cse5 (select .cse9 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse8 (store (store .cse9 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_309)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_311))) (let ((.cse3 (select .cse8 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_312)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_314))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_315)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_317))) (let ((.cse0 (select .cse6 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse1 (store (store .cse6 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_318)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_320))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~i~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_318) (< (select (select (store (store .cse1 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_322)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_323) |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) 99) (< (+ (select .cse3 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_312) (< (+ (select .cse2 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_322) (< (+ (select .cse4 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_315) (< (+ (select .cse5 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_309))))))))))))) is different from false [2021-12-15 17:03:30,939 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 57 not checked. [2021-12-15 17:03:30,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018928432] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:03:30,954 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:03:30,954 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 16] total 39 [2021-12-15 17:03:30,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593257982] [2021-12-15 17:03:30,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:03:30,955 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:03:30,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:30,956 INFO L85 PathProgramCache]: Analyzing trace with hash 50806, now seen corresponding path program 4 times [2021-12-15 17:03:30,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:30,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877320904] [2021-12-15 17:03:30,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:30,957 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:30,961 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:03:30,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:30,963 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:03:31,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:03:31,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-12-15 17:03:31,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=499, Unknown=11, NotChecked=682, Total=1482 [2021-12-15 17:03:31,018 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. cyclomatic complexity: 3 Second operand has 39 states, 39 states have (on average 1.6666666666666667) internal successors, (65), 39 states have internal predecessors, (65), 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-15 17:03:31,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:03:31,315 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2021-12-15 17:03:31,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-15 17:03:31,316 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 40 transitions. [2021-12-15 17:03:31,316 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:03:31,317 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 36 states and 37 transitions. [2021-12-15 17:03:31,317 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2021-12-15 17:03:31,317 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2021-12-15 17:03:31,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 37 transitions. [2021-12-15 17:03:31,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:03:31,317 INFO L681 BuchiCegarLoop]: Abstraction has 36 states and 37 transitions. [2021-12-15 17:03:31,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 37 transitions. [2021-12-15 17:03:31,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2021-12-15 17:03:31,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 34 states have internal predecessors, (36), 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-15 17:03:31,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2021-12-15 17:03:31,319 INFO L704 BuchiCegarLoop]: Abstraction has 35 states and 36 transitions. [2021-12-15 17:03:31,319 INFO L587 BuchiCegarLoop]: Abstraction has 35 states and 36 transitions. [2021-12-15 17:03:31,319 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-15 17:03:31,320 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 36 transitions. [2021-12-15 17:03:31,320 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:03:31,320 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:03:31,320 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:03:31,320 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 9, 1, 1, 1, 1] [2021-12-15 17:03:31,320 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:03:31,321 INFO L791 eck$LassoCheckResult]: Stem: 720#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 721#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~mem8#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~mem10#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); 722#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 723#L552-1 assume !!(main_#t~mem7#1 < 100);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 752#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; 724#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 725#L552-1 assume !!(main_#t~mem7#1 < 100);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 718#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; 719#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 751#L552-1 assume !!(main_#t~mem7#1 < 100);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 750#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; 749#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 748#L552-1 assume !!(main_#t~mem7#1 < 100);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 747#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; 746#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 745#L552-1 assume !!(main_#t~mem7#1 < 100);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 744#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; 743#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 742#L552-1 assume !!(main_#t~mem7#1 < 100);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 741#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; 740#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 739#L552-1 assume !!(main_#t~mem7#1 < 100);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 738#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; 737#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 736#L552-1 assume !!(main_#t~mem7#1 < 100);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 735#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; 734#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 732#L552-1 assume !!(main_#t~mem7#1 < 100);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 733#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; 731#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 730#L552-1 assume !(main_#t~mem7#1 < 100);havoc main_#t~mem7#1; 726#L552-5 call write~int(5, main_~j~0#1.base, main_~j~0#1.offset, 4); 727#L553-4 [2021-12-15 17:03:31,321 INFO L793 eck$LassoCheckResult]: Loop: 727#L553-4 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 729#L553-1 assume !!(main_#t~mem10#1 < 21);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; 728#L553-3 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(3 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1; 727#L553-4 [2021-12-15 17:03:31,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:31,321 INFO L85 PathProgramCache]: Analyzing trace with hash -2019868855, now seen corresponding path program 4 times [2021-12-15 17:03:31,321 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:31,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513512811] [2021-12-15 17:03:31,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:31,321 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:31,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:03:32,050 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:03:32,051 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:03:32,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513512811] [2021-12-15 17:03:32,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513512811] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:03:32,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529134602] [2021-12-15 17:03:32,052 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-15 17:03:32,052 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:03:32,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:32,053 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:03:32,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-15 17:03:32,190 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-15 17:03:32,190 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 17:03:32,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 57 conjunts are in the unsatisfiable core [2021-12-15 17:03:32,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:03:32,204 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-15 17:03:32,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:03:32,208 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 14 [2021-12-15 17:03:32,210 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2021-12-15 17:03:32,223 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-15 17:03:32,231 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-15 17:03:32,244 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-15 17:03:32,253 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-15 17:03:32,271 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-15 17:03:32,280 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-15 17:03:32,294 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-15 17:03:32,301 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-15 17:03:32,316 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-15 17:03:32,326 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-15 17:03:32,344 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-15 17:03:32,351 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-15 17:03:32,368 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-15 17:03:32,377 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-15 17:03:32,394 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-15 17:03:32,406 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-15 17:03:32,428 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-15 17:03:32,452 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-15 17:03:32,469 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-15 17:03:32,478 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:03:32,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:03:32,534 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_469 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_469) |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) 99)) is different from false [2021-12-15 17:03:32,551 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_469 (Array Int Int)) (v_ArrVal_468 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_468)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_469) |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) 99) (< (+ (select .cse0 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_468)))) is different from false [2021-12-15 17:03:32,558 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_469 (Array Int Int)) (v_ArrVal_466 (Array Int Int)) (v_ArrVal_468 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_466))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~i~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_468)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_469) |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) 99) (< (+ (select .cse1 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_468))))) is different from false [2021-12-15 17:03:32,601 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_469 (Array Int Int)) (v_ArrVal_465 Int) (v_ArrVal_466 (Array Int Int)) (v_ArrVal_468 Int)) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_465)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_466))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~i~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_468)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_469) |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) 99) (< (+ (select .cse1 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_468) (< (+ (select .cse2 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_465)))))) is different from false [2021-12-15 17:03:32,617 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_469 (Array Int Int)) (v_ArrVal_465 Int) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_466 (Array Int Int)) (v_ArrVal_468 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_463))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse0 (store (store .cse3 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_465)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_466))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~i~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_468)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_469) |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) 99) (< (+ (select .cse1 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_468) (< (+ (select .cse2 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_465))))))) is different from false [2021-12-15 17:03:32,667 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_469 (Array Int Int)) (v_ArrVal_465 Int) (v_ArrVal_461 Int) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_466 (Array Int Int)) (v_ArrVal_468 Int)) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_461)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_463))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse1 (store (store .cse4 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_465)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_466))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~i~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_468) (< (select (select (store (store .cse1 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_468)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_469) |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) 99) (< (+ (select .cse2 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_461) (< (+ (select .cse3 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_465)))))))) is different from false [2021-12-15 17:03:32,700 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_469 (Array Int Int)) (v_ArrVal_465 Int) (v_ArrVal_461 Int) (v_ArrVal_460 (Array Int Int)) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_466 (Array Int Int)) (v_ArrVal_468 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_460))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_461)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_463))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse3 (store (store .cse4 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_465)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_466))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_main_~i~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_468) (< (+ (select .cse1 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_465) (< (+ (select .cse2 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_461) (< (select (select (store (store .cse3 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_468)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_469) |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) 99))))))))) is different from false [2021-12-15 17:03:32,801 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_469 (Array Int Int)) (v_ArrVal_465 Int) (v_ArrVal_461 Int) (v_ArrVal_460 (Array Int Int)) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_466 (Array Int Int)) (v_ArrVal_468 Int)) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_459)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_460))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_461)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_463))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse0 (store (store .cse5 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_465)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_466))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~i~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_468)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_469) |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) 99) (< (+ (select .cse2 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_459) (< (+ (select .cse3 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_465) (< (+ (select .cse1 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_468) (< (+ (select .cse4 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_461)))))))))) is different from false [2021-12-15 17:03:32,873 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_469 (Array Int Int)) (v_ArrVal_457 (Array Int Int)) (v_ArrVal_465 Int) (v_ArrVal_461 Int) (v_ArrVal_460 (Array Int Int)) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_466 (Array Int Int)) (v_ArrVal_468 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_457))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_459)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_460))) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_461)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_463))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse3 (store (store .cse5 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_465)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_466))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~i~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_465) (< (+ (select .cse1 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_468) (< (+ (select .cse2 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_461) (< (select (select (store (store .cse3 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_468)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_469) |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) 99) (< (+ (select .cse4 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_459))))))))))) is different from false [2021-12-15 17:03:33,102 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_469 (Array Int Int)) (v_ArrVal_455 Int) (v_ArrVal_457 (Array Int Int)) (v_ArrVal_465 Int) (v_ArrVal_461 Int) (v_ArrVal_460 (Array Int Int)) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_466 (Array Int Int)) (v_ArrVal_468 Int)) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_455)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_457))) (let ((.cse5 (select .cse8 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_459)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_460))) (let ((.cse0 (select .cse7 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_461)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_463))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse3 (store (store .cse6 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_465)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_466))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~i~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_461) (< (+ (select .cse1 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_465) (< (+ (select .cse2 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_455) (< (select (select (store (store .cse3 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_468)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_469) |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) 99) (< (+ (select .cse4 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_468) (< (+ (select .cse5 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_459)))))))))))) is different from false [2021-12-15 17:03:33,333 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_469 (Array Int Int)) (v_ArrVal_455 Int) (v_ArrVal_457 (Array Int Int)) (v_ArrVal_465 Int) (v_ArrVal_461 Int) (v_ArrVal_460 (Array Int Int)) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_454 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_466 (Array Int Int)) (v_ArrVal_468 Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_454))) (let ((.cse4 (select .cse9 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse8 (store (store .cse9 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_455)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_457))) (let ((.cse0 (select .cse8 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_459)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_460))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_461)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_463))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse1 (store (store .cse6 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_465)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_466))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~i~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_459) (< (select (select (store (store .cse1 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_468)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_469) |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) 99) (< (+ (select .cse3 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_465) (< (+ (select .cse4 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_455) (< (+ (select .cse5 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_461) (< (+ (select .cse2 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_468))))))))))))) is different from false [2021-12-15 17:03:33,950 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_460 (Array Int Int)) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_454 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_466 (Array Int Int)) (v_ArrVal_468 Int) (v_ArrVal_469 (Array Int Int)) (v_ArrVal_455 Int) (v_ArrVal_457 (Array Int Int)) (v_ArrVal_465 Int) (v_ArrVal_453 Int) (v_ArrVal_461 Int)) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_453)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_454))) (let ((.cse0 (select .cse10 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse9 (store (store .cse10 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_455)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_457))) (let ((.cse3 (select .cse9 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse8 (store (store .cse9 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_459)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_460))) (let ((.cse1 (select .cse8 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_461)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_463))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse5 (store (store .cse7 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_465)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_466))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~i~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_455) (< (+ (select .cse1 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_461) (< (+ (select .cse2 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_453) (< (+ (select .cse3 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_459) (< (+ (select .cse4 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_465) (< (select (select (store (store .cse5 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_468)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_469) |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) 99) (< (+ (select .cse6 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_468)))))))))))))) is different from false [2021-12-15 17:03:34,467 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_460 (Array Int Int)) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_451 (Array Int Int)) (v_ArrVal_454 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_466 (Array Int Int)) (v_ArrVal_468 Int) (v_ArrVal_469 (Array Int Int)) (v_ArrVal_455 Int) (v_ArrVal_457 (Array Int Int)) (v_ArrVal_465 Int) (v_ArrVal_453 Int) (v_ArrVal_461 Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_451))) (let ((.cse0 (select .cse11 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse10 (store (store .cse11 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_453)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_454))) (let ((.cse2 (select .cse10 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse9 (store (store .cse10 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_455)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_457))) (let ((.cse1 (select .cse9 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse8 (store (store .cse9 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_459)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_460))) (let ((.cse5 (select .cse8 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_461)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_463))) (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse3 (store (store .cse7 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_465)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_466))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~i~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_453) (< (+ (select .cse1 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_459) (< (+ (select .cse2 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_455) (< (select (select (store (store .cse3 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_468)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_469) |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) 99) (< (+ (select .cse5 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_461) (< (+ (select .cse6 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_465) (< (+ (select .cse4 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_468))))))))))))))) is different from false [2021-12-15 17:03:35,811 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_460 (Array Int Int)) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_451 (Array Int Int)) (v_ArrVal_454 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_466 (Array Int Int)) (v_ArrVal_468 Int) (v_ArrVal_469 (Array Int Int)) (v_ArrVal_455 Int) (v_ArrVal_457 (Array Int Int)) (v_ArrVal_465 Int) (v_ArrVal_453 Int) (v_ArrVal_450 Int) (v_ArrVal_461 Int)) (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse12 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_450)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_451))) (let ((.cse2 (select .cse12 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse11 (store (store .cse12 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_453)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_454))) (let ((.cse1 (select .cse11 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse10 (store (store .cse11 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_455)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_457))) (let ((.cse0 (select .cse10 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse9 (store (store .cse10 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_459)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_460))) (let ((.cse4 (select .cse9 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse8 (store (store .cse9 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_461)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_463))) (let ((.cse5 (select .cse8 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse6 (store (store .cse8 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_465)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_466))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_main_~i~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_459) (< (+ (select .cse1 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_455) (< (+ (select .cse2 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_453) (< (+ (select .cse3 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_468) (< (+ (select .cse4 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_461) (< (+ (select .cse5 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_465) (< (select (select (store (store .cse6 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_468)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_469) |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) 99) (< (+ (select .cse7 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_450)))))))))))))))) is different from false [2021-12-15 17:03:36,908 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_460 (Array Int Int)) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_451 (Array Int Int)) (v_ArrVal_454 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_466 (Array Int Int)) (v_ArrVal_468 Int) (v_ArrVal_469 (Array Int Int)) (v_ArrVal_455 Int) (v_ArrVal_457 (Array Int Int)) (v_ArrVal_465 Int) (v_ArrVal_448 (Array Int Int)) (v_ArrVal_453 Int) (v_ArrVal_450 Int) (v_ArrVal_461 Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_448))) (let ((.cse5 (select .cse13 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse12 (store (store .cse13 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_450)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_451))) (let ((.cse4 (select .cse12 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse11 (store (store .cse12 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_453)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_454))) (let ((.cse0 (select .cse11 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse10 (store (store .cse11 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_455)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_457))) (let ((.cse3 (select .cse10 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse9 (store (store .cse10 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_459)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_460))) (let ((.cse1 (select .cse9 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse8 (store (store .cse9 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_461)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_463))) (let ((.cse2 (select .cse8 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_465)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_466))) (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~i~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_455) (< (+ (select .cse1 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_461) (< (+ (select .cse2 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_465) (< (+ (select .cse3 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_459) (< (+ (select .cse4 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_453) (< (+ (select .cse5 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_450) (< (+ (select .cse6 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_468) (< (select (select (store (store .cse7 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_468)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_469) |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) 99))))))))))))))))) is different from false [2021-12-15 17:03:40,546 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_460 (Array Int Int)) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_451 (Array Int Int)) (v_ArrVal_454 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_446 Int) (v_ArrVal_466 (Array Int Int)) (v_ArrVal_468 Int) (v_ArrVal_469 (Array Int Int)) (v_ArrVal_455 Int) (v_ArrVal_457 (Array Int Int)) (v_ArrVal_465 Int) (v_ArrVal_448 (Array Int Int)) (v_ArrVal_453 Int) (v_ArrVal_450 Int) (v_ArrVal_461 Int)) (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse14 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_446)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_448))) (let ((.cse2 (select .cse14 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse13 (store (store .cse14 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_450)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_451))) (let ((.cse0 (select .cse13 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse12 (store (store .cse13 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_453)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_454))) (let ((.cse8 (select .cse12 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse11 (store (store .cse12 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_455)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_457))) (let ((.cse6 (select .cse11 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse10 (store (store .cse11 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_459)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_460))) (let ((.cse5 (select .cse10 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse9 (store (store .cse10 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_461)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_463))) (let ((.cse3 (select .cse9 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse4 (store (store .cse9 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_465)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_466))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_main_~i~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_453) (< (+ (select .cse1 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_468) (< (+ (select .cse2 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_450) (< (+ (select .cse3 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_465) (< (select (select (store (store .cse4 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_468)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_469) |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) 99) (< (+ (select .cse5 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_461) (< (+ (select .cse6 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_459) (< (+ (select .cse7 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_446) (< (+ (select .cse8 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_455)))))))))))))))))) is different from false [2021-12-15 17:03:43,101 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_460 (Array Int Int)) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_451 (Array Int Int)) (v_ArrVal_454 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_445 (Array Int Int)) (v_ArrVal_446 Int) (v_ArrVal_466 (Array Int Int)) (v_ArrVal_468 Int) (v_ArrVal_469 (Array Int Int)) (v_ArrVal_455 Int) (v_ArrVal_457 (Array Int Int)) (v_ArrVal_465 Int) (v_ArrVal_448 (Array Int Int)) (v_ArrVal_453 Int) (v_ArrVal_450 Int) (v_ArrVal_461 Int)) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_445))) (let ((.cse4 (select .cse15 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse14 (store (store .cse15 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_446)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_448))) (let ((.cse8 (select .cse14 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse13 (store (store .cse14 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_450)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_451))) (let ((.cse5 (select .cse13 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse12 (store (store .cse13 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_453)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_454))) (let ((.cse6 (select .cse12 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse11 (store (store .cse12 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_455)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_457))) (let ((.cse7 (select .cse11 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse10 (store (store .cse11 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_459)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_460))) (let ((.cse0 (select .cse10 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse9 (store (store .cse10 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_461)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_463))) (let ((.cse1 (select .cse9 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse2 (store (store .cse9 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_465)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_466))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~i~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_461) (< (+ (select .cse1 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_465) (< (select (select (store (store .cse2 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_468)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_469) |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) 99) (< (+ (select .cse3 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_468) (< (+ (select .cse4 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_446) (< (+ (select .cse5 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_453) (< (+ (select .cse6 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_455) (< (+ (select .cse7 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_459) (< (+ (select .cse8 |c_ULTIMATE.start_main_~i~0#1.offset|) 1) v_ArrVal_450))))))))))))))))))) is different from false [2021-12-15 17:03:46,356 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 126 not checked. [2021-12-15 17:03:46,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529134602] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:03:46,356 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:03:46,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 14, 22] total 54 [2021-12-15 17:03:46,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231190777] [2021-12-15 17:03:46,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:03:46,358 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:03:46,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:46,359 INFO L85 PathProgramCache]: Analyzing trace with hash 50806, now seen corresponding path program 5 times [2021-12-15 17:03:46,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:46,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730194997] [2021-12-15 17:03:46,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:46,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:46,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:46,368 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:03:46,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:03:46,379 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:03:46,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:03:46,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2021-12-15 17:03:46,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=515, Invalid=868, Unknown=17, NotChecked=1462, Total=2862 [2021-12-15 17:03:46,420 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. cyclomatic complexity: 3 Second operand has 54 states, 54 states have (on average 1.7037037037037037) internal successors, (92), 54 states have internal predecessors, (92), 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-15 17:03:47,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:03:47,017 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2021-12-15 17:03:47,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-12-15 17:03:47,018 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 49 transitions. [2021-12-15 17:03:47,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:03:47,028 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 45 states and 46 transitions. [2021-12-15 17:03:47,028 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2021-12-15 17:03:47,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2021-12-15 17:03:47,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 46 transitions. [2021-12-15 17:03:47,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:03:47,029 INFO L681 BuchiCegarLoop]: Abstraction has 45 states and 46 transitions. [2021-12-15 17:03:47,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 46 transitions. [2021-12-15 17:03:47,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2021-12-15 17:03:47,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 43 states have internal predecessors, (45), 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-15 17:03:47,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2021-12-15 17:03:47,035 INFO L704 BuchiCegarLoop]: Abstraction has 44 states and 45 transitions. [2021-12-15 17:03:47,035 INFO L587 BuchiCegarLoop]: Abstraction has 44 states and 45 transitions. [2021-12-15 17:03:47,035 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-15 17:03:47,035 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 45 transitions. [2021-12-15 17:03:47,037 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:03:47,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:03:47,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:03:47,038 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [13, 12, 12, 1, 1, 1, 1] [2021-12-15 17:03:47,038 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:03:47,038 INFO L791 eck$LassoCheckResult]: Stem: 1088#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1089#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~mem8#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~mem10#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); 1090#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 1091#L552-1 assume !!(main_#t~mem7#1 < 100);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 1129#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; 1092#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 1093#L552-1 assume !!(main_#t~mem7#1 < 100);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 1086#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; 1087#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 1128#L552-1 assume !!(main_#t~mem7#1 < 100);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 1127#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; 1126#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 1125#L552-1 assume !!(main_#t~mem7#1 < 100);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 1124#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; 1123#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 1122#L552-1 assume !!(main_#t~mem7#1 < 100);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 1121#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; 1120#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 1119#L552-1 assume !!(main_#t~mem7#1 < 100);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 1118#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; 1117#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 1116#L552-1 assume !!(main_#t~mem7#1 < 100);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 1115#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; 1114#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 1113#L552-1 assume !!(main_#t~mem7#1 < 100);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 1112#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; 1111#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 1110#L552-1 assume !!(main_#t~mem7#1 < 100);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 1109#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; 1108#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 1107#L552-1 assume !!(main_#t~mem7#1 < 100);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 1106#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; 1105#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 1104#L552-1 assume !!(main_#t~mem7#1 < 100);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 1103#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; 1102#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 1100#L552-1 assume !!(main_#t~mem7#1 < 100);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int(1 + main_#t~mem8#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem8#1; 1101#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; 1099#L552-4 call main_#t~mem7#1 := read~int(main_~i~0#1.base, main_~i~0#1.offset, 4); 1098#L552-1 assume !(main_#t~mem7#1 < 100);havoc main_#t~mem7#1; 1094#L552-5 call write~int(5, main_~j~0#1.base, main_~j~0#1.offset, 4); 1095#L553-4 [2021-12-15 17:03:47,039 INFO L793 eck$LassoCheckResult]: Loop: 1095#L553-4 call main_#t~mem10#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4); 1097#L553-1 assume !!(main_#t~mem10#1 < 21);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; 1096#L553-3 call main_#t~mem9#1 := read~int(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int(3 + main_#t~mem9#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem9#1; 1095#L553-4 [2021-12-15 17:03:47,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:03:47,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1777916789, now seen corresponding path program 5 times [2021-12-15 17:03:47,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:03:47,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778485845] [2021-12-15 17:03:47,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:03:47,043 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:03:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:03:47,859 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:03:47,859 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:03:47,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778485845] [2021-12-15 17:03:47,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778485845] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:03:47,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790973692] [2021-12-15 17:03:47,860 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-15 17:03:47,860 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:03:47,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:03:47,869 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:03:47,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-12-15 17:03:48,178 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2021-12-15 17:03:48,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 17:03:48,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 85 conjunts are in the unsatisfiable core [2021-12-15 17:03:48,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:03:48,222 INFO L354 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2021-12-15 17:03:48,223 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 51 [2021-12-15 17:03:48,229 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2021-12-15 17:03:48,234 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-12-15 17:03:48,269 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-12-15 17:03:48,273 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 9 treesize of output 7 [2021-12-15 17:03:48,284 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 19 treesize of output 11 [2021-12-15 17:03:48,330 INFO L354 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2021-12-15 17:03:48,331 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 2 case distinctions, treesize of input 28 treesize of output 35 [2021-12-15 17:03:48,411 INFO L354 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2021-12-15 17:03:48,412 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 2 case distinctions, treesize of input 40 treesize of output 43 [2021-12-15 17:03:48,499 INFO L354 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2021-12-15 17:03:48,499 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 2 case distinctions, treesize of input 40 treesize of output 43 [2021-12-15 17:03:48,570 INFO L354 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2021-12-15 17:03:48,571 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 2 case distinctions, treesize of input 40 treesize of output 43 [2021-12-15 17:03:48,662 INFO L354 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2021-12-15 17:03:48,663 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 2 case distinctions, treesize of input 40 treesize of output 43 [2021-12-15 17:03:48,739 INFO L354 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2021-12-15 17:03:48,739 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 2 case distinctions, treesize of input 40 treesize of output 43 [2021-12-15 17:03:48,831 INFO L354 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2021-12-15 17:03:48,832 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 2 case distinctions, treesize of input 40 treesize of output 43 [2021-12-15 17:03:48,949 INFO L354 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2021-12-15 17:03:48,950 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 2 case distinctions, treesize of input 40 treesize of output 43 [2021-12-15 17:03:49,061 INFO L354 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2021-12-15 17:03:49,061 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 2 case distinctions, treesize of input 40 treesize of output 43 [2021-12-15 17:03:49,150 INFO L354 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2021-12-15 17:03:49,151 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 2 case distinctions, treesize of input 40 treesize of output 43 [2021-12-15 17:03:49,226 INFO L354 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2021-12-15 17:03:49,226 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 2 case distinctions, treesize of input 40 treesize of output 43 [2021-12-15 17:03:49,310 INFO L354 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2021-12-15 17:03:49,310 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 2 case distinctions, treesize of input 40 treesize of output 43 [2021-12-15 17:03:49,385 INFO L354 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2021-12-15 17:03:49,386 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 2 case distinctions, treesize of input 40 treesize of output 43 [2021-12-15 17:03:49,466 INFO L354 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2021-12-15 17:03:49,467 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 2 case distinctions, treesize of input 40 treesize of output 43 [2021-12-15 17:03:49,580 INFO L354 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2021-12-15 17:03:49,580 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 2 case distinctions, treesize of input 40 treesize of output 43 [2021-12-15 17:03:49,644 INFO L354 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2021-12-15 17:03:49,645 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 2 case distinctions, treesize of input 40 treesize of output 43 [2021-12-15 17:03:49,731 INFO L354 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2021-12-15 17:03:49,731 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 2 case distinctions, treesize of input 40 treesize of output 43 [2021-12-15 17:03:49,804 INFO L354 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2021-12-15 17:03:49,804 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 2 case distinctions, treesize of input 40 treesize of output 43 [2021-12-15 17:03:49,884 INFO L354 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2021-12-15 17:03:49,885 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 2 case distinctions, treesize of input 40 treesize of output 43 [2021-12-15 17:03:49,966 INFO L354 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2021-12-15 17:03:49,966 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 2 case distinctions, treesize of input 40 treesize of output 43 [2021-12-15 17:03:50,045 INFO L354 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2021-12-15 17:03:50,046 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 2 case distinctions, treesize of input 40 treesize of output 43 [2021-12-15 17:03:50,128 INFO L354 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2021-12-15 17:03:50,129 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 2 case distinctions, treesize of input 40 treesize of output 43 [2021-12-15 17:03:50,214 INFO L354 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2021-12-15 17:03:50,214 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 2 case distinctions, treesize of input 40 treesize of output 43 [2021-12-15 17:03:50,271 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 17:03:50,272 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 1 case distinctions, treesize of input 28 treesize of output 26 [2021-12-15 17:03:50,318 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-15 17:03:50,322 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:03:50,322 INFO L328 TraceCheckSpWp]: Computing backward predicates...