./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-industry-pattern/array_monotonic.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6c24879c 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-industry-pattern/array_monotonic.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 5e947ce3cb6be538c3110154d89a790a98803ec545aa8464d99fb543118ea442 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 03:26:02,746 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 03:26:02,748 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 03:26:02,782 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 03:26:02,783 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 03:26:02,785 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 03:26:02,787 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 03:26:02,788 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 03:26:02,789 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 03:26:02,793 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 03:26:02,793 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 03:26:02,795 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 03:26:02,795 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 03:26:02,796 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 03:26:02,797 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 03:26:02,799 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 03:26:02,800 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 03:26:02,801 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 03:26:02,802 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 03:26:02,805 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 03:26:02,807 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 03:26:02,807 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 03:26:02,808 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 03:26:02,809 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 03:26:02,809 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 03:26:02,814 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 03:26:02,815 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 03:26:02,815 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 03:26:02,815 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 03:26:02,816 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 03:26:02,817 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 03:26:02,817 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 03:26:02,818 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 03:26:02,818 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 03:26:02,819 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 03:26:02,819 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 03:26:02,819 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 03:26:02,820 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 03:26:02,820 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 03:26:02,820 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 03:26:02,821 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 03:26:02,822 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 03:26:02,823 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-13 03:26:02,844 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 03:26:02,844 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 03:26:02,844 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 03:26:02,844 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 03:26:02,846 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 03:26:02,846 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 03:26:02,846 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 03:26:02,846 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-13 03:26:02,846 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-13 03:26:02,847 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-13 03:26:02,847 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-13 03:26:02,847 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-13 03:26:02,847 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-13 03:26:02,848 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 03:26:02,848 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 03:26:02,848 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 03:26:02,848 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 03:26:02,848 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 03:26:02,848 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 03:26:02,848 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-13 03:26:02,849 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-13 03:26:02,849 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-13 03:26:02,849 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 03:26:02,849 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 03:26:02,849 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-13 03:26:02,849 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 03:26:02,849 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-13 03:26:02,850 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 03:26:02,850 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 03:26:02,850 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 03:26:02,850 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 03:26:02,851 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-13 03:26:02,851 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 -> 5e947ce3cb6be538c3110154d89a790a98803ec545aa8464d99fb543118ea442 [2022-07-13 03:26:03,027 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 03:26:03,043 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 03:26:03,045 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 03:26:03,045 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 03:26:03,046 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 03:26:03,047 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-industry-pattern/array_monotonic.i [2022-07-13 03:26:03,090 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c399e9144/dc847d1a482a451f8072516a0644ee8a/FLAG0eecdd1cc [2022-07-13 03:26:03,440 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 03:26:03,440 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_monotonic.i [2022-07-13 03:26:03,445 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c399e9144/dc847d1a482a451f8072516a0644ee8a/FLAG0eecdd1cc [2022-07-13 03:26:03,454 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c399e9144/dc847d1a482a451f8072516a0644ee8a [2022-07-13 03:26:03,456 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 03:26:03,457 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 03:26:03,458 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 03:26:03,458 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 03:26:03,460 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 03:26:03,461 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:26:03" (1/1) ... [2022-07-13 03:26:03,461 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eb37727 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:26:03, skipping insertion in model container [2022-07-13 03:26:03,462 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:26:03" (1/1) ... [2022-07-13 03:26:03,470 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 03:26:03,478 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 03:26:03,617 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-industry-pattern/array_monotonic.i[808,821] [2022-07-13 03:26:03,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:26:03,634 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 03:26:03,659 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-industry-pattern/array_monotonic.i[808,821] [2022-07-13 03:26:03,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:26:03,678 INFO L208 MainTranslator]: Completed translation [2022-07-13 03:26:03,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:26:03 WrapperNode [2022-07-13 03:26:03,678 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 03:26:03,679 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 03:26:03,679 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 03:26:03,679 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 03:26:03,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:26:03" (1/1) ... [2022-07-13 03:26:03,690 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:26:03" (1/1) ... [2022-07-13 03:26:03,708 INFO L137 Inliner]: procedures = 16, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 47 [2022-07-13 03:26:03,708 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 03:26:03,709 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 03:26:03,709 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 03:26:03,709 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 03:26:03,714 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:26:03" (1/1) ... [2022-07-13 03:26:03,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:26:03" (1/1) ... [2022-07-13 03:26:03,724 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:26:03" (1/1) ... [2022-07-13 03:26:03,724 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:26:03" (1/1) ... [2022-07-13 03:26:03,730 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:26:03" (1/1) ... [2022-07-13 03:26:03,734 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:26:03" (1/1) ... [2022-07-13 03:26:03,738 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:26:03" (1/1) ... [2022-07-13 03:26:03,740 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 03:26:03,741 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 03:26:03,742 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 03:26:03,742 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 03:26:03,743 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:26:03" (1/1) ... [2022-07-13 03:26:03,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:03,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:03,771 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) [2022-07-13 03:26:03,805 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 [2022-07-13 03:26:03,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 03:26:03,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 03:26:03,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 03:26:03,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 03:26:03,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 03:26:03,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 03:26:03,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 03:26:03,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 03:26:03,871 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 03:26:03,872 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 03:26:03,990 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 03:26:03,993 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 03:26:03,994 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 03:26:03,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:26:03 BoogieIcfgContainer [2022-07-13 03:26:03,995 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 03:26:03,996 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-13 03:26:03,996 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-13 03:26:03,998 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-13 03:26:03,998 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:26:03,998 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.07 03:26:03" (1/3) ... [2022-07-13 03:26:03,999 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6e7a8845 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:26:03, skipping insertion in model container [2022-07-13 03:26:03,999 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:26:03,999 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:26:03" (2/3) ... [2022-07-13 03:26:04,000 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6e7a8845 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:26:03, skipping insertion in model container [2022-07-13 03:26:04,000 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:26:04,000 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:26:03" (3/3) ... [2022-07-13 03:26:04,000 INFO L354 chiAutomizerObserver]: Analyzing ICFG array_monotonic.i [2022-07-13 03:26:04,031 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-13 03:26:04,032 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-13 03:26:04,032 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-13 03:26:04,032 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-13 03:26:04,032 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-13 03:26:04,032 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-13 03:26:04,032 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-13 03:26:04,032 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-13 03:26:04,035 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:04,045 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-07-13 03:26:04,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:04,045 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:04,048 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:26:04,048 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-13 03:26:04,049 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-13 03:26:04,049 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:04,050 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-07-13 03:26:04,050 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:04,050 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:04,050 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:26:04,050 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-13 03:26:04,054 INFO L752 eck$LassoCheckResult]: Stem: 3#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(18, 2); 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 12#L20-3true [2022-07-13 03:26:04,055 INFO L754 eck$LassoCheckResult]: Loop: 12#L20-3true assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 15#L23true assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 13#L20-2true main_~i~0#1 := 2 + main_~i~0#1; 12#L20-3true [2022-07-13 03:26:04,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:04,058 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-13 03:26:04,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:04,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086440027] [2022-07-13 03:26:04,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:04,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:04,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:04,121 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:04,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:04,141 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:04,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:04,143 INFO L85 PathProgramCache]: Analyzing trace with hash 39821, now seen corresponding path program 1 times [2022-07-13 03:26:04,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:04,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122879128] [2022-07-13 03:26:04,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:04,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:04,156 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:04,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:04,167 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:04,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:04,168 INFO L85 PathProgramCache]: Analyzing trace with hash 28698763, now seen corresponding path program 1 times [2022-07-13 03:26:04,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:04,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549232110] [2022-07-13 03:26:04,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:04,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:04,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:04,194 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:04,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:04,212 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:04,615 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:26:04,616 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:26:04,616 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:26:04,616 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:26:04,616 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:26:04,616 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:04,616 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:26:04,616 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:26:04,617 INFO L133 ssoRankerPreferences]: Filename of dumped script: array_monotonic.i_Iteration1_Lasso [2022-07-13 03:26:04,617 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:26:04,617 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:26:04,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:26:04,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:26:04,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:26:04,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:26:04,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:26:04,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:26:04,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:26:05,099 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:26:05,102 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 03:26:05,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:05,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:05,105 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) [2022-07-13 03:26:05,109 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 [2022-07-13 03:26:05,111 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 [2022-07-13 03:26:05,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:05,119 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:05,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:05,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:05,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:26:05,121 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:26:05,121 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:05,136 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:05,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-07-13 03:26:05,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:05,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:05,155 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) [2022-07-13 03:26:05,156 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 [2022-07-13 03:26:05,157 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 [2022-07-13 03:26:05,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:05,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:05,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:05,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:26:05,166 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:26:05,166 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:26:05,182 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:05,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:05,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:05,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:05,199 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) [2022-07-13 03:26:05,200 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 [2022-07-13 03:26:05,201 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 [2022-07-13 03:26:05,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:05,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:05,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:05,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:26:05,210 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:26:05,210 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:26:05,215 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:05,231 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 [2022-07-13 03:26:05,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:05,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:05,233 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) [2022-07-13 03:26:05,246 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 [2022-07-13 03:26:05,247 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 [2022-07-13 03:26:05,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:05,252 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:05,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:05,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:05,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:26:05,253 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:26:05,253 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:05,254 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:05,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-07-13 03:26:05,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:05,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:05,272 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) [2022-07-13 03:26:05,274 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 [2022-07-13 03:26:05,275 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:05,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:05,281 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:05,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:05,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:05,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:26:05,292 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:26:05,292 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:05,299 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:05,363 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 [2022-07-13 03:26:05,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:05,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:05,365 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) [2022-07-13 03:26:05,366 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 [2022-07-13 03:26:05,367 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 [2022-07-13 03:26:05,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:05,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:05,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:05,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:26:05,375 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:26:05,375 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:26:05,377 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:05,411 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 [2022-07-13 03:26:05,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:05,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:05,413 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) [2022-07-13 03:26:05,419 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 [2022-07-13 03:26:05,420 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 [2022-07-13 03:26:05,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:05,426 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:05,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:05,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:05,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:26:05,427 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:26:05,427 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:05,439 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:05,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-07-13 03:26:05,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:05,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:05,456 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) [2022-07-13 03:26:05,457 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 [2022-07-13 03:26:05,458 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 [2022-07-13 03:26:05,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:05,464 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:05,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:05,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:05,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:26:05,466 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:26:05,466 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:05,475 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:05,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-07-13 03:26:05,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:05,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:05,491 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) [2022-07-13 03:26:05,492 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 [2022-07-13 03:26:05,493 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 [2022-07-13 03:26:05,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:05,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:05,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:05,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:26:05,508 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:26:05,508 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:26:05,521 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:05,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-07-13 03:26:05,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:05,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:05,538 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) [2022-07-13 03:26:05,539 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 [2022-07-13 03:26:05,540 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 [2022-07-13 03:26:05,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:05,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:05,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:05,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:26:05,564 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:26:05,564 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:26:05,567 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:05,585 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 [2022-07-13 03:26:05,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:05,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:05,587 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) [2022-07-13 03:26:05,588 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 [2022-07-13 03:26:05,589 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 [2022-07-13 03:26:05,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:05,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:05,595 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:05,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:26:05,600 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:26:05,600 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:26:05,616 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 03:26:05,652 INFO L443 ModelExtractionUtils]: Simplification made 24 calls to the SMT solver. [2022-07-13 03:26:05,652 INFO L444 ModelExtractionUtils]: 0 out of 19 variables were initially zero. Simplification set additionally 16 variables to zero. [2022-07-13 03:26:05,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:05,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:05,654 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) [2022-07-13 03:26:05,655 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 [2022-07-13 03:26:05,656 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 03:26:05,677 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-13 03:26:05,677 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 03:26:05,678 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1) = -1*ULTIMATE.start_main_~i~0#1 + 25000*v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1 Supporting invariants [] [2022-07-13 03:26:05,704 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 [2022-07-13 03:26:05,724 INFO L293 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2022-07-13 03:26:05,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:05,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:05,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 03:26:05,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:26:05,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:05,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 03:26:05,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:26:05,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:26:05,864 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 [2022-07-13 03:26:05,866 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:05,907 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 31 states and 45 transitions. Complement of second has 8 states. [2022-07-13 03:26:05,908 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 [2022-07-13 03:26:05,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:05,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2022-07-13 03:26:05,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 2 letters. Loop has 3 letters. [2022-07-13 03:26:05,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:26:05,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 5 letters. Loop has 3 letters. [2022-07-13 03:26:05,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:26:05,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 2 letters. Loop has 6 letters. [2022-07-13 03:26:05,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:26:05,916 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 45 transitions. [2022-07-13 03:26:05,921 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-07-13 03:26:05,924 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 13 states and 18 transitions. [2022-07-13 03:26:05,925 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-07-13 03:26:05,926 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-07-13 03:26:05,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2022-07-13 03:26:05,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:05,926 INFO L369 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2022-07-13 03:26:05,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2022-07-13 03:26:05,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-07-13 03:26:05,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:05,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2022-07-13 03:26:05,947 INFO L392 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2022-07-13 03:26:05,947 INFO L374 stractBuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2022-07-13 03:26:05,947 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-13 03:26:05,947 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2022-07-13 03:26:05,948 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-07-13 03:26:05,949 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:05,949 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:05,949 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-13 03:26:05,949 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-13 03:26:05,949 INFO L752 eck$LassoCheckResult]: Stem: 136#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(18, 2); 137#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 141#L20-3 assume !(main_~i~0#1 < 100000); 142#L20-4 main_~i~0#1 := 0; 140#L26-3 [2022-07-13 03:26:05,950 INFO L754 eck$LassoCheckResult]: Loop: 140#L26-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 146#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 139#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 140#L26-3 [2022-07-13 03:26:05,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:05,956 INFO L85 PathProgramCache]: Analyzing trace with hash 925712, now seen corresponding path program 1 times [2022-07-13 03:26:05,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:05,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010251581] [2022-07-13 03:26:05,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:05,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:05,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:06,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:26:06,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:06,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010251581] [2022-07-13 03:26:06,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010251581] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:26:06,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:26:06,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:26:06,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059744305] [2022-07-13 03:26:06,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:26:06,013 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:26:06,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:06,014 INFO L85 PathProgramCache]: Analyzing trace with hash 59038, now seen corresponding path program 1 times [2022-07-13 03:26:06,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:06,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555047240] [2022-07-13 03:26:06,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:06,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:06,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:06,019 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:06,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:06,023 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:06,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:06,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:26:06,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:26:06,073 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 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) [2022-07-13 03:26:06,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:06,090 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2022-07-13 03:26:06,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:26:06,091 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2022-07-13 03:26:06,092 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-13 03:26:06,092 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 24 transitions. [2022-07-13 03:26:06,092 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-07-13 03:26:06,092 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-07-13 03:26:06,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2022-07-13 03:26:06,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:06,092 INFO L369 hiAutomatonCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-07-13 03:26:06,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2022-07-13 03:26:06,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 12. [2022-07-13 03:26:06,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:06,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2022-07-13 03:26:06,094 INFO L392 hiAutomatonCegarLoop]: Abstraction has 12 states and 15 transitions. [2022-07-13 03:26:06,094 INFO L374 stractBuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2022-07-13 03:26:06,094 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-13 03:26:06,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2022-07-13 03:26:06,094 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-13 03:26:06,094 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:06,094 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:06,094 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:06,094 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-13 03:26:06,095 INFO L752 eck$LassoCheckResult]: Stem: 176#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(18, 2); 177#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 182#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 183#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 180#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 181#L20-3 assume !(main_~i~0#1 < 100000); 184#L20-4 main_~i~0#1 := 0; 179#L26-3 [2022-07-13 03:26:06,095 INFO L754 eck$LassoCheckResult]: Loop: 179#L26-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 185#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 178#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 179#L26-3 [2022-07-13 03:26:06,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:06,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1809767318, now seen corresponding path program 1 times [2022-07-13 03:26:06,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:06,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744825806] [2022-07-13 03:26:06,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:06,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:06,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:06,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:26:06,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:06,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744825806] [2022-07-13 03:26:06,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744825806] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:26:06,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760618588] [2022-07-13 03:26:06,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:06,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:26:06,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:06,133 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) [2022-07-13 03:26:06,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-13 03:26:06,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:06,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 03:26:06,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:26:06,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:26:06,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:26:06,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:26:06,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760618588] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:26:06,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:26:06,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-13 03:26:06,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022966935] [2022-07-13 03:26:06,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:26:06,236 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:26:06,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:06,236 INFO L85 PathProgramCache]: Analyzing trace with hash 59038, now seen corresponding path program 2 times [2022-07-13 03:26:06,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:06,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127724102] [2022-07-13 03:26:06,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:06,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:06,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:06,248 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:06,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:06,252 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:06,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:06,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 03:26:06,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-13 03:26:06,312 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:06,323 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 [2022-07-13 03:26:06,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:06,384 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-07-13 03:26:06,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 03:26:06,385 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 46 transitions. [2022-07-13 03:26:06,391 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-13 03:26:06,393 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 46 transitions. [2022-07-13 03:26:06,393 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2022-07-13 03:26:06,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2022-07-13 03:26:06,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 46 transitions. [2022-07-13 03:26:06,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:06,394 INFO L369 hiAutomatonCegarLoop]: Abstraction has 37 states and 46 transitions. [2022-07-13 03:26:06,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 46 transitions. [2022-07-13 03:26:06,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 21. [2022-07-13 03:26:06,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 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) [2022-07-13 03:26:06,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-07-13 03:26:06,398 INFO L392 hiAutomatonCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-07-13 03:26:06,398 INFO L374 stractBuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-07-13 03:26:06,398 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-13 03:26:06,398 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2022-07-13 03:26:06,399 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-13 03:26:06,399 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:06,399 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:06,400 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 1, 1, 1, 1] [2022-07-13 03:26:06,400 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-13 03:26:06,400 INFO L752 eck$LassoCheckResult]: Stem: 271#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(18, 2); 272#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 275#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 276#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 282#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 277#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 278#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 279#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 280#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 289#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 288#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 287#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 285#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 286#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 284#L20-3 assume !(main_~i~0#1 < 100000); 283#L20-4 main_~i~0#1 := 0; 274#L26-3 [2022-07-13 03:26:06,400 INFO L754 eck$LassoCheckResult]: Loop: 274#L26-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 281#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 273#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 274#L26-3 [2022-07-13 03:26:06,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:06,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1825864560, now seen corresponding path program 2 times [2022-07-13 03:26:06,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:06,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710563330] [2022-07-13 03:26:06,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:06,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:06,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:06,451 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:26:06,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:06,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710563330] [2022-07-13 03:26:06,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710563330] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:26:06,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689963064] [2022-07-13 03:26:06,451 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 03:26:06,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:26:06,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:06,472 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) [2022-07-13 03:26:06,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-13 03:26:06,517 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 03:26:06,517 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 03:26:06,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 03:26:06,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:26:06,543 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:26:06,543 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:26:06,599 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:26:06,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689963064] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:26:06,600 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:26:06,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-07-13 03:26:06,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052890726] [2022-07-13 03:26:06,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:26:06,600 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:26:06,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:06,600 INFO L85 PathProgramCache]: Analyzing trace with hash 59038, now seen corresponding path program 3 times [2022-07-13 03:26:06,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:06,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683778010] [2022-07-13 03:26:06,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:06,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:06,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:06,604 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:06,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:06,610 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:06,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:06,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 03:26:06,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-07-13 03:26:06,647 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 8 Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:06,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:06,744 INFO L93 Difference]: Finished difference Result 85 states and 106 transitions. [2022-07-13 03:26:06,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 03:26:06,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 106 transitions. [2022-07-13 03:26:06,749 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-13 03:26:06,750 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 85 states and 106 transitions. [2022-07-13 03:26:06,750 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2022-07-13 03:26:06,751 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2022-07-13 03:26:06,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 106 transitions. [2022-07-13 03:26:06,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:06,751 INFO L369 hiAutomatonCegarLoop]: Abstraction has 85 states and 106 transitions. [2022-07-13 03:26:06,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 106 transitions. [2022-07-13 03:26:06,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 39. [2022-07-13 03:26:06,755 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) [2022-07-13 03:26:06,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2022-07-13 03:26:06,757 INFO L392 hiAutomatonCegarLoop]: Abstraction has 39 states and 51 transitions. [2022-07-13 03:26:06,757 INFO L374 stractBuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2022-07-13 03:26:06,757 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-13 03:26:06,757 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 51 transitions. [2022-07-13 03:26:06,758 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-13 03:26:06,758 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:06,758 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:06,760 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 1, 1, 1, 1] [2022-07-13 03:26:06,760 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-13 03:26:06,760 INFO L752 eck$LassoCheckResult]: Stem: 481#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(18, 2); 482#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 487#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 488#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 519#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 489#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 490#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 491#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 492#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 518#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 517#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 516#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 515#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 514#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 513#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 512#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 511#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 510#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 509#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 508#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 507#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 506#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 505#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 504#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 503#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 502#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 501#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 500#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 499#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 498#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 496#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 497#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 495#L20-3 assume !(main_~i~0#1 < 100000); 494#L20-4 main_~i~0#1 := 0; 486#L26-3 [2022-07-13 03:26:06,760 INFO L754 eck$LassoCheckResult]: Loop: 486#L26-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 493#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 485#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 486#L26-3 [2022-07-13 03:26:06,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:06,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1205177520, now seen corresponding path program 3 times [2022-07-13 03:26:06,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:06,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708064785] [2022-07-13 03:26:06,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:06,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:06,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:06,889 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:26:06,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:06,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708064785] [2022-07-13 03:26:06,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708064785] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:26:06,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730797796] [2022-07-13 03:26:06,890 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 03:26:06,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:26:06,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:06,891 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) [2022-07-13 03:26:06,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-13 03:26:07,005 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-07-13 03:26:07,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 03:26:07,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 03:26:07,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:26:07,060 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:26:07,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:26:07,229 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:26:07,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730797796] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:26:07,229 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:26:07,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-07-13 03:26:07,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738266699] [2022-07-13 03:26:07,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:26:07,230 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:26:07,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:07,230 INFO L85 PathProgramCache]: Analyzing trace with hash 59038, now seen corresponding path program 4 times [2022-07-13 03:26:07,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:07,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573257745] [2022-07-13 03:26:07,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:07,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:07,233 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:07,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:07,235 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:07,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:07,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-13 03:26:07,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-07-13 03:26:07,260 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. cyclomatic complexity: 14 Second operand has 25 states, 25 states have (on average 2.8) internal successors, (70), 25 states have internal predecessors, (70), 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) [2022-07-13 03:26:07,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:07,431 INFO L93 Difference]: Finished difference Result 181 states and 226 transitions. [2022-07-13 03:26:07,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-13 03:26:07,432 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 181 states and 226 transitions. [2022-07-13 03:26:07,433 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-13 03:26:07,434 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 181 states to 181 states and 226 transitions. [2022-07-13 03:26:07,434 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2022-07-13 03:26:07,434 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 115 [2022-07-13 03:26:07,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 181 states and 226 transitions. [2022-07-13 03:26:07,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:07,435 INFO L369 hiAutomatonCegarLoop]: Abstraction has 181 states and 226 transitions. [2022-07-13 03:26:07,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states and 226 transitions. [2022-07-13 03:26:07,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 75. [2022-07-13 03:26:07,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.32) internal successors, (99), 74 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) [2022-07-13 03:26:07,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 99 transitions. [2022-07-13 03:26:07,438 INFO L392 hiAutomatonCegarLoop]: Abstraction has 75 states and 99 transitions. [2022-07-13 03:26:07,439 INFO L374 stractBuchiCegarLoop]: Abstraction has 75 states and 99 transitions. [2022-07-13 03:26:07,439 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-13 03:26:07,439 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 99 transitions. [2022-07-13 03:26:07,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-13 03:26:07,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:07,439 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:07,440 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 22, 22, 1, 1, 1, 1] [2022-07-13 03:26:07,440 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-13 03:26:07,440 INFO L752 eck$LassoCheckResult]: Stem: 929#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(18, 2); 930#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 935#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 936#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 933#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 934#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 937#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 939#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1001#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1000#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 999#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 998#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 997#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 996#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 995#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 994#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 993#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 992#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 991#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 990#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 989#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 988#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 987#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 986#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 985#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 984#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 983#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 982#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 981#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 980#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 979#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 978#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 977#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 976#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 975#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 974#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 973#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 972#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 971#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 970#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 969#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 968#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 967#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 966#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 965#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 964#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 963#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 962#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 961#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 960#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 959#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 958#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 957#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 956#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 955#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 954#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 953#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 952#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 951#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 950#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 949#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 948#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 947#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 946#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 945#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 944#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 942#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 943#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 941#L20-3 assume !(main_~i~0#1 < 100000); 940#L20-4 main_~i~0#1 := 0; 932#L26-3 [2022-07-13 03:26:07,441 INFO L754 eck$LassoCheckResult]: Loop: 932#L26-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 938#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 931#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 932#L26-3 [2022-07-13 03:26:07,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:07,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1121042640, now seen corresponding path program 4 times [2022-07-13 03:26:07,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:07,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814291624] [2022-07-13 03:26:07,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:07,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:07,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:07,746 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:26:07,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:07,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814291624] [2022-07-13 03:26:07,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814291624] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:26:07,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944894599] [2022-07-13 03:26:07,746 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 03:26:07,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:26:07,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:07,748 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) [2022-07-13 03:26:07,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-13 03:26:07,848 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 03:26:07,849 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 03:26:07,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-13 03:26:07,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:26:07,967 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:26:07,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:26:08,541 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:26:08,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944894599] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:26:08,542 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:26:08,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2022-07-13 03:26:08,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862873298] [2022-07-13 03:26:08,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:26:08,542 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:26:08,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:08,543 INFO L85 PathProgramCache]: Analyzing trace with hash 59038, now seen corresponding path program 5 times [2022-07-13 03:26:08,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:08,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844597691] [2022-07-13 03:26:08,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:08,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:08,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:08,546 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:08,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:08,548 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:08,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:08,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-13 03:26:08,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-07-13 03:26:08,573 INFO L87 Difference]: Start difference. First operand 75 states and 99 transitions. cyclomatic complexity: 26 Second operand has 49 states, 49 states have (on average 2.8979591836734695) internal successors, (142), 49 states have internal predecessors, (142), 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) [2022-07-13 03:26:09,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:09,067 INFO L93 Difference]: Finished difference Result 373 states and 466 transitions. [2022-07-13 03:26:09,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-07-13 03:26:09,068 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 373 states and 466 transitions. [2022-07-13 03:26:09,070 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-13 03:26:09,071 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 373 states to 373 states and 466 transitions. [2022-07-13 03:26:09,071 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 235 [2022-07-13 03:26:09,072 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 235 [2022-07-13 03:26:09,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 373 states and 466 transitions. [2022-07-13 03:26:09,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:09,086 INFO L369 hiAutomatonCegarLoop]: Abstraction has 373 states and 466 transitions. [2022-07-13 03:26:09,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states and 466 transitions. [2022-07-13 03:26:09,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 147. [2022-07-13 03:26:09,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 147 states have (on average 1.3265306122448979) internal successors, (195), 146 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) [2022-07-13 03:26:09,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 195 transitions. [2022-07-13 03:26:09,097 INFO L392 hiAutomatonCegarLoop]: Abstraction has 147 states and 195 transitions. [2022-07-13 03:26:09,097 INFO L374 stractBuchiCegarLoop]: Abstraction has 147 states and 195 transitions. [2022-07-13 03:26:09,098 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-13 03:26:09,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 147 states and 195 transitions. [2022-07-13 03:26:09,099 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-13 03:26:09,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:09,101 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:09,102 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [46, 46, 46, 1, 1, 1, 1] [2022-07-13 03:26:09,102 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-13 03:26:09,103 INFO L752 eck$LassoCheckResult]: Stem: 1843#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(18, 2); 1844#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 1847#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1848#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1987#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1849#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1850#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1851#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1852#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1986#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1985#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1984#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1983#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1982#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1981#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1980#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1979#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1978#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1977#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1976#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1975#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1974#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1973#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1972#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1971#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1970#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1969#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1968#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1967#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1966#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1965#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1964#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1963#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1962#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1961#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1960#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1959#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1958#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1957#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1956#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1955#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1954#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1953#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1952#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1951#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1950#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1949#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1948#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1947#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1946#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1945#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1944#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1943#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1942#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1941#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1940#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1939#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1938#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1937#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1936#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1935#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1934#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1933#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1932#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1931#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1930#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1929#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1928#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1927#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1926#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1925#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1924#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1923#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1922#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1921#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1920#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1919#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1918#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1917#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1916#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1915#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1914#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1913#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1912#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1911#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1910#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1909#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1908#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1907#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1906#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1905#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1904#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1903#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1902#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1901#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1900#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1899#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1898#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1897#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1896#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1895#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1894#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1893#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1892#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1891#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1890#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1889#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1888#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1887#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1886#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1885#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1884#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1883#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1882#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1881#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1880#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1879#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1878#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1877#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1876#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1875#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1874#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1873#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1872#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1871#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1870#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1869#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1868#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1867#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1866#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1865#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1864#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1863#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1862#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1861#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1860#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1859#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1858#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1856#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1857#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1855#L20-3 assume !(main_~i~0#1 < 100000); 1854#L20-4 main_~i~0#1 := 0; 1846#L26-3 [2022-07-13 03:26:09,103 INFO L754 eck$LassoCheckResult]: Loop: 1846#L26-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1853#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 1845#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 1846#L26-3 [2022-07-13 03:26:09,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:09,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1788222416, now seen corresponding path program 5 times [2022-07-13 03:26:09,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:09,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536458147] [2022-07-13 03:26:09,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:09,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:09,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:10,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:26:10,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:10,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536458147] [2022-07-13 03:26:10,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536458147] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:26:10,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817644605] [2022-07-13 03:26:10,007 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 03:26:10,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:26:10,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:10,009 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) [2022-07-13 03:26:10,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-13 03:26:50,333 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2022-07-13 03:26:50,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 03:26:50,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-13 03:26:50,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:26:50,579 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:26:50,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:26:52,571 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:26:52,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817644605] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:26:52,572 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:26:52,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2022-07-13 03:26:52,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977837932] [2022-07-13 03:26:52,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:26:52,573 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:26:52,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:52,573 INFO L85 PathProgramCache]: Analyzing trace with hash 59038, now seen corresponding path program 6 times [2022-07-13 03:26:52,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:52,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046377656] [2022-07-13 03:26:52,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:52,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:52,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:52,576 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:52,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:52,578 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:52,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:52,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2022-07-13 03:26:52,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2022-07-13 03:26:52,607 INFO L87 Difference]: Start difference. First operand 147 states and 195 transitions. cyclomatic complexity: 50 Second operand has 97 states, 97 states have (on average 2.948453608247423) internal successors, (286), 97 states have internal predecessors, (286), 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) [2022-07-13 03:26:54,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:54,632 INFO L93 Difference]: Finished difference Result 757 states and 946 transitions. [2022-07-13 03:26:54,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-07-13 03:26:54,632 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 757 states and 946 transitions. [2022-07-13 03:26:54,637 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-13 03:26:54,640 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 757 states to 757 states and 946 transitions. [2022-07-13 03:26:54,640 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 475 [2022-07-13 03:26:54,641 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 475 [2022-07-13 03:26:54,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 757 states and 946 transitions. [2022-07-13 03:26:54,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:54,642 INFO L369 hiAutomatonCegarLoop]: Abstraction has 757 states and 946 transitions. [2022-07-13 03:26:54,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states and 946 transitions. [2022-07-13 03:26:54,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 291. [2022-07-13 03:26:54,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 291 states have (on average 1.3298969072164948) internal successors, (387), 290 states have internal predecessors, (387), 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) [2022-07-13 03:26:54,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 387 transitions. [2022-07-13 03:26:54,652 INFO L392 hiAutomatonCegarLoop]: Abstraction has 291 states and 387 transitions. [2022-07-13 03:26:54,652 INFO L374 stractBuchiCegarLoop]: Abstraction has 291 states and 387 transitions. [2022-07-13 03:26:54,652 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-13 03:26:54,652 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 291 states and 387 transitions. [2022-07-13 03:26:54,653 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-13 03:26:54,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:54,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:54,655 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [94, 94, 94, 1, 1, 1, 1] [2022-07-13 03:26:54,656 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-13 03:26:54,656 INFO L752 eck$LassoCheckResult]: Stem: 3693#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(18, 2); 3694#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 3699#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3700#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3697#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3698#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3701#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3703#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3981#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3980#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3979#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3978#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3977#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3976#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3975#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3974#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3973#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3972#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3971#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3970#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3969#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3968#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3967#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3966#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3965#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3964#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3963#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3962#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3961#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3960#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3959#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3958#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3957#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3956#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3955#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3954#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3953#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3952#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3951#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3950#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3949#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3948#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3947#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3946#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3945#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3944#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3943#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3942#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3941#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3940#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3939#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3938#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3937#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3936#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3935#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3934#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3933#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3932#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3931#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3930#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3929#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3928#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3927#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3926#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3925#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3924#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3923#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3922#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3921#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3920#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3919#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3918#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3917#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3916#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3915#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3914#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3913#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3912#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3911#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3910#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3909#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3908#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3907#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3906#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3905#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3904#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3903#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3902#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3901#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3900#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3899#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3898#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3897#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3896#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3895#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3894#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3893#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3892#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3891#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3890#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3889#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3888#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3887#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3886#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3885#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3884#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3883#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3882#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3881#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3880#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3879#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3878#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3877#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3876#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3875#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3874#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3873#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3872#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3871#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3870#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3869#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3868#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3867#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3866#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3865#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3864#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3863#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3862#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3861#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3860#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3859#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3858#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3857#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3856#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3855#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3854#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3853#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3852#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3851#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3850#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3849#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3848#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3847#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3846#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3845#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3844#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3843#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3842#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3841#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3840#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3839#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3838#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3837#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3836#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3835#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3834#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3833#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3832#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3831#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3830#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3829#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3828#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3827#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3826#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3825#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3824#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3823#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3822#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3821#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3820#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3819#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3818#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3817#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3816#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3815#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3814#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3813#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3812#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3811#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3810#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3809#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3808#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3807#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3806#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3805#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3804#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3803#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3802#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3801#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3800#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3799#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3798#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3797#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3796#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3795#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3794#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3793#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3792#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3791#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3790#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3789#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3788#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3787#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3786#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3785#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3784#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3783#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3782#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3781#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3780#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3779#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3778#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3777#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3776#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3775#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3774#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3773#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3772#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3771#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3770#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3769#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3768#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3767#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3766#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3765#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3764#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3763#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3762#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3761#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3760#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3759#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3758#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3757#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3756#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3755#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3754#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3753#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3752#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3751#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3750#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3749#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3748#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3747#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3746#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3745#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3744#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3743#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3742#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3741#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3740#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3739#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3738#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3737#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3736#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3735#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3734#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3733#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3732#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3731#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3730#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3729#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3728#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3727#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3726#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3725#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3724#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3723#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3722#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3721#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3720#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3719#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3718#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3717#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3716#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3715#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3714#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3713#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3712#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3711#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3710#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3709#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3708#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3706#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3707#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3705#L20-3 assume !(main_~i~0#1 < 100000); 3704#L20-4 main_~i~0#1 := 0; 3696#L26-3 [2022-07-13 03:26:54,656 INFO L754 eck$LassoCheckResult]: Loop: 3696#L26-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3702#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 3695#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 3696#L26-3 [2022-07-13 03:26:54,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:54,657 INFO L85 PathProgramCache]: Analyzing trace with hash 712364496, now seen corresponding path program 6 times [2022-07-13 03:26:54,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:54,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69882039] [2022-07-13 03:26:54,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:54,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:54,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:56,625 INFO L134 CoverageAnalysis]: Checked inductivity of 13207 backedges. 0 proven. 13207 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:26:56,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:56,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69882039] [2022-07-13 03:26:56,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69882039] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:26:56,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848450758] [2022-07-13 03:26:56,626 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-13 03:26:56,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:26:56,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:56,628 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) [2022-07-13 03:26:56,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process