./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ace4aef293e19a259ba259e8c5434d0ef43394b5 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 14:23:16,834 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 14:23:16,836 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 14:23:16,861 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 14:23:16,861 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 14:23:16,862 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 14:23:16,863 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 14:23:16,865 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 14:23:16,866 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 14:23:16,867 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 14:23:16,868 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 14:23:16,869 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 14:23:16,869 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 14:23:16,870 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 14:23:16,871 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 14:23:16,872 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 14:23:16,873 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 14:23:16,874 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 14:23:16,875 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 14:23:16,877 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 14:23:16,878 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 14:23:16,884 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 14:23:16,885 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 14:23:16,886 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 14:23:16,888 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 14:23:16,895 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 14:23:16,895 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 14:23:16,896 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 14:23:16,897 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 14:23:16,898 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 14:23:16,898 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 14:23:16,899 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 14:23:16,899 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 14:23:16,900 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 14:23:16,901 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 14:23:16,901 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 14:23:16,902 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 14:23:16,902 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 14:23:16,903 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 14:23:16,903 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 14:23:16,904 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 14:23:16,909 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-08-27 14:23:16,941 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 14:23:16,942 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 14:23:16,943 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 14:23:16,943 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 14:23:16,944 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 14:23:16,944 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 14:23:16,945 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 14:23:16,945 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-27 14:23:16,945 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-27 14:23:16,945 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-27 14:23:16,946 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-27 14:23:16,946 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-27 14:23:16,946 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-27 14:23:16,946 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 14:23:16,946 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 14:23:16,946 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 14:23:16,947 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 14:23:16,947 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-27 14:23:16,947 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-27 14:23:16,947 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-27 14:23:16,947 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 14:23:16,947 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-27 14:23:16,947 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 14:23:16,947 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-27 14:23:16,948 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 14:23:16,948 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 14:23:16,948 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 14:23:16,948 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 14:23:16,948 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 14:23:16,949 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-27 14:23:16,950 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ace4aef293e19a259ba259e8c5434d0ef43394b5 [2021-08-27 14:23:17,253 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 14:23:17,277 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 14:23:17,280 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 14:23:17,281 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 14:23:17,283 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 14:23:17,284 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca.i [2021-08-27 14:23:17,341 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f50131c1/9072a027d219409da15067278278ca19/FLAG7c397beeb [2021-08-27 14:23:17,798 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 14:23:17,798 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca.i [2021-08-27 14:23:17,817 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f50131c1/9072a027d219409da15067278278ca19/FLAG7c397beeb [2021-08-27 14:23:17,831 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f50131c1/9072a027d219409da15067278278ca19 [2021-08-27 14:23:17,833 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 14:23:17,834 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 14:23:17,836 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 14:23:17,836 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 14:23:17,840 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 14:23:17,841 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 02:23:17" (1/1) ... [2021-08-27 14:23:17,841 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f11344c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:23:17, skipping insertion in model container [2021-08-27 14:23:17,842 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 02:23:17" (1/1) ... [2021-08-27 14:23:17,847 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 14:23:17,887 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 14:23:18,174 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 14:23:18,208 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 14:23:18,273 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 14:23:18,293 INFO L208 MainTranslator]: Completed translation [2021-08-27 14:23:18,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:23:18 WrapperNode [2021-08-27 14:23:18,294 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 14:23:18,295 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 14:23:18,295 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 14:23:18,295 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 14:23:18,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:23:18" (1/1) ... [2021-08-27 14:23:18,323 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:23:18" (1/1) ... [2021-08-27 14:23:18,341 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 14:23:18,341 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 14:23:18,342 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 14:23:18,342 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 14:23:18,350 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:23:18" (1/1) ... [2021-08-27 14:23:18,351 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:23:18" (1/1) ... [2021-08-27 14:23:18,364 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:23:18" (1/1) ... [2021-08-27 14:23:18,365 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:23:18" (1/1) ... [2021-08-27 14:23:18,368 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:23:18" (1/1) ... [2021-08-27 14:23:18,370 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:23:18" (1/1) ... [2021-08-27 14:23:18,377 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:23:18" (1/1) ... [2021-08-27 14:23:18,382 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 14:23:18,383 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 14:23:18,383 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 14:23:18,383 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 14:23:18,384 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:23:18" (1/1) ... [2021-08-27 14:23:18,392 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:23:18,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:23:18,410 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-08-27 14:23:18,440 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-08-27 14:23:18,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 14:23:18,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 14:23:18,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 14:23:18,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 14:23:18,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 14:23:18,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 14:23:18,746 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 14:23:18,746 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-08-27 14:23:18,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:23:18 BoogieIcfgContainer [2021-08-27 14:23:18,748 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 14:23:18,749 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-27 14:23:18,749 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-27 14:23:18,752 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-27 14:23:18,752 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 14:23:18,752 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.08 02:23:17" (1/3) ... [2021-08-27 14:23:18,753 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@366b79af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 02:23:18, skipping insertion in model container [2021-08-27 14:23:18,753 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 14:23:18,753 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:23:18" (2/3) ... [2021-08-27 14:23:18,754 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@366b79af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 02:23:18, skipping insertion in model container [2021-08-27 14:23:18,754 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 14:23:18,754 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:23:18" (3/3) ... [2021-08-27 14:23:18,755 INFO L389 chiAutomizerObserver]: Analyzing ICFG java_Continue1-alloca.i [2021-08-27 14:23:18,794 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-27 14:23:18,794 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-27 14:23:18,794 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-27 14:23:18,794 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-27 14:23:18,794 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-27 14:23:18,794 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-27 14:23:18,794 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-27 14:23:18,795 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-27 14:23:18,822 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:23:18,835 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-08-27 14:23:18,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:23:18,839 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:23:18,844 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:23:18,844 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 14:23:18,845 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-27 14:23:18,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:23:18,847 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-08-27 14:23:18,848 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:23:18,848 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:23:18,848 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:23:18,848 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 14:23:18,854 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 9#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 5#L552-3true [2021-08-27 14:23:18,855 INFO L793 eck$LassoCheckResult]: Loop: 5#L552-3true goto; 8#L554-1true call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 10#L552-1true assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 11#L554true assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem8;havoc main_#t~post9; 5#L552-3true [2021-08-27 14:23:18,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:18,866 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-08-27 14:23:18,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:18,874 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436274744] [2021-08-27 14:23:18,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:18,875 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:18,977 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:23:18,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:19,007 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:23:19,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:19,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1109383, now seen corresponding path program 1 times [2021-08-27 14:23:19,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:19,010 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872479656] [2021-08-27 14:23:19,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:19,010 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:19,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:19,021 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:23:19,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:19,031 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:23:19,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:19,033 INFO L82 PathProgramCache]: Analyzing trace with hash 889536585, now seen corresponding path program 1 times [2021-08-27 14:23:19,033 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:19,033 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370104899] [2021-08-27 14:23:19,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:19,034 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:19,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:23:19,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:23:19,187 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:23:19,187 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370104899] [2021-08-27 14:23:19,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370104899] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:23:19,188 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:23:19,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 14:23:19,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418085212] [2021-08-27 14:23:19,350 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:23:19,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 14:23:19,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-27 14:23:19,363 INFO L87 Difference]: Start difference. First operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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-08-27 14:23:19,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:23:19,397 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2021-08-27 14:23:19,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 14:23:19,399 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 15 transitions. [2021-08-27 14:23:19,400 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-08-27 14:23:19,403 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 11 transitions. [2021-08-27 14:23:19,404 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-08-27 14:23:19,404 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-08-27 14:23:19,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2021-08-27 14:23:19,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:23:19,405 INFO L681 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2021-08-27 14:23:19,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2021-08-27 14:23:19,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2021-08-27 14:23:19,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:23:19,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2021-08-27 14:23:19,425 INFO L704 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2021-08-27 14:23:19,425 INFO L587 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2021-08-27 14:23:19,425 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-27 14:23:19,425 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2021-08-27 14:23:19,426 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-08-27 14:23:19,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:23:19,426 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:23:19,426 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-08-27 14:23:19,426 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 14:23:19,427 INFO L791 eck$LassoCheckResult]: Stem: 39#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 40#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 37#L552-3 goto; 38#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 41#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 42#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 43#L554-1 [2021-08-27 14:23:19,427 INFO L793 eck$LassoCheckResult]: Loop: 43#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 46#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 44#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 43#L554-1 [2021-08-27 14:23:19,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:19,427 INFO L82 PathProgramCache]: Analyzing trace with hash 889536583, now seen corresponding path program 1 times [2021-08-27 14:23:19,427 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:19,428 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584160421] [2021-08-27 14:23:19,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:19,428 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:19,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:19,442 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:23:19,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:19,460 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:23:19,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:19,464 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2021-08-27 14:23:19,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:19,466 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429337954] [2021-08-27 14:23:19,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:19,468 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:19,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:19,489 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:23:19,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:19,495 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:23:19,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:19,496 INFO L82 PathProgramCache]: Analyzing trace with hash 236134947, now seen corresponding path program 2 times [2021-08-27 14:23:19,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:19,496 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788825806] [2021-08-27 14:23:19,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:19,496 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:19,525 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:23:19,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:19,563 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:23:20,248 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 14:23:20,249 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 14:23:20,249 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 14:23:20,249 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 14:23:20,249 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 14:23:20,249 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:23:20,249 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 14:23:20,249 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 14:23:20,250 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_Continue1-alloca.i_Iteration2_Lasso [2021-08-27 14:23:20,250 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 14:23:20,250 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 14:23:20,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:23:20,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:23:20,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:23:20,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:23:20,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:23:20,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:23:20,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:23:20,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:23:20,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:23:20,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:23:20,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:23:20,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:23:20,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:23:20,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:23:20,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:23:20,822 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 14:23:20,828 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 14:23:20,829 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:23:20,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:23:20,831 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-08-27 14:23:20,840 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-08-27 14:23:20,841 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-08-27 14:23:20,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:23:20,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:23:20,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:23:20,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:23:20,854 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:23:20,854 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:23:20,866 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:23:20,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2021-08-27 14:23:20,887 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:23:20,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:23:20,893 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-08-27 14:23:20,894 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-08-27 14:23:20,895 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-08-27 14:23:20,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:23:20,901 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:23:20,901 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:23:20,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:23:20,919 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:23:20,919 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:23:20,936 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:23:20,962 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-08-27 14:23:20,963 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:23:20,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:23:20,969 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-08-27 14:23:20,975 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-08-27 14:23:20,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:23:20,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:23:20,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:23:20,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:23:20,985 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-08-27 14:23:20,989 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:23:20,989 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:23:20,997 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 14:23:21,033 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2021-08-27 14:23:21,034 INFO L444 ModelExtractionUtils]: 0 out of 7 variables were initially zero. Simplification set additionally 4 variables to zero. [2021-08-27 14:23:21,035 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:23:21,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:23:21,036 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-08-27 14:23:21,038 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-08-27 14:23:21,041 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 14:23:21,066 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-27 14:23:21,066 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 14:23:21,067 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_1 + 19 Supporting invariants [] [2021-08-27 14:23:21,093 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-08-27 14:23:21,150 INFO L297 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2021-08-27 14:23:21,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:21,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:23:21,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 14:23:21,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:23:21,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:23:21,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 14:23:21,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:23:21,282 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2021-08-27 14:23:21,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:23:21,299 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-08-27 14:23:21,299 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:23:21,336 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 11 transitions. cyclomatic complexity: 2. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 17 states and 20 transitions. Complement of second has 6 states. [2021-08-27 14:23:21,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-08-27 14:23:21,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:23:21,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2021-08-27 14:23:21,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 6 letters. Loop has 3 letters. [2021-08-27 14:23:21,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:23:21,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. [2021-08-27 14:23:21,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:23:21,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 6 letters. Loop has 6 letters. [2021-08-27 14:23:21,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:23:21,340 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2021-08-27 14:23:21,341 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-08-27 14:23:21,341 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 20 transitions. [2021-08-27 14:23:21,342 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-08-27 14:23:21,342 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2021-08-27 14:23:21,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2021-08-27 14:23:21,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:23:21,342 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2021-08-27 14:23:21,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2021-08-27 14:23:21,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2021-08-27 14:23:21,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:23:21,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2021-08-27 14:23:21,344 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2021-08-27 14:23:21,344 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2021-08-27 14:23:21,344 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-27 14:23:21,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2021-08-27 14:23:21,345 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-08-27 14:23:21,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:23:21,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:23:21,346 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2021-08-27 14:23:21,346 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 14:23:21,346 INFO L791 eck$LassoCheckResult]: Stem: 158#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 159#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 162#L552-3 goto; 169#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 168#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 167#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 166#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 160#L552-1 [2021-08-27 14:23:21,346 INFO L793 eck$LassoCheckResult]: Loop: 160#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 163#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem8;havoc main_#t~post9; 154#L552-3 goto; 155#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 160#L552-1 [2021-08-27 14:23:21,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:21,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1805830304, now seen corresponding path program 3 times [2021-08-27 14:23:21,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:21,347 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367449662] [2021-08-27 14:23:21,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:21,347 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:21,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:21,370 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:23:21,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:21,397 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:23:21,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:21,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 2 times [2021-08-27 14:23:21,398 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:21,399 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724824850] [2021-08-27 14:23:21,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:21,399 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:21,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:21,405 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:23:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:21,414 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:23:21,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:21,427 INFO L82 PathProgramCache]: Analyzing trace with hash -707580506, now seen corresponding path program 1 times [2021-08-27 14:23:21,427 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:21,427 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940790440] [2021-08-27 14:23:21,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:21,428 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:21,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:23:21,533 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-08-27 14:23:21,550 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:23:21,550 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:23:21,550 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940790440] [2021-08-27 14:23:21,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940790440] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:23:21,551 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199731741] [2021-08-27 14:23:21,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:21,551 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:23:21,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:23:21,552 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:23:21,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-08-27 14:23:21,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:23:21,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 13 conjunts are in the unsatisfiable core [2021-08-27 14:23:21,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:23:21,657 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-08-27 14:23:21,657 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2021-08-27 14:23:21,722 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:21,773 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-08-27 14:23:21,782 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:23:21,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199731741] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:23:21,783 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:23:21,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 9 [2021-08-27 14:23:21,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045355107] [2021-08-27 14:23:21,887 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:23:21,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 14:23:21,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-08-27 14:23:21,888 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:23:21,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:23:21,955 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2021-08-27 14:23:21,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 14:23:21,955 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2021-08-27 14:23:21,956 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-08-27 14:23:21,957 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 20 transitions. [2021-08-27 14:23:21,957 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-08-27 14:23:21,957 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-08-27 14:23:21,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 20 transitions. [2021-08-27 14:23:21,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:23:21,958 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2021-08-27 14:23:21,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 20 transitions. [2021-08-27 14:23:21,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-08-27 14:23:21,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:23:21,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2021-08-27 14:23:21,960 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2021-08-27 14:23:21,960 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2021-08-27 14:23:21,960 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-27 14:23:21,960 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2021-08-27 14:23:21,965 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-08-27 14:23:21,966 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:23:21,966 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:23:21,967 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1] [2021-08-27 14:23:21,967 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 14:23:21,967 INFO L791 eck$LassoCheckResult]: Stem: 242#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 243#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 247#L552-3 goto; 255#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 254#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 253#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 244#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 245#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 250#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 251#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 248#L552-1 [2021-08-27 14:23:21,967 INFO L793 eck$LassoCheckResult]: Loop: 248#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 249#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem8;havoc main_#t~post9; 238#L552-3 goto; 239#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 248#L552-1 [2021-08-27 14:23:21,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:21,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1269751228, now seen corresponding path program 4 times [2021-08-27 14:23:21,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:21,969 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783473278] [2021-08-27 14:23:21,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:21,969 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:21,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:21,994 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:23:22,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:22,012 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:23:22,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:22,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 3 times [2021-08-27 14:23:22,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:22,014 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089598410] [2021-08-27 14:23:22,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:22,014 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:22,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:22,026 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:23:22,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:22,044 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:23:22,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:22,045 INFO L82 PathProgramCache]: Analyzing trace with hash 112465226, now seen corresponding path program 2 times [2021-08-27 14:23:22,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:22,046 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888882723] [2021-08-27 14:23:22,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:22,049 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:22,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:23:22,165 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:23:22,165 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:23:22,165 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888882723] [2021-08-27 14:23:22,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888882723] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:23:22,166 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599057520] [2021-08-27 14:23:22,166 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 14:23:22,166 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:23:22,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:23:22,167 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-08-27 14:23:22,168 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-08-27 14:23:22,246 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 14:23:22,246 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:23:22,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 14 conjunts are in the unsatisfiable core [2021-08-27 14:23:22,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:23:22,273 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-08-27 14:23:22,273 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2021-08-27 14:23:22,329 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:22,374 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:22,420 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-08-27 14:23:22,428 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:23:22,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599057520] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:23:22,429 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:23:22,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2021-08-27 14:23:22,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937175362] [2021-08-27 14:23:22,510 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:23:22,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 14:23:22,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-08-27 14:23:22,511 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 4 Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 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-08-27 14:23:22,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:23:22,611 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2021-08-27 14:23:22,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 14:23:22,612 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 25 transitions. [2021-08-27 14:23:22,619 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-08-27 14:23:22,619 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 21 states and 23 transitions. [2021-08-27 14:23:22,620 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-08-27 14:23:22,620 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-08-27 14:23:22,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 23 transitions. [2021-08-27 14:23:22,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:23:22,620 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2021-08-27 14:23:22,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 23 transitions. [2021-08-27 14:23:22,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-08-27 14:23:22,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 20 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:23:22,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2021-08-27 14:23:22,624 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2021-08-27 14:23:22,624 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2021-08-27 14:23:22,625 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-27 14:23:22,625 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 23 transitions. [2021-08-27 14:23:22,628 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-08-27 14:23:22,628 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:23:22,629 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:23:22,629 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 1, 1, 1] [2021-08-27 14:23:22,629 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 14:23:22,630 INFO L791 eck$LassoCheckResult]: Stem: 345#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 346#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 351#L552-3 goto; 361#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 360#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 359#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 347#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 348#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 354#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 349#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 350#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 358#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 356#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 352#L552-1 [2021-08-27 14:23:22,630 INFO L793 eck$LassoCheckResult]: Loop: 352#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 353#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem8;havoc main_#t~post9; 341#L552-3 goto; 342#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 352#L552-1 [2021-08-27 14:23:22,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:22,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1381845472, now seen corresponding path program 5 times [2021-08-27 14:23:22,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:22,631 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416701950] [2021-08-27 14:23:22,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:22,631 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:22,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:22,656 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:23:22,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:22,678 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:23:22,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:22,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 4 times [2021-08-27 14:23:22,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:22,682 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601526161] [2021-08-27 14:23:22,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:22,688 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:22,692 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:23:22,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:22,697 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:23:22,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:22,697 INFO L82 PathProgramCache]: Analyzing trace with hash 320887590, now seen corresponding path program 3 times [2021-08-27 14:23:22,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:22,698 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960932537] [2021-08-27 14:23:22,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:22,698 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:22,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:23:22,830 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:23:22,830 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:23:22,830 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960932537] [2021-08-27 14:23:22,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960932537] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:23:22,831 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064522364] [2021-08-27 14:23:22,834 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-27 14:23:22,834 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:23:22,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:23:22,836 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-08-27 14:23:22,843 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-08-27 14:23:22,932 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-08-27 14:23:22,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:23:22,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-27 14:23:22,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:23:22,962 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-08-27 14:23:22,962 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2021-08-27 14:23:23,037 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:23,080 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:23,121 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:23,180 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-08-27 14:23:23,190 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:23:23,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064522364] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:23:23,190 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:23:23,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 15 [2021-08-27 14:23:23,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638033596] [2021-08-27 14:23:23,280 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:23:23,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 14:23:23,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2021-08-27 14:23:23,282 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. cyclomatic complexity: 4 Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 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-08-27 14:23:23,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:23:23,415 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2021-08-27 14:23:23,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 14:23:23,417 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2021-08-27 14:23:23,417 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-08-27 14:23:23,418 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 24 states and 26 transitions. [2021-08-27 14:23:23,418 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-08-27 14:23:23,418 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-08-27 14:23:23,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 26 transitions. [2021-08-27 14:23:23,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:23:23,418 INFO L681 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2021-08-27 14:23:23,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 26 transitions. [2021-08-27 14:23:23,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-08-27 14:23:23,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 23 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-08-27 14:23:23,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2021-08-27 14:23:23,421 INFO L704 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2021-08-27 14:23:23,421 INFO L587 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2021-08-27 14:23:23,421 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-27 14:23:23,421 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 26 transitions. [2021-08-27 14:23:23,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-08-27 14:23:23,422 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:23:23,422 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:23:23,422 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 1, 1, 1] [2021-08-27 14:23:23,422 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 14:23:23,423 INFO L791 eck$LassoCheckResult]: Stem: 468#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 469#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 474#L552-3 goto; 484#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 483#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 478#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 470#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 471#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 487#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 472#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 473#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 477#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 479#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 486#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 485#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 481#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 475#L552-1 [2021-08-27 14:23:23,423 INFO L793 eck$LassoCheckResult]: Loop: 475#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 476#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem8;havoc main_#t~post9; 464#L552-3 goto; 465#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 475#L552-1 [2021-08-27 14:23:23,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:23,423 INFO L82 PathProgramCache]: Analyzing trace with hash 703087812, now seen corresponding path program 6 times [2021-08-27 14:23:23,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:23,424 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622579891] [2021-08-27 14:23:23,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:23,424 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:23,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:23,433 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:23:23,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:23,445 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:23:23,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:23,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 5 times [2021-08-27 14:23:23,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:23,446 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294466293] [2021-08-27 14:23:23,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:23,446 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:23,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:23,450 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:23:23,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:23,454 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:23:23,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:23,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1091176502, now seen corresponding path program 4 times [2021-08-27 14:23:23,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:23,455 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785020826] [2021-08-27 14:23:23,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:23,455 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:23,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:23:23,589 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:23:23,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:23:23,589 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785020826] [2021-08-27 14:23:23,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785020826] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:23:23,590 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552862922] [2021-08-27 14:23:23,590 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-27 14:23:23,590 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:23:23,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:23:23,593 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-08-27 14:23:23,623 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-08-27 14:23:23,711 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-27 14:23:23,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:23:23,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 14 conjunts are in the unsatisfiable core [2021-08-27 14:23:23,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:23:23,739 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 14:23:23,740 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 14:23:23,745 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2021-08-27 14:23:23,862 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-08-27 14:23:23,862 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 27 [2021-08-27 14:23:23,943 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-08-27 14:23:23,943 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 27 [2021-08-27 14:23:24,035 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-08-27 14:23:24,036 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 27 [2021-08-27 14:23:24,125 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-08-27 14:23:24,126 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 27 [2021-08-27 14:23:24,215 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 14:23:24,216 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 16 [2021-08-27 14:23:24,225 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:23:24,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552862922] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:23:24,225 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:23:24,225 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 18 [2021-08-27 14:23:24,226 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421932034] [2021-08-27 14:23:24,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:23:24,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-27 14:23:24,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2021-08-27 14:23:24,308 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. cyclomatic complexity: 4 Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:23:24,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:23:24,525 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2021-08-27 14:23:24,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 14:23:24,525 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 31 transitions. [2021-08-27 14:23:24,526 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-08-27 14:23:24,527 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 27 states and 29 transitions. [2021-08-27 14:23:24,527 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-08-27 14:23:24,527 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-08-27 14:23:24,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 29 transitions. [2021-08-27 14:23:24,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:23:24,527 INFO L681 BuchiCegarLoop]: Abstraction has 27 states and 29 transitions. [2021-08-27 14:23:24,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 29 transitions. [2021-08-27 14:23:24,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-08-27 14:23:24,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 26 states have internal predecessors, (29), 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-08-27 14:23:24,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2021-08-27 14:23:24,529 INFO L704 BuchiCegarLoop]: Abstraction has 27 states and 29 transitions. [2021-08-27 14:23:24,530 INFO L587 BuchiCegarLoop]: Abstraction has 27 states and 29 transitions. [2021-08-27 14:23:24,530 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-27 14:23:24,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 29 transitions. [2021-08-27 14:23:24,530 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-08-27 14:23:24,530 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:23:24,531 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:23:24,531 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 1, 1, 1] [2021-08-27 14:23:24,531 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 14:23:24,531 INFO L791 eck$LassoCheckResult]: Stem: 611#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 612#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 617#L552-3 goto; 626#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 625#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 621#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 613#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 614#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 620#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 615#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 616#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 633#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 632#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 631#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 630#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 629#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 628#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 627#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 623#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 618#L552-1 [2021-08-27 14:23:24,532 INFO L793 eck$LassoCheckResult]: Loop: 618#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 619#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem8;havoc main_#t~post9; 607#L552-3 goto; 608#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 618#L552-1 [2021-08-27 14:23:24,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:24,532 INFO L82 PathProgramCache]: Analyzing trace with hash -866483296, now seen corresponding path program 7 times [2021-08-27 14:23:24,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:24,532 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222134515] [2021-08-27 14:23:24,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:24,533 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:24,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:24,542 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:23:24,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:24,553 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:23:24,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:24,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 6 times [2021-08-27 14:23:24,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:24,554 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709145779] [2021-08-27 14:23:24,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:24,554 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:24,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:24,558 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:23:24,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:24,562 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:23:24,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:24,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1312123046, now seen corresponding path program 5 times [2021-08-27 14:23:24,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:24,563 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99613076] [2021-08-27 14:23:24,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:24,563 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:24,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:23:24,739 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 7 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:23:24,739 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:23:24,740 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99613076] [2021-08-27 14:23:24,740 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99613076] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:23:24,740 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611805987] [2021-08-27 14:23:24,740 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-27 14:23:24,740 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:23:24,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:23:24,746 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:23:24,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-08-27 14:23:24,875 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2021-08-27 14:23:24,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:23:24,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 17 conjunts are in the unsatisfiable core [2021-08-27 14:23:24,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:23:24,898 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-08-27 14:23:24,898 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2021-08-27 14:23:24,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:24,982 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:25,019 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:25,057 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:25,100 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:25,164 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-08-27 14:23:25,173 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 7 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:23:25,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611805987] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:23:25,174 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:23:25,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 21 [2021-08-27 14:23:25,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042377850] [2021-08-27 14:23:25,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:23:25,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-27 14:23:25,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2021-08-27 14:23:25,267 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. cyclomatic complexity: 4 Second operand has 21 states, 21 states have (on average 2.0) internal successors, (42), 21 states have internal predecessors, (42), 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-08-27 14:23:25,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:23:25,489 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2021-08-27 14:23:25,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 14:23:25,489 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 34 transitions. [2021-08-27 14:23:25,491 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-08-27 14:23:25,491 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 30 states and 32 transitions. [2021-08-27 14:23:25,491 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-08-27 14:23:25,492 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-08-27 14:23:25,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 32 transitions. [2021-08-27 14:23:25,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:23:25,492 INFO L681 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2021-08-27 14:23:25,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 32 transitions. [2021-08-27 14:23:25,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-08-27 14:23:25,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 29 states have internal predecessors, (32), 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-08-27 14:23:25,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2021-08-27 14:23:25,497 INFO L704 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2021-08-27 14:23:25,497 INFO L587 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2021-08-27 14:23:25,497 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-08-27 14:23:25,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 32 transitions. [2021-08-27 14:23:25,499 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-08-27 14:23:25,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:23:25,499 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:23:25,500 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 6, 1, 1, 1] [2021-08-27 14:23:25,500 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 14:23:25,500 INFO L791 eck$LassoCheckResult]: Stem: 770#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 771#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 780#L552-3 goto; 790#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 789#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 784#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 776#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 777#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 799#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 778#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 779#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 783#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 785#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 798#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 797#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 796#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 795#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 794#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 793#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 792#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 791#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 787#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 781#L552-1 [2021-08-27 14:23:25,500 INFO L793 eck$LassoCheckResult]: Loop: 781#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 782#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem8;havoc main_#t~post9; 772#L552-3 goto; 773#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 781#L552-1 [2021-08-27 14:23:25,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:25,501 INFO L82 PathProgramCache]: Analyzing trace with hash -650410172, now seen corresponding path program 8 times [2021-08-27 14:23:25,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:25,501 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439948889] [2021-08-27 14:23:25,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:25,501 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:25,519 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:23:25,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:25,551 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:23:25,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:25,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 7 times [2021-08-27 14:23:25,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:25,553 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472687058] [2021-08-27 14:23:25,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:25,553 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:25,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:25,560 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:23:25,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:25,568 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:23:25,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:25,569 INFO L82 PathProgramCache]: Analyzing trace with hash 904133194, now seen corresponding path program 6 times [2021-08-27 14:23:25,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:25,569 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476775180] [2021-08-27 14:23:25,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:25,570 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:25,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:23:25,820 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 8 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:23:25,820 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:23:25,820 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476775180] [2021-08-27 14:23:25,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476775180] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:23:25,820 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998138578] [2021-08-27 14:23:25,821 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-27 14:23:25,821 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:23:25,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:23:25,822 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:23:25,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-08-27 14:23:25,979 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2021-08-27 14:23:25,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:23:25,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 18 conjunts are in the unsatisfiable core [2021-08-27 14:23:25,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:23:26,008 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-08-27 14:23:26,009 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2021-08-27 14:23:26,059 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:26,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:26,142 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:26,178 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:26,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:26,274 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:26,322 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-08-27 14:23:26,330 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 8 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:23:26,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998138578] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:23:26,330 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:23:26,331 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 24 [2021-08-27 14:23:26,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561439572] [2021-08-27 14:23:26,424 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:23:26,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-08-27 14:23:26,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2021-08-27 14:23:26,426 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. cyclomatic complexity: 4 Second operand has 24 states, 24 states have (on average 2.0) internal successors, (48), 24 states have internal predecessors, (48), 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-08-27 14:23:26,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:23:26,668 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2021-08-27 14:23:26,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-27 14:23:26,669 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 37 transitions. [2021-08-27 14:23:26,669 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-08-27 14:23:26,669 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 33 states and 35 transitions. [2021-08-27 14:23:26,670 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-08-27 14:23:26,670 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-08-27 14:23:26,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 35 transitions. [2021-08-27 14:23:26,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:23:26,670 INFO L681 BuchiCegarLoop]: Abstraction has 33 states and 35 transitions. [2021-08-27 14:23:26,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 35 transitions. [2021-08-27 14:23:26,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2021-08-27 14:23:26,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 32 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:23:26,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2021-08-27 14:23:26,672 INFO L704 BuchiCegarLoop]: Abstraction has 33 states and 35 transitions. [2021-08-27 14:23:26,673 INFO L587 BuchiCegarLoop]: Abstraction has 33 states and 35 transitions. [2021-08-27 14:23:26,673 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-08-27 14:23:26,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 35 transitions. [2021-08-27 14:23:26,673 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-08-27 14:23:26,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:23:26,673 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:23:26,674 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 7, 1, 1, 1] [2021-08-27 14:23:26,674 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 14:23:26,674 INFO L791 eck$LassoCheckResult]: Stem: 953#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 954#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 963#L552-3 goto; 972#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 971#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 967#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 959#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 960#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 966#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 961#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 962#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 985#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 984#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 983#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 982#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 981#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 980#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 979#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 978#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 977#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 976#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 975#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 974#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 973#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 969#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 964#L552-1 [2021-08-27 14:23:26,674 INFO L793 eck$LassoCheckResult]: Loop: 964#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 965#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem8;havoc main_#t~post9; 955#L552-3 goto; 956#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 964#L552-1 [2021-08-27 14:23:26,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:26,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1771949792, now seen corresponding path program 9 times [2021-08-27 14:23:26,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:26,675 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991233324] [2021-08-27 14:23:26,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:26,675 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:26,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:26,685 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:23:26,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:26,697 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:23:26,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:26,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 8 times [2021-08-27 14:23:26,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:26,698 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110574161] [2021-08-27 14:23:26,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:26,698 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:26,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:26,702 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:23:26,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:26,705 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:23:26,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:26,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1235899942, now seen corresponding path program 7 times [2021-08-27 14:23:26,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:26,706 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752592632] [2021-08-27 14:23:26,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:26,707 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:26,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:23:26,929 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 9 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:23:26,929 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:23:26,930 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752592632] [2021-08-27 14:23:26,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752592632] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:23:26,930 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10817962] [2021-08-27 14:23:26,930 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-08-27 14:23:26,930 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:23:26,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:23:26,965 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:23:26,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-08-27 14:23:27,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:23:27,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 19 conjunts are in the unsatisfiable core [2021-08-27 14:23:27,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:23:27,152 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-08-27 14:23:27,153 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2021-08-27 14:23:27,202 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:27,234 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:27,284 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:27,330 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:27,379 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:27,426 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:27,465 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:27,518 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-08-27 14:23:27,525 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 9 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:23:27,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10817962] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:23:27,526 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:23:27,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11] total 27 [2021-08-27 14:23:27,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299306920] [2021-08-27 14:23:27,613 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:23:27,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-08-27 14:23:27,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=523, Unknown=0, NotChecked=0, Total=702 [2021-08-27 14:23:27,615 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. cyclomatic complexity: 4 Second operand has 27 states, 27 states have (on average 2.0) internal successors, (54), 27 states have internal predecessors, (54), 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-08-27 14:23:27,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:23:27,930 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2021-08-27 14:23:27,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-27 14:23:27,931 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 40 transitions. [2021-08-27 14:23:27,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-08-27 14:23:27,932 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 36 states and 38 transitions. [2021-08-27 14:23:27,932 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-08-27 14:23:27,932 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-08-27 14:23:27,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 38 transitions. [2021-08-27 14:23:27,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:23:27,933 INFO L681 BuchiCegarLoop]: Abstraction has 36 states and 38 transitions. [2021-08-27 14:23:27,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 38 transitions. [2021-08-27 14:23:27,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2021-08-27 14:23:27,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 35 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:23:27,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2021-08-27 14:23:27,935 INFO L704 BuchiCegarLoop]: Abstraction has 36 states and 38 transitions. [2021-08-27 14:23:27,935 INFO L587 BuchiCegarLoop]: Abstraction has 36 states and 38 transitions. [2021-08-27 14:23:27,935 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-08-27 14:23:27,935 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 38 transitions. [2021-08-27 14:23:27,936 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-08-27 14:23:27,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:23:27,936 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:23:27,937 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 1, 1, 1] [2021-08-27 14:23:27,937 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 14:23:27,937 INFO L791 eck$LassoCheckResult]: Stem: 1160#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1161#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 1166#L552-3 goto; 1176#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1175#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1170#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1162#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1163#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1191#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1164#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1165#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1169#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1171#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1190#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1189#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1188#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1187#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1186#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1185#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1184#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1183#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1182#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1181#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1180#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1179#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1178#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1177#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1173#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1167#L552-1 [2021-08-27 14:23:27,937 INFO L793 eck$LassoCheckResult]: Loop: 1167#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1168#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem8;havoc main_#t~post9; 1156#L552-3 goto; 1157#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1167#L552-1 [2021-08-27 14:23:27,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:27,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1286793668, now seen corresponding path program 10 times [2021-08-27 14:23:27,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:27,938 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826440030] [2021-08-27 14:23:27,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:27,938 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:27,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:27,948 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:23:27,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:27,960 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:23:27,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:27,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 9 times [2021-08-27 14:23:27,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:27,961 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473976599] [2021-08-27 14:23:27,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:27,961 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:27,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:27,965 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:23:27,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:27,968 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:23:27,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:27,969 INFO L82 PathProgramCache]: Analyzing trace with hash -2115625782, now seen corresponding path program 8 times [2021-08-27 14:23:27,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:27,969 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216043458] [2021-08-27 14:23:27,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:27,970 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:27,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:23:28,266 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 10 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:23:28,267 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:23:28,268 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216043458] [2021-08-27 14:23:28,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216043458] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:23:28,268 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589836816] [2021-08-27 14:23:28,268 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 14:23:28,268 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:23:28,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:23:28,269 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:23:28,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-08-27 14:23:28,439 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 14:23:28,439 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:23:28,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 20 conjunts are in the unsatisfiable core [2021-08-27 14:23:28,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:23:28,469 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-08-27 14:23:28,470 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2021-08-27 14:23:28,514 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:28,552 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:28,598 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:28,645 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:28,680 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:28,724 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:28,771 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:28,817 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:28,866 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-08-27 14:23:28,875 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 10 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:23:28,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589836816] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:23:28,876 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:23:28,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12] total 30 [2021-08-27 14:23:28,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288691528] [2021-08-27 14:23:28,943 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:23:28,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-08-27 14:23:28,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=651, Unknown=0, NotChecked=0, Total=870 [2021-08-27 14:23:28,945 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. cyclomatic complexity: 4 Second operand has 30 states, 30 states have (on average 2.0) internal successors, (60), 30 states have internal predecessors, (60), 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-08-27 14:23:29,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:23:29,273 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2021-08-27 14:23:29,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-08-27 14:23:29,280 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 43 transitions. [2021-08-27 14:23:29,280 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-08-27 14:23:29,280 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 39 states and 41 transitions. [2021-08-27 14:23:29,281 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-08-27 14:23:29,281 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-08-27 14:23:29,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 41 transitions. [2021-08-27 14:23:29,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:23:29,281 INFO L681 BuchiCegarLoop]: Abstraction has 39 states and 41 transitions. [2021-08-27 14:23:29,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 41 transitions. [2021-08-27 14:23:29,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2021-08-27 14:23:29,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 38 states have internal predecessors, (41), 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-08-27 14:23:29,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2021-08-27 14:23:29,284 INFO L704 BuchiCegarLoop]: Abstraction has 39 states and 41 transitions. [2021-08-27 14:23:29,284 INFO L587 BuchiCegarLoop]: Abstraction has 39 states and 41 transitions. [2021-08-27 14:23:29,284 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-08-27 14:23:29,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 41 transitions. [2021-08-27 14:23:29,285 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-08-27 14:23:29,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:23:29,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:23:29,286 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 9, 1, 1, 1] [2021-08-27 14:23:29,286 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 14:23:29,287 INFO L791 eck$LassoCheckResult]: Stem: 1383#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1384#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 1389#L552-3 goto; 1399#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1398#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1393#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1385#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1386#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1417#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1387#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1388#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1392#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1394#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1416#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1415#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1414#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1413#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1412#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1411#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1410#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1409#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1408#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1407#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1406#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1405#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1404#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1403#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1402#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1401#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1400#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1396#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1390#L552-1 [2021-08-27 14:23:29,287 INFO L793 eck$LassoCheckResult]: Loop: 1390#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1391#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem8;havoc main_#t~post9; 1379#L552-3 goto; 1380#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1390#L552-1 [2021-08-27 14:23:29,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:29,287 INFO L82 PathProgramCache]: Analyzing trace with hash -2007908704, now seen corresponding path program 11 times [2021-08-27 14:23:29,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:29,288 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227130769] [2021-08-27 14:23:29,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:29,288 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:29,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:29,302 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:23:29,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:29,316 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:23:29,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:29,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 10 times [2021-08-27 14:23:29,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:29,318 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381094905] [2021-08-27 14:23:29,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:29,318 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:29,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:29,324 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:23:29,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:29,327 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:23:29,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:29,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1981227942, now seen corresponding path program 9 times [2021-08-27 14:23:29,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:29,328 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683443085] [2021-08-27 14:23:29,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:29,328 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:29,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:23:29,642 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 11 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:23:29,642 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:23:29,642 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683443085] [2021-08-27 14:23:29,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683443085] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:23:29,642 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292404337] [2021-08-27 14:23:29,642 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-27 14:23:29,642 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:23:29,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:23:29,643 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:23:29,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-08-27 14:23:29,896 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2021-08-27 14:23:29,896 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:23:29,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 19 conjunts are in the unsatisfiable core [2021-08-27 14:23:29,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:23:29,921 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 14:23:29,921 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 14:23:29,923 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2021-08-27 14:23:30,005 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-08-27 14:23:30,005 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 27 [2021-08-27 14:23:30,088 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-08-27 14:23:30,092 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 27 [2021-08-27 14:23:30,172 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-08-27 14:23:30,172 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 27 [2021-08-27 14:23:30,246 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-08-27 14:23:30,246 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 27 [2021-08-27 14:23:30,322 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-08-27 14:23:30,322 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 27 [2021-08-27 14:23:30,423 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-08-27 14:23:30,423 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 27 [2021-08-27 14:23:30,500 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-08-27 14:23:30,500 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 27 [2021-08-27 14:23:30,577 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-08-27 14:23:30,578 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 27 [2021-08-27 14:23:30,656 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-08-27 14:23:30,657 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 27 [2021-08-27 14:23:30,734 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 14:23:30,735 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 16 [2021-08-27 14:23:30,743 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 11 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:23:30,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292404337] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:23:30,744 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:23:30,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13] total 33 [2021-08-27 14:23:30,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285340248] [2021-08-27 14:23:30,811 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:23:30,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-08-27 14:23:30,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=793, Unknown=0, NotChecked=0, Total=1056 [2021-08-27 14:23:30,813 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. cyclomatic complexity: 4 Second operand has 33 states, 33 states have (on average 2.0) internal successors, (66), 33 states have internal predecessors, (66), 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-08-27 14:23:31,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:23:31,226 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2021-08-27 14:23:31,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-08-27 14:23:31,227 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 46 transitions. [2021-08-27 14:23:31,227 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-08-27 14:23:31,228 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 42 states and 44 transitions. [2021-08-27 14:23:31,228 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-08-27 14:23:31,228 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-08-27 14:23:31,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 44 transitions. [2021-08-27 14:23:31,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:23:31,228 INFO L681 BuchiCegarLoop]: Abstraction has 42 states and 44 transitions. [2021-08-27 14:23:31,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 44 transitions. [2021-08-27 14:23:31,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2021-08-27 14:23:31,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 41 states have internal predecessors, (44), 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-08-27 14:23:31,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2021-08-27 14:23:31,230 INFO L704 BuchiCegarLoop]: Abstraction has 42 states and 44 transitions. [2021-08-27 14:23:31,231 INFO L587 BuchiCegarLoop]: Abstraction has 42 states and 44 transitions. [2021-08-27 14:23:31,231 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-08-27 14:23:31,231 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 44 transitions. [2021-08-27 14:23:31,231 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-08-27 14:23:31,231 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:23:31,231 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:23:31,232 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 1, 1, 1] [2021-08-27 14:23:31,232 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 14:23:31,232 INFO L791 eck$LassoCheckResult]: Stem: 1626#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1627#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 1632#L552-3 goto; 1642#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1641#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1636#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1628#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1629#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1663#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1630#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1631#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1635#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1637#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1662#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1661#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1660#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1659#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1658#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1657#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1656#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1655#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1654#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1653#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1652#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1651#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1650#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1649#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1648#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1647#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1646#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1645#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1644#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1643#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1639#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1633#L552-1 [2021-08-27 14:23:31,233 INFO L793 eck$LassoCheckResult]: Loop: 1633#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1634#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem8;havoc main_#t~post9; 1622#L552-3 goto; 1623#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1633#L552-1 [2021-08-27 14:23:31,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:31,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1598657468, now seen corresponding path program 12 times [2021-08-27 14:23:31,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:31,233 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010003306] [2021-08-27 14:23:31,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:31,234 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:31,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:31,247 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:23:31,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:31,260 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:23:31,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:31,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 11 times [2021-08-27 14:23:31,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:31,261 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908324182] [2021-08-27 14:23:31,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:31,261 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:31,265 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:23:31,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:31,268 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:23:31,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:31,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1264869194, now seen corresponding path program 10 times [2021-08-27 14:23:31,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:31,269 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042571045] [2021-08-27 14:23:31,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:31,269 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:31,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:31,281 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:23:31,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:31,295 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:23:37,773 WARN L207 SmtUtils]: Spent 6.39 s on a formula simplification. DAG size of input: 204 DAG size of output: 172 [2021-08-27 14:23:37,915 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 14:23:37,915 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 14:23:37,915 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 14:23:37,915 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 14:23:37,916 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 14:23:37,916 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:23:37,916 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 14:23:37,916 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 14:23:37,916 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_Continue1-alloca.i_Iteration12_Lasso [2021-08-27 14:23:37,916 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 14:23:37,916 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 14:23:37,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:23:37,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:23:37,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:23:38,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:23:38,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:23:38,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:23:38,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:23:38,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:23:38,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:23:38,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:23:38,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:23:38,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:23:38,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:23:38,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:23:38,433 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 14:23:38,433 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 14:23:38,433 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:23:38,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:23:38,444 INFO L229 MonitoredProcess]: Starting monitored process 15 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-08-27 14:23:38,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-08-27 14:23:38,446 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-08-27 14:23:38,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:23:38,451 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:23:38,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:23:38,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:23:38,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:23:38,452 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:23:38,452 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:23:38,461 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:23:38,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-08-27 14:23:38,477 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:23:38,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:23:38,478 INFO L229 MonitoredProcess]: Starting monitored process 16 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-08-27 14:23:38,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-08-27 14:23:38,481 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-08-27 14:23:38,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:23:38,486 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:23:38,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:23:38,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:23:38,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:23:38,487 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:23:38,487 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:23:38,488 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:23:38,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-08-27 14:23:38,505 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:23:38,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:23:38,506 INFO L229 MonitoredProcess]: Starting monitored process 17 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-08-27 14:23:38,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-08-27 14:23:38,508 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:23:38,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:23:38,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:23:38,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:23:38,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:23:38,517 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:23:38,517 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:23:38,521 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:23:38,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-08-27 14:23:38,536 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:23:38,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:23:38,537 INFO L229 MonitoredProcess]: Starting monitored process 18 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-08-27 14:23:38,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-08-27 14:23:38,539 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-08-27 14:23:38,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:23:38,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:23:38,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:23:38,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:23:38,546 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:23:38,546 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:23:38,550 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:23:38,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-08-27 14:23:38,565 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:23:38,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:23:38,566 INFO L229 MonitoredProcess]: Starting monitored process 19 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-08-27 14:23:38,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-08-27 14:23:38,568 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-08-27 14:23:38,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:23:38,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:23:38,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:23:38,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:23:38,576 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:23:38,577 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:23:38,581 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:23:38,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2021-08-27 14:23:38,597 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:23:38,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:23:38,598 INFO L229 MonitoredProcess]: Starting monitored process 20 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-08-27 14:23:38,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-08-27 14:23:38,604 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-08-27 14:23:38,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:23:38,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:23:38,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:23:38,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:23:38,616 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:23:38,616 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:23:38,622 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:23:38,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-08-27 14:23:38,639 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:23:38,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:23:38,640 INFO L229 MonitoredProcess]: Starting monitored process 21 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-08-27 14:23:38,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-08-27 14:23:38,642 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-08-27 14:23:38,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:23:38,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:23:38,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:23:38,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:23:38,649 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:23:38,649 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:23:38,665 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:23:38,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-08-27 14:23:38,681 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:23:38,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:23:38,682 INFO L229 MonitoredProcess]: Starting monitored process 22 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-08-27 14:23:38,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-08-27 14:23:38,690 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-08-27 14:23:38,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:23:38,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:23:38,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:23:38,696 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:23:38,701 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:23:38,701 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:23:38,709 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:23:38,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2021-08-27 14:23:38,729 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:23:38,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:23:38,730 INFO L229 MonitoredProcess]: Starting monitored process 23 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-08-27 14:23:38,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-08-27 14:23:38,733 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-08-27 14:23:38,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:23:38,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:23:38,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:23:38,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:23:38,741 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:23:38,741 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:23:38,745 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 14:23:38,762 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2021-08-27 14:23:38,762 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2021-08-27 14:23:38,762 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:23:38,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:23:38,767 INFO L229 MonitoredProcess]: Starting monitored process 24 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-08-27 14:23:38,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-08-27 14:23:38,771 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 14:23:38,793 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-08-27 14:23:38,793 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 14:23:38,793 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~mem4) = -41*ULTIMATE.start_main_#t~mem4 + 790 Supporting invariants [-40*ULTIMATE.start_main_#t~mem4 + 41*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_2 >= 0] [2021-08-27 14:23:38,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2021-08-27 14:23:38,843 INFO L297 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2021-08-27 14:23:38,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:38,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:23:38,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 22 conjunts are in the unsatisfiable core [2021-08-27 14:23:38,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:23:38,943 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-08-27 14:23:38,943 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2021-08-27 14:23:39,011 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:39,061 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:39,114 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:39,179 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:39,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2021-08-27 14:23:39,240 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:39,295 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:39,347 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:39,397 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:39,450 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:39,504 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:39,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:23:39,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 14:23:39,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:23:39,560 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2021-08-27 14:23:39,638 INFO L354 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2021-08-27 14:23:39,638 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 53 [2021-08-27 14:23:39,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:23:39,766 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.12 stem predicates 3 loop predicates [2021-08-27 14:23:39,766 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4 Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:23:39,817 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 43 states and 45 transitions. Complement of second has 6 states. [2021-08-27 14:23:39,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2021-08-27 14:23:39,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:23:39,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2021-08-27 14:23:39,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 34 letters. Loop has 4 letters. [2021-08-27 14:23:39,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:23:39,818 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-08-27 14:23:39,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:39,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:23:39,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 22 conjunts are in the unsatisfiable core [2021-08-27 14:23:39,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:23:39,910 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-08-27 14:23:39,911 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2021-08-27 14:23:39,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:40,038 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:40,084 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:40,134 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:40,194 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:40,244 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:40,298 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:40,347 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:40,403 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:40,457 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:40,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:23:40,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 14:23:40,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:23:40,525 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2021-08-27 14:23:40,592 INFO L354 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2021-08-27 14:23:40,593 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 53 [2021-08-27 14:23:40,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:23:40,685 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.12 stem predicates 3 loop predicates [2021-08-27 14:23:40,685 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4 Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:23:40,729 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 43 states and 45 transitions. Complement of second has 6 states. [2021-08-27 14:23:40,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2021-08-27 14:23:40,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:23:40,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2021-08-27 14:23:40,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 34 letters. Loop has 4 letters. [2021-08-27 14:23:40,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:23:40,730 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-08-27 14:23:40,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:40,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:23:40,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 22 conjunts are in the unsatisfiable core [2021-08-27 14:23:40,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:23:40,812 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-08-27 14:23:40,812 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2021-08-27 14:23:40,868 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:40,923 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:40,970 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:41,014 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:41,062 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:41,111 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:41,163 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:41,214 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:41,266 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:41,323 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:41,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:23:41,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 14:23:41,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:23:41,382 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2021-08-27 14:23:41,451 INFO L354 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2021-08-27 14:23:41,452 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 53 [2021-08-27 14:23:41,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:23:41,543 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.12 stem predicates 3 loop predicates [2021-08-27 14:23:41,543 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4 Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:23:41,772 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 69 states and 75 transitions. Complement of second has 49 states. [2021-08-27 14:23:41,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 12 stem states 2 non-accepting loop states 2 accepting loop states [2021-08-27 14:23:41,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:23:41,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 56 transitions. [2021-08-27 14:23:41,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 56 transitions. Stem has 34 letters. Loop has 4 letters. [2021-08-27 14:23:41,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:23:41,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 56 transitions. Stem has 38 letters. Loop has 4 letters. [2021-08-27 14:23:41,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:23:41,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 56 transitions. Stem has 34 letters. Loop has 8 letters. [2021-08-27 14:23:41,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:23:41,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 75 transitions. [2021-08-27 14:23:41,778 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-08-27 14:23:41,779 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 49 states and 53 transitions. [2021-08-27 14:23:41,779 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-08-27 14:23:41,779 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-08-27 14:23:41,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 53 transitions. [2021-08-27 14:23:41,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 14:23:41,779 INFO L681 BuchiCegarLoop]: Abstraction has 49 states and 53 transitions. [2021-08-27 14:23:41,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 53 transitions. [2021-08-27 14:23:41,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2021-08-27 14:23:41,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 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-08-27 14:23:41,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2021-08-27 14:23:41,784 INFO L704 BuchiCegarLoop]: Abstraction has 47 states and 50 transitions. [2021-08-27 14:23:41,784 INFO L587 BuchiCegarLoop]: Abstraction has 47 states and 50 transitions. [2021-08-27 14:23:41,785 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-08-27 14:23:41,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 50 transitions. [2021-08-27 14:23:41,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-08-27 14:23:41,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:23:41,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:23:41,786 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [12, 11, 11, 1, 1, 1] [2021-08-27 14:23:41,786 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 14:23:41,786 INFO L791 eck$LassoCheckResult]: Stem: 2355#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2356#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 2351#L552-3 goto; 2352#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2361#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2362#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2357#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2358#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2363#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2359#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2360#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2397#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2396#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2395#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2394#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2393#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2392#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2391#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2390#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2389#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2388#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2387#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2386#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2385#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2384#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2383#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2382#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2381#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2380#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2379#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2378#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2377#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2376#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2354#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2365#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2366#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2367#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2368#L552-1 [2021-08-27 14:23:41,786 INFO L793 eck$LassoCheckResult]: Loop: 2368#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2370#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem8;havoc main_#t~post9; 2371#L552-3 goto; 2374#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2368#L552-1 [2021-08-27 14:23:41,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:41,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1287728160, now seen corresponding path program 13 times [2021-08-27 14:23:41,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:41,787 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963552408] [2021-08-27 14:23:41,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:41,787 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:41,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:23:42,079 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 146 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:23:42,079 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:23:42,080 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963552408] [2021-08-27 14:23:42,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963552408] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:23:42,080 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73343671] [2021-08-27 14:23:42,080 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-08-27 14:23:42,080 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:23:42,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:23:42,085 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:23:42,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-08-27 14:23:42,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:23:42,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 22 conjunts are in the unsatisfiable core [2021-08-27 14:23:42,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:23:42,525 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-08-27 14:23:42,526 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2021-08-27 14:23:42,576 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:42,611 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:42,649 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:42,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:42,734 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:42,776 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:42,821 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:42,865 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:42,913 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:42,985 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-08-27 14:23:43,032 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-08-27 14:23:43,038 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 11 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:23:43,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73343671] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:23:43,038 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:23:43,039 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 14] total 36 [2021-08-27 14:23:43,039 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138241239] [2021-08-27 14:23:43,040 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:23:43,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:23:43,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 12 times [2021-08-27 14:23:43,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:23:43,041 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252158355] [2021-08-27 14:23:43,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:23:43,041 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:23:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:43,046 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:23:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:23:43,050 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:23:43,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:23:43,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-08-27 14:23:43,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=989, Unknown=0, NotChecked=0, Total=1260 [2021-08-27 14:23:43,132 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. cyclomatic complexity: 6 Second operand has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 36 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:23:43,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:23:43,599 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2021-08-27 14:23:43,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-08-27 14:23:43,599 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 41 transitions. [2021-08-27 14:23:43,600 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-27 14:23:43,600 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 0 states and 0 transitions. [2021-08-27 14:23:43,600 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-08-27 14:23:43,600 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-08-27 14:23:43,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-08-27 14:23:43,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:23:43,601 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 14:23:43,601 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 14:23:43,601 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 14:23:43,601 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-08-27 14:23:43,601 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-08-27 14:23:43,601 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-27 14:23:43,601 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-08-27 14:23:43,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.08 02:23:43 BoogieIcfgContainer [2021-08-27 14:23:43,606 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-08-27 14:23:43,607 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 14:23:43,607 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 14:23:43,607 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 14:23:43,607 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:23:18" (3/4) ... [2021-08-27 14:23:43,610 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 14:23:43,610 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 14:23:43,610 INFO L168 Benchmark]: Toolchain (without parser) took 25776.17 ms. Allocated memory was 60.8 MB in the beginning and 299.9 MB in the end (delta: 239.1 MB). Free memory was 38.3 MB in the beginning and 109.5 MB in the end (delta: -71.2 MB). Peak memory consumption was 167.2 MB. Max. memory is 16.1 GB. [2021-08-27 14:23:43,611 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 60.8 MB. Free memory was 41.8 MB in the beginning and 41.8 MB in the end (delta: 36.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 14:23:43,611 INFO L168 Benchmark]: CACSL2BoogieTranslator took 458.59 ms. Allocated memory is still 60.8 MB. Free memory was 38.1 MB in the beginning and 39.3 MB in the end (delta: -1.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-27 14:23:43,611 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.78 ms. Allocated memory is still 60.8 MB. Free memory was 39.3 MB in the beginning and 37.8 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 14:23:43,611 INFO L168 Benchmark]: Boogie Preprocessor took 40.99 ms. Allocated memory is still 60.8 MB. Free memory was 37.7 MB in the beginning and 36.4 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 14:23:43,612 INFO L168 Benchmark]: RCFGBuilder took 365.00 ms. Allocated memory was 60.8 MB in the beginning and 79.7 MB in the end (delta: 18.9 MB). Free memory was 36.4 MB in the beginning and 55.8 MB in the end (delta: -19.4 MB). Peak memory consumption was 11.2 MB. Max. memory is 16.1 GB. [2021-08-27 14:23:43,612 INFO L168 Benchmark]: BuchiAutomizer took 24857.36 ms. Allocated memory was 79.7 MB in the beginning and 299.9 MB in the end (delta: 220.2 MB). Free memory was 55.8 MB in the beginning and 110.5 MB in the end (delta: -54.7 MB). Peak memory consumption was 166.6 MB. Max. memory is 16.1 GB. [2021-08-27 14:23:43,612 INFO L168 Benchmark]: Witness Printer took 3.18 ms. Allocated memory is still 299.9 MB. Free memory was 110.5 MB in the beginning and 109.5 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 14:23:43,613 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 60.8 MB. Free memory was 41.8 MB in the beginning and 41.8 MB in the end (delta: 36.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 458.59 ms. Allocated memory is still 60.8 MB. Free memory was 38.1 MB in the beginning and 39.3 MB in the end (delta: -1.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 45.78 ms. Allocated memory is still 60.8 MB. Free memory was 39.3 MB in the beginning and 37.8 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 40.99 ms. Allocated memory is still 60.8 MB. Free memory was 37.7 MB in the beginning and 36.4 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 365.00 ms. Allocated memory was 60.8 MB in the beginning and 79.7 MB in the end (delta: 18.9 MB). Free memory was 36.4 MB in the beginning and 55.8 MB in the end (delta: -19.4 MB). Peak memory consumption was 11.2 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 24857.36 ms. Allocated memory was 79.7 MB in the beginning and 299.9 MB in the end (delta: 220.2 MB). Free memory was 55.8 MB in the beginning and 110.5 MB in the end (delta: -54.7 MB). Peak memory consumption was 166.6 MB. Max. memory is 16.1 GB. * Witness Printer took 3.18 ms. Allocated memory is still 299.9 MB. Free memory was 110.5 MB in the beginning and 109.5 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (11 trivial, 1 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 19 + -2 * unknown-#memory_int-unknown[i][i] and consists of 4 locations. One nondeterministic module has affine ranking function -41 * aux-i-aux + 790 and consists of 16 locations. 11 modules have a trivial ranking function, the largest among these consists of 36 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 24.8s and 14 iterations. TraceHistogramMax:12. Analysis of lassos took 18.9s. Construction of modules took 1.1s. Büchi inclusion checks took 4.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 11. Automata minimization 38.9ms AutomataMinimizationTime, 12 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 47 states and ocurred in iteration 12. Nontrivial modules had stage [1, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 76 SDtfs, 75 SDslu, 339 SDs, 0 SdLazy, 2198 SolverSat, 209 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1197.1ms Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc10 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital250 mio100 ax107 hnf100 lsp89 ukn47 mio100 lsp42 div100 bol100 ite100 ukn100 eq175 hnf89 smp91 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 37ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2021-08-27 14:23:43,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2021-08-27 14:23:43,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-08-27 14:23:44,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2021-08-27 14:23:44,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-08-27 14:23:44,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-08-27 14:23:44,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-08-27 14:23:44,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-08-27 14:23:45,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-08-27 14:23:45,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-08-27 14:23:45,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-08-27 14:23:45,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...