./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 839c364b 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/array-examples/data_structures_set_multi_proc_trivial_ground.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0286582125bb2879636b8cf3b934bed172850a3a3b0d880c07306d10439134a7 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 23:10:02,646 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 23:10:02,647 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 23:10:02,676 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 23:10:02,677 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 23:10:02,680 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 23:10:02,682 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 23:10:02,685 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 23:10:02,686 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 23:10:02,691 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 23:10:02,692 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 23:10:02,693 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 23:10:02,693 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 23:10:02,695 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 23:10:02,697 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 23:10:02,700 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 23:10:02,702 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 23:10:02,703 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 23:10:02,705 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 23:10:02,707 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 23:10:02,710 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 23:10:02,710 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 23:10:02,712 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 23:10:02,712 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 23:10:02,714 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 23:10:02,714 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 23:10:02,714 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 23:10:02,715 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 23:10:02,715 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 23:10:02,716 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 23:10:02,716 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 23:10:02,717 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 23:10:02,718 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 23:10:02,719 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 23:10:02,720 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 23:10:02,720 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 23:10:02,720 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 23:10:02,720 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 23:10:02,721 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 23:10:02,721 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 23:10:02,722 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 23:10:02,722 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-14 23:10:02,749 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 23:10:02,750 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 23:10:02,750 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 23:10:02,750 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 23:10:02,751 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 23:10:02,751 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 23:10:02,751 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 23:10:02,751 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-14 23:10:02,752 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-14 23:10:02,752 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-14 23:10:02,752 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-14 23:10:02,752 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-14 23:10:02,752 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-14 23:10:02,752 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 23:10:02,753 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 23:10:02,753 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 23:10:02,753 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 23:10:02,753 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 23:10:02,753 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 23:10:02,753 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-14 23:10:02,753 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-14 23:10:02,754 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-14 23:10:02,754 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 23:10:02,754 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 23:10:02,754 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-14 23:10:02,754 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 23:10:02,754 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-14 23:10:02,755 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 23:10:02,755 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 23:10:02,755 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 23:10:02,755 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 23:10:02,755 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 23:10:02,756 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-14 23:10:02,756 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0286582125bb2879636b8cf3b934bed172850a3a3b0d880c07306d10439134a7 [2021-12-14 23:10:02,959 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 23:10:02,976 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 23:10:02,978 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 23:10:02,979 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 23:10:02,980 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 23:10:02,981 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i [2021-12-14 23:10:03,043 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7758e3f48/a174243948ad412bb9e2805701723a92/FLAG2ca406330 [2021-12-14 23:10:03,414 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 23:10:03,414 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i [2021-12-14 23:10:03,418 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7758e3f48/a174243948ad412bb9e2805701723a92/FLAG2ca406330 [2021-12-14 23:10:03,426 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7758e3f48/a174243948ad412bb9e2805701723a92 [2021-12-14 23:10:03,428 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 23:10:03,432 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 23:10:03,434 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 23:10:03,434 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 23:10:03,436 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 23:10:03,437 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:10:03" (1/1) ... [2021-12-14 23:10:03,438 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@386d44cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:10:03, skipping insertion in model container [2021-12-14 23:10:03,438 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:10:03" (1/1) ... [2021-12-14 23:10:03,442 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 23:10:03,457 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 23:10:03,609 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i[838,851] [2021-12-14 23:10:03,622 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 23:10:03,628 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 23:10:03,641 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i[838,851] [2021-12-14 23:10:03,657 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 23:10:03,666 INFO L208 MainTranslator]: Completed translation [2021-12-14 23:10:03,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:10:03 WrapperNode [2021-12-14 23:10:03,666 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 23:10:03,667 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 23:10:03,667 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 23:10:03,667 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 23:10:03,673 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:10:03" (1/1) ... [2021-12-14 23:10:03,686 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:10:03" (1/1) ... [2021-12-14 23:10:03,704 INFO L137 Inliner]: procedures = 18, calls = 29, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 169 [2021-12-14 23:10:03,704 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 23:10:03,705 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 23:10:03,705 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 23:10:03,705 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 23:10:03,710 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:10:03" (1/1) ... [2021-12-14 23:10:03,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:10:03" (1/1) ... [2021-12-14 23:10:03,712 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:10:03" (1/1) ... [2021-12-14 23:10:03,712 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:10:03" (1/1) ... [2021-12-14 23:10:03,717 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:10:03" (1/1) ... [2021-12-14 23:10:03,721 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:10:03" (1/1) ... [2021-12-14 23:10:03,722 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:10:03" (1/1) ... [2021-12-14 23:10:03,724 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 23:10:03,724 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 23:10:03,724 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 23:10:03,725 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 23:10:03,725 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:10:03" (1/1) ... [2021-12-14 23:10:03,739 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:10:03,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:10:03,760 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:10:03,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-14 23:10:03,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 23:10:03,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 23:10:03,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-14 23:10:03,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 23:10:03,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 23:10:03,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 23:10:03,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 23:10:03,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 23:10:03,845 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 23:10:03,846 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 23:10:03,996 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 23:10:04,000 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 23:10:04,000 INFO L301 CfgBuilder]: Removed 10 assume(true) statements. [2021-12-14 23:10:04,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:10:04 BoogieIcfgContainer [2021-12-14 23:10:04,001 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 23:10:04,002 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-14 23:10:04,002 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-14 23:10:04,009 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-14 23:10:04,009 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:10:04,009 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.12 11:10:03" (1/3) ... [2021-12-14 23:10:04,010 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7590d70f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.12 11:10:04, skipping insertion in model container [2021-12-14 23:10:04,011 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:10:04,011 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:10:03" (2/3) ... [2021-12-14 23:10:04,023 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7590d70f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.12 11:10:04, skipping insertion in model container [2021-12-14 23:10:04,023 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:10:04,023 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:10:04" (3/3) ... [2021-12-14 23:10:04,024 INFO L388 chiAutomizerObserver]: Analyzing ICFG data_structures_set_multi_proc_trivial_ground.i [2021-12-14 23:10:04,067 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-14 23:10:04,068 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-14 23:10:04,068 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-14 23:10:04,068 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-14 23:10:04,068 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-14 23:10:04,068 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-14 23:10:04,069 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-14 23:10:04,069 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-14 23:10:04,093 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:10:04,109 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 35 [2021-12-14 23:10:04,109 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:10:04,110 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:10:04,113 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-14 23:10:04,114 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-14 23:10:04,114 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-14 23:10:04,115 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:10:04,120 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 35 [2021-12-14 23:10:04,128 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:10:04,128 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:10:04,128 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-14 23:10:04,128 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-14 23:10:04,133 INFO L791 eck$LassoCheckResult]: Stem: 30#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 45#L33-3true [2021-12-14 23:10:04,134 INFO L793 eck$LassoCheckResult]: Loop: 45#L33-3true assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 35#L33-2true main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 45#L33-3true [2021-12-14 23:10:04,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:10:04,139 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-14 23:10:04,146 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:10:04,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123525551] [2021-12-14 23:10:04,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:10:04,149 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:10:04,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:10:04,220 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:10:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:10:04,238 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:10:04,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:10:04,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2021-12-14 23:10:04,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:10:04,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935233903] [2021-12-14 23:10:04,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:10:04,242 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:10:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:10:04,262 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:10:04,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:10:04,279 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:10:04,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:10:04,281 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2021-12-14 23:10:04,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:10:04,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894157691] [2021-12-14 23:10:04,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:10:04,281 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:10:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:10:04,297 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:10:04,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:10:04,321 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:10:04,565 INFO L210 LassoAnalysis]: Preferences: [2021-12-14 23:10:04,567 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-14 23:10:04,567 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-14 23:10:04,567 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-14 23:10:04,567 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-14 23:10:04,567 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:10:04,567 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-14 23:10:04,568 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-14 23:10:04,568 INFO L133 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_ground.i_Iteration1_Lasso [2021-12-14 23:10:04,568 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-14 23:10:04,568 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-14 23:10:04,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:10:04,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:10:04,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:10:04,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:10:04,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:10:04,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:10:04,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:10:04,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:10:04,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:10:04,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:10:04,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:10:04,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:10:04,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:10:04,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:10:04,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:10:04,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:10:04,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:10:04,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:10:04,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:10:04,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:10:04,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:10:04,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:10:04,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:10:04,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:10:04,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:10:04,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:10:04,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:10:04,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:10:04,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:10:05,013 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-14 23:10:05,016 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-14 23:10:05,017 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:10:05,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:10:05,018 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:10:05,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-12-14 23:10:05,022 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:10:05,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:10:05,028 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:10:05,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:10:05,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:10:05,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:10:05,030 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:10:05,030 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:10:05,040 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:10:05,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-12-14 23:10:05,059 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:10:05,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:10:05,060 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:10:05,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-12-14 23:10:05,063 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:10:05,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:10:05,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:10:05,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:10:05,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:10:05,073 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:10:05,074 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:10:05,090 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:10:05,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2021-12-14 23:10:05,107 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:10:05,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:10:05,108 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:10:05,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-12-14 23:10:05,114 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:10:05,121 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:10:05,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:10:05,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:10:05,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:10:05,125 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:10:05,125 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:10:05,138 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:10:05,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-12-14 23:10:05,153 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:10:05,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:10:05,154 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:10:05,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-12-14 23:10:05,156 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:10:05,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:10:05,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:10:05,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:10:05,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:10:05,174 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:10:05,174 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:10:05,185 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:10:05,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-12-14 23:10:05,203 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:10:05,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:10:05,205 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:10:05,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-12-14 23:10:05,208 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:10:05,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:10:05,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:10:05,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:10:05,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:10:05,225 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:10:05,225 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:10:05,240 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-14 23:10:05,278 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2021-12-14 23:10:05,278 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2021-12-14 23:10:05,279 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:10:05,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:10:05,281 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:10:05,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-12-14 23:10:05,283 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-14 23:10:05,304 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-14 23:10:05,304 INFO L513 LassoAnalysis]: Proved termination. [2021-12-14 23:10:05,305 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, v_rep(select #length ULTIMATE.start_main_~#set~0#1.base)_1) = -8*ULTIMATE.start_main_~x~0#1 + 199999*v_rep(select #length ULTIMATE.start_main_~#set~0#1.base)_1 Supporting invariants [] [2021-12-14 23:10:05,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-12-14 23:10:05,343 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2021-12-14 23:10:05,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:10:05,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:10:05,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 23:10:05,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:10:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:10:05,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 23:10:05,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:10:05,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:10:05,462 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-14 23:10:05,463 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:10:05,506 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 89 states and 139 transitions. Complement of second has 8 states. [2021-12-14 23:10:05,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-14 23:10:05,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:10:05,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2021-12-14 23:10:05,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 69 transitions. Stem has 2 letters. Loop has 2 letters. [2021-12-14 23:10:05,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:10:05,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 69 transitions. Stem has 4 letters. Loop has 2 letters. [2021-12-14 23:10:05,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:10:05,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 69 transitions. Stem has 2 letters. Loop has 4 letters. [2021-12-14 23:10:05,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:10:05,513 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 139 transitions. [2021-12-14 23:10:05,516 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 33 [2021-12-14 23:10:05,518 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 42 states and 65 transitions. [2021-12-14 23:10:05,519 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2021-12-14 23:10:05,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2021-12-14 23:10:05,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 65 transitions. [2021-12-14 23:10:05,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:10:05,520 INFO L681 BuchiCegarLoop]: Abstraction has 42 states and 65 transitions. [2021-12-14 23:10:05,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 65 transitions. [2021-12-14 23:10:05,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2021-12-14 23:10:05,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 41 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:10:05,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 65 transitions. [2021-12-14 23:10:05,545 INFO L704 BuchiCegarLoop]: Abstraction has 42 states and 65 transitions. [2021-12-14 23:10:05,546 INFO L587 BuchiCegarLoop]: Abstraction has 42 states and 65 transitions. [2021-12-14 23:10:05,546 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-14 23:10:05,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 65 transitions. [2021-12-14 23:10:05,547 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 33 [2021-12-14 23:10:05,547 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:10:05,547 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:10:05,547 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-14 23:10:05,547 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:10:05,547 INFO L791 eck$LassoCheckResult]: Stem: 230#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); 206#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 207#L33-3 assume !(main_~x~0#1 < 100000); 200#L33-4 main_~x~0#1 := 0; 201#L39-3 [2021-12-14 23:10:05,548 INFO L793 eck$LassoCheckResult]: Loop: 201#L39-3 assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; 214#L40-3 assume !true; 216#L39-2 main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 201#L39-3 [2021-12-14 23:10:05,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:10:05,548 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2021-12-14 23:10:05,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:10:05,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901183314] [2021-12-14 23:10:05,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:10:05,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:10:05,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:10:05,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:10:05,575 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:10:05,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901183314] [2021-12-14 23:10:05,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901183314] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:10:05,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-12-14 23:10:05,578 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:10:05,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 23:10:05,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435799109] [2021-12-14 23:10:05,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:10:05,595 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:10:05,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:10:05,596 INFO L85 PathProgramCache]: Analyzing trace with hash 54297, now seen corresponding path program 1 times [2021-12-14 23:10:05,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:10:05,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022335111] [2021-12-14 23:10:05,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:10:05,596 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:10:05,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:10:05,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:10:05,603 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:10:05,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022335111] [2021-12-14 23:10:05,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022335111] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:10:05,604 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:10:05,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 23:10:05,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822024285] [2021-12-14 23:10:05,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:10:05,604 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-14 23:10:05,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:10:05,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-14 23:10:05,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 23:10:05,607 INFO L87 Difference]: Start difference. First operand 42 states and 65 transitions. cyclomatic complexity: 28 Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:10:05,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:10:05,611 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2021-12-14 23:10:05,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-14 23:10:05,612 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 54 transitions. [2021-12-14 23:10:05,612 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2021-12-14 23:10:05,613 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 39 states and 51 transitions. [2021-12-14 23:10:05,613 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2021-12-14 23:10:05,613 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2021-12-14 23:10:05,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 51 transitions. [2021-12-14 23:10:05,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:10:05,613 INFO L681 BuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2021-12-14 23:10:05,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 51 transitions. [2021-12-14 23:10:05,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2021-12-14 23:10:05,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 38 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:10:05,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2021-12-14 23:10:05,615 INFO L704 BuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2021-12-14 23:10:05,615 INFO L587 BuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2021-12-14 23:10:05,615 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-14 23:10:05,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 51 transitions. [2021-12-14 23:10:05,618 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2021-12-14 23:10:05,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:10:05,619 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:10:05,619 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-14 23:10:05,619 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-14 23:10:05,619 INFO L791 eck$LassoCheckResult]: Stem: 317#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); 294#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 295#L33-3 assume !(main_~x~0#1 < 100000); 290#L33-4 main_~x~0#1 := 0; 291#L39-3 [2021-12-14 23:10:05,619 INFO L793 eck$LassoCheckResult]: Loop: 291#L39-3 assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; 300#L40-3 assume !(main_~y~0#1 < main_~n~0#1); 302#L39-2 main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 291#L39-3 [2021-12-14 23:10:05,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:10:05,620 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 2 times [2021-12-14 23:10:05,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:10:05,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235729647] [2021-12-14 23:10:05,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:10:05,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:10:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:10:05,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:10:05,634 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:10:05,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235729647] [2021-12-14 23:10:05,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235729647] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:10:05,635 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:10:05,635 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 23:10:05,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483944849] [2021-12-14 23:10:05,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:10:05,636 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:10:05,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:10:05,636 INFO L85 PathProgramCache]: Analyzing trace with hash 53832, now seen corresponding path program 1 times [2021-12-14 23:10:05,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:10:05,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937770153] [2021-12-14 23:10:05,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:10:05,637 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:10:05,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:10:05,652 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:10:05,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:10:05,668 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:10:05,684 INFO L210 LassoAnalysis]: Preferences: [2021-12-14 23:10:05,684 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-14 23:10:05,684 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-14 23:10:05,684 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-14 23:10:05,684 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-14 23:10:05,685 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:10:05,685 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-14 23:10:05,685 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-14 23:10:05,685 INFO L133 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_ground.i_Iteration3_Loop [2021-12-14 23:10:05,685 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-14 23:10:05,685 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-14 23:10:05,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:10:05,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:10:05,726 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-14 23:10:05,726 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-14 23:10:05,727 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:10:05,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:10:05,729 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:10:05,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-12-14 23:10:05,732 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-14 23:10:05,732 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-14 23:10:05,751 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-14 23:10:05,751 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5#1=0} Honda state: {ULTIMATE.start_main_#t~post5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-14 23:10:05,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-12-14 23:10:05,768 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:10:05,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:10:05,769 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:10:05,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-12-14 23:10:05,772 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-14 23:10:05,772 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-14 23:10:05,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-12-14 23:10:05,815 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:10:05,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:10:05,816 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:10:05,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-12-14 23:10:05,818 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-14 23:10:05,818 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-14 23:10:06,003 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-14 23:10:06,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-12-14 23:10:06,008 INFO L210 LassoAnalysis]: Preferences: [2021-12-14 23:10:06,008 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-14 23:10:06,008 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-14 23:10:06,008 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-14 23:10:06,008 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-14 23:10:06,008 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:10:06,008 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-14 23:10:06,008 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-14 23:10:06,008 INFO L133 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_ground.i_Iteration3_Loop [2021-12-14 23:10:06,008 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-14 23:10:06,008 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-14 23:10:06,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:10:06,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:10:06,051 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-14 23:10:06,051 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-14 23:10:06,051 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:10:06,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:10:06,052 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:10:06,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-12-14 23:10:06,056 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:10:06,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:10:06,062 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:10:06,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:10:06,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:10:06,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:10:06,063 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:10:06,063 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:10:06,078 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:10:06,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-12-14 23:10:06,097 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:10:06,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:10:06,098 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:10:06,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-12-14 23:10:06,099 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:10:06,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:10:06,105 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:10:06,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:10:06,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:10:06,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:10:06,106 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:10:06,106 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:10:06,119 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-14 23:10:06,121 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-14 23:10:06,121 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-12-14 23:10:06,122 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:10:06,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:10:06,122 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:10:06,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-12-14 23:10:06,124 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-14 23:10:06,124 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-14 23:10:06,124 INFO L513 LassoAnalysis]: Proved termination. [2021-12-14 23:10:06,124 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~n~0#1) = -1*ULTIMATE.start_main_~x~0#1 + 1*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2021-12-14 23:10:06,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-12-14 23:10:06,140 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-14 23:10:06,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:10:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:10:06,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 23:10:06,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:10:06,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:10:06,205 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 23:10:06,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:10:06,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:10:06,226 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-14 23:10:06,226 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 51 transitions. cyclomatic complexity: 17 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:10:06,262 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 51 transitions. cyclomatic complexity: 17. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 70 states and 94 transitions. Complement of second has 7 states. [2021-12-14 23:10:06,262 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-12-14 23:10:06,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:10:06,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2021-12-14 23:10:06,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 4 letters. Loop has 3 letters. [2021-12-14 23:10:06,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:10:06,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 7 letters. Loop has 3 letters. [2021-12-14 23:10:06,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:10:06,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 4 letters. Loop has 6 letters. [2021-12-14 23:10:06,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:10:06,266 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 94 transitions. [2021-12-14 23:10:06,269 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 31 [2021-12-14 23:10:06,272 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 55 states and 74 transitions. [2021-12-14 23:10:06,272 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2021-12-14 23:10:06,273 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2021-12-14 23:10:06,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 74 transitions. [2021-12-14 23:10:06,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:10:06,275 INFO L681 BuchiCegarLoop]: Abstraction has 55 states and 74 transitions. [2021-12-14 23:10:06,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 74 transitions. [2021-12-14 23:10:06,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 44. [2021-12-14 23:10:06,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 43 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:10:06,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 59 transitions. [2021-12-14 23:10:06,279 INFO L704 BuchiCegarLoop]: Abstraction has 44 states and 59 transitions. [2021-12-14 23:10:06,279 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:10:06,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 23:10:06,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 23:10:06,281 INFO L87 Difference]: Start difference. First operand 44 states and 59 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:10:06,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:10:06,323 INFO L93 Difference]: Finished difference Result 81 states and 104 transitions. [2021-12-14 23:10:06,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 23:10:06,323 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 104 transitions. [2021-12-14 23:10:06,325 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 54 [2021-12-14 23:10:06,327 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 81 states and 104 transitions. [2021-12-14 23:10:06,328 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2021-12-14 23:10:06,328 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2021-12-14 23:10:06,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 104 transitions. [2021-12-14 23:10:06,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:10:06,329 INFO L681 BuchiCegarLoop]: Abstraction has 81 states and 104 transitions. [2021-12-14 23:10:06,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 104 transitions. [2021-12-14 23:10:06,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 44. [2021-12-14 23:10:06,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 43 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:10:06,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2021-12-14 23:10:06,333 INFO L704 BuchiCegarLoop]: Abstraction has 44 states and 58 transitions. [2021-12-14 23:10:06,333 INFO L587 BuchiCegarLoop]: Abstraction has 44 states and 58 transitions. [2021-12-14 23:10:06,333 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-14 23:10:06,333 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 58 transitions. [2021-12-14 23:10:06,334 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 28 [2021-12-14 23:10:06,334 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:10:06,334 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:10:06,335 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:10:06,335 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-14 23:10:06,335 INFO L791 eck$LassoCheckResult]: Stem: 600#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); 574#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 575#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 603#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 604#L33-3 assume !(main_~x~0#1 < 100000); 570#L33-4 main_~x~0#1 := 0; 571#L39-3 assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; 580#L40-3 [2021-12-14 23:10:06,336 INFO L793 eck$LassoCheckResult]: Loop: 580#L40-3 assume !!(main_~y~0#1 < main_~n~0#1);call main_#t~mem7#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem8#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~y~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 != main_#t~mem8#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 581#L13 assume !(0 == __VERIFIER_assert_~cond#1); 566#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem7#1;havoc main_#t~mem8#1; 567#L40-2 main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 580#L40-3 [2021-12-14 23:10:06,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:10:06,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1809669547, now seen corresponding path program 1 times [2021-12-14 23:10:06,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:10:06,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828835126] [2021-12-14 23:10:06,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:10:06,338 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:10:06,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:10:06,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:10:06,388 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:10:06,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828835126] [2021-12-14 23:10:06,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828835126] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 23:10:06,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131880791] [2021-12-14 23:10:06,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:10:06,388 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:10:06,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:10:06,390 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-12-14 23:10:06,391 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-12-14 23:10:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:10:06,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 23:10:06,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:10:06,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:10:06,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 23:10:06,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:10:06,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131880791] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 23:10:06,529 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 23:10:06,529 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-12-14 23:10:06,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752562695] [2021-12-14 23:10:06,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 23:10:06,529 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:10:06,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:10:06,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1915626, now seen corresponding path program 1 times [2021-12-14 23:10:06,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:10:06,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015465067] [2021-12-14 23:10:06,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:10:06,530 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:10:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:10:06,542 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:10:06,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:10:06,552 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:10:06,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-12-14 23:10:06,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:10:06,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 23:10:06,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-12-14 23:10:06,660 INFO L87 Difference]: Start difference. First operand 44 states and 58 transitions. cyclomatic complexity: 20 Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:10:06,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:10:06,763 INFO L93 Difference]: Finished difference Result 197 states and 253 transitions. [2021-12-14 23:10:06,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 23:10:06,765 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 197 states and 253 transitions. [2021-12-14 23:10:06,767 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 132 [2021-12-14 23:10:06,769 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 197 states to 197 states and 253 transitions. [2021-12-14 23:10:06,770 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 160 [2021-12-14 23:10:06,771 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 160 [2021-12-14 23:10:06,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 197 states and 253 transitions. [2021-12-14 23:10:06,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-14 23:10:06,771 INFO L681 BuchiCegarLoop]: Abstraction has 197 states and 253 transitions. [2021-12-14 23:10:06,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states and 253 transitions. [2021-12-14 23:10:06,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 50. [2021-12-14 23:10:06,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.28) internal successors, (64), 49 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:10:06,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2021-12-14 23:10:06,776 INFO L704 BuchiCegarLoop]: Abstraction has 50 states and 64 transitions. [2021-12-14 23:10:06,776 INFO L587 BuchiCegarLoop]: Abstraction has 50 states and 64 transitions. [2021-12-14 23:10:06,776 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-14 23:10:06,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 64 transitions. [2021-12-14 23:10:06,777 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 28 [2021-12-14 23:10:06,777 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:10:06,777 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:10:06,777 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1] [2021-12-14 23:10:06,777 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-14 23:10:06,777 INFO L791 eck$LassoCheckResult]: Stem: 887#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); 859#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 860#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 893#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 894#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 890#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 891#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 898#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 897#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 896#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 895#L33-3 assume !(main_~x~0#1 < 100000); 853#L33-4 main_~x~0#1 := 0; 854#L39-3 assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; 867#L40-3 [2021-12-14 23:10:06,777 INFO L793 eck$LassoCheckResult]: Loop: 867#L40-3 assume !!(main_~y~0#1 < main_~n~0#1);call main_#t~mem7#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem8#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~y~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 != main_#t~mem8#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 868#L13 assume !(0 == __VERIFIER_assert_~cond#1); 855#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem7#1;havoc main_#t~mem8#1; 856#L40-2 main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 867#L40-3 [2021-12-14 23:10:06,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:10:06,778 INFO L85 PathProgramCache]: Analyzing trace with hash 82232677, now seen corresponding path program 2 times [2021-12-14 23:10:06,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:10:06,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136387497] [2021-12-14 23:10:06,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:10:06,778 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:10:06,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:10:06,807 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-14 23:10:06,807 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:10:06,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136387497] [2021-12-14 23:10:06,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136387497] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:10:06,808 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:10:06,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 23:10:06,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487421077] [2021-12-14 23:10:06,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:10:06,808 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:10:06,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:10:06,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1915626, now seen corresponding path program 2 times [2021-12-14 23:10:06,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:10:06,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707969514] [2021-12-14 23:10:06,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:10:06,809 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:10:06,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:10:06,813 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:10:06,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:10:06,817 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:10:06,878 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:10:06,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 23:10:06,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-14 23:10:06,878 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. cyclomatic complexity: 20 Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:10:06,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:10:06,899 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2021-12-14 23:10:06,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 23:10:06,900 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 65 transitions. [2021-12-14 23:10:06,900 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2021-12-14 23:10:06,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 51 states and 63 transitions. [2021-12-14 23:10:06,901 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2021-12-14 23:10:06,901 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2021-12-14 23:10:06,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 63 transitions. [2021-12-14 23:10:06,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:10:06,901 INFO L681 BuchiCegarLoop]: Abstraction has 51 states and 63 transitions. [2021-12-14 23:10:06,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 63 transitions. [2021-12-14 23:10:06,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2021-12-14 23:10:06,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.24) internal successors, (62), 49 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:10:06,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2021-12-14 23:10:06,903 INFO L704 BuchiCegarLoop]: Abstraction has 50 states and 62 transitions. [2021-12-14 23:10:06,903 INFO L587 BuchiCegarLoop]: Abstraction has 50 states and 62 transitions. [2021-12-14 23:10:06,903 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-14 23:10:06,903 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 62 transitions. [2021-12-14 23:10:06,903 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2021-12-14 23:10:06,903 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:10:06,903 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:10:06,904 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1, 1] [2021-12-14 23:10:06,904 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-14 23:10:06,904 INFO L791 eck$LassoCheckResult]: Stem: 987#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); 964#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 965#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 990#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 991#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 995#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1001#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1000#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 999#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 997#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 996#L33-3 assume !(main_~x~0#1 < 100000); 962#L33-4 main_~x~0#1 := 0; 963#L39-3 assume !(main_~x~0#1 < main_~n~0#1); 979#L39-4 call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; 980#L47-3 [2021-12-14 23:10:06,904 INFO L793 eck$LassoCheckResult]: Loop: 980#L47-3 assume !!(main_~v~0#1 < 100000);call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; 981#L47-2 main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 980#L47-3 [2021-12-14 23:10:06,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:10:06,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1745754320, now seen corresponding path program 1 times [2021-12-14 23:10:06,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:10:06,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547850138] [2021-12-14 23:10:06,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:10:06,905 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:10:06,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:10:06,939 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:10:06,940 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:10:06,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547850138] [2021-12-14 23:10:06,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547850138] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 23:10:06,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27695150] [2021-12-14 23:10:06,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:10:06,940 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:10:06,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:10:06,941 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:10:06,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-14 23:10:06,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:10:06,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 23:10:06,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:10:07,010 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:10:07,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 23:10:07,062 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:10:07,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27695150] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 23:10:07,062 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 23:10:07,062 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2021-12-14 23:10:07,062 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115779809] [2021-12-14 23:10:07,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 23:10:07,063 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:10:07,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:10:07,063 INFO L85 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 1 times [2021-12-14 23:10:07,063 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:10:07,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007189641] [2021-12-14 23:10:07,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:10:07,063 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:10:07,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:10:07,067 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:10:07,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:10:07,069 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:10:07,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:10:07,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-14 23:10:07,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-12-14 23:10:07,093 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. cyclomatic complexity: 17 Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:10:07,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:10:07,267 INFO L93 Difference]: Finished difference Result 292 states and 374 transitions. [2021-12-14 23:10:07,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 23:10:07,268 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 292 states and 374 transitions. [2021-12-14 23:10:07,270 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 234 [2021-12-14 23:10:07,271 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 292 states to 292 states and 374 transitions. [2021-12-14 23:10:07,271 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 272 [2021-12-14 23:10:07,271 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 272 [2021-12-14 23:10:07,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 292 states and 374 transitions. [2021-12-14 23:10:07,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:10:07,272 INFO L681 BuchiCegarLoop]: Abstraction has 292 states and 374 transitions. [2021-12-14 23:10:07,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states and 374 transitions. [2021-12-14 23:10:07,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 62. [2021-12-14 23:10:07,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 61 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:10:07,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2021-12-14 23:10:07,276 INFO L704 BuchiCegarLoop]: Abstraction has 62 states and 74 transitions. [2021-12-14 23:10:07,276 INFO L587 BuchiCegarLoop]: Abstraction has 62 states and 74 transitions. [2021-12-14 23:10:07,276 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-14 23:10:07,276 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 74 transitions. [2021-12-14 23:10:07,276 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2021-12-14 23:10:07,276 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:10:07,277 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:10:07,277 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1] [2021-12-14 23:10:07,277 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-14 23:10:07,277 INFO L791 eck$LassoCheckResult]: Stem: 1423#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); 1400#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 1401#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1431#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1432#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1426#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1427#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1448#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1447#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1446#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1445#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1444#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1443#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1442#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1441#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1440#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1439#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1438#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1437#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1436#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1435#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1434#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1433#L33-3 assume !(main_~x~0#1 < 100000); 1398#L33-4 main_~x~0#1 := 0; 1399#L39-3 assume !(main_~x~0#1 < main_~n~0#1); 1415#L39-4 call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; 1416#L47-3 [2021-12-14 23:10:07,277 INFO L793 eck$LassoCheckResult]: Loop: 1416#L47-3 assume !!(main_~v~0#1 < 100000);call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; 1417#L47-2 main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1416#L47-3 [2021-12-14 23:10:07,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:10:07,278 INFO L85 PathProgramCache]: Analyzing trace with hash -95702852, now seen corresponding path program 2 times [2021-12-14 23:10:07,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:10:07,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982812137] [2021-12-14 23:10:07,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:10:07,278 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:10:07,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:10:07,358 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:10:07,358 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:10:07,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982812137] [2021-12-14 23:10:07,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982812137] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 23:10:07,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34150951] [2021-12-14 23:10:07,358 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 23:10:07,359 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:10:07,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:10:07,360 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:10:07,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-14 23:10:07,413 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 23:10:07,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 23:10:07,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-14 23:10:07,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:10:07,463 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:10:07,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 23:10:07,627 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:10:07,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34150951] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 23:10:07,627 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 23:10:07,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2021-12-14 23:10:07,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265511998] [2021-12-14 23:10:07,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 23:10:07,628 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:10:07,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:10:07,628 INFO L85 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 2 times [2021-12-14 23:10:07,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:10:07,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531508713] [2021-12-14 23:10:07,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:10:07,628 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:10:07,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:10:07,631 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:10:07,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:10:07,634 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:10:07,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:10:07,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-14 23:10:07,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2021-12-14 23:10:07,658 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. cyclomatic complexity: 17 Second operand has 25 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:10:08,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:10:08,043 INFO L93 Difference]: Finished difference Result 592 states and 758 transitions. [2021-12-14 23:10:08,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-14 23:10:08,044 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 592 states and 758 transitions. [2021-12-14 23:10:08,047 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 474 [2021-12-14 23:10:08,049 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 592 states to 592 states and 758 transitions. [2021-12-14 23:10:08,049 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 548 [2021-12-14 23:10:08,049 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 548 [2021-12-14 23:10:08,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 592 states and 758 transitions. [2021-12-14 23:10:08,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:10:08,050 INFO L681 BuchiCegarLoop]: Abstraction has 592 states and 758 transitions. [2021-12-14 23:10:08,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states and 758 transitions. [2021-12-14 23:10:08,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 86. [2021-12-14 23:10:08,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 86 states have (on average 1.1395348837209303) internal successors, (98), 85 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:10:08,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2021-12-14 23:10:08,054 INFO L704 BuchiCegarLoop]: Abstraction has 86 states and 98 transitions. [2021-12-14 23:10:08,054 INFO L587 BuchiCegarLoop]: Abstraction has 86 states and 98 transitions. [2021-12-14 23:10:08,054 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-14 23:10:08,054 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 98 transitions. [2021-12-14 23:10:08,054 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2021-12-14 23:10:08,054 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:10:08,055 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:10:08,055 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [22, 22, 1, 1, 1, 1, 1, 1] [2021-12-14 23:10:08,055 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-14 23:10:08,055 INFO L791 eck$LassoCheckResult]: Stem: 2258#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); 2234#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 2235#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2268#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2269#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2263#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2264#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2309#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2308#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2307#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2306#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2305#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2304#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2303#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2302#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2301#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2300#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2299#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2298#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2297#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2296#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2295#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2294#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2293#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2292#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2291#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2290#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2289#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2288#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2287#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2286#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2285#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2284#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2283#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2282#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2281#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2280#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2279#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2278#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2277#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2276#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2275#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2274#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2273#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2272#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2271#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2270#L33-3 assume !(main_~x~0#1 < 100000); 2230#L33-4 main_~x~0#1 := 0; 2231#L39-3 assume !(main_~x~0#1 < main_~n~0#1); 2250#L39-4 call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; 2251#L47-3 [2021-12-14 23:10:08,055 INFO L793 eck$LassoCheckResult]: Loop: 2251#L47-3 assume !!(main_~v~0#1 < 100000);call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; 2252#L47-2 main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2251#L47-3 [2021-12-14 23:10:08,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:10:08,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1293970900, now seen corresponding path program 3 times [2021-12-14 23:10:08,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:10:08,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039192855] [2021-12-14 23:10:08,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:10:08,056 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:10:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:10:08,314 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:10:08,314 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:10:08,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039192855] [2021-12-14 23:10:08,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039192855] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 23:10:08,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71007120] [2021-12-14 23:10:08,315 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 23:10:08,315 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:10:08,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:10:08,317 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:10:08,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-14 23:10:09,090 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2021-12-14 23:10:09,090 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 23:10:09,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-14 23:10:09,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:10:09,219 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:10:09,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 23:10:09,802 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:10:09,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71007120] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 23:10:09,802 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 23:10:09,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2021-12-14 23:10:09,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052612986] [2021-12-14 23:10:09,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 23:10:09,803 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:10:09,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:10:09,803 INFO L85 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 3 times [2021-12-14 23:10:09,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:10:09,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205012779] [2021-12-14 23:10:09,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:10:09,803 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:10:09,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:10:09,806 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:10:09,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:10:09,808 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:10:09,837 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:10:09,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-12-14 23:10:09,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2021-12-14 23:10:09,839 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. cyclomatic complexity: 17 Second operand has 49 states, 49 states have (on average 2.020408163265306) internal successors, (99), 49 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:10:11,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:10:11,160 INFO L93 Difference]: Finished difference Result 1192 states and 1526 transitions. [2021-12-14 23:10:11,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-12-14 23:10:11,161 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1192 states and 1526 transitions. [2021-12-14 23:10:11,167 INFO L131 ngComponentsAnalysis]: Automaton has 50 accepting balls. 954 [2021-12-14 23:10:11,171 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1192 states to 1192 states and 1526 transitions. [2021-12-14 23:10:11,171 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1100 [2021-12-14 23:10:11,172 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1100 [2021-12-14 23:10:11,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1192 states and 1526 transitions. [2021-12-14 23:10:11,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:10:11,173 INFO L681 BuchiCegarLoop]: Abstraction has 1192 states and 1526 transitions. [2021-12-14 23:10:11,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states and 1526 transitions. [2021-12-14 23:10:11,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 134. [2021-12-14 23:10:11,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 134 states have (on average 1.0895522388059702) internal successors, (146), 133 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:10:11,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2021-12-14 23:10:11,184 INFO L704 BuchiCegarLoop]: Abstraction has 134 states and 146 transitions. [2021-12-14 23:10:11,184 INFO L587 BuchiCegarLoop]: Abstraction has 134 states and 146 transitions. [2021-12-14 23:10:11,184 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-14 23:10:11,185 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 134 states and 146 transitions. [2021-12-14 23:10:11,185 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2021-12-14 23:10:11,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:10:11,185 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:10:11,188 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [46, 46, 1, 1, 1, 1, 1, 1] [2021-12-14 23:10:11,188 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-14 23:10:11,189 INFO L791 eck$LassoCheckResult]: Stem: 3879#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); 3856#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 3857#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3887#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3888#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3882#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3883#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3976#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3975#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3974#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3973#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3972#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3971#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3970#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3969#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3968#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3967#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3966#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3965#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3964#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3963#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3962#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3961#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3960#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3959#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3958#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3957#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3956#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3955#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3954#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3953#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3952#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3951#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3950#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3949#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3948#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3947#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3946#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3945#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3944#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3943#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3942#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3941#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3940#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3939#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3938#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3937#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3936#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3935#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3934#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3933#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3932#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3931#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3930#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3929#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3928#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3927#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3926#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3925#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3924#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3923#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3922#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3921#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3920#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3919#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3918#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3917#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3916#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3915#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3914#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3913#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3912#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3911#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3910#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3909#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3908#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3907#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3906#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3905#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3904#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3903#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3902#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3901#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3900#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3899#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3898#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3897#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3896#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3895#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3894#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3893#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3892#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3891#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3890#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3889#L33-3 assume !(main_~x~0#1 < 100000); 3854#L33-4 main_~x~0#1 := 0; 3855#L39-3 assume !(main_~x~0#1 < main_~n~0#1); 3871#L39-4 call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; 3872#L47-3 [2021-12-14 23:10:11,191 INFO L793 eck$LassoCheckResult]: Loop: 3872#L47-3 assume !!(main_~v~0#1 < 100000);call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; 3873#L47-2 main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3872#L47-3 [2021-12-14 23:10:11,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:10:11,192 INFO L85 PathProgramCache]: Analyzing trace with hash -675115004, now seen corresponding path program 4 times [2021-12-14 23:10:11,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:10:11,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708173666] [2021-12-14 23:10:11,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:10:11,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:10:11,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:10:11,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:10:11,994 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:10:11,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708173666] [2021-12-14 23:10:11,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708173666] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 23:10:11,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037236633] [2021-12-14 23:10:11,995 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-14 23:10:11,995 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:10:11,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:10:11,996 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:10:11,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-14 23:10:12,107 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-14 23:10:12,107 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 23:10:12,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 48 conjunts are in the unsatisfiable core [2021-12-14 23:10:12,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:10:12,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:10:12,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 23:10:14,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:10:14,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037236633] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 23:10:14,429 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 23:10:14,430 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2021-12-14 23:10:14,430 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544392715] [2021-12-14 23:10:14,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 23:10:14,432 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:10:14,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:10:14,432 INFO L85 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 4 times [2021-12-14 23:10:14,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:10:14,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126699114] [2021-12-14 23:10:14,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:10:14,433 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:10:14,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:10:14,436 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:10:14,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:10:14,443 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:10:14,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:10:14,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2021-12-14 23:10:14,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2021-12-14 23:10:14,471 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. cyclomatic complexity: 17 Second operand has 97 states, 97 states have (on average 2.0103092783505154) internal successors, (195), 97 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:10:23,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:10:23,279 INFO L93 Difference]: Finished difference Result 2392 states and 3062 transitions. [2021-12-14 23:10:23,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2021-12-14 23:10:23,280 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2392 states and 3062 transitions. [2021-12-14 23:10:23,288 INFO L131 ngComponentsAnalysis]: Automaton has 98 accepting balls. 1914 [2021-12-14 23:10:23,295 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2392 states to 2392 states and 3062 transitions. [2021-12-14 23:10:23,296 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2204 [2021-12-14 23:10:23,297 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2204 [2021-12-14 23:10:23,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2392 states and 3062 transitions. [2021-12-14 23:10:23,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:10:23,299 INFO L681 BuchiCegarLoop]: Abstraction has 2392 states and 3062 transitions. [2021-12-14 23:10:23,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states and 3062 transitions. [2021-12-14 23:10:23,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 230. [2021-12-14 23:10:23,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 230 states have (on average 1.0521739130434782) internal successors, (242), 229 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:10:23,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 242 transitions. [2021-12-14 23:10:23,306 INFO L704 BuchiCegarLoop]: Abstraction has 230 states and 242 transitions. [2021-12-14 23:10:23,306 INFO L587 BuchiCegarLoop]: Abstraction has 230 states and 242 transitions. [2021-12-14 23:10:23,306 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-14 23:10:23,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 230 states and 242 transitions. [2021-12-14 23:10:23,307 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2021-12-14 23:10:23,307 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:10:23,307 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:10:23,309 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [94, 94, 1, 1, 1, 1, 1, 1] [2021-12-14 23:10:23,309 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-14 23:10:23,309 INFO L791 eck$LassoCheckResult]: Stem: 7087#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); 7064#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 7065#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7095#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7096#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7090#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7091#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7280#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7279#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7278#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7277#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7276#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7275#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7274#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7273#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7272#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7271#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7270#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7269#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7268#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7267#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7266#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7265#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7264#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7263#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7262#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7261#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7260#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7259#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7258#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7257#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7256#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7255#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7254#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7253#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7252#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7251#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7250#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7249#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7248#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7247#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7246#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7245#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7244#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7243#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7242#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7241#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7240#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7239#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7238#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7237#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7236#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7235#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7234#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7233#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7232#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7231#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7230#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7229#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7228#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7227#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7226#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7225#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7224#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7223#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7222#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7221#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7220#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7219#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7218#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7217#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7216#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7215#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7214#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7213#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7212#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7211#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7210#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7209#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7208#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7207#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7206#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7205#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7204#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7203#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7202#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7201#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7200#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7199#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7198#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7197#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7196#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7195#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7194#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7193#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7192#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7191#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7190#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7189#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7188#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7187#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7186#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7185#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7184#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7183#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7182#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7181#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7180#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7179#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7178#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7177#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7176#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7175#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7174#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7173#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7172#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7171#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7170#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7169#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7168#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7167#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7166#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7165#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7164#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7163#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7162#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7161#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7160#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7159#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7158#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7157#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7156#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7155#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7154#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7153#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7152#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7151#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7150#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7149#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7148#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7147#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7146#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7145#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7144#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7143#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7142#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7141#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7140#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7139#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7138#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7137#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7136#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7135#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7134#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7133#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7132#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7131#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7130#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7129#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7128#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7127#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7126#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7125#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7124#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7123#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7122#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7121#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7120#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7119#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7118#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7117#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7116#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7115#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7114#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7113#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7112#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7111#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7110#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7109#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7108#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7107#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7106#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7105#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7104#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7103#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7102#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7101#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7100#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7099#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7098#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7097#L33-3 assume !(main_~x~0#1 < 100000); 7062#L33-4 main_~x~0#1 := 0; 7063#L39-3 assume !(main_~x~0#1 < main_~n~0#1); 7079#L39-4 call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; 7080#L47-3 [2021-12-14 23:10:23,310 INFO L793 eck$LassoCheckResult]: Loop: 7080#L47-3 assume !!(main_~v~0#1 < 100000);call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; 7081#L47-2 main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 7080#L47-3 [2021-12-14 23:10:23,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:10:23,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1064733596, now seen corresponding path program 5 times [2021-12-14 23:10:23,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:10:23,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488278032] [2021-12-14 23:10:23,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:10:23,310 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:10:23,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:10:26,055 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:10:26,056 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:10:26,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488278032] [2021-12-14 23:10:26,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488278032] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 23:10:26,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877844586] [2021-12-14 23:10:26,056 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-14 23:10:26,056 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:10:26,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:10:26,057 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:10:26,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process