./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/ldv-regression/test27-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version ff03de63 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/ldv-regression/test27-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8b17e864f5b8145df67cb2b3dc045f82af33b1bd3c9c5e4c95275bcb385f71da --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 22:20:42,195 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 22:20:42,219 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 22:20:42,264 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 22:20:42,265 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 22:20:42,269 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 22:20:42,271 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 22:20:42,274 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 22:20:42,276 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 22:20:42,278 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 22:20:42,279 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 22:20:42,280 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 22:20:42,280 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 22:20:42,286 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 22:20:42,287 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 22:20:42,289 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 22:20:42,290 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 22:20:42,290 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 22:20:42,295 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 22:20:42,298 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 22:20:42,301 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 22:20:42,302 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 22:20:42,303 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 22:20:42,304 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 22:20:42,308 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 22:20:42,308 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 22:20:42,309 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 22:20:42,310 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 22:20:42,311 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 22:20:42,311 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 22:20:42,312 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 22:20:42,313 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 22:20:42,314 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 22:20:42,315 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 22:20:42,316 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 22:20:42,316 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 22:20:42,317 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 22:20:42,317 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 22:20:42,317 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 22:20:42,318 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 22:20:42,318 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 22:20:42,319 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-21 22:20:42,352 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 22:20:42,352 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 22:20:42,353 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 22:20:42,353 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 22:20:42,354 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 22:20:42,354 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 22:20:42,354 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 22:20:42,355 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-21 22:20:42,355 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-21 22:20:42,355 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-21 22:20:42,356 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-21 22:20:42,356 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-21 22:20:42,356 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-21 22:20:42,357 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 22:20:42,357 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 22:20:42,357 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-21 22:20:42,357 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 22:20:42,357 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 22:20:42,357 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 22:20:42,358 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-21 22:20:42,358 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-21 22:20:42,358 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-21 22:20:42,358 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 22:20:42,358 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 22:20:42,359 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-21 22:20:42,359 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 22:20:42,359 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-21 22:20:42,359 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 22:20:42,359 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 22:20:42,360 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 22:20:42,360 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 22:20:42,360 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 22:20:42,361 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-21 22:20:42,361 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8b17e864f5b8145df67cb2b3dc045f82af33b1bd3c9c5e4c95275bcb385f71da [2021-12-21 22:20:42,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 22:20:42,618 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 22:20:42,620 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 22:20:42,621 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 22:20:42,622 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 22:20:42,623 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test27-2.c [2021-12-21 22:20:42,698 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08852ee31/613f6aa31ef64841ad12c99100568722/FLAGf0cbc40d9 [2021-12-21 22:20:43,139 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 22:20:43,139 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test27-2.c [2021-12-21 22:20:43,150 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08852ee31/613f6aa31ef64841ad12c99100568722/FLAGf0cbc40d9 [2021-12-21 22:20:43,170 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08852ee31/613f6aa31ef64841ad12c99100568722 [2021-12-21 22:20:43,172 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 22:20:43,174 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 22:20:43,176 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 22:20:43,176 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 22:20:43,179 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 22:20:43,179 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:20:43" (1/1) ... [2021-12-21 22:20:43,180 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57c4ff14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:20:43, skipping insertion in model container [2021-12-21 22:20:43,180 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:20:43" (1/1) ... [2021-12-21 22:20:43,187 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 22:20:43,200 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 22:20:43,392 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test27-2.c[1224,1237] [2021-12-21 22:20:43,393 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 22:20:43,400 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 22:20:43,418 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test27-2.c[1224,1237] [2021-12-21 22:20:43,424 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 22:20:43,438 INFO L208 MainTranslator]: Completed translation [2021-12-21 22:20:43,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:20:43 WrapperNode [2021-12-21 22:20:43,438 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 22:20:43,439 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 22:20:43,440 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 22:20:43,440 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 22:20:43,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:20:43" (1/1) ... [2021-12-21 22:20:43,465 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:20:43" (1/1) ... [2021-12-21 22:20:43,486 INFO L137 Inliner]: procedures = 16, calls = 42, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 110 [2021-12-21 22:20:43,487 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 22:20:43,488 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 22:20:43,488 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 22:20:43,488 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 22:20:43,494 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:20:43" (1/1) ... [2021-12-21 22:20:43,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:20:43" (1/1) ... [2021-12-21 22:20:43,496 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:20:43" (1/1) ... [2021-12-21 22:20:43,496 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:20:43" (1/1) ... [2021-12-21 22:20:43,502 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:20:43" (1/1) ... [2021-12-21 22:20:43,505 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:20:43" (1/1) ... [2021-12-21 22:20:43,510 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:20:43" (1/1) ... [2021-12-21 22:20:43,512 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 22:20:43,513 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 22:20:43,513 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 22:20:43,514 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 22:20:43,514 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:20:43" (1/1) ... [2021-12-21 22:20:43,522 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:20:43,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:20:43,542 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-21 22:20:43,544 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-21 22:20:43,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-21 22:20:43,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 22:20:43,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 22:20:43,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-21 22:20:43,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-21 22:20:43,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-21 22:20:43,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 22:20:43,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 22:20:43,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-21 22:20:43,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 22:20:43,639 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 22:20:43,640 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 22:20:43,933 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 22:20:43,938 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 22:20:43,938 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-21 22:20:43,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:20:43 BoogieIcfgContainer [2021-12-21 22:20:43,940 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 22:20:43,941 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-21 22:20:43,941 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-21 22:20:43,944 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-21 22:20:43,945 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-21 22:20:43,945 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.12 10:20:43" (1/3) ... [2021-12-21 22:20:43,958 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a2c4514 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.12 10:20:43, skipping insertion in model container [2021-12-21 22:20:43,958 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-21 22:20:43,958 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:20:43" (2/3) ... [2021-12-21 22:20:43,958 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a2c4514 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.12 10:20:43, skipping insertion in model container [2021-12-21 22:20:43,958 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-21 22:20:43,958 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:20:43" (3/3) ... [2021-12-21 22:20:43,960 INFO L388 chiAutomizerObserver]: Analyzing ICFG test27-2.c [2021-12-21 22:20:43,991 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-21 22:20:43,992 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-21 22:20:43,992 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-21 22:20:43,992 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-21 22:20:43,992 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-21 22:20:43,992 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-21 22:20:43,992 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-21 22:20:43,992 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-21 22:20:44,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:20:44,015 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-12-21 22:20:44,016 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:20:44,016 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:20:44,021 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-21 22:20:44,021 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-21 22:20:44,021 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-21 22:20:44,022 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:20:44,023 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-12-21 22:20:44,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:20:44,024 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:20:44,024 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-21 22:20:44,024 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-21 22:20:44,037 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;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet10#1, main_#t~post9#1, main_~j~0#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~pre19#1, main_#t~mem18#1, main_#t~ret20#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~pa~0#1.base, main_~pa~0#1.offset;call main_~#cont~0#1.base, main_~#cont~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0#1.base, main_~#dummy~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0#1.base, main_~#dummies~0#1.offset := #Ultimate.allocOnStack(40);call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~i~0#1;havoc main_~pa~0#1.base, main_~pa~0#1.offset;main_~i~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~j~0#1 := 0; 15#L29-3true [2021-12-21 22:20:44,037 INFO L793 eck$LassoCheckResult]: Loop: 15#L29-3true assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 17#L29-2true main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15#L29-3true [2021-12-21 22:20:44,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:20:44,043 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-21 22:20:44,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:20:44,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101802827] [2021-12-21 22:20:44,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:20:44,053 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:20:44,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:20:44,191 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:20:44,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:20:44,245 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:20:44,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:20:44,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2021-12-21 22:20:44,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:20:44,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882215610] [2021-12-21 22:20:44,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:20:44,251 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:20:44,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:20:44,293 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:20:44,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:20:44,307 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:20:44,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:20:44,309 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2021-12-21 22:20:44,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:20:44,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636826042] [2021-12-21 22:20:44,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:20:44,311 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:20:44,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:20:44,369 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:20:44,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:20:44,402 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:20:45,293 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 22:20:45,294 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 22:20:45,294 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 22:20:45,294 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 22:20:45,294 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-21 22:20:45,295 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:20:45,295 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 22:20:45,295 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 22:20:45,295 INFO L133 ssoRankerPreferences]: Filename of dumped script: test27-2.c_Iteration1_Lasso [2021-12-21 22:20:45,296 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 22:20:45,296 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 22:20:45,315 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-21 22:20:45,321 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-21 22:20:45,323 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-21 22:20:45,325 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-21 22:20:45,786 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-21 22:20:45,789 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-21 22:20:45,795 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-21 22:20:45,798 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-21 22:20:45,803 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-21 22:20:45,805 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-21 22:20:45,808 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-21 22:20:45,810 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-21 22:20:45,812 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-21 22:20:45,815 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-21 22:20:45,818 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-21 22:20:45,820 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-21 22:20:45,823 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-21 22:20:45,825 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-21 22:20:45,827 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-21 22:20:45,830 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-21 22:20:45,832 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-21 22:20:45,834 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-21 22:20:45,836 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-21 22:20:45,839 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-21 22:20:45,843 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-21 22:20:45,845 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-21 22:20:46,191 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 22:20:46,195 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-21 22:20:46,196 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:20:46,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:20:46,199 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-21 22:20:46,212 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-21 22:20:46,213 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-21 22:20:46,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:20:46,221 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:20:46,221 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:20:46,221 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:20:46,225 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:20:46,225 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 22:20:46,240 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:20:46,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-12-21 22:20:46,267 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:20:46,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:20:46,269 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-21 22:20:46,274 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-21 22:20:46,275 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-21 22:20:46,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:20:46,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:20:46,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:20:46,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:20:46,287 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:20:46,288 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 22:20:46,307 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:20:46,330 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-21 22:20:46,331 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:20:46,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:20:46,333 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-21 22:20:46,335 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-21 22:20:46,336 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-21 22:20:46,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:20:46,344 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:20:46,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:20:46,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:20:46,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:20:46,346 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:20:46,346 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:20:46,352 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:20:46,373 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-21 22:20:46,374 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:20:46,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:20:46,375 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-21 22:20:46,375 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-21 22:20:46,378 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-21 22:20:46,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:20:46,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:20:46,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:20:46,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:20:46,392 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:20:46,392 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 22:20:46,404 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-21 22:20:46,439 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2021-12-21 22:20:46,439 INFO L444 ModelExtractionUtils]: 0 out of 19 variables were initially zero. Simplification set additionally 16 variables to zero. [2021-12-21 22:20:46,441 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:20:46,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:20:46,443 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-21 22:20:46,463 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-21 22:20:46,477 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-21 22:20:46,514 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-21 22:20:46,515 INFO L513 LassoAnalysis]: Proved termination. [2021-12-21 22:20:46,515 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1, v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1) = -8*ULTIMATE.start_main_~j~0#1 + 19*v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1 Supporting invariants [] [2021-12-21 22:20:46,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-12-21 22:20:46,653 INFO L297 tatePredicateManager]: 26 out of 26 supporting invariants were superfluous and have been removed [2021-12-21 22:20:46,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:20:46,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:20:46,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 22:20:46,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:20:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:20:46,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 22:20:46,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:20:46,757 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-21 22:20:46,789 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-21 22:20:46,791 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:20:46,875 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 39 states and 56 transitions. Complement of second has 8 states. [2021-12-21 22:20:46,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-21 22:20:46,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:20:46,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2021-12-21 22:20:46,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 2 letters. Loop has 2 letters. [2021-12-21 22:20:46,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 22:20:46,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 4 letters. Loop has 2 letters. [2021-12-21 22:20:46,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 22:20:46,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 2 letters. Loop has 4 letters. [2021-12-21 22:20:46,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 22:20:46,888 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 56 transitions. [2021-12-21 22:20:46,891 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 22:20:46,894 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 9 states and 11 transitions. [2021-12-21 22:20:46,895 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2021-12-21 22:20:46,895 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2021-12-21 22:20:46,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2021-12-21 22:20:46,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:20:46,896 INFO L681 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2021-12-21 22:20:46,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2021-12-21 22:20:46,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2021-12-21 22:20:46,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:20:46,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2021-12-21 22:20:46,943 INFO L704 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2021-12-21 22:20:46,943 INFO L587 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2021-12-21 22:20:46,943 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-21 22:20:46,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2021-12-21 22:20:46,943 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-21 22:20:46,943 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 22:20:46,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:20:46,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:20:46,945 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-12-21 22:20:46,945 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-21 22:20:46,945 INFO L791 eck$LassoCheckResult]: Stem: 199#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 200#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet10#1, main_#t~post9#1, main_~j~0#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~pre19#1, main_#t~mem18#1, main_#t~ret20#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~pa~0#1.base, main_~pa~0#1.offset;call main_~#cont~0#1.base, main_~#cont~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0#1.base, main_~#dummy~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0#1.base, main_~#dummies~0#1.offset := #Ultimate.allocOnStack(40);call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~i~0#1;havoc main_~pa~0#1.base, main_~pa~0#1.offset;main_~i~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~j~0#1 := 0; 201#L29-3 assume !(main_~j~0#1 < 10); 202#L29-4 assume main_~i~0#1 >= 0 && main_~i~0#1 < 9;call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, main_~#dummy~0#1.base, main_~#dummy~0#1.offset, 4);call write~$Pointer$(main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * (1 + main_~i~0#1), 4);call write~$Pointer$(main_~#dummies~0#1.base, main_~#dummies~0#1.offset, main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_#t~mem11#1.base, main_#t~mem11#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_#t~mem12#1.base, main_#t~mem12#1.offset, 4);main_~pa~0#1.base, main_~pa~0#1.offset := main_#t~mem13#1.base, main_#t~mem13#1.offset + 4 * main_~i~0#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset;call main_#t~mem14#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 205#L42 assume main_#t~mem14#1 > 0;havoc main_#t~mem14#1;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * (1 + main_~i~0#1), 4);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_#t~mem15#1.base, main_#t~mem15#1.offset, 4);call main_#t~mem17#1 := read~int(main_#t~mem16#1.base, main_#t~mem16#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := main_#t~mem17#1 - 10;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem17#1; 206#L44-3 [2021-12-21 22:20:46,945 INFO L793 eck$LassoCheckResult]: Loop: 206#L44-3 call main_#t~mem18#1 := read~int(main_~pa~0#1.base, main_~pa~0#1.offset, 4); 207#L44-1 assume !!(main_~i~0#1 < main_#t~mem18#1);havoc main_#t~mem18#1;main_#t~pre19#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre19#1; 206#L44-3 [2021-12-21 22:20:46,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:20:46,946 INFO L85 PathProgramCache]: Analyzing trace with hash 28697000, now seen corresponding path program 1 times [2021-12-21 22:20:46,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:20:46,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411061421] [2021-12-21 22:20:46,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:20:46,947 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:20:46,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:20:47,027 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-21 22:20:47,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:20:47,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411061421] [2021-12-21 22:20:47,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411061421] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:20:47,029 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:20:47,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 22:20:47,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991025989] [2021-12-21 22:20:47,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:20:47,035 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:20:47,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:20:47,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 1 times [2021-12-21 22:20:47,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:20:47,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105964335] [2021-12-21 22:20:47,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:20:47,037 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:20:47,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:20:47,045 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:20:47,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:20:47,057 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:20:47,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:20:47,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 22:20:47,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 22:20:47,086 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:20:47,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:20:47,096 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2021-12-21 22:20:47,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 22:20:47,097 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2021-12-21 22:20:47,098 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 22:20:47,099 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 11 transitions. [2021-12-21 22:20:47,100 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2021-12-21 22:20:47,100 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2021-12-21 22:20:47,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2021-12-21 22:20:47,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:20:47,100 INFO L681 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2021-12-21 22:20:47,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2021-12-21 22:20:47,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2021-12-21 22:20:47,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:20:47,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2021-12-21 22:20:47,103 INFO L704 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2021-12-21 22:20:47,103 INFO L587 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2021-12-21 22:20:47,103 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-21 22:20:47,103 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2021-12-21 22:20:47,104 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 22:20:47,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:20:47,104 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:20:47,104 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:20:47,104 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-21 22:20:47,104 INFO L791 eck$LassoCheckResult]: Stem: 224#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 225#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet10#1, main_#t~post9#1, main_~j~0#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~pre19#1, main_#t~mem18#1, main_#t~ret20#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~pa~0#1.base, main_~pa~0#1.offset;call main_~#cont~0#1.base, main_~#cont~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0#1.base, main_~#dummy~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0#1.base, main_~#dummies~0#1.offset := #Ultimate.allocOnStack(40);call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~i~0#1;havoc main_~pa~0#1.base, main_~pa~0#1.offset;main_~i~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~j~0#1 := 0; 226#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 227#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 228#L29-3 assume !(main_~j~0#1 < 10); 229#L29-4 assume main_~i~0#1 >= 0 && main_~i~0#1 < 9;call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, main_~#dummy~0#1.base, main_~#dummy~0#1.offset, 4);call write~$Pointer$(main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * (1 + main_~i~0#1), 4);call write~$Pointer$(main_~#dummies~0#1.base, main_~#dummies~0#1.offset, main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_#t~mem11#1.base, main_#t~mem11#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_#t~mem12#1.base, main_#t~mem12#1.offset, 4);main_~pa~0#1.base, main_~pa~0#1.offset := main_#t~mem13#1.base, main_#t~mem13#1.offset + 4 * main_~i~0#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset;call main_#t~mem14#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 230#L42 assume main_#t~mem14#1 > 0;havoc main_#t~mem14#1;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * (1 + main_~i~0#1), 4);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_#t~mem15#1.base, main_#t~mem15#1.offset, 4);call main_#t~mem17#1 := read~int(main_#t~mem16#1.base, main_#t~mem16#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := main_#t~mem17#1 - 10;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem17#1; 231#L44-3 [2021-12-21 22:20:47,104 INFO L793 eck$LassoCheckResult]: Loop: 231#L44-3 call main_#t~mem18#1 := read~int(main_~pa~0#1.base, main_~pa~0#1.offset, 4); 232#L44-1 assume !!(main_~i~0#1 < main_#t~mem18#1);havoc main_#t~mem18#1;main_#t~pre19#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre19#1; 231#L44-3 [2021-12-21 22:20:47,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:20:47,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1809669606, now seen corresponding path program 1 times [2021-12-21 22:20:47,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:20:47,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135691338] [2021-12-21 22:20:47,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:20:47,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:20:47,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:20:47,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:20:47,178 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:20:47,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135691338] [2021-12-21 22:20:47,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135691338] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 22:20:47,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621068231] [2021-12-21 22:20:47,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:20:47,179 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 22:20:47,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:20:47,184 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 22:20:47,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-21 22:20:47,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:20:47,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-21 22:20:47,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:20:47,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:20:47,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 22:20:47,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:20:47,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621068231] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 22:20:47,320 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 22:20:47,321 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-12-21 22:20:47,321 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168293213] [2021-12-21 22:20:47,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 22:20:47,321 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:20:47,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:20:47,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 2 times [2021-12-21 22:20:47,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:20:47,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365452718] [2021-12-21 22:20:47,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:20:47,322 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:20:47,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:20:47,326 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:20:47,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:20:47,329 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:20:47,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:20:47,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 22:20:47,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-12-21 22:20:47,355 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 3 Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:20:47,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:20:47,382 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2021-12-21 22:20:47,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 22:20:47,383 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 16 transitions. [2021-12-21 22:20:47,383 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 22:20:47,384 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 16 transitions. [2021-12-21 22:20:47,384 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2021-12-21 22:20:47,384 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2021-12-21 22:20:47,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 16 transitions. [2021-12-21 22:20:47,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:20:47,384 INFO L681 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2021-12-21 22:20:47,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 16 transitions. [2021-12-21 22:20:47,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-12-21 22:20:47,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:20:47,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2021-12-21 22:20:47,386 INFO L704 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2021-12-21 22:20:47,386 INFO L587 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2021-12-21 22:20:47,386 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-21 22:20:47,386 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2021-12-21 22:20:47,386 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 22:20:47,386 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:20:47,386 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:20:47,387 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1] [2021-12-21 22:20:47,387 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-21 22:20:47,387 INFO L791 eck$LassoCheckResult]: Stem: 298#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 299#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet10#1, main_#t~post9#1, main_~j~0#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~pre19#1, main_#t~mem18#1, main_#t~ret20#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~pa~0#1.base, main_~pa~0#1.offset;call main_~#cont~0#1.base, main_~#cont~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0#1.base, main_~#dummy~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0#1.base, main_~#dummies~0#1.offset := #Ultimate.allocOnStack(40);call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~i~0#1;havoc main_~pa~0#1.base, main_~pa~0#1.offset;main_~i~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~j~0#1 := 0; 294#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 295#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 296#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 297#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 304#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 308#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 307#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 306#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 305#L29-3 assume !(main_~j~0#1 < 10); 300#L29-4 assume main_~i~0#1 >= 0 && main_~i~0#1 < 9;call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, main_~#dummy~0#1.base, main_~#dummy~0#1.offset, 4);call write~$Pointer$(main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * (1 + main_~i~0#1), 4);call write~$Pointer$(main_~#dummies~0#1.base, main_~#dummies~0#1.offset, main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_#t~mem11#1.base, main_#t~mem11#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_#t~mem12#1.base, main_#t~mem12#1.offset, 4);main_~pa~0#1.base, main_~pa~0#1.offset := main_#t~mem13#1.base, main_#t~mem13#1.offset + 4 * main_~i~0#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset;call main_#t~mem14#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 301#L42 assume main_#t~mem14#1 > 0;havoc main_#t~mem14#1;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * (1 + main_~i~0#1), 4);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_#t~mem15#1.base, main_#t~mem15#1.offset, 4);call main_#t~mem17#1 := read~int(main_#t~mem16#1.base, main_#t~mem16#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := main_#t~mem17#1 - 10;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem17#1; 302#L44-3 [2021-12-21 22:20:47,387 INFO L793 eck$LassoCheckResult]: Loop: 302#L44-3 call main_#t~mem18#1 := read~int(main_~pa~0#1.base, main_~pa~0#1.offset, 4); 303#L44-1 assume !!(main_~i~0#1 < main_#t~mem18#1);havoc main_#t~mem18#1;main_#t~pre19#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre19#1; 302#L44-3 [2021-12-21 22:20:47,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:20:47,388 INFO L85 PathProgramCache]: Analyzing trace with hash 82232736, now seen corresponding path program 2 times [2021-12-21 22:20:47,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:20:47,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673438352] [2021-12-21 22:20:47,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:20:47,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:20:47,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:20:47,458 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:20:47,458 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:20:47,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673438352] [2021-12-21 22:20:47,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673438352] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 22:20:47,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524407997] [2021-12-21 22:20:47,458 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 22:20:47,459 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 22:20:47,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:20:47,460 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 22:20:47,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-21 22:20:47,688 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 22:20:47,688 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 22:20:47,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 22:20:47,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:20:47,730 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:20:47,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 22:20:47,818 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:20:47,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524407997] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 22:20:47,818 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 22:20:47,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2021-12-21 22:20:47,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469170941] [2021-12-21 22:20:47,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 22:20:47,821 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:20:47,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:20:47,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 3 times [2021-12-21 22:20:47,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:20:47,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329116502] [2021-12-21 22:20:47,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:20:47,822 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:20:47,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:20:47,827 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:20:47,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:20:47,830 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:20:47,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:20:47,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-21 22:20:47,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-12-21 22:20:47,860 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:20:47,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:20:47,916 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2021-12-21 22:20:47,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-21 22:20:47,917 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 28 transitions. [2021-12-21 22:20:47,919 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 22:20:47,919 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 28 transitions. [2021-12-21 22:20:47,919 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2021-12-21 22:20:47,919 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2021-12-21 22:20:47,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 28 transitions. [2021-12-21 22:20:47,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:20:47,920 INFO L681 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2021-12-21 22:20:47,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 28 transitions. [2021-12-21 22:20:47,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-12-21 22:20:47,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.037037037037037) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:20:47,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2021-12-21 22:20:47,922 INFO L704 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2021-12-21 22:20:47,922 INFO L587 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2021-12-21 22:20:47,922 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-21 22:20:47,922 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 28 transitions. [2021-12-21 22:20:47,922 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 22:20:47,923 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:20:47,923 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:20:47,923 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1] [2021-12-21 22:20:47,923 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-21 22:20:47,924 INFO L791 eck$LassoCheckResult]: Stem: 424#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 425#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet10#1, main_#t~post9#1, main_~j~0#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~pre19#1, main_#t~mem18#1, main_#t~ret20#1, main_~#cont~0#1.base, main_~#cont~0#1.offset, main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset, main_~i~0#1, main_~pa~0#1.base, main_~pa~0#1.offset;call main_~#cont~0#1.base, main_~#cont~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummy~0#1.base, main_~#dummy~0#1.offset := #Ultimate.allocOnStack(4);call main_~#dummies~0#1.base, main_~#dummies~0#1.offset := #Ultimate.allocOnStack(40);call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~i~0#1;havoc main_~pa~0#1.base, main_~pa~0#1.offset;main_~i~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~j~0#1 := 0; 426#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 427#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 428#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 429#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 434#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 450#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 449#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 448#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 447#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 446#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 445#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 444#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 443#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 442#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 441#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 440#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 439#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 438#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 437#L29-3 assume !!(main_~j~0#1 < 10);call write~int(main_#t~nondet10#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet10#1;call write~$Pointer$(0, 0, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * main_~j~0#1, 4); 436#L29-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 435#L29-3 assume !(main_~j~0#1 < 10); 430#L29-4 assume main_~i~0#1 >= 0 && main_~i~0#1 < 9;call write~int(main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~$Pointer$(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, main_~#dummy~0#1.base, main_~#dummy~0#1.offset, 4);call write~$Pointer$(main_~#dummy~0#1.base, main_~#dummy~0#1.offset, main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * (1 + main_~i~0#1), 4);call write~$Pointer$(main_~#dummies~0#1.base, main_~#dummies~0#1.offset, main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#cont~0#1.base, main_~#cont~0#1.offset, 4);call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_#t~mem11#1.base, main_#t~mem11#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_#t~mem12#1.base, main_#t~mem12#1.offset, 4);main_~pa~0#1.base, main_~pa~0#1.offset := main_#t~mem13#1.base, main_#t~mem13#1.offset + 4 * main_~i~0#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset;call main_#t~mem14#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 431#L42 assume main_#t~mem14#1 > 0;havoc main_#t~mem14#1;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~#dummies~0#1.base, main_~#dummies~0#1.offset + 4 * (1 + main_~i~0#1), 4);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_#t~mem15#1.base, main_#t~mem15#1.offset, 4);call main_#t~mem17#1 := read~int(main_#t~mem16#1.base, main_#t~mem16#1.offset + 4 * main_~i~0#1, 4);main_~i~0#1 := main_#t~mem17#1 - 10;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem17#1; 432#L44-3 [2021-12-21 22:20:47,924 INFO L793 eck$LassoCheckResult]: Loop: 432#L44-3 call main_#t~mem18#1 := read~int(main_~pa~0#1.base, main_~pa~0#1.offset, 4); 433#L44-1 assume !!(main_~i~0#1 < main_#t~mem18#1);havoc main_#t~mem18#1;main_#t~pre19#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre19#1; 432#L44-3 [2021-12-21 22:20:47,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:20:47,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1520933524, now seen corresponding path program 3 times [2021-12-21 22:20:47,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:20:47,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133451733] [2021-12-21 22:20:47,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:20:47,925 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:20:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:20:50,908 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 12 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:20:50,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:20:50,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133451733] [2021-12-21 22:20:50,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133451733] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 22:20:50,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970447964] [2021-12-21 22:20:50,910 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-21 22:20:50,910 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 22:20:50,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:20:50,940 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 22:20:50,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-21 22:21:10,063 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2021-12-21 22:21:10,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 22:21:10,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 122 conjunts are in the unsatisfiable core [2021-12-21 22:21:10,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:21:10,183 INFO L353 Elim1Store]: treesize reduction 117, result has 12.0 percent of original size [2021-12-21 22:21:10,184 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 60 treesize of output 62 [2021-12-21 22:21:10,233 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2021-12-21 22:21:10,470 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-21 22:21:10,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:10,783 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2021-12-21 22:21:10,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:10,791 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 24 [2021-12-21 22:21:11,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:11,067 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2021-12-21 22:21:11,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:11,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:11,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:11,073 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 36 [2021-12-21 22:21:11,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:11,300 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2021-12-21 22:21:11,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:11,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:11,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:11,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:11,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:11,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:11,309 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2021-12-21 22:21:11,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:11,501 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 46 [2021-12-21 22:21:11,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:11,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:11,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:11,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:11,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:11,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:11,541 INFO L353 Elim1Store]: treesize reduction 96, result has 38.9 percent of original size [2021-12-21 22:21:11,541 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 84 [2021-12-21 22:21:11,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:11,985 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 110 [2021-12-21 22:21:11,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:11,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:11,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:11,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:11,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:11,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:12,031 INFO L353 Elim1Store]: treesize reduction 96, result has 38.9 percent of original size [2021-12-21 22:21:12,031 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 105 treesize of output 124 [2021-12-21 22:21:13,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:13,154 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 149 [2021-12-21 22:21:13,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:13,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:13,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:13,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:13,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:13,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:13,204 INFO L353 Elim1Store]: treesize reduction 96, result has 38.9 percent of original size [2021-12-21 22:21:13,205 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 144 treesize of output 147 [2021-12-21 22:21:14,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:14,362 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 122 [2021-12-21 22:21:14,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:14,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:14,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:14,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:14,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:14,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:14,406 INFO L353 Elim1Store]: treesize reduction 96, result has 38.9 percent of original size [2021-12-21 22:21:14,407 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 117 treesize of output 132 [2021-12-21 22:21:15,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:15,137 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 150 [2021-12-21 22:21:15,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:15,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:15,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:15,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:15,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:15,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:15,183 INFO L353 Elim1Store]: treesize reduction 96, result has 38.9 percent of original size [2021-12-21 22:21:15,184 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 145 treesize of output 160 [2021-12-21 22:21:16,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:16,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:16,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:16,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:16,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:16,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:16,034 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 63 [2021-12-21 22:21:16,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:16,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:16,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:16,051 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 41 [2021-12-21 22:21:16,064 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2021-12-21 22:21:16,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:16,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:16,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:16,077 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-21 22:21:16,088 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 41 [2021-12-21 22:21:16,116 INFO L353 Elim1Store]: treesize reduction 32, result has 43.9 percent of original size [2021-12-21 22:21:16,116 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 34 [2021-12-21 22:21:16,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:16,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:16,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:16,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:16,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:16,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 22:21:16,176 INFO L353 Elim1Store]: treesize reduction 122, result has 26.1 percent of original size [2021-12-21 22:21:16,177 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 67 [2021-12-21 22:21:16,189 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 47 [2021-12-21 22:21:16,207 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2021-12-21 22:21:16,217 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-12-21 22:21:16,225 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2021-12-21 22:21:16,232 INFO L387 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-21 22:21:16,239 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2021-12-21 22:21:16,408 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:21:16,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 22:21:16,658 INFO L353 Elim1Store]: treesize reduction 42, result has 55.3 percent of original size [2021-12-21 22:21:16,659 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 2442 treesize of output 2170 [2021-12-21 22:21:16,692 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 22:21:16,692 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 2118 treesize of output 2034 [2021-12-21 22:21:16,817 INFO L353 Elim1Store]: treesize reduction 75, result has 66.8 percent of original size [2021-12-21 22:21:16,818 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 20958 treesize of output 19882 [2021-12-21 22:21:17,021 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 22:21:17,022 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 19714 treesize of output 19581 [2021-12-21 22:21:17,204 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 22:21:17,204 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 25149 treesize of output 24762 [2021-12-21 22:21:17,459 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 22:21:17,460 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 30346 treesize of output 29952 [2021-12-21 22:21:17,711 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 22:21:17,712 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2021-12-21 22:21:17,858 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1234 treesize of output 1162 [2021-12-21 22:21:18,083 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1158 treesize of output 966 [2021-12-21 22:21:18,230 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 966 treesize of output 870 [2021-12-21 22:21:18,385 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 459 treesize of output 411 [2021-12-21 22:21:22,787 WARN L234 Elim1Store]: Array PQE input equivalent to true [2021-12-21 22:21:22,796 WARN L234 Elim1Store]: Array PQE input equivalent to true [2021-12-21 22:21:22,829 WARN L234 Elim1Store]: Array PQE input equivalent to true [2021-12-21 22:21:22,879 WARN L234 Elim1Store]: Array PQE input equivalent to true [2021-12-21 22:21:22,903 INFO L387 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 126 treesize of output 124 [2021-12-21 22:21:22,987 WARN L234 Elim1Store]: Array PQE input equivalent to true [2021-12-21 22:21:23,015 INFO L387 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 126 treesize of output 124