./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0286582125bb2879636b8cf3b934bed172850a3a3b0d880c07306d10439134a7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 15:06:55,113 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 15:06:55,115 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 15:06:55,162 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 15:06:55,162 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 15:06:55,164 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 15:06:55,165 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 15:06:55,167 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 15:06:55,169 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 15:06:55,173 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 15:06:55,174 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 15:06:55,176 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 15:06:55,176 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 15:06:55,178 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 15:06:55,179 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 15:06:55,182 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 15:06:55,183 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 15:06:55,184 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 15:06:55,186 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 15:06:55,191 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 15:06:55,192 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 15:06:55,193 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 15:06:55,194 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 15:06:55,195 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 15:06:55,196 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 15:06:55,202 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 15:06:55,203 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 15:06:55,203 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 15:06:55,204 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 15:06:55,205 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 15:06:55,206 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 15:06:55,206 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 15:06:55,208 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 15:06:55,208 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 15:06:55,209 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 15:06:55,210 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 15:06:55,210 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 15:06:55,210 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 15:06:55,211 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 15:06:55,212 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 15:06:55,212 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 15:06:55,214 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 15:06:55,215 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-14 15:06:55,249 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 15:06:55,250 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 15:06:55,250 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 15:06:55,250 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 15:06:55,251 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 15:06:55,251 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 15:06:55,252 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 15:06:55,252 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-14 15:06:55,252 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-14 15:06:55,253 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-14 15:06:55,253 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-14 15:06:55,253 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-14 15:06:55,253 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-14 15:06:55,253 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 15:06:55,254 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 15:06:55,254 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 15:06:55,255 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 15:06:55,255 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 15:06:55,255 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 15:06:55,255 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-14 15:06:55,256 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-14 15:06:55,256 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-14 15:06:55,256 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 15:06:55,256 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 15:06:55,264 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-14 15:06:55,264 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 15:06:55,264 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-14 15:06:55,265 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 15:06:55,265 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 15:06:55,265 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 15:06:55,265 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 15:06:55,266 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-14 15:06:55,266 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0286582125bb2879636b8cf3b934bed172850a3a3b0d880c07306d10439134a7 [2022-07-14 15:06:55,518 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 15:06:55,545 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 15:06:55,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 15:06:55,548 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 15:06:55,548 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 15:06:55,549 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i [2022-07-14 15:06:55,613 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00e784ad1/99b5389247234a498ea66677d8e0ed1f/FLAG73143fe0b [2022-07-14 15:06:56,080 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 15:06:56,080 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i [2022-07-14 15:06:56,085 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00e784ad1/99b5389247234a498ea66677d8e0ed1f/FLAG73143fe0b [2022-07-14 15:06:56,460 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00e784ad1/99b5389247234a498ea66677d8e0ed1f [2022-07-14 15:06:56,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 15:06:56,463 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 15:06:56,464 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 15:06:56,464 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 15:06:56,467 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 15:06:56,468 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 03:06:56" (1/1) ... [2022-07-14 15:06:56,471 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cc66820 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:06:56, skipping insertion in model container [2022-07-14 15:06:56,472 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 03:06:56" (1/1) ... [2022-07-14 15:06:56,479 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 15:06:56,495 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 15:06:56,649 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i[838,851] [2022-07-14 15:06:56,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 15:06:56,701 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 15:06:56,714 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i[838,851] [2022-07-14 15:06:56,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 15:06:56,758 INFO L208 MainTranslator]: Completed translation [2022-07-14 15:06:56,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:06:56 WrapperNode [2022-07-14 15:06:56,758 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 15:06:56,760 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 15:06:56,760 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 15:06:56,760 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 15:06:56,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:06:56" (1/1) ... [2022-07-14 15:06:56,780 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:06:56" (1/1) ... [2022-07-14 15:06:56,811 INFO L137 Inliner]: procedures = 18, calls = 29, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 169 [2022-07-14 15:06:56,812 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 15:06:56,813 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 15:06:56,813 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 15:06:56,813 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 15:06:56,820 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:06:56" (1/1) ... [2022-07-14 15:06:56,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:06:56" (1/1) ... [2022-07-14 15:06:56,834 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:06:56" (1/1) ... [2022-07-14 15:06:56,834 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:06:56" (1/1) ... [2022-07-14 15:06:56,843 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:06:56" (1/1) ... [2022-07-14 15:06:56,851 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:06:56" (1/1) ... [2022-07-14 15:06:56,852 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:06:56" (1/1) ... [2022-07-14 15:06:56,854 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 15:06:56,855 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 15:06:56,855 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 15:06:56,856 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 15:06:56,861 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:06:56" (1/1) ... [2022-07-14 15:06:56,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:56,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:56,892 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-14 15:06:56,918 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-14 15:06:56,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 15:06:56,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 15:06:56,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 15:06:56,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 15:06:56,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 15:06:56,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 15:06:56,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 15:06:56,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 15:06:57,020 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 15:06:57,022 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 15:06:57,204 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 15:06:57,209 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 15:06:57,218 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2022-07-14 15:06:57,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:06:57 BoogieIcfgContainer [2022-07-14 15:06:57,220 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 15:06:57,221 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-14 15:06:57,221 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-14 15:06:57,224 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-14 15:06:57,224 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:06:57,224 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.07 03:06:56" (1/3) ... [2022-07-14 15:06:57,226 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d4638d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 03:06:57, skipping insertion in model container [2022-07-14 15:06:57,226 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:06:57,226 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:06:56" (2/3) ... [2022-07-14 15:06:57,226 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d4638d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 03:06:57, skipping insertion in model container [2022-07-14 15:06:57,226 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:06:57,226 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:06:57" (3/3) ... [2022-07-14 15:06:57,227 INFO L354 chiAutomizerObserver]: Analyzing ICFG data_structures_set_multi_proc_trivial_ground.i [2022-07-14 15:06:57,295 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-14 15:06:57,296 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-14 15:06:57,296 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-14 15:06:57,296 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-14 15:06:57,296 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-14 15:06:57,296 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-14 15:06:57,296 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-14 15:06:57,316 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-14 15:06:57,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:06:57,358 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 35 [2022-07-14 15:06:57,358 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:06:57,358 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:06:57,363 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:06:57,363 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 15:06:57,364 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-14 15:06:57,364 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:06:57,367 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 35 [2022-07-14 15:06:57,368 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:06:57,368 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:06:57,368 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:06:57,368 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 15:06:57,375 INFO L752 eck$LassoCheckResult]: Stem: 29#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 44#L33-3true [2022-07-14 15:06:57,375 INFO L754 eck$LassoCheckResult]: Loop: 44#L33-3true assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 34#L33-2true main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 44#L33-3true [2022-07-14 15:06:57,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:57,385 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-14 15:06:57,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:57,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890965610] [2022-07-14 15:06:57,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:57,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:57,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:57,493 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:06:57,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:57,535 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:06:57,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:57,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2022-07-14 15:06:57,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:57,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100060437] [2022-07-14 15:06:57,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:57,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:57,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:57,561 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:06:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:57,575 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:06:57,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:57,584 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-07-14 15:06:57,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:57,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354204930] [2022-07-14 15:06:57,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:57,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:57,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:57,612 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:06:57,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:57,645 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:06:57,946 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:06:57,947 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:06:57,947 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:06:57,948 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:06:57,948 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 15:06:57,948 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:57,948 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:06:57,949 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:06:57,949 INFO L133 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_ground.i_Iteration1_Lasso [2022-07-14 15:06:57,949 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:06:57,950 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:06:57,971 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-14 15:06:57,977 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-14 15:06:57,979 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-14 15:06:58,147 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-14 15:06:58,149 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-14 15:06:58,151 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-14 15:06:58,153 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-14 15:06:58,155 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-14 15:06:58,157 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-14 15:06:58,159 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-14 15:06:58,161 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-14 15:06:58,165 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-14 15:06:58,167 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-14 15:06:58,170 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-14 15:06:58,172 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-14 15:06:58,176 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-14 15:06:58,178 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-14 15:06:58,181 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-14 15:06:58,182 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-14 15:06:58,184 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-14 15:06:58,187 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-14 15:06:58,190 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-14 15:06:58,192 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-14 15:06:58,194 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-14 15:06:58,196 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-14 15:06:58,198 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-14 15:06:58,202 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-14 15:06:58,205 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-14 15:06:58,207 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-14 15:06:58,485 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:06:58,488 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 15:06:58,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:58,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:58,492 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-14 15:06:58,494 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-14 15:06:58,496 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-14 15:06:58,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:58,503 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:58,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:58,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:58,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:58,505 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:58,505 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:58,518 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:58,536 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-14 15:06:58,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:58,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:58,538 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-14 15:06:58,547 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-14 15:06:58,548 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-14 15:06:58,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:58,555 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:58,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:58,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:58,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:58,556 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:58,556 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:58,557 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:58,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-07-14 15:06:58,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:58,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:58,574 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-14 15:06:58,576 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-14 15:06:58,577 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-14 15:06:58,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:58,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:58,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:58,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:58,588 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:06:58,588 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:06:58,598 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:58,625 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-14 15:06:58,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:58,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:58,627 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-14 15:06:58,629 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-14 15:06:58,630 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-14 15:06:58,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:58,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:58,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:58,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:58,639 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:06:58,639 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:06:58,655 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:58,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-14 15:06:58,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:58,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:58,683 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-14 15:06:58,690 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:06:58,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:58,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:58,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:58,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:58,700 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:06:58,700 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:06:58,703 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-14 15:06:58,719 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:58,739 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-14 15:06:58,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:58,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:58,741 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-14 15:06:58,742 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-14 15:06:58,745 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-14 15:06:58,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:58,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:58,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:58,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:58,758 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:06:58,758 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:06:58,782 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 15:06:58,812 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2022-07-14 15:06:58,813 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2022-07-14 15:06:58,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:58,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:58,823 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-14 15:06:58,860 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 15:06:58,871 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-14 15:06:58,889 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-14 15:06:58,889 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 15:06:58,889 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, v_rep(select #length ULTIMATE.start_main_~#set~0#1.base)_1) = -8*ULTIMATE.start_main_~x~0#1 + 199999*v_rep(select #length ULTIMATE.start_main_~#set~0#1.base)_1 Supporting invariants [] [2022-07-14 15:06:58,926 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-14 15:06:58,944 INFO L293 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2022-07-14 15:06:58,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:58,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:59,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 15:06:59,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:06:59,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:59,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 15:06:59,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:06:59,041 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-14 15:06:59,065 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-14 15:06:59,066 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:06:59,113 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 45 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 89 states and 139 transitions. Complement of second has 8 states. [2022-07-14 15:06:59,115 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-14 15:06:59,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:06:59,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-07-14 15:06:59,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 69 transitions. Stem has 2 letters. Loop has 2 letters. [2022-07-14 15:06:59,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:06:59,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 69 transitions. Stem has 4 letters. Loop has 2 letters. [2022-07-14 15:06:59,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:06:59,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 69 transitions. Stem has 2 letters. Loop has 4 letters. [2022-07-14 15:06:59,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:06:59,123 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 139 transitions. [2022-07-14 15:06:59,168 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 33 [2022-07-14 15:06:59,171 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 42 states and 65 transitions. [2022-07-14 15:06:59,172 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2022-07-14 15:06:59,173 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2022-07-14 15:06:59,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 65 transitions. [2022-07-14 15:06:59,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:06:59,174 INFO L369 hiAutomatonCegarLoop]: Abstraction has 42 states and 65 transitions. [2022-07-14 15:06:59,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 65 transitions. [2022-07-14 15:06:59,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-07-14 15:06:59,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 41 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:06:59,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-14 15:06:59,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 65 transitions. [2022-07-14 15:06:59,208 INFO L392 hiAutomatonCegarLoop]: Abstraction has 42 states and 65 transitions. [2022-07-14 15:06:59,208 INFO L374 stractBuchiCegarLoop]: Abstraction has 42 states and 65 transitions. [2022-07-14 15:06:59,208 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-14 15:06:59,208 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 65 transitions. [2022-07-14 15:06:59,209 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 33 [2022-07-14 15:06:59,209 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:06:59,209 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:06:59,210 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-14 15:06:59,210 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 15:06:59,210 INFO L752 eck$LassoCheckResult]: Stem: 230#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); 206#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 207#L33-3 assume !(main_~x~0#1 < 100000); 200#L33-4 main_~x~0#1 := 0; 201#L39-3 [2022-07-14 15:06:59,210 INFO L754 eck$LassoCheckResult]: Loop: 201#L39-3 assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; 214#L40-3 assume !true; 216#L39-2 main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 201#L39-3 [2022-07-14 15:06:59,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:59,213 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2022-07-14 15:06:59,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:59,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443127647] [2022-07-14 15:06:59,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:59,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:59,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:59,244 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-14 15:06:59,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:06:59,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443127647] [2022-07-14 15:06:59,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443127647] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:06:59,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:06:59,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 15:06:59,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742372503] [2022-07-14 15:06:59,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:06:59,248 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:06:59,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:59,248 INFO L85 PathProgramCache]: Analyzing trace with hash 54297, now seen corresponding path program 1 times [2022-07-14 15:06:59,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:59,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798009587] [2022-07-14 15:06:59,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:59,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:59,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:59,255 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-14 15:06:59,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:06:59,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798009587] [2022-07-14 15:06:59,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798009587] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:06:59,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:06:59,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 15:06:59,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27546145] [2022-07-14 15:06:59,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:06:59,257 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:06:59,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:06:59,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-14 15:06:59,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 15:06:59,262 INFO L87 Difference]: Start difference. First operand 42 states and 65 transitions. cyclomatic complexity: 28 Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:06:59,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:06:59,271 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2022-07-14 15:06:59,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-14 15:06:59,272 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 54 transitions. [2022-07-14 15:06:59,273 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2022-07-14 15:06:59,274 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 39 states and 51 transitions. [2022-07-14 15:06:59,274 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2022-07-14 15:06:59,274 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2022-07-14 15:06:59,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 51 transitions. [2022-07-14 15:06:59,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:06:59,275 INFO L369 hiAutomatonCegarLoop]: Abstraction has 39 states and 51 transitions. [2022-07-14 15:06:59,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 51 transitions. [2022-07-14 15:06:59,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-07-14 15:06:59,277 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-14 15:06:59,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2022-07-14 15:06:59,277 INFO L392 hiAutomatonCegarLoop]: Abstraction has 39 states and 51 transitions. [2022-07-14 15:06:59,277 INFO L374 stractBuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2022-07-14 15:06:59,277 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-14 15:06:59,278 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 51 transitions. [2022-07-14 15:06:59,278 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2022-07-14 15:06:59,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:06:59,278 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:06:59,279 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-14 15:06:59,279 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 15:06:59,279 INFO L752 eck$LassoCheckResult]: Stem: 317#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); 294#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 295#L33-3 assume !(main_~x~0#1 < 100000); 290#L33-4 main_~x~0#1 := 0; 291#L39-3 [2022-07-14 15:06:59,279 INFO L754 eck$LassoCheckResult]: Loop: 291#L39-3 assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; 300#L40-3 assume !(main_~y~0#1 < main_~n~0#1); 302#L39-2 main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 291#L39-3 [2022-07-14 15:06:59,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:59,279 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 2 times [2022-07-14 15:06:59,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:59,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308282446] [2022-07-14 15:06:59,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:59,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:59,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:59,298 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-14 15:06:59,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:06:59,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308282446] [2022-07-14 15:06:59,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308282446] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:06:59,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:06:59,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 15:06:59,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181040779] [2022-07-14 15:06:59,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:06:59,299 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:06:59,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:59,299 INFO L85 PathProgramCache]: Analyzing trace with hash 53832, now seen corresponding path program 1 times [2022-07-14 15:06:59,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:06:59,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519206774] [2022-07-14 15:06:59,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:06:59,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:06:59,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:59,304 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:06:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:06:59,307 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:06:59,326 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:06:59,326 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:06:59,326 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:06:59,327 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:06:59,327 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-14 15:06:59,327 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:59,327 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:06:59,327 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:06:59,327 INFO L133 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_ground.i_Iteration3_Loop [2022-07-14 15:06:59,327 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:06:59,327 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:06:59,328 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-14 15:06:59,330 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-14 15:06:59,363 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:06:59,364 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-14 15:06:59,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:59,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:59,366 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-14 15:06:59,368 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-14 15:06:59,369 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 15:06:59,369 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 15:06:59,389 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 15:06:59,389 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5#1=0} Honda state: {ULTIMATE.start_main_#t~post5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 15:06:59,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-14 15:06:59,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:59,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:59,424 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-14 15:06:59,434 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 15:06:59,435 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 15:06:59,444 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-14 15:06:59,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-14 15:06:59,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:59,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:59,484 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-14 15:06:59,491 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-14 15:06:59,492 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-14 15:06:59,492 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 15:06:59,696 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-14 15:06:59,702 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-14 15:06:59,702 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:06:59,702 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:06:59,702 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:06:59,702 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:06:59,702 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 15:06:59,702 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:59,702 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:06:59,703 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:06:59,703 INFO L133 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_ground.i_Iteration3_Loop [2022-07-14 15:06:59,703 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:06:59,703 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:06:59,703 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-14 15:06:59,706 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-14 15:06:59,740 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:06:59,740 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 15:06:59,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:59,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:59,742 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-14 15:06:59,752 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-14 15:06:59,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:59,759 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:59,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:59,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:59,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:59,760 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:59,760 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:59,762 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-14 15:06:59,775 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:06:59,799 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-14 15:06:59,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:59,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:59,801 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-14 15:06:59,810 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-14 15:06:59,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:06:59,817 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:06:59,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:06:59,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:06:59,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:06:59,819 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:06:59,819 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:06:59,823 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-14 15:06:59,831 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 15:06:59,844 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-14 15:06:59,844 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-14 15:06:59,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:06:59,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:06:59,848 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:06:59,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-14 15:06:59,851 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 15:06:59,851 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-14 15:06:59,851 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 15:06:59,851 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~n~0#1) = -1*ULTIMATE.start_main_~x~0#1 + 1*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2022-07-14 15:06:59,877 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-14 15:06:59,878 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-14 15:06:59,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:06:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:59,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 15:06:59,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:06:59,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:06:59,909 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 15:06:59,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:06:59,925 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-14 15:06:59,926 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-14 15:06:59,926 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 51 transitions. cyclomatic complexity: 17 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:06:59,960 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 51 transitions. cyclomatic complexity: 17. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 70 states and 94 transitions. Complement of second has 7 states. [2022-07-14 15:06:59,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-14 15:06:59,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:06:59,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-07-14 15:06:59,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 4 letters. Loop has 3 letters. [2022-07-14 15:06:59,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:06:59,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 7 letters. Loop has 3 letters. [2022-07-14 15:06:59,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:06:59,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 4 letters. Loop has 6 letters. [2022-07-14 15:06:59,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:06:59,963 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 94 transitions. [2022-07-14 15:06:59,967 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 31 [2022-07-14 15:06:59,968 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 55 states and 74 transitions. [2022-07-14 15:06:59,969 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2022-07-14 15:06:59,970 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2022-07-14 15:06:59,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 74 transitions. [2022-07-14 15:06:59,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:06:59,974 INFO L369 hiAutomatonCegarLoop]: Abstraction has 55 states and 74 transitions. [2022-07-14 15:06:59,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 74 transitions. [2022-07-14 15:06:59,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 44. [2022-07-14 15:06:59,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 43 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:06:59,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 59 transitions. [2022-07-14 15:06:59,979 INFO L392 hiAutomatonCegarLoop]: Abstraction has 44 states and 59 transitions. [2022-07-14 15:06:59,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:06:59,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 15:06:59,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 15:06:59,981 INFO L87 Difference]: Start difference. First operand 44 states and 59 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:00,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:07:00,019 INFO L93 Difference]: Finished difference Result 81 states and 104 transitions. [2022-07-14 15:07:00,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 15:07:00,021 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 104 transitions. [2022-07-14 15:07:00,022 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 54 [2022-07-14 15:07:00,024 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 81 states and 104 transitions. [2022-07-14 15:07:00,024 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2022-07-14 15:07:00,025 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2022-07-14 15:07:00,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 104 transitions. [2022-07-14 15:07:00,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:07:00,026 INFO L369 hiAutomatonCegarLoop]: Abstraction has 81 states and 104 transitions. [2022-07-14 15:07:00,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 104 transitions. [2022-07-14 15:07:00,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 44. [2022-07-14 15:07:00,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 43 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:00,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2022-07-14 15:07:00,034 INFO L392 hiAutomatonCegarLoop]: Abstraction has 44 states and 58 transitions. [2022-07-14 15:07:00,034 INFO L374 stractBuchiCegarLoop]: Abstraction has 44 states and 58 transitions. [2022-07-14 15:07:00,034 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-14 15:07:00,034 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 58 transitions. [2022-07-14 15:07:00,035 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 28 [2022-07-14 15:07:00,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:07:00,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:07:00,035 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:00,035 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-14 15:07:00,036 INFO L752 eck$LassoCheckResult]: Stem: 600#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); 574#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 575#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 603#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 604#L33-3 assume !(main_~x~0#1 < 100000); 570#L33-4 main_~x~0#1 := 0; 571#L39-3 assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; 580#L40-3 [2022-07-14 15:07:00,036 INFO L754 eck$LassoCheckResult]: Loop: 580#L40-3 assume !!(main_~y~0#1 < main_~n~0#1);call main_#t~mem7#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem8#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~y~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 != main_#t~mem8#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 581#L13 assume !(0 == __VERIFIER_assert_~cond#1); 566#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem7#1;havoc main_#t~mem8#1; 567#L40-2 main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 580#L40-3 [2022-07-14 15:07:00,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:00,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1809669547, now seen corresponding path program 1 times [2022-07-14 15:07:00,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:00,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359928497] [2022-07-14 15:07:00,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:00,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:00,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:00,078 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-14 15:07:00,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:07:00,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359928497] [2022-07-14 15:07:00,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359928497] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:07:00,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025707360] [2022-07-14 15:07:00,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:00,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:07:00,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:00,081 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-14 15:07:00,082 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-14 15:07:00,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:00,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 15:07:00,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:07:00,127 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-14 15:07:00,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 15:07:00,141 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-14 15:07:00,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025707360] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 15:07:00,142 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 15:07:00,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-14 15:07:00,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871158742] [2022-07-14 15:07:00,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 15:07:00,142 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:07:00,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:00,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1915626, now seen corresponding path program 1 times [2022-07-14 15:07:00,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:00,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714862848] [2022-07-14 15:07:00,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:00,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:00,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:00,151 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:07:00,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:00,181 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:07:00,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:00,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:07:00,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 15:07:00,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-14 15:07:00,269 INFO L87 Difference]: Start difference. First operand 44 states and 58 transitions. cyclomatic complexity: 20 Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:00,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:07:00,397 INFO L93 Difference]: Finished difference Result 197 states and 253 transitions. [2022-07-14 15:07:00,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 15:07:00,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 197 states and 253 transitions. [2022-07-14 15:07:00,402 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 132 [2022-07-14 15:07:00,406 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 197 states to 197 states and 253 transitions. [2022-07-14 15:07:00,407 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 160 [2022-07-14 15:07:00,408 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 160 [2022-07-14 15:07:00,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 197 states and 253 transitions. [2022-07-14 15:07:00,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:07:00,409 INFO L369 hiAutomatonCegarLoop]: Abstraction has 197 states and 253 transitions. [2022-07-14 15:07:00,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states and 253 transitions. [2022-07-14 15:07:00,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 50. [2022-07-14 15:07:00,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.28) internal successors, (64), 49 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:00,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-07-14 15:07:00,421 INFO L392 hiAutomatonCegarLoop]: Abstraction has 50 states and 64 transitions. [2022-07-14 15:07:00,421 INFO L374 stractBuchiCegarLoop]: Abstraction has 50 states and 64 transitions. [2022-07-14 15:07:00,421 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-14 15:07:00,421 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 64 transitions. [2022-07-14 15:07:00,423 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 28 [2022-07-14 15:07:00,423 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:07:00,423 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:07:00,424 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1] [2022-07-14 15:07:00,424 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-14 15:07:00,424 INFO L752 eck$LassoCheckResult]: Stem: 887#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); 859#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 860#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 893#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 894#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 890#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 891#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 898#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 897#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 896#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 895#L33-3 assume !(main_~x~0#1 < 100000); 853#L33-4 main_~x~0#1 := 0; 854#L39-3 assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; 867#L40-3 [2022-07-14 15:07:00,424 INFO L754 eck$LassoCheckResult]: Loop: 867#L40-3 assume !!(main_~y~0#1 < main_~n~0#1);call main_#t~mem7#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem8#1 := read~int(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~y~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 != main_#t~mem8#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 868#L13 assume !(0 == __VERIFIER_assert_~cond#1); 855#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem7#1;havoc main_#t~mem8#1; 856#L40-2 main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 867#L40-3 [2022-07-14 15:07:00,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:00,425 INFO L85 PathProgramCache]: Analyzing trace with hash 82232677, now seen corresponding path program 2 times [2022-07-14 15:07:00,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:00,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725839825] [2022-07-14 15:07:00,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:00,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:00,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:00,476 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-14 15:07:00,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:07:00,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725839825] [2022-07-14 15:07:00,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725839825] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:07:00,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:07:00,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 15:07:00,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834474908] [2022-07-14 15:07:00,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:07:00,477 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:07:00,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:00,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1915626, now seen corresponding path program 2 times [2022-07-14 15:07:00,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:00,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747594187] [2022-07-14 15:07:00,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:00,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:00,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:00,484 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:07:00,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:00,489 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:07:00,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:07:00,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 15:07:00,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 15:07:00,565 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. cyclomatic complexity: 20 Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:00,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:07:00,590 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2022-07-14 15:07:00,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 15:07:00,592 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 65 transitions. [2022-07-14 15:07:00,592 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2022-07-14 15:07:00,593 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 51 states and 63 transitions. [2022-07-14 15:07:00,593 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2022-07-14 15:07:00,593 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2022-07-14 15:07:00,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 63 transitions. [2022-07-14 15:07:00,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:07:00,594 INFO L369 hiAutomatonCegarLoop]: Abstraction has 51 states and 63 transitions. [2022-07-14 15:07:00,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 63 transitions. [2022-07-14 15:07:00,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-07-14 15:07:00,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.24) internal successors, (62), 49 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:00,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-07-14 15:07:00,599 INFO L392 hiAutomatonCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-07-14 15:07:00,599 INFO L374 stractBuchiCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-07-14 15:07:00,600 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-14 15:07:00,600 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 62 transitions. [2022-07-14 15:07:00,600 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2022-07-14 15:07:00,600 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:07:00,600 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:07:00,601 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:00,601 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 15:07:00,601 INFO L752 eck$LassoCheckResult]: Stem: 987#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); 964#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 965#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 990#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 991#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 995#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1001#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1000#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 999#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 997#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 996#L33-3 assume !(main_~x~0#1 < 100000); 962#L33-4 main_~x~0#1 := 0; 963#L39-3 assume !(main_~x~0#1 < main_~n~0#1); 979#L39-4 call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; 980#L47-3 [2022-07-14 15:07:00,601 INFO L754 eck$LassoCheckResult]: Loop: 980#L47-3 assume !!(main_~v~0#1 < 100000);call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; 981#L47-2 main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 980#L47-3 [2022-07-14 15:07:00,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:00,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1745754320, now seen corresponding path program 1 times [2022-07-14 15:07:00,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:00,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525462313] [2022-07-14 15:07:00,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:00,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:00,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:00,645 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:00,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:07:00,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525462313] [2022-07-14 15:07:00,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525462313] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:07:00,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166457897] [2022-07-14 15:07:00,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:00,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:07:00,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:00,648 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-14 15:07:00,678 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-14 15:07:00,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:00,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 15:07:00,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:07:00,733 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:00,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 15:07:00,793 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:00,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166457897] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 15:07:00,793 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 15:07:00,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-07-14 15:07:00,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031239073] [2022-07-14 15:07:00,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 15:07:00,794 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:07:00,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:00,794 INFO L85 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 1 times [2022-07-14 15:07:00,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:00,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533721341] [2022-07-14 15:07:00,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:00,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:00,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:00,798 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:07:00,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:00,801 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:07:00,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:07:00,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-14 15:07:00,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-07-14 15:07:00,833 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. cyclomatic complexity: 17 Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:01,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:07:01,035 INFO L93 Difference]: Finished difference Result 292 states and 374 transitions. [2022-07-14 15:07:01,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 15:07:01,036 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 292 states and 374 transitions. [2022-07-14 15:07:01,038 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 234 [2022-07-14 15:07:01,039 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 292 states to 292 states and 374 transitions. [2022-07-14 15:07:01,039 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 272 [2022-07-14 15:07:01,040 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 272 [2022-07-14 15:07:01,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 292 states and 374 transitions. [2022-07-14 15:07:01,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:07:01,041 INFO L369 hiAutomatonCegarLoop]: Abstraction has 292 states and 374 transitions. [2022-07-14 15:07:01,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states and 374 transitions. [2022-07-14 15:07:01,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 62. [2022-07-14 15:07:01,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 61 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:01,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2022-07-14 15:07:01,043 INFO L392 hiAutomatonCegarLoop]: Abstraction has 62 states and 74 transitions. [2022-07-14 15:07:01,043 INFO L374 stractBuchiCegarLoop]: Abstraction has 62 states and 74 transitions. [2022-07-14 15:07:01,044 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-14 15:07:01,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 74 transitions. [2022-07-14 15:07:01,044 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2022-07-14 15:07:01,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:07:01,044 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:07:01,045 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:01,045 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 15:07:01,045 INFO L752 eck$LassoCheckResult]: Stem: 1423#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); 1400#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 1401#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1431#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1432#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1426#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1427#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1448#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1447#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1446#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1445#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1444#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1443#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1442#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1441#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1440#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1439#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1438#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1437#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1436#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1435#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1434#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1433#L33-3 assume !(main_~x~0#1 < 100000); 1398#L33-4 main_~x~0#1 := 0; 1399#L39-3 assume !(main_~x~0#1 < main_~n~0#1); 1415#L39-4 call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; 1416#L47-3 [2022-07-14 15:07:01,045 INFO L754 eck$LassoCheckResult]: Loop: 1416#L47-3 assume !!(main_~v~0#1 < 100000);call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; 1417#L47-2 main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1416#L47-3 [2022-07-14 15:07:01,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:01,045 INFO L85 PathProgramCache]: Analyzing trace with hash -95702852, now seen corresponding path program 2 times [2022-07-14 15:07:01,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:01,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954797997] [2022-07-14 15:07:01,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:01,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:01,168 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:01,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:07:01,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954797997] [2022-07-14 15:07:01,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954797997] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:07:01,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227716436] [2022-07-14 15:07:01,169 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 15:07:01,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:07:01,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:01,170 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-14 15:07:01,181 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-14 15:07:01,251 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 15:07:01,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 15:07:01,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 15:07:01,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:07:01,302 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:01,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 15:07:01,506 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:01,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227716436] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 15:07:01,506 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 15:07:01,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-07-14 15:07:01,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158560169] [2022-07-14 15:07:01,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 15:07:01,507 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:07:01,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:01,507 INFO L85 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 2 times [2022-07-14 15:07:01,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:01,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415739081] [2022-07-14 15:07:01,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:01,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:01,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:01,522 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:07:01,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:01,525 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:07:01,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:07:01,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-14 15:07:01,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-07-14 15:07:01,559 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. cyclomatic complexity: 17 Second operand has 25 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:02,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:07:02,083 INFO L93 Difference]: Finished difference Result 592 states and 758 transitions. [2022-07-14 15:07:02,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-14 15:07:02,083 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 592 states and 758 transitions. [2022-07-14 15:07:02,087 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 474 [2022-07-14 15:07:02,090 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 592 states to 592 states and 758 transitions. [2022-07-14 15:07:02,090 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 548 [2022-07-14 15:07:02,090 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 548 [2022-07-14 15:07:02,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 592 states and 758 transitions. [2022-07-14 15:07:02,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:07:02,092 INFO L369 hiAutomatonCegarLoop]: Abstraction has 592 states and 758 transitions. [2022-07-14 15:07:02,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states and 758 transitions. [2022-07-14 15:07:02,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 86. [2022-07-14 15:07:02,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 86 states have (on average 1.1395348837209303) internal successors, (98), 85 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:02,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2022-07-14 15:07:02,096 INFO L392 hiAutomatonCegarLoop]: Abstraction has 86 states and 98 transitions. [2022-07-14 15:07:02,096 INFO L374 stractBuchiCegarLoop]: Abstraction has 86 states and 98 transitions. [2022-07-14 15:07:02,096 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-14 15:07:02,096 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 98 transitions. [2022-07-14 15:07:02,096 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2022-07-14 15:07:02,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:07:02,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:07:02,097 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 22, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:02,097 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 15:07:02,098 INFO L752 eck$LassoCheckResult]: Stem: 2258#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); 2234#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 2235#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2268#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2269#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2263#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2264#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2309#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2308#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2307#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2306#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2305#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2304#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2303#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2302#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2301#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2300#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2299#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2298#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2297#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2296#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2295#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2294#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2293#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2292#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2291#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2290#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2289#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2288#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2287#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2286#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2285#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2284#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2283#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2282#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2281#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2280#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2279#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2278#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2277#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2276#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2275#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2274#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2273#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2272#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2271#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2270#L33-3 assume !(main_~x~0#1 < 100000); 2230#L33-4 main_~x~0#1 := 0; 2231#L39-3 assume !(main_~x~0#1 < main_~n~0#1); 2250#L39-4 call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; 2251#L47-3 [2022-07-14 15:07:02,098 INFO L754 eck$LassoCheckResult]: Loop: 2251#L47-3 assume !!(main_~v~0#1 < 100000);call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; 2252#L47-2 main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2251#L47-3 [2022-07-14 15:07:02,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:02,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1293970900, now seen corresponding path program 3 times [2022-07-14 15:07:02,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:02,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040446375] [2022-07-14 15:07:02,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:02,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:02,410 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:02,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:07:02,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040446375] [2022-07-14 15:07:02,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040446375] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:07:02,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314793151] [2022-07-14 15:07:02,411 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 15:07:02,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:07:02,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:02,418 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-14 15:07:02,420 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-14 15:07:03,083 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2022-07-14 15:07:03,083 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 15:07:03,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-14 15:07:03,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:07:03,168 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:03,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 15:07:03,829 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:03,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314793151] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 15:07:03,829 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 15:07:03,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2022-07-14 15:07:03,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476604500] [2022-07-14 15:07:03,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 15:07:03,830 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:07:03,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:03,831 INFO L85 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 3 times [2022-07-14 15:07:03,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:03,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990604849] [2022-07-14 15:07:03,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:03,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:03,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:03,854 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:07:03,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:03,859 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:07:03,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:07:03,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-14 15:07:03,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-07-14 15:07:03,892 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. cyclomatic complexity: 17 Second operand has 49 states, 49 states have (on average 2.020408163265306) internal successors, (99), 49 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:05,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:07:05,347 INFO L93 Difference]: Finished difference Result 1192 states and 1526 transitions. [2022-07-14 15:07:05,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-07-14 15:07:05,348 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1192 states and 1526 transitions. [2022-07-14 15:07:05,355 INFO L131 ngComponentsAnalysis]: Automaton has 50 accepting balls. 954 [2022-07-14 15:07:05,361 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1192 states to 1192 states and 1526 transitions. [2022-07-14 15:07:05,361 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1100 [2022-07-14 15:07:05,362 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1100 [2022-07-14 15:07:05,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1192 states and 1526 transitions. [2022-07-14 15:07:05,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:07:05,363 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1192 states and 1526 transitions. [2022-07-14 15:07:05,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states and 1526 transitions. [2022-07-14 15:07:05,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 134. [2022-07-14 15:07:05,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 134 states have (on average 1.0895522388059702) internal successors, (146), 133 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:05,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2022-07-14 15:07:05,369 INFO L392 hiAutomatonCegarLoop]: Abstraction has 134 states and 146 transitions. [2022-07-14 15:07:05,370 INFO L374 stractBuchiCegarLoop]: Abstraction has 134 states and 146 transitions. [2022-07-14 15:07:05,370 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-14 15:07:05,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 134 states and 146 transitions. [2022-07-14 15:07:05,370 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2022-07-14 15:07:05,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:07:05,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:07:05,373 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [46, 46, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:05,373 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 15:07:05,373 INFO L752 eck$LassoCheckResult]: Stem: 3879#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); 3856#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 3857#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3887#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3888#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3882#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3883#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3976#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3975#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3974#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3973#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3972#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3971#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3970#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3969#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3968#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3967#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3966#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3965#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3964#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3963#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3962#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3961#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3960#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3959#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3958#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3957#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3956#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3955#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3954#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3953#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3952#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3951#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3950#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3949#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3948#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3947#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3946#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3945#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3944#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3943#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3942#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3941#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3940#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3939#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3938#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3937#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3936#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3935#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3934#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3933#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3932#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3931#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3930#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3929#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3928#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3927#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3926#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3925#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3924#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3923#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3922#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3921#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3920#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3919#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3918#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3917#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3916#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3915#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3914#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3913#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3912#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3911#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3910#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3909#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3908#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3907#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3906#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3905#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3904#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3903#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3902#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3901#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3900#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3899#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3898#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3897#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3896#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3895#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3894#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3893#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3892#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3891#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3890#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3889#L33-3 assume !(main_~x~0#1 < 100000); 3854#L33-4 main_~x~0#1 := 0; 3855#L39-3 assume !(main_~x~0#1 < main_~n~0#1); 3871#L39-4 call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; 3872#L47-3 [2022-07-14 15:07:05,373 INFO L754 eck$LassoCheckResult]: Loop: 3872#L47-3 assume !!(main_~v~0#1 < 100000);call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; 3873#L47-2 main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3872#L47-3 [2022-07-14 15:07:05,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:05,374 INFO L85 PathProgramCache]: Analyzing trace with hash -675115004, now seen corresponding path program 4 times [2022-07-14 15:07:05,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:05,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144978216] [2022-07-14 15:07:05,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:05,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:05,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:06,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:06,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:07:06,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144978216] [2022-07-14 15:07:06,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144978216] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:07:06,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139121195] [2022-07-14 15:07:06,338 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-14 15:07:06,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:07:06,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:06,344 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-14 15:07:06,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-14 15:07:06,490 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-14 15:07:06,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 15:07:06,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-14 15:07:06,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:07:06,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:06,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 15:07:09,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:09,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139121195] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 15:07:09,113 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 15:07:09,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2022-07-14 15:07:09,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238813655] [2022-07-14 15:07:09,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 15:07:09,114 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:07:09,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:09,114 INFO L85 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 4 times [2022-07-14 15:07:09,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:09,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141542397] [2022-07-14 15:07:09,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:09,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:09,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:09,121 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:07:09,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:09,124 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:07:09,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:07:09,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2022-07-14 15:07:09,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2022-07-14 15:07:09,160 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. cyclomatic complexity: 17 Second operand has 97 states, 97 states have (on average 2.0103092783505154) internal successors, (195), 97 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:17,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:07:17,118 INFO L93 Difference]: Finished difference Result 2392 states and 3062 transitions. [2022-07-14 15:07:17,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-07-14 15:07:17,119 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2392 states and 3062 transitions. [2022-07-14 15:07:17,132 INFO L131 ngComponentsAnalysis]: Automaton has 98 accepting balls. 1914 [2022-07-14 15:07:17,143 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2392 states to 2392 states and 3062 transitions. [2022-07-14 15:07:17,143 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2204 [2022-07-14 15:07:17,145 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2204 [2022-07-14 15:07:17,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2392 states and 3062 transitions. [2022-07-14 15:07:17,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:07:17,147 INFO L369 hiAutomatonCegarLoop]: Abstraction has 2392 states and 3062 transitions. [2022-07-14 15:07:17,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states and 3062 transitions. [2022-07-14 15:07:17,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 230. [2022-07-14 15:07:17,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 230 states have (on average 1.0521739130434782) internal successors, (242), 229 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:17,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 242 transitions. [2022-07-14 15:07:17,156 INFO L392 hiAutomatonCegarLoop]: Abstraction has 230 states and 242 transitions. [2022-07-14 15:07:17,156 INFO L374 stractBuchiCegarLoop]: Abstraction has 230 states and 242 transitions. [2022-07-14 15:07:17,157 INFO L287 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-14 15:07:17,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 230 states and 242 transitions. [2022-07-14 15:07:17,158 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2022-07-14 15:07:17,158 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:07:17,158 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:07:17,160 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [94, 94, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:17,160 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 15:07:17,160 INFO L752 eck$LassoCheckResult]: Stem: 7087#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); 7064#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 7065#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7095#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7096#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7090#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7091#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7280#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7279#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7278#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7277#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7276#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7275#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7274#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7273#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7272#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7271#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7270#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7269#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7268#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7267#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7266#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7265#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7264#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7263#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7262#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7261#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7260#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7259#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7258#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7257#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7256#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7255#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7254#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7253#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7252#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7251#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7250#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7249#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7248#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7247#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7246#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7245#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7244#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7243#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7242#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7241#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7240#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7239#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7238#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7237#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7236#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7235#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7234#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7233#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7232#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7231#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7230#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7229#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7228#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7227#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7226#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7225#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7224#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7223#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7222#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7221#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7220#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7219#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7218#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7217#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7216#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7215#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7214#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7213#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7212#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7211#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7210#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7209#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7208#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7207#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7206#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7205#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7204#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7203#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7202#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7201#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7200#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7199#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7198#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7197#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7196#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7195#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7194#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7193#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7192#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7191#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7190#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7189#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7188#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7187#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7186#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7185#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7184#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7183#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7182#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7181#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7180#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7179#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7178#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7177#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7176#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7175#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7174#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7173#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7172#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7171#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7170#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7169#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7168#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7167#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7166#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7165#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7164#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7163#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7162#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7161#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7160#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7159#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7158#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7157#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7156#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7155#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7154#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7153#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7152#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7151#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7150#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7149#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7148#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7147#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7146#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7145#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7144#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7143#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7142#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7141#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7140#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7139#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7138#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7137#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7136#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7135#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7134#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7133#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7132#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7131#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7130#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7129#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7128#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7127#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7126#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7125#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7124#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7123#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7122#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7121#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7120#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7119#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7118#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7117#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7116#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7115#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7114#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7113#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7112#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7111#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7110#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7109#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7108#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7107#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7106#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7105#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7104#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7103#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7102#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7101#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7100#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7099#L33-3 assume !!(main_~x~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7098#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7097#L33-3 assume !(main_~x~0#1 < 100000); 7062#L33-4 main_~x~0#1 := 0; 7063#L39-3 assume !(main_~x~0#1 < main_~n~0#1); 7079#L39-4 call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; 7080#L47-3 [2022-07-14 15:07:17,160 INFO L754 eck$LassoCheckResult]: Loop: 7080#L47-3 assume !!(main_~v~0#1 < 100000);call write~int(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; 7081#L47-2 main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 7080#L47-3 [2022-07-14 15:07:17,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:17,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1064733596, now seen corresponding path program 5 times [2022-07-14 15:07:17,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:17,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558651932] [2022-07-14 15:07:17,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:17,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:17,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:20,352 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:20,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:07:20,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558651932] [2022-07-14 15:07:20,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558651932] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:07:20,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756929858] [2022-07-14 15:07:20,353 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-14 15:07:20,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:07:20,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:20,355 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:07:20,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process