/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf -i ../../../trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 11:59:13,127 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 11:59:13,131 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 11:59:13,210 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 11:59:13,210 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 11:59:13,212 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 11:59:13,220 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 11:59:13,225 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 11:59:13,231 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 11:59:13,238 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 11:59:13,239 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 11:59:13,241 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 11:59:13,241 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 11:59:13,244 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 11:59:13,246 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 11:59:13,248 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 11:59:13,250 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 11:59:13,251 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 11:59:13,255 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 11:59:13,264 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 11:59:13,267 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 11:59:13,268 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 11:59:13,272 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 11:59:13,273 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 11:59:13,276 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 11:59:13,286 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 11:59:13,287 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 11:59:13,287 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 11:59:13,288 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 11:59:13,289 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 11:59:13,291 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 11:59:13,291 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 11:59:13,293 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 11:59:13,294 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 11:59:13,295 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 11:59:13,296 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 11:59:13,297 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 11:59:13,298 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 11:59:13,298 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 11:59:13,298 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 11:59:13,300 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 11:59:13,302 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 11:59:13,309 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2022-07-22 11:59:13,363 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 11:59:13,364 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 11:59:13,364 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 11:59:13,364 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 11:59:13,366 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 11:59:13,366 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 11:59:13,366 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 11:59:13,367 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 11:59:13,367 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 11:59:13,367 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 11:59:13,367 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 11:59:13,368 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 11:59:13,368 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 11:59:13,368 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 11:59:13,368 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 11:59:13,369 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 11:59:13,369 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 11:59:13,369 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 11:59:13,369 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 11:59:13,370 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 11:59:13,370 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 11:59:13,370 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 11:59:13,370 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 11:59:13,371 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 11:59:13,371 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 11:59:13,371 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 11:59:13,371 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 11:59:13,372 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 11:59:13,372 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 11:59:13,372 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 11:59:13,372 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 11:59:13,373 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 11:59:13,374 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 11:59:13,375 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 [2022-07-22 11:59:13,734 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 11:59:13,765 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 11:59:13,768 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 11:59:13,769 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 11:59:13,771 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 11:59:13,772 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c [2022-07-22 11:59:13,864 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/031317907/09b25722988f40c7915015202b355e08/FLAG70bc7d50c [2022-07-22 11:59:14,494 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 11:59:14,494 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c [2022-07-22 11:59:14,504 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/031317907/09b25722988f40c7915015202b355e08/FLAG70bc7d50c [2022-07-22 11:59:14,824 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/031317907/09b25722988f40c7915015202b355e08 [2022-07-22 11:59:14,828 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 11:59:14,835 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 11:59:14,839 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 11:59:14,839 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 11:59:14,843 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 11:59:14,844 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:59:14" (1/1) ... [2022-07-22 11:59:14,845 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21bb77a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:59:14, skipping insertion in model container [2022-07-22 11:59:14,846 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:59:14" (1/1) ... [2022-07-22 11:59:14,854 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 11:59:14,882 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 11:59:15,147 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c[2396,2409] [2022-07-22 11:59:15,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:59:15,163 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 11:59:15,189 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c[2396,2409] [2022-07-22 11:59:15,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:59:15,210 INFO L208 MainTranslator]: Completed translation [2022-07-22 11:59:15,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:59:15 WrapperNode [2022-07-22 11:59:15,210 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 11:59:15,211 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 11:59:15,212 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 11:59:15,212 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 11:59:15,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:59:15" (1/1) ... [2022-07-22 11:59:15,229 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:59:15" (1/1) ... [2022-07-22 11:59:15,261 INFO L137 Inliner]: procedures = 25, calls = 34, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 99 [2022-07-22 11:59:15,264 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 11:59:15,265 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 11:59:15,265 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 11:59:15,265 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 11:59:15,275 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:59:15" (1/1) ... [2022-07-22 11:59:15,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:59:15" (1/1) ... [2022-07-22 11:59:15,296 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:59:15" (1/1) ... [2022-07-22 11:59:15,297 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:59:15" (1/1) ... [2022-07-22 11:59:15,307 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:59:15" (1/1) ... [2022-07-22 11:59:15,312 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:59:15" (1/1) ... [2022-07-22 11:59:15,315 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:59:15" (1/1) ... [2022-07-22 11:59:15,318 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 11:59:15,320 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 11:59:15,320 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 11:59:15,320 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 11:59:15,323 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:59:15" (1/1) ... [2022-07-22 11:59:15,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:59:15,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:59:15,361 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-22 11:59:15,372 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-22 11:59:15,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 11:59:15,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 11:59:15,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 11:59:15,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 11:59:15,432 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 11:59:15,433 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 11:59:15,434 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 11:59:15,434 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 11:59:15,434 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-22 11:59:15,435 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-22 11:59:15,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 11:59:15,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 11:59:15,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 11:59:15,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 11:59:15,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 11:59:15,438 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-22 11:59:15,579 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 11:59:15,581 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 11:59:16,043 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 11:59:16,063 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 11:59:16,063 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-22 11:59:16,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:59:16 BoogieIcfgContainer [2022-07-22 11:59:16,086 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 11:59:16,090 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 11:59:16,090 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 11:59:16,098 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 11:59:16,102 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 11:59:16,102 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 11:59:14" (1/3) ... [2022-07-22 11:59:16,103 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47cc6bfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 11:59:16, skipping insertion in model container [2022-07-22 11:59:16,104 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 11:59:16,109 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:59:15" (2/3) ... [2022-07-22 11:59:16,109 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47cc6bfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 11:59:16, skipping insertion in model container [2022-07-22 11:59:16,109 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 11:59:16,110 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:59:16" (3/3) ... [2022-07-22 11:59:16,111 INFO L322 chiAutomizerObserver]: Analyzing ICFG popl20-more-sum-array-hom.wvr.c [2022-07-22 11:59:16,238 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-07-22 11:59:16,276 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 154 places, 159 transitions, 342 flow [2022-07-22 11:59:16,432 INFO L129 PetriNetUnfolder]: 12/153 cut-off events. [2022-07-22 11:59:16,432 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-22 11:59:16,440 INFO L84 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 153 events. 12/153 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 102 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 114. Up to 2 conditions per place. [2022-07-22 11:59:16,440 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 159 transitions, 342 flow [2022-07-22 11:59:16,455 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 153 transitions, 324 flow [2022-07-22 11:59:16,474 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 11:59:16,474 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 11:59:16,474 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 11:59:16,474 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 11:59:16,475 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 11:59:16,475 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 11:59:16,475 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 11:59:16,475 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 11:59:16,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 11:59:17,533 INFO L131 ngComponentsAnalysis]: Automaton has 335 accepting balls. 6082 [2022-07-22 11:59:17,533 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 11:59:17,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 11:59:17,552 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:59:17,552 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-22 11:59:17,552 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 11:59:17,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 6601 states, but on-demand construction may add more states [2022-07-22 11:59:17,768 INFO L131 ngComponentsAnalysis]: Automaton has 335 accepting balls. 6082 [2022-07-22 11:59:17,768 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 11:59:17,768 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 11:59:17,770 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:59:17,770 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-22 11:59:17,778 INFO L748 eck$LassoCheckResult]: Stem: 157#[ULTIMATE.startENTRY]don't care [342] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 160#[L-1]don't care [242] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 162#[L-1-1]don't care [351] L-1-1-->L-1-2: Formula: (= (select |v_#valid_4| 0) 0) InVars {#valid=|v_#valid_4|} OutVars{#valid=|v_#valid_4|} AuxVars[] AssignedVars[] 164#[L-1-2]don't care [352] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 166#[L21]don't care [311] L21-->L21-1: Formula: (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_4| 1))) InVars {#length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] 168#[L21-1]don't care [338] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_4| 1) 0)) InVars {#memory_int=|v_#memory_int_4|} OutVars{#memory_int=|v_#memory_int_4|} AuxVars[] AssignedVars[] 170#[L21-2]don't care [249] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_5| 1) 1) 0) InVars {#memory_int=|v_#memory_int_5|} OutVars{#memory_int=|v_#memory_int_5|} AuxVars[] AssignedVars[] 172#[L21-3]don't care [298] L21-3-->L21-4: Formula: (and (= 32 (select |v_#length_5| 2)) (= (select |v_#valid_6| 2) 1)) InVars {#length=|v_#length_5|, #valid=|v_#valid_6|} OutVars{#length=|v_#length_5|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[] 174#[L21-4]don't care [269] L21-4-->L42: Formula: (and (= v_~A~0.base_4 0) (= v_~A~0.offset_4 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_4, ~A~0.offset=v_~A~0.offset_4} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset] 176#[L42]don't care [257] L42-->L42-1: Formula: (= v_~sum1~0_3 0) InVars {} OutVars{~sum1~0=v_~sum1~0_3} AuxVars[] AssignedVars[~sum1~0] 178#[L42-1]don't care [339] L42-1-->L42-2: Formula: (= v_~sum2~0_3 0) InVars {} OutVars{~sum2~0=v_~sum2~0_3} AuxVars[] AssignedVars[~sum2~0] 180#[L42-2]don't care [264] L42-2-->L43: Formula: (= v_~sum3~0_3 0) InVars {} OutVars{~sum3~0=v_~sum3~0_3} AuxVars[] AssignedVars[~sum3~0] 182#[L43]don't care [345] L43-->L43-1: Formula: (= v_~M~0_4 0) InVars {} OutVars{~M~0=v_~M~0_4} AuxVars[] AssignedVars[~M~0] 184#[L43-1]don't care [235] L43-1-->L-1-3: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0] 186#[L-1-3]don't care [355] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 188#[L-1-4]don't care [246] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 190#[L-1-5]don't care [221] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 192#[L-1-6]don't care [330] L-1-6-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_1|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_1|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_1|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_1|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_1|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_1|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_1|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~#t2~0#1.base] 194#[L72]don't care [273] L72-->L72-1: Formula: (and (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= |v_#length_6| (store |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= |v_#valid_7| (store |v_#valid_8| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 196#[L72-1]don't care [279] L72-1-->L72-2: Formula: (and (= |v_#length_8| (store |v_#length_9| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (= (store |v_#valid_10| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_9|) (= (select |v_#valid_10| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_9|, #valid=|v_#valid_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 198#[L72-2]don't care [213] L72-2-->L72-3: Formula: (and (= |v_#valid_11| (store |v_#valid_12| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 1)) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_2| 0) (not (= |v_ULTIMATE.start_main_~#t3~0#1.base_2| 0)) (= (select |v_#valid_12| |v_ULTIMATE.start_main_~#t3~0#1.base_2|) 0) (= |v_#length_10| (store |v_#length_11| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 4)) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t3~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_11|, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_10|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_2|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t3~0#1.offset, #valid, ULTIMATE.start_main_~#t3~0#1.base, #length] 200#[L72-3]don't care [244] L72-3-->L75: Formula: (= |v_ULTIMATE.start_main_#t~nondet7#1_2| v_~M~0_5) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} OutVars{~M~0=v_~M~0_5, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[~M~0] 202#[L75]don't care [261] L75-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 204#[L76]don't care [274] L76-->L76-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_2| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0] 206#[L76-1]don't care [336] L76-1-->L77: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 208#[L77]don't care [288] L77-->L77-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 210#[L77-1]don't care [304] L77-1-->L77-2: Formula: (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_1| v_~N~0_7) InVars {~N~0=v_~N~0_7} OutVars{ULTIMATE.start_create_fresh_uint_array_#in~size#1=|v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_1|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#in~size#1] 212#[L77-2]don't care [243] L77-2-->L77-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_1|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#res#1.base, ULTIMATE.start_create_fresh_uint_array_#res#1.offset] 214#[L77-3]don't care [289] L77-3-->L95: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_1|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_1|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_1|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_1|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_1|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_1|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ULTIMATE.start_create_fresh_uint_array_~i~3#1, ULTIMATE.start_create_fresh_uint_array_~size#1, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_uint_array_#t~post20#1, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset] 216#[L95]don't care [305] L95-->L96: Formula: (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_2| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_2|) InVars {ULTIMATE.start_create_fresh_uint_array_#in~size#1=|v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_uint_array_#in~size#1=|v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_2|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_~size#1] 218#[L96]don't care [327] L96-->L96-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 220#[L96-1]don't care [280] L96-1-->L96-2: Formula: (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_uint_array_~size#1_3|) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|) InVars {ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 222#[L96-2]don't care [226] L96-2-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 224#[L37]don't care [258] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 226#[L38]don't care [271] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] 230#[L37-1]don't care [259] L37-1-->L97: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 232#[L97]don't care [286] L97-->L97-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 234#[L97-1]don't care [297] L97-1-->L97-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| (ite (<= (mod |v_ULTIMATE.start_create_fresh_uint_array_~size#1_4| 4294967296) 1073741823) 1 0)) InVars {ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_4|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 236#[L97-2]don't care [349] L97-2-->L37-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 238#[L37-2]don't care [224] L37-2-->L38-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 240#[L38-3]don't care [238] L38-3-->L37-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_8| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} AuxVars[] AssignedVars[] 244#[L37-3]don't care [231] L37-3-->L99: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 246#[L99]don't care [319] L99-->L99-1: Formula: (and (= |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_2| 0) (not (= |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_2| 0)) (= |v_#valid_13| (store |v_#valid_14| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_2| 1)) (< |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_2| |v_#StackHeapBarrier_5|) (= (select |v_#valid_14| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_2|) 0) (= (store |v_#length_13| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_2| (* 4 |v_ULTIMATE.start_create_fresh_uint_array_~size#1_5|)) |v_#length_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_13|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_5|, #valid=|v_#valid_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_5|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_5|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_2|, #valid=|v_#valid_13|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_2|, #length=|v_#length_12|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset, #valid, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base, #length] 248#[L99-1]don't care [248] L99-1-->L99-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_2| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_3|) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_2| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_3|)) InVars {ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_3|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_3|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset] 250#[L99-2]don't care [331] L99-2-->L100: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_4|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base] 252#[L100]don't care [256] L100-->L100-6: Formula: (= |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_~i~3#1] 254#[L100-6]don't care [2022-07-22 11:59:17,779 INFO L750 eck$LassoCheckResult]: Loop: 254#[L100-6]don't care [294] L100-6-->L101: Formula: (< |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_4| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_7|) InVars {ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_4|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_7|} OutVars{ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_4|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_7|} AuxVars[] AssignedVars[] 258#[L101]don't care [343] L101-->L101-1: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_5| 4))) (let ((.cse1 (+ |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_3| .cse0))) (and (<= (+ |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_3| .cse0 4) (select |v_#length_14| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_3|)) (= (store |v_#memory_int_7| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_3| (store (select |v_#memory_int_7| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_3|) .cse1 |v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_2|)) |v_#memory_int_6|) (= (select |v_#valid_15| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_3|) 1) (<= 0 .cse1)))) InVars {ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_2|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_5|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_3|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_7|, #length=|v_#length_14|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_2|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_5|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_3|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_14|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] 262#[L101-1]don't care [225] L101-1-->L100-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1] 266#[L100-3]don't care [316] L100-3-->L100-4: Formula: (= |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_6| |v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_2|) InVars {ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_6|} OutVars{ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_6|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#t~post20#1] 270#[L100-4]don't care [212] L100-4-->L100-5: Formula: (= (+ |v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_3| 1) |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_7|) InVars {ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_3|} OutVars{ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_7|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_~i~3#1] 274#[L100-5]don't care [325] L100-5-->L100-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#t~post20#1] 254#[L100-6]don't care [2022-07-22 11:59:17,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:59:17,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1976004108, now seen corresponding path program 1 times [2022-07-22 11:59:17,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:59:17,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016571846] [2022-07-22 11:59:17,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:59:17,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:59:17,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:59:17,965 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:59:18,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:59:18,038 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:59:18,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:59:18,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1038320734, now seen corresponding path program 1 times [2022-07-22 11:59:18,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:59:18,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357745433] [2022-07-22 11:59:18,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:59:18,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:59:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:59:18,070 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:59:18,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:59:18,092 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:59:18,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:59:18,096 INFO L85 PathProgramCache]: Analyzing trace with hash -600468463, now seen corresponding path program 1 times [2022-07-22 11:59:18,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:59:18,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954588820] [2022-07-22 11:59:18,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:59:18,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:59:18,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:59:18,164 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:59:18,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:59:18,249 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:59:20,269 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 11:59:20,270 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 11:59:20,270 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 11:59:20,270 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 11:59:20,270 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 11:59:20,270 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:59:20,271 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 11:59:20,271 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 11:59:20,271 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-sum-array-hom.wvr.c_BEv2_Iteration1_Lasso [2022-07-22 11:59:20,271 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 11:59:20,271 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 11:59:20,297 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-22 11:59:20,303 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-22 11:59:20,305 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-22 11:59:20,307 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-22 11:59:20,311 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-22 11:59:20,316 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-22 11:59:20,321 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-22 11:59:20,324 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-22 11:59:20,326 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-22 11:59:20,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-22 11:59:20,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-22 11:59:20,333 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-22 11:59:20,337 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-22 11:59:20,339 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-22 11:59:20,342 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-22 11:59:20,345 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-22 11:59:20,347 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-22 11:59:20,749 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-22 11:59:20,754 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-22 11:59:20,763 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-22 11:59:20,766 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-22 11:59:20,769 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-22 11:59:20,771 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-22 11:59:20,774 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-22 11:59:20,776 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-22 11:59:20,778 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-22 11:59:20,781 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-22 11:59:20,783 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-22 11:59:20,785 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-22 11:59:20,787 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-22 11:59:20,791 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-22 11:59:20,793 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-22 11:59:20,795 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-22 11:59:20,797 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-22 11:59:20,799 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-22 11:59:20,801 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-22 11:59:20,803 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-22 11:59:20,805 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-22 11:59:21,335 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 11:59:21,340 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 11:59:21,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:59:21,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:59:21,350 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-22 11:59:21,367 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:59:21,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:59:21,378 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:59:21,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:59:21,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:59:21,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:59:21,384 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:59:21,385 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:59:21,386 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-22 11:59:21,398 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:59:21,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-22 11:59:21,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:59:21,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:59:21,433 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-22 11:59:21,438 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-22 11:59:21,440 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-22 11:59:21,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:59:21,447 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:59:21,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:59:21,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:59:21,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:59:21,449 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:59:21,449 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:59:21,463 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:59:21,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-22 11:59:21,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:59:21,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:59:21,492 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-22 11:59:21,493 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-22 11:59:21,494 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-22 11:59:21,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:59:21,501 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:59:21,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:59:21,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:59:21,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:59:21,503 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:59:21,503 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:59:21,507 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:59:21,532 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-22 11:59:21,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:59:21,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:59:21,535 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-22 11:59:21,538 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-22 11:59:21,538 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-22 11:59:21,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:59:21,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:59:21,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:59:21,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:59:21,556 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:59:21,556 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:59:21,570 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:59:21,604 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-22 11:59:21,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:59:21,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:59:21,607 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-22 11:59:21,614 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-22 11:59:21,615 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-22 11:59:21,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:59:21,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:59:21,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:59:21,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:59:21,631 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:59:21,632 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:59:21,649 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:59:21,686 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-22 11:59:21,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:59:21,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:59:21,688 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-22 11:59:21,691 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-22 11:59:21,691 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-22 11:59:21,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:59:21,701 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:59:21,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:59:21,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:59:21,701 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:59:21,702 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:59:21,702 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:59:21,706 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:59:21,729 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-22 11:59:21,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:59:21,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:59:21,731 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-22 11:59:21,732 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-22 11:59:21,737 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-22 11:59:21,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:59:21,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:59:21,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:59:21,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:59:21,747 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:59:21,748 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:59:21,772 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:59:21,809 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-22 11:59:21,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:59:21,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:59:21,811 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-22 11:59:21,814 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-22 11:59:21,814 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-22 11:59:21,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:59:21,823 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:59:21,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:59:21,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:59:21,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:59:21,825 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:59:21,825 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:59:21,840 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:59:21,878 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-22 11:59:21,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:59:21,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:59:21,880 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-22 11:59:21,881 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-22 11:59:21,882 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-22 11:59:21,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:59:21,889 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:59:21,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:59:21,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:59:21,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:59:21,890 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:59:21,890 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:59:21,891 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:59:21,913 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-22 11:59:21,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:59:21,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:59:21,915 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-22 11:59:21,921 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-22 11:59:21,921 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-22 11:59:21,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:59:21,929 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:59:21,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:59:21,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:59:21,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:59:21,930 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:59:21,930 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:59:21,941 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:59:21,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2022-07-22 11:59:21,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:59:21,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:59:21,966 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-22 11:59:21,967 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-22 11:59:21,968 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-22 11:59:21,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:59:21,975 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:59:21,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:59:21,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:59:21,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:59:21,976 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:59:21,977 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:59:21,987 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:59:22,010 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-22 11:59:22,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:59:22,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:59:22,012 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-22 11:59:22,012 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-22 11:59:22,013 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-22 11:59:22,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:59:22,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:59:22,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:59:22,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:59:22,024 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:59:22,024 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:59:22,037 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:59:22,061 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-22 11:59:22,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:59:22,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:59:22,062 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-22 11:59:22,063 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-22 11:59:22,064 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-22 11:59:22,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:59:22,071 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:59:22,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:59:22,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:59:22,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:59:22,077 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:59:22,077 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:59:22,083 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:59:22,104 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-22 11:59:22,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:59:22,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:59:22,106 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:59:22,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-22 11:59:22,107 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-22 11:59:22,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:59:22,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:59:22,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:59:22,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:59:22,118 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:59:22,118 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:59:22,143 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:59:22,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-22 11:59:22,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:59:22,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:59:22,180 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:59:22,187 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-22 11:59:22,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:59:22,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:59:22,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:59:22,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:59:22,200 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:59:22,200 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:59:22,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-22 11:59:22,211 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:59:22,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-22 11:59:22,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:59:22,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:59:22,248 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:59:22,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-22 11:59:22,252 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-22 11:59:22,259 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:59:22,259 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:59:22,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:59:22,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:59:22,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:59:22,263 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:59:22,263 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:59:22,264 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:59:22,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-22 11:59:22,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:59:22,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:59:22,291 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:59:22,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-22 11:59:22,296 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-22 11:59:22,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:59:22,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:59:22,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:59:22,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:59:22,312 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:59:22,312 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:59:22,330 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:59:22,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-22 11:59:22,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:59:22,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:59:22,366 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:59:22,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-22 11:59:22,371 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-22 11:59:22,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:59:22,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:59:22,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:59:22,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:59:22,382 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:59:22,382 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:59:22,398 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:59:22,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-22 11:59:22,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:59:22,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:59:22,436 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:59:22,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-22 11:59:22,440 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-22 11:59:22,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:59:22,449 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:59:22,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:59:22,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:59:22,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:59:22,450 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:59:22,450 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:59:22,463 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:59:22,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-22 11:59:22,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:59:22,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:59:22,493 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:59:22,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-22 11:59:22,497 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-22 11:59:22,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:59:22,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:59:22,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:59:22,505 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:59:22,507 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:59:22,507 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:59:22,510 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:59:22,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-22 11:59:22,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:59:22,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:59:22,535 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:59:22,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-22 11:59:22,537 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-22 11:59:22,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:59:22,544 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:59:22,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:59:22,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:59:22,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:59:22,545 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:59:22,545 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:59:22,546 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:59:22,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-07-22 11:59:22,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:59:22,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:59:22,571 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:59:22,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-22 11:59:22,575 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-22 11:59:22,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:59:22,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:59:22,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:59:22,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:59:22,584 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:59:22,584 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:59:22,587 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:59:22,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-22 11:59:22,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:59:22,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:59:22,613 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:59:22,614 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-22 11:59:22,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-22 11:59:22,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:59:22,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:59:22,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:59:22,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:59:22,624 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:59:22,624 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:59:22,628 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:59:22,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-22 11:59:22,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:59:22,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:59:22,653 INFO L229 MonitoredProcess]: Starting monitored process 25 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-22 11:59:22,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-22 11:59:22,655 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-22 11:59:22,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:59:22,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:59:22,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:59:22,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:59:22,665 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:59:22,665 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:59:22,673 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:59:22,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-07-22 11:59:22,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:59:22,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:59:22,697 INFO L229 MonitoredProcess]: Starting monitored process 26 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-22 11:59:22,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-22 11:59:22,699 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-22 11:59:22,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:59:22,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:59:22,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:59:22,706 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:59:22,709 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:59:22,710 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:59:22,714 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:59:22,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-22 11:59:22,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:59:22,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:59:22,738 INFO L229 MonitoredProcess]: Starting monitored process 27 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-22 11:59:22,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-22 11:59:22,740 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-22 11:59:22,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:59:22,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:59:22,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:59:22,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:59:22,749 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:59:22,750 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:59:22,753 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:59:22,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-07-22 11:59:22,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:59:22,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:59:22,777 INFO L229 MonitoredProcess]: Starting monitored process 28 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-22 11:59:22,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-22 11:59:22,779 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-22 11:59:22,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:59:22,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:59:22,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:59:22,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:59:22,789 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:59:22,789 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:59:22,798 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:59:22,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-07-22 11:59:22,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:59:22,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:59:22,823 INFO L229 MonitoredProcess]: Starting monitored process 29 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-22 11:59:22,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-22 11:59:22,826 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-22 11:59:22,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:59:22,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:59:22,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:59:22,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:59:22,839 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:59:22,839 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:59:22,851 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 11:59:22,898 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2022-07-22 11:59:22,899 INFO L444 ModelExtractionUtils]: 10 out of 22 variables were initially zero. Simplification set additionally 9 variables to zero. [2022-07-22 11:59:22,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:59:22,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:59:22,902 INFO L229 MonitoredProcess]: Starting monitored process 30 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-22 11:59:22,919 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 11:59:22,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-07-22 11:59:22,941 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 11:59:22,942 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 11:59:22,943 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_uint_array_~i~3#1, ULTIMATE.start_create_fresh_uint_array_~size#1) = -1*ULTIMATE.start_create_fresh_uint_array_~i~3#1 + 1*ULTIMATE.start_create_fresh_uint_array_~size#1 Supporting invariants [] [2022-07-22 11:59:23,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-07-22 11:59:23,140 INFO L257 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2022-07-22 11:59:23,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:59:23,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:59:23,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 11:59:23,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:59:23,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:59:23,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 11:59:23,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:59:23,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-07-22 11:59:23,435 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-22 11:59:23,479 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2022-07-22 11:59:23,482 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 6601 states, but on-demand construction may add more states Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-22 11:59:23,927 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 6601 states, but on-demand construction may add more states. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 13181 states and 50350 transitions. Complement of second has 8 states. [2022-07-22 11:59:23,929 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-22 11:59:23,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-22 11:59:23,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 172 transitions. [2022-07-22 11:59:23,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 172 transitions. Stem has 46 letters. Loop has 6 letters. [2022-07-22 11:59:23,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:59:23,943 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 11:59:23,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:59:24,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:59:24,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 11:59:24,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:59:24,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:59:24,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 11:59:24,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:59:24,140 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-22 11:59:24,141 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2022-07-22 11:59:24,141 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 6601 states, but on-demand construction may add more states Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-22 11:59:24,535 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 6601 states, but on-demand construction may add more states. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 13175 states and 50343 transitions. Complement of second has 10 states. [2022-07-22 11:59:24,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-07-22 11:59:24,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-22 11:59:24,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 173 transitions. [2022-07-22 11:59:24,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 173 transitions. Stem has 46 letters. Loop has 6 letters. [2022-07-22 11:59:24,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:59:24,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 173 transitions. Stem has 52 letters. Loop has 6 letters. [2022-07-22 11:59:24,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:59:24,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 173 transitions. Stem has 46 letters. Loop has 12 letters. [2022-07-22 11:59:24,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:59:24,540 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13175 states and 50343 transitions. [2022-07-22 11:59:24,830 INFO L131 ngComponentsAnalysis]: Automaton has 334 accepting balls. 6076 [2022-07-22 11:59:24,963 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13175 states to 6437 states and 24528 transitions. [2022-07-22 11:59:24,964 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6430 [2022-07-22 11:59:24,984 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6431 [2022-07-22 11:59:24,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6437 states and 24528 transitions. [2022-07-22 11:59:25,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 11:59:25,018 INFO L220 hiAutomatonCegarLoop]: Abstraction has 6437 states and 24528 transitions. [2022-07-22 11:59:25,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6437 states and 24528 transitions. [2022-07-22 11:59:25,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6437 to 6437. [2022-07-22 11:59:25,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6437 states, 6437 states have (on average 3.81047071617213) internal successors, (24528), 6436 states have internal predecessors, (24528), 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-22 11:59:25,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6437 states to 6437 states and 24528 transitions. [2022-07-22 11:59:25,508 INFO L242 hiAutomatonCegarLoop]: Abstraction has 6437 states and 24528 transitions. [2022-07-22 11:59:25,508 INFO L425 stractBuchiCegarLoop]: Abstraction has 6437 states and 24528 transitions. [2022-07-22 11:59:25,508 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 11:59:25,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6437 states and 24528 transitions. [2022-07-22 11:59:25,581 INFO L131 ngComponentsAnalysis]: Automaton has 334 accepting balls. 6076 [2022-07-22 11:59:25,581 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 11:59:25,581 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 11:59:25,584 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:59:25,584 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:59:25,586 INFO L748 eck$LassoCheckResult]: Stem: 53013#[ULTIMATE.startENTRY]don't care [342] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 52423#[L-1]don't care [242] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 43391#[L-1-1]don't care [351] L-1-1-->L-1-2: Formula: (= (select |v_#valid_4| 0) 0) InVars {#valid=|v_#valid_4|} OutVars{#valid=|v_#valid_4|} AuxVars[] AssignedVars[] 43393#[L-1-2]don't care [352] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 49053#[L21]don't care [311] L21-->L21-1: Formula: (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_4| 1))) InVars {#length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] 49055#[L21-1]don't care [338] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_4| 1) 0)) InVars {#memory_int=|v_#memory_int_4|} OutVars{#memory_int=|v_#memory_int_4|} AuxVars[] AssignedVars[] 52595#[L21-2]don't care [249] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_5| 1) 1) 0) InVars {#memory_int=|v_#memory_int_5|} OutVars{#memory_int=|v_#memory_int_5|} AuxVars[] AssignedVars[] 52597#[L21-3]don't care [298] L21-3-->L21-4: Formula: (and (= 32 (select |v_#length_5| 2)) (= (select |v_#valid_6| 2) 1)) InVars {#length=|v_#length_5|, #valid=|v_#valid_6|} OutVars{#length=|v_#length_5|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[] 48107#[L21-4]don't care [269] L21-4-->L42: Formula: (and (= v_~A~0.base_4 0) (= v_~A~0.offset_4 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_4, ~A~0.offset=v_~A~0.offset_4} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset] 47289#[L42]don't care [257] L42-->L42-1: Formula: (= v_~sum1~0_3 0) InVars {} OutVars{~sum1~0=v_~sum1~0_3} AuxVars[] AssignedVars[~sum1~0] 47291#[L42-1]don't care [339] L42-1-->L42-2: Formula: (= v_~sum2~0_3 0) InVars {} OutVars{~sum2~0=v_~sum2~0_3} AuxVars[] AssignedVars[~sum2~0] 49481#[L42-2]don't care [264] L42-2-->L43: Formula: (= v_~sum3~0_3 0) InVars {} OutVars{~sum3~0=v_~sum3~0_3} AuxVars[] AssignedVars[~sum3~0] 45915#[L43]don't care [345] L43-->L43-1: Formula: (= v_~M~0_4 0) InVars {} OutVars{~M~0=v_~M~0_4} AuxVars[] AssignedVars[~M~0] 45917#[L43-1]don't care [235] L43-1-->L-1-3: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0] 44729#[L-1-3]don't care [355] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 44731#[L-1-4]don't care [246] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 49661#[L-1-5]don't care [221] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 50035#[L-1-6]don't care [330] L-1-6-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_1|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_1|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_1|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_1|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_1|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_1|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_1|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~#t2~0#1.base] 50037#[L72]don't care [273] L72-->L72-1: Formula: (and (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= |v_#length_6| (store |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= |v_#valid_7| (store |v_#valid_8| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 50205#[L72-1]don't care [279] L72-1-->L72-2: Formula: (and (= |v_#length_8| (store |v_#length_9| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (= (store |v_#valid_10| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_9|) (= (select |v_#valid_10| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_9|, #valid=|v_#valid_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 51313#[L72-2]don't care [213] L72-2-->L72-3: Formula: (and (= |v_#valid_11| (store |v_#valid_12| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 1)) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_2| 0) (not (= |v_ULTIMATE.start_main_~#t3~0#1.base_2| 0)) (= (select |v_#valid_12| |v_ULTIMATE.start_main_~#t3~0#1.base_2|) 0) (= |v_#length_10| (store |v_#length_11| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 4)) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t3~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_11|, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_10|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_2|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t3~0#1.offset, #valid, ULTIMATE.start_main_~#t3~0#1.base, #length] 51315#[L72-3]don't care [244] L72-3-->L75: Formula: (= |v_ULTIMATE.start_main_#t~nondet7#1_2| v_~M~0_5) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} OutVars{~M~0=v_~M~0_5, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[~M~0] 45637#[L75]don't care [261] L75-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 45639#[L76]don't care [274] L76-->L76-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_2| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0] 43303#[L76-1]don't care [336] L76-1-->L77: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 43305#[L77]don't care [288] L77-->L77-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 46839#[L77-1]don't care [304] L77-1-->L77-2: Formula: (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_1| v_~N~0_7) InVars {~N~0=v_~N~0_7} OutVars{ULTIMATE.start_create_fresh_uint_array_#in~size#1=|v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_1|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#in~size#1] 52943#[L77-2]don't care [243] L77-2-->L77-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_1|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#res#1.base, ULTIMATE.start_create_fresh_uint_array_#res#1.offset] 53015#[L77-3]don't care [289] L77-3-->L95: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_1|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_1|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_1|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_1|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_1|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_1|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ULTIMATE.start_create_fresh_uint_array_~i~3#1, ULTIMATE.start_create_fresh_uint_array_~size#1, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_uint_array_#t~post20#1, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset] 49985#[L95]don't care [305] L95-->L96: Formula: (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_2| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_2|) InVars {ULTIMATE.start_create_fresh_uint_array_#in~size#1=|v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_uint_array_#in~size#1=|v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_2|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_~size#1] 48667#[L96]don't care [327] L96-->L96-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 44487#[L96-1]don't care [280] L96-1-->L96-2: Formula: (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_uint_array_~size#1_3|) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|) InVars {ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 44489#[L96-2]don't care [226] L96-2-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 51657#[L37]don't care [258] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 43121#[L38]don't care [271] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] 43123#[L37-1]don't care [259] L37-1-->L97: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 45685#[L97]don't care [286] L97-->L97-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 45687#[L97-1]don't care [297] L97-1-->L97-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| (ite (<= (mod |v_ULTIMATE.start_create_fresh_uint_array_~size#1_4| 4294967296) 1073741823) 1 0)) InVars {ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_4|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 49369#[L97-2]don't care [349] L97-2-->L37-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 52387#[L37-2]don't care [224] L37-2-->L38-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 52685#[L38-3]don't care [238] L38-3-->L37-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_8| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} AuxVars[] AssignedVars[] 51795#[L37-3]don't care [231] L37-3-->L99: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 43995#[L99]don't care [319] L99-->L99-1: Formula: (and (= |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_2| 0) (not (= |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_2| 0)) (= |v_#valid_13| (store |v_#valid_14| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_2| 1)) (< |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_2| |v_#StackHeapBarrier_5|) (= (select |v_#valid_14| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_2|) 0) (= (store |v_#length_13| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_2| (* 4 |v_ULTIMATE.start_create_fresh_uint_array_~size#1_5|)) |v_#length_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_13|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_5|, #valid=|v_#valid_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_5|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_5|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_2|, #valid=|v_#valid_13|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_2|, #length=|v_#length_12|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset, #valid, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base, #length] 43997#[L99-1]don't care [248] L99-1-->L99-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_2| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_3|) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_2| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_3|)) InVars {ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_3|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_3|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset] 52987#[L99-2]don't care [331] L99-2-->L100: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_4|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base] 52989#[L100]don't care [256] L100-->L100-6: Formula: (= |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_~i~3#1] 52713#[L100-6]don't care [293] L100-6-->L100-7: Formula: (not (< |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_3| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_6|)) InVars {ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_3|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_6|} OutVars{ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_3|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_6|} AuxVars[] AssignedVars[] 52715#[L100-7]don't care [262] L100-7-->L103: Formula: (and (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_4| |v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_2|) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_4| |v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_2|)) InVars {ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_4|} OutVars{ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_2|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#res#1.base, ULTIMATE.start_create_fresh_uint_array_#res#1.offset] 52995#[L103]don't care [340] L103-->L77-4: Formula: (and (= |v_ULTIMATE.start_main_#t~ret9#1.base_2| |v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_3|) (= |v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_3| |v_ULTIMATE.start_main_#t~ret9#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_3|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_3|} OutVars{ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_3|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_2|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_2|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~ret9#1.base] 52945#[L77-4]don't care [321] L77-4-->L77-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 51927#[L77-5]don't care [220] L77-5-->L77-6: Formula: (and (= |v_ULTIMATE.start_main_#t~ret9#1.base_3| v_~A~0.base_5) (= v_~A~0.offset_5 |v_ULTIMATE.start_main_#t~ret9#1.offset_3|)) InVars {ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_3|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_3|} OutVars{~A~0.base=v_~A~0.base_5, ~A~0.offset=v_~A~0.offset_5, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_3|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_3|} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset] 48791#[L77-6]don't care [215] L77-6-->L79: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_4|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~ret9#1.base] 48793#[L79]don't care [254] L79-->L79-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 52113#[L79-1]don't care [334] L79-1-->L79-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| (ite (and (<= v_~M~0_6 v_~N~0_8) (<= 0 v_~M~0_6)) 1 0)) InVars {~M~0=v_~M~0_6, ~N~0=v_~N~0_8} OutVars{~N~0=v_~N~0_8, ~M~0=v_~M~0_6, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 52917#[L79-2]don't care [236] L79-2-->L37-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 52029#[L37-4]don't care [326] L37-4-->L38-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 50271#[L38-6]don't care [310] L38-6-->L37-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[] 49747#[L37-5]don't care [290] L37-5-->L82: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 49749#[L82]don't care [307] L82-->L82-1: Formula: (= |v_ULTIMATE.start_main_#t~pre10#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1] 53025#[L82-1]don't care [216] L82-1-->L82-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 53019#[L82-2]don't care [354] L82-2-->L82-3: Formula: (and (= (select |v_#valid_16| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_15| |v_ULTIMATE.start_main_~#t1~0#1.base_3|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (= (store |v_#memory_int_9| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_9| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre10#1_3|)) |v_#memory_int_8|)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] 52063#[L82-3]don't care [399] L82-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|} OutVars{thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_8|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_14, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 44975#[L82-4, thread1ENTRY]don't care [361] thread1ENTRY-->L48-5: Formula: (= v_thread1Thread1of1ForFork0_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0] 42747#[L82-4, L48-5]don't care [2022-07-22 11:59:25,586 INFO L750 eck$LassoCheckResult]: Loop: 42747#[L82-4, L48-5]don't care [364] L48-5-->L49: Formula: (< v_thread1Thread1of1ForFork0_~i~0_5 v_~N~0_2) InVars {thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_5, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_5, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[] 42753#[L82-4, L49]don't care [366] L49-->L49-1: Formula: (let ((.cse0 (* v_thread1Thread1of1ForFork0_~i~0_7 4))) (let ((.cse1 (+ .cse0 v_~A~0.offset_1))) (and (<= (+ .cse0 v_~A~0.offset_1 4) (select |v_#length_1| v_~A~0.base_1)) (= (select (select |v_#memory_int_1| v_~A~0.base_1) .cse1) |v_thread1Thread1of1ForFork0_#t~mem2_1|) (<= 0 .cse1) (= (select |v_#valid_1| v_~A~0.base_1) 1)))) InVars {~A~0.base=v_~A~0.base_1, ~A~0.offset=v_~A~0.offset_1, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_7, #length=|v_#length_1|} OutVars{~A~0.base=v_~A~0.base_1, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_1|, ~A~0.offset=v_~A~0.offset_1, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_7, #length=|v_#length_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2] 48733#[L82-4, L49-1]don't care [368] L49-1-->L49-2: Formula: (= v_~sum1~0_1 (+ v_~sum1~0_2 |v_thread1Thread1of1ForFork0_#t~mem2_3|)) InVars {~sum1~0=v_~sum1~0_2, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_3|} OutVars{~sum1~0=v_~sum1~0_1, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_3|} AuxVars[] AssignedVars[~sum1~0] 46199#[L82-4, L49-2]don't care [369] L49-2-->L48-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2] 46201#[L82-4, L48-2]don't care [370] L48-2-->L48-3: Formula: (= v_thread1Thread1of1ForFork0_~i~0_9 |v_thread1Thread1of1ForFork0_#t~post1_1|) InVars {thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_9} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_9, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1] 50261#[L82-4, L48-3]don't care [371] L48-3-->L48-4: Formula: (= v_thread1Thread1of1ForFork0_~i~0_11 (+ |v_thread1Thread1of1ForFork0_#t~post1_3| 1)) InVars {thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_3|} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_11, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0] 50263#[L82-4, L48-4]don't care [372] L48-4-->L48-5: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1] 42747#[L82-4, L48-5]don't care [2022-07-22 11:59:25,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:59:25,587 INFO L85 PathProgramCache]: Analyzing trace with hash -848234396, now seen corresponding path program 1 times [2022-07-22 11:59:25,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:59:25,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389901333] [2022-07-22 11:59:25,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:59:25,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:59:25,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:59:25,643 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:59:25,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:59:25,851 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:59:25,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:59:25,852 INFO L85 PathProgramCache]: Analyzing trace with hash 616186447, now seen corresponding path program 1 times [2022-07-22 11:59:25,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:59:25,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017628939] [2022-07-22 11:59:25,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:59:25,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:59:25,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:59:25,873 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:59:25,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:59:25,888 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:59:25,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:59:25,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1462328180, now seen corresponding path program 1 times [2022-07-22 11:59:25,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:59:25,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449183570] [2022-07-22 11:59:25,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:59:25,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:59:25,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:59:26,100 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-22 11:59:26,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:59:26,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449183570] [2022-07-22 11:59:26,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449183570] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:59:26,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:59:26,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 11:59:26,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857201747] [2022-07-22 11:59:26,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:59:26,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:59:26,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 11:59:26,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-22 11:59:26,162 INFO L87 Difference]: Start difference. First operand 6437 states and 24528 transitions. cyclomatic complexity: 18426 Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:59:26,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:59:26,553 INFO L93 Difference]: Finished difference Result 9489 states and 33237 transitions. [2022-07-22 11:59:26,553 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9489 states and 33237 transitions. [2022-07-22 11:59:26,695 INFO L131 ngComponentsAnalysis]: Automaton has 574 accepting balls. 8722 [2022-07-22 11:59:26,936 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9489 states to 9415 states and 33001 transitions. [2022-07-22 11:59:26,936 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9405 [2022-07-22 11:59:26,964 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9405 [2022-07-22 11:59:26,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9415 states and 33001 transitions. [2022-07-22 11:59:27,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 11:59:27,006 INFO L220 hiAutomatonCegarLoop]: Abstraction has 9415 states and 33001 transitions. [2022-07-22 11:59:27,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9415 states and 33001 transitions. [2022-07-22 11:59:27,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9415 to 7491. [2022-07-22 11:59:27,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7491 states, 7491 states have (on average 3.5764250433853957) internal successors, (26791), 7490 states have internal predecessors, (26791), 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-22 11:59:27,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7491 states to 7491 states and 26791 transitions. [2022-07-22 11:59:27,420 INFO L242 hiAutomatonCegarLoop]: Abstraction has 7491 states and 26791 transitions. [2022-07-22 11:59:27,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 11:59:27,422 INFO L425 stractBuchiCegarLoop]: Abstraction has 7491 states and 26791 transitions. [2022-07-22 11:59:27,422 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 11:59:27,422 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7491 states and 26791 transitions. [2022-07-22 11:59:27,494 INFO L131 ngComponentsAnalysis]: Automaton has 418 accepting balls. 7000 [2022-07-22 11:59:27,494 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 11:59:27,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 11:59:27,496 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:59:27,496 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:59:27,498 INFO L748 eck$LassoCheckResult]: Stem: 76220#[ULTIMATE.startENTRY]don't care [342] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 75260#[L-1]don't care [242] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 65728#[L-1-1]don't care [351] L-1-1-->L-1-2: Formula: (= (select |v_#valid_4| 0) 0) InVars {#valid=|v_#valid_4|} OutVars{#valid=|v_#valid_4|} AuxVars[] AssignedVars[] 65730#[L-1-2]don't care [352] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 71488#[L21]don't care [311] L21-->L21-1: Formula: (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_4| 1))) InVars {#length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] 71490#[L21-1]don't care [338] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_4| 1) 0)) InVars {#memory_int=|v_#memory_int_4|} OutVars{#memory_int=|v_#memory_int_4|} AuxVars[] AssignedVars[] 75488#[L21-2]don't care [249] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_5| 1) 1) 0) InVars {#memory_int=|v_#memory_int_5|} OutVars{#memory_int=|v_#memory_int_5|} AuxVars[] AssignedVars[] 75490#[L21-3]don't care [298] L21-3-->L21-4: Formula: (and (= 32 (select |v_#length_5| 2)) (= (select |v_#valid_6| 2) 1)) InVars {#length=|v_#length_5|, #valid=|v_#valid_6|} OutVars{#length=|v_#length_5|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[] 70504#[L21-4]don't care [269] L21-4-->L42: Formula: (and (= v_~A~0.base_4 0) (= v_~A~0.offset_4 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_4, ~A~0.offset=v_~A~0.offset_4} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset] 69670#[L42]don't care [257] L42-->L42-1: Formula: (= v_~sum1~0_3 0) InVars {} OutVars{~sum1~0=v_~sum1~0_3} AuxVars[] AssignedVars[~sum1~0] 69672#[L42-1]don't care [339] L42-1-->L42-2: Formula: (= v_~sum2~0_3 0) InVars {} OutVars{~sum2~0=v_~sum2~0_3} AuxVars[] AssignedVars[~sum2~0] 71934#[L42-2]don't care [264] L42-2-->L43: Formula: (= v_~sum3~0_3 0) InVars {} OutVars{~sum3~0=v_~sum3~0_3} AuxVars[] AssignedVars[~sum3~0] 68290#[L43]don't care [345] L43-->L43-1: Formula: (= v_~M~0_4 0) InVars {} OutVars{~M~0=v_~M~0_4} AuxVars[] AssignedVars[~M~0] 68292#[L43-1]don't care [235] L43-1-->L-1-3: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0] 67084#[L-1-3]don't care [355] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 67086#[L-1-4]don't care [246] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 72122#[L-1-5]don't care [221] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 72516#[L-1-6]don't care [330] L-1-6-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_1|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_1|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_1|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_1|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_1|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_1|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_1|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~#t2~0#1.base] 72518#[L72]don't care [273] L72-->L72-1: Formula: (and (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= |v_#length_6| (store |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= |v_#valid_7| (store |v_#valid_8| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 72692#[L72-1]don't care [279] L72-1-->L72-2: Formula: (and (= |v_#length_8| (store |v_#length_9| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (= (store |v_#valid_10| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_9|) (= (select |v_#valid_10| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_9|, #valid=|v_#valid_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 73918#[L72-2]don't care [213] L72-2-->L72-3: Formula: (and (= |v_#valid_11| (store |v_#valid_12| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 1)) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_2| 0) (not (= |v_ULTIMATE.start_main_~#t3~0#1.base_2| 0)) (= (select |v_#valid_12| |v_ULTIMATE.start_main_~#t3~0#1.base_2|) 0) (= |v_#length_10| (store |v_#length_11| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 4)) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t3~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_11|, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_10|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_2|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t3~0#1.offset, #valid, ULTIMATE.start_main_~#t3~0#1.base, #length] 73920#[L72-3]don't care [244] L72-3-->L75: Formula: (= |v_ULTIMATE.start_main_#t~nondet7#1_2| v_~M~0_5) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} OutVars{~M~0=v_~M~0_5, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[~M~0] 68006#[L75]don't care [261] L75-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 68008#[L76]don't care [274] L76-->L76-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_2| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0] 65640#[L76-1]don't care [336] L76-1-->L77: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 65642#[L77]don't care [288] L77-->L77-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 69218#[L77-1]don't care [304] L77-1-->L77-2: Formula: (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_1| v_~N~0_7) InVars {~N~0=v_~N~0_7} OutVars{ULTIMATE.start_create_fresh_uint_array_#in~size#1=|v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_1|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#in~size#1] 75996#[L77-2]don't care [243] L77-2-->L77-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_1|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#res#1.base, ULTIMATE.start_create_fresh_uint_array_#res#1.offset] 76248#[L77-3]don't care [289] L77-3-->L95: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_1|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_1|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_1|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_1|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_1|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_1|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ULTIMATE.start_create_fresh_uint_array_~i~3#1, ULTIMATE.start_create_fresh_uint_array_~size#1, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_uint_array_#t~post20#1, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset] 72460#[L95]don't care [305] L95-->L96: Formula: (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_2| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_2|) InVars {ULTIMATE.start_create_fresh_uint_array_#in~size#1=|v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_uint_array_#in~size#1=|v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_2|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_~size#1] 71084#[L96]don't care [327] L96-->L96-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 66838#[L96-1]don't care [280] L96-1-->L96-2: Formula: (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_uint_array_~size#1_3|) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|) InVars {ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 66840#[L96-2]don't care [226] L96-2-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 74314#[L37]don't care [258] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 65460#[L38]don't care [271] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] 65462#[L37-1]don't care [259] L37-1-->L97: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 68056#[L97]don't care [286] L97-->L97-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 68058#[L97-1]don't care [297] L97-1-->L97-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| (ite (<= (mod |v_ULTIMATE.start_create_fresh_uint_array_~size#1_4| 4294967296) 1073741823) 1 0)) InVars {ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_4|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 71824#[L97-2]don't care [349] L97-2-->L37-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 75216#[L37-2]don't care [224] L37-2-->L38-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 75604#[L38-3]don't care [238] L38-3-->L37-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_8| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} AuxVars[] AssignedVars[] 74482#[L37-3]don't care [231] L37-3-->L99: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 66346#[L99]don't care [319] L99-->L99-1: Formula: (and (= |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_2| 0) (not (= |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_2| 0)) (= |v_#valid_13| (store |v_#valid_14| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_2| 1)) (< |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_2| |v_#StackHeapBarrier_5|) (= (select |v_#valid_14| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_2|) 0) (= (store |v_#length_13| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_2| (* 4 |v_ULTIMATE.start_create_fresh_uint_array_~size#1_5|)) |v_#length_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_13|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_5|, #valid=|v_#valid_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_5|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_5|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_2|, #valid=|v_#valid_13|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_2|, #length=|v_#length_12|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset, #valid, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base, #length] 66348#[L99-1]don't care [248] L99-1-->L99-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_2| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_3|) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_2| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_3|)) InVars {ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_3|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_3|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset] 76112#[L99-2]don't care [331] L99-2-->L100: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_4|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base] 76114#[L100]don't care [256] L100-->L100-6: Formula: (= |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_~i~3#1] 75642#[L100-6]don't care [293] L100-6-->L100-7: Formula: (not (< |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_3| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_6|)) InVars {ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_3|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_6|} OutVars{ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_3|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_6|} AuxVars[] AssignedVars[] 75644#[L100-7]don't care [262] L100-7-->L103: Formula: (and (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_4| |v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_2|) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_4| |v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_2|)) InVars {ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_4|} OutVars{ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_2|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#res#1.base, ULTIMATE.start_create_fresh_uint_array_#res#1.offset] 76130#[L103]don't care [340] L103-->L77-4: Formula: (and (= |v_ULTIMATE.start_main_#t~ret9#1.base_2| |v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_3|) (= |v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_3| |v_ULTIMATE.start_main_#t~ret9#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_3|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_3|} OutVars{ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_3|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_2|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_2|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~ret9#1.base] 76004#[L77-4]don't care [321] L77-4-->L77-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 74652#[L77-5]don't care [220] L77-5-->L77-6: Formula: (and (= |v_ULTIMATE.start_main_#t~ret9#1.base_3| v_~A~0.base_5) (= v_~A~0.offset_5 |v_ULTIMATE.start_main_#t~ret9#1.offset_3|)) InVars {ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_3|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_3|} OutVars{~A~0.base=v_~A~0.base_5, ~A~0.offset=v_~A~0.offset_5, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_3|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_3|} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset] 71214#[L77-6]don't care [215] L77-6-->L79: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_4|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~ret9#1.base] 71216#[L79]don't care [254] L79-->L79-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 74876#[L79-1]don't care [334] L79-1-->L79-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| (ite (and (<= v_~M~0_6 v_~N~0_8) (<= 0 v_~M~0_6)) 1 0)) InVars {~M~0=v_~M~0_6, ~N~0=v_~N~0_8} OutVars{~N~0=v_~N~0_8, ~M~0=v_~M~0_6, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 75950#[L79-2]don't care [236] L79-2-->L37-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 74776#[L37-4]don't care [326] L37-4-->L38-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 72762#[L38-6]don't care [310] L38-6-->L37-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[] 72218#[L37-5]don't care [290] L37-5-->L82: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 72220#[L82]don't care [307] L82-->L82-1: Formula: (= |v_ULTIMATE.start_main_#t~pre10#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1] 76374#[L82-1]don't care [216] L82-1-->L82-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 76302#[L82-2]don't care [354] L82-2-->L82-3: Formula: (and (= (select |v_#valid_16| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_15| |v_ULTIMATE.start_main_~#t1~0#1.base_3|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (= (store |v_#memory_int_9| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_9| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre10#1_3|)) |v_#memory_int_8|)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] 74816#[L82-3]don't care [399] L82-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|} OutVars{thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_8|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_14, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 67332#[L82-4, thread1ENTRY]don't care [308] L82-4-->L82-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1] 67334#[L82-5, thread1ENTRY]don't care [234] L82-5-->L83: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1] 74122#[L83, thread1ENTRY]don't care [227] L83-->L83-1: Formula: (= |v_ULTIMATE.start_main_#t~pre12#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1] 71898#[L83-1, thread1ENTRY]don't care [275] L83-1-->L83-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 66034#[L83-2, thread1ENTRY]don't care [332] L83-2-->L83-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|) (= |v_#memory_int_10| (store |v_#memory_int_11| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_11| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre12#1_3|))) (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|) (select |v_#length_16| |v_ULTIMATE.start_main_~#t2~0#1.base_3|)) (= (select |v_#valid_17| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) 1)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_11|, #length=|v_#length_16|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] 66038#[L83-3, thread1ENTRY]don't care [402] L83-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_14, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_8|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_#t~mem4=|v_thread2Thread1of1ForFork1_#t~mem4_8|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post3, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_#t~mem4, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 67902#[thread2ENTRY, L83-4, thread1ENTRY]don't care [373] thread2ENTRY-->L56-5: Formula: (= v_thread2Thread1of1ForFork1_~i~1_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1] 67906#[L56-5, L83-4, thread1ENTRY]don't care [2022-07-22 11:59:27,498 INFO L750 eck$LassoCheckResult]: Loop: 67906#[L56-5, L83-4, thread1ENTRY]don't care [376] L56-5-->L57: Formula: (< v_thread2Thread1of1ForFork1_~i~1_5 v_~M~0_2) InVars {~M~0=v_~M~0_2, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_5} OutVars{~M~0=v_~M~0_2, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_5} AuxVars[] AssignedVars[] 75268#[L57, L83-4, thread1ENTRY]don't care [378] L57-->L57-1: Formula: (let ((.cse1 (* v_thread2Thread1of1ForFork1_~i~1_7 4))) (let ((.cse0 (+ v_~A~0.offset_2 .cse1))) (and (= (select (select |v_#memory_int_2| v_~A~0.base_2) .cse0) |v_thread2Thread1of1ForFork1_#t~mem4_1|) (<= 0 .cse0) (= (select |v_#valid_2| v_~A~0.base_2) 1) (<= (+ v_~A~0.offset_2 .cse1 4) (select |v_#length_2| v_~A~0.base_2))))) InVars {~A~0.base=v_~A~0.base_2, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_7, ~A~0.offset=v_~A~0.offset_2, #valid=|v_#valid_2|, #memory_int=|v_#memory_int_2|, #length=|v_#length_2|} OutVars{~A~0.base=v_~A~0.base_2, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_7, ~A~0.offset=v_~A~0.offset_2, #valid=|v_#valid_2|, #memory_int=|v_#memory_int_2|, #length=|v_#length_2|, thread2Thread1of1ForFork1_#t~mem4=|v_thread2Thread1of1ForFork1_#t~mem4_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem4] 70870#[L57-1, L83-4, thread1ENTRY]don't care [380] L57-1-->L57-2: Formula: (= v_~sum2~0_1 (+ |v_thread2Thread1of1ForFork1_#t~mem4_3| v_~sum2~0_2)) InVars {thread2Thread1of1ForFork1_#t~mem4=|v_thread2Thread1of1ForFork1_#t~mem4_3|, ~sum2~0=v_~sum2~0_2} OutVars{thread2Thread1of1ForFork1_#t~mem4=|v_thread2Thread1of1ForFork1_#t~mem4_3|, ~sum2~0=v_~sum2~0_1} AuxVars[] AssignedVars[~sum2~0] 69028#[L83-4, L57-2, thread1ENTRY]don't care [381] L57-2-->L56-2: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~mem4=|v_thread2Thread1of1ForFork1_#t~mem4_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem4] 69034#[L56-2, L83-4, thread1ENTRY]don't care [382] L56-2-->L56-3: Formula: (= |v_thread2Thread1of1ForFork1_#t~post3_1| v_thread2Thread1of1ForFork1_~i~1_9) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_9} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_9, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post3] 72586#[L56-3, L83-4, thread1ENTRY]don't care [383] L56-3-->L56-4: Formula: (= v_thread2Thread1of1ForFork1_~i~1_11 (+ |v_thread2Thread1of1ForFork1_#t~post3_3| 1)) InVars {thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_3|} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_11, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1] 72590#[L56-4, L83-4, thread1ENTRY]don't care [384] L56-4-->L56-5: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post3] 67906#[L56-5, L83-4, thread1ENTRY]don't care [2022-07-22 11:59:27,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:59:27,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1433060388, now seen corresponding path program 1 times [2022-07-22 11:59:27,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:59:27,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973159774] [2022-07-22 11:59:27,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:59:27,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:59:27,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:59:27,533 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:59:27,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:59:27,566 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:59:27,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:59:27,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1263669797, now seen corresponding path program 1 times [2022-07-22 11:59:27,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:59:27,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139353302] [2022-07-22 11:59:27,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:59:27,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:59:27,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:59:27,573 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:59:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:59:27,578 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:59:27,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:59:27,579 INFO L85 PathProgramCache]: Analyzing trace with hash -299381672, now seen corresponding path program 1 times [2022-07-22 11:59:27,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:59:27,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75026262] [2022-07-22 11:59:27,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:59:27,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:59:27,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:59:27,789 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-22 11:59:27,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:59:27,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75026262] [2022-07-22 11:59:27,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75026262] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:59:27,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:59:27,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-22 11:59:27,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286224963] [2022-07-22 11:59:27,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:59:27,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:59:27,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 11:59:27,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-22 11:59:27,839 INFO L87 Difference]: Start difference. First operand 7491 states and 26791 transitions. cyclomatic complexity: 19719 Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 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-22 11:59:28,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:59:28,470 INFO L93 Difference]: Finished difference Result 7295 states and 25442 transitions. [2022-07-22 11:59:28,471 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7295 states and 25442 transitions. [2022-07-22 11:59:28,693 INFO L131 ngComponentsAnalysis]: Automaton has 334 accepting balls. 6076 [2022-07-22 11:59:28,784 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7295 states to 6440 states and 22999 transitions. [2022-07-22 11:59:28,784 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6430 [2022-07-22 11:59:28,798 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6430 [2022-07-22 11:59:28,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6440 states and 22999 transitions. [2022-07-22 11:59:28,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 11:59:28,820 INFO L220 hiAutomatonCegarLoop]: Abstraction has 6440 states and 22999 transitions. [2022-07-22 11:59:28,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6440 states and 22999 transitions. [2022-07-22 11:59:29,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6440 to 6436. [2022-07-22 11:59:29,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6436 states, 6436 states have (on average 3.5728713486637664) internal successors, (22995), 6435 states have internal predecessors, (22995), 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-22 11:59:29,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6436 states to 6436 states and 22995 transitions. [2022-07-22 11:59:29,140 INFO L242 hiAutomatonCegarLoop]: Abstraction has 6436 states and 22995 transitions. [2022-07-22 11:59:29,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 11:59:29,142 INFO L425 stractBuchiCegarLoop]: Abstraction has 6436 states and 22995 transitions. [2022-07-22 11:59:29,143 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 11:59:29,143 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6436 states and 22995 transitions. [2022-07-22 11:59:29,200 INFO L131 ngComponentsAnalysis]: Automaton has 334 accepting balls. 6076 [2022-07-22 11:59:29,200 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 11:59:29,200 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 11:59:29,201 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:59:29,201 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:59:29,203 INFO L748 eck$LassoCheckResult]: Stem: 97700#[ULTIMATE.startENTRY]don't care [342] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 97110#[L-1]don't care [242] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 88080#[L-1-1]don't care [351] L-1-1-->L-1-2: Formula: (= (select |v_#valid_4| 0) 0) InVars {#valid=|v_#valid_4|} OutVars{#valid=|v_#valid_4|} AuxVars[] AssignedVars[] 88082#[L-1-2]don't care [352] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 93742#[L21]don't care [311] L21-->L21-1: Formula: (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_4| 1))) InVars {#length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] 93744#[L21-1]don't care [338] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_4| 1) 0)) InVars {#memory_int=|v_#memory_int_4|} OutVars{#memory_int=|v_#memory_int_4|} AuxVars[] AssignedVars[] 97284#[L21-2]don't care [249] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_5| 1) 1) 0) InVars {#memory_int=|v_#memory_int_5|} OutVars{#memory_int=|v_#memory_int_5|} AuxVars[] AssignedVars[] 97286#[L21-3]don't care [298] L21-3-->L21-4: Formula: (and (= 32 (select |v_#length_5| 2)) (= (select |v_#valid_6| 2) 1)) InVars {#length=|v_#length_5|, #valid=|v_#valid_6|} OutVars{#length=|v_#length_5|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[] 92796#[L21-4]don't care [269] L21-4-->L42: Formula: (and (= v_~A~0.base_4 0) (= v_~A~0.offset_4 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_4, ~A~0.offset=v_~A~0.offset_4} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset] 91978#[L42]don't care [257] L42-->L42-1: Formula: (= v_~sum1~0_3 0) InVars {} OutVars{~sum1~0=v_~sum1~0_3} AuxVars[] AssignedVars[~sum1~0] 91980#[L42-1]don't care [339] L42-1-->L42-2: Formula: (= v_~sum2~0_3 0) InVars {} OutVars{~sum2~0=v_~sum2~0_3} AuxVars[] AssignedVars[~sum2~0] 94170#[L42-2]don't care [264] L42-2-->L43: Formula: (= v_~sum3~0_3 0) InVars {} OutVars{~sum3~0=v_~sum3~0_3} AuxVars[] AssignedVars[~sum3~0] 90604#[L43]don't care [345] L43-->L43-1: Formula: (= v_~M~0_4 0) InVars {} OutVars{~M~0=v_~M~0_4} AuxVars[] AssignedVars[~M~0] 90606#[L43-1]don't care [235] L43-1-->L-1-3: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0] 89418#[L-1-3]don't care [355] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 89420#[L-1-4]don't care [246] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 94350#[L-1-5]don't care [221] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 94724#[L-1-6]don't care [330] L-1-6-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_1|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_1|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_1|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_1|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_1|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_1|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_1|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~#t2~0#1.base] 94726#[L72]don't care [273] L72-->L72-1: Formula: (and (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= |v_#length_6| (store |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= |v_#valid_7| (store |v_#valid_8| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 94894#[L72-1]don't care [279] L72-1-->L72-2: Formula: (and (= |v_#length_8| (store |v_#length_9| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (= (store |v_#valid_10| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_9|) (= (select |v_#valid_10| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_9|, #valid=|v_#valid_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 96000#[L72-2]don't care [213] L72-2-->L72-3: Formula: (and (= |v_#valid_11| (store |v_#valid_12| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 1)) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_2| 0) (not (= |v_ULTIMATE.start_main_~#t3~0#1.base_2| 0)) (= (select |v_#valid_12| |v_ULTIMATE.start_main_~#t3~0#1.base_2|) 0) (= |v_#length_10| (store |v_#length_11| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 4)) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t3~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_11|, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_10|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_2|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t3~0#1.offset, #valid, ULTIMATE.start_main_~#t3~0#1.base, #length] 96002#[L72-3]don't care [244] L72-3-->L75: Formula: (= |v_ULTIMATE.start_main_#t~nondet7#1_2| v_~M~0_5) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} OutVars{~M~0=v_~M~0_5, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[~M~0] 90326#[L75]don't care [261] L75-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 90328#[L76]don't care [274] L76-->L76-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_2| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0] 87992#[L76-1]don't care [336] L76-1-->L77: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 87994#[L77]don't care [288] L77-->L77-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 91528#[L77-1]don't care [304] L77-1-->L77-2: Formula: (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_1| v_~N~0_7) InVars {~N~0=v_~N~0_7} OutVars{ULTIMATE.start_create_fresh_uint_array_#in~size#1=|v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_1|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#in~size#1] 97630#[L77-2]don't care [243] L77-2-->L77-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_1|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#res#1.base, ULTIMATE.start_create_fresh_uint_array_#res#1.offset] 97702#[L77-3]don't care [289] L77-3-->L95: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_1|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_1|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_1|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_1|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_1|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_1|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ULTIMATE.start_create_fresh_uint_array_~i~3#1, ULTIMATE.start_create_fresh_uint_array_~size#1, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_uint_array_#t~post20#1, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset] 94674#[L95]don't care [305] L95-->L96: Formula: (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_2| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_2|) InVars {ULTIMATE.start_create_fresh_uint_array_#in~size#1=|v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_uint_array_#in~size#1=|v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_2|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_~size#1] 93366#[L96]don't care [327] L96-->L96-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 89176#[L96-1]don't care [280] L96-1-->L96-2: Formula: (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_uint_array_~size#1_3|) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|) InVars {ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 89178#[L96-2]don't care [226] L96-2-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 96344#[L37]don't care [258] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 87810#[L38]don't care [271] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] 87812#[L37-1]don't care [259] L37-1-->L97: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 90374#[L97]don't care [286] L97-->L97-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 90376#[L97-1]don't care [297] L97-1-->L97-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| (ite (<= (mod |v_ULTIMATE.start_create_fresh_uint_array_~size#1_4| 4294967296) 1073741823) 1 0)) InVars {ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_4|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 94062#[L97-2]don't care [349] L97-2-->L37-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 97072#[L37-2]don't care [224] L37-2-->L38-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 97372#[L38-3]don't care [238] L38-3-->L37-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_8| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} AuxVars[] AssignedVars[] 96482#[L37-3]don't care [231] L37-3-->L99: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 88684#[L99]don't care [319] L99-->L99-1: Formula: (and (= |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_2| 0) (not (= |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_2| 0)) (= |v_#valid_13| (store |v_#valid_14| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_2| 1)) (< |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_2| |v_#StackHeapBarrier_5|) (= (select |v_#valid_14| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_2|) 0) (= (store |v_#length_13| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_2| (* 4 |v_ULTIMATE.start_create_fresh_uint_array_~size#1_5|)) |v_#length_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_13|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_5|, #valid=|v_#valid_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_5|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_5|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_2|, #valid=|v_#valid_13|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_2|, #length=|v_#length_12|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset, #valid, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base, #length] 88686#[L99-1]don't care [248] L99-1-->L99-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_2| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_3|) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_2| |v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_3|)) InVars {ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_3|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_3|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset] 97674#[L99-2]don't care [331] L99-2-->L100: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_4|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base] 97676#[L100]don't care [256] L100-->L100-6: Formula: (= |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_~i~3#1] 97400#[L100-6]don't care [294] L100-6-->L101: Formula: (< |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_4| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_7|) InVars {ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_4|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_7|} OutVars{ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_4|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_7|} AuxVars[] AssignedVars[] 97160#[L101]don't care [343] L101-->L101-1: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_5| 4))) (let ((.cse1 (+ |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_3| .cse0))) (and (<= (+ |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_3| .cse0 4) (select |v_#length_14| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_3|)) (= (store |v_#memory_int_7| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_3| (store (select |v_#memory_int_7| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_3|) .cse1 |v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_2|)) |v_#memory_int_6|) (= (select |v_#valid_15| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_3|) 1) (<= 0 .cse1)))) InVars {ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_2|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_5|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_3|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_7|, #length=|v_#length_14|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_2|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_5|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_3|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_14|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] 95616#[L101-1]don't care [225] L101-1-->L100-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1] 95618#[L100-3]don't care [316] L100-3-->L100-4: Formula: (= |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_6| |v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_2|) InVars {ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_6|} OutVars{ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_6|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#t~post20#1] 97710#[L100-4]don't care [212] L100-4-->L100-5: Formula: (= (+ |v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_3| 1) |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_7|) InVars {ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_3|} OutVars{ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_7|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_~i~3#1] 92550#[L100-5]don't care [325] L100-5-->L100-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#t~post20#1] 92552#[L100-6]don't care [293] L100-6-->L100-7: Formula: (not (< |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_3| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_6|)) InVars {ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_3|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_6|} OutVars{ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_3|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_6|} AuxVars[] AssignedVars[] 97402#[L100-7]don't care [262] L100-7-->L103: Formula: (and (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_4| |v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_2|) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_4| |v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_2|)) InVars {ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_4|} OutVars{ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_2|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#res#1.base, ULTIMATE.start_create_fresh_uint_array_#res#1.offset] 97682#[L103]don't care [340] L103-->L77-4: Formula: (and (= |v_ULTIMATE.start_main_#t~ret9#1.base_2| |v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_3|) (= |v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_3| |v_ULTIMATE.start_main_#t~ret9#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_3|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_3|} OutVars{ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_3|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_2|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_2|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~ret9#1.base] 97632#[L77-4]don't care [321] L77-4-->L77-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 96614#[L77-5]don't care [220] L77-5-->L77-6: Formula: (and (= |v_ULTIMATE.start_main_#t~ret9#1.base_3| v_~A~0.base_5) (= v_~A~0.offset_5 |v_ULTIMATE.start_main_#t~ret9#1.offset_3|)) InVars {ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_3|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_3|} OutVars{~A~0.base=v_~A~0.base_5, ~A~0.offset=v_~A~0.offset_5, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_3|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_3|} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset] 93486#[L77-6]don't care [215] L77-6-->L79: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_4|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~ret9#1.base] 93488#[L79]don't care [254] L79-->L79-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 96800#[L79-1]don't care [334] L79-1-->L79-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| (ite (and (<= v_~M~0_6 v_~N~0_8) (<= 0 v_~M~0_6)) 1 0)) InVars {~M~0=v_~M~0_6, ~N~0=v_~N~0_8} OutVars{~N~0=v_~N~0_8, ~M~0=v_~M~0_6, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 97604#[L79-2]don't care [236] L79-2-->L37-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 96716#[L37-4]don't care [326] L37-4-->L38-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 94960#[L38-6]don't care [310] L38-6-->L37-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|} AuxVars[] AssignedVars[] 94436#[L37-5]don't care [290] L37-5-->L82: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 94438#[L82]don't care [307] L82-->L82-1: Formula: (= |v_ULTIMATE.start_main_#t~pre10#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre10#1] 97712#[L82-1]don't care [216] L82-1-->L82-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 97706#[L82-2]don't care [354] L82-2-->L82-3: Formula: (and (= (select |v_#valid_16| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_15| |v_ULTIMATE.start_main_~#t1~0#1.base_3|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (= (store |v_#memory_int_9| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_9| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre10#1_3|)) |v_#memory_int_8|)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] 96750#[L82-3]don't care [399] L82-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|} OutVars{thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_8|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_14, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 89664#[L82-4, thread1ENTRY]don't care [361] thread1ENTRY-->L48-5: Formula: (= v_thread1Thread1of1ForFork0_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0] 87436#[L82-4, L48-5]don't care [2022-07-22 11:59:29,204 INFO L750 eck$LassoCheckResult]: Loop: 87436#[L82-4, L48-5]don't care [364] L48-5-->L49: Formula: (< v_thread1Thread1of1ForFork0_~i~0_5 v_~N~0_2) InVars {thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_5, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_5, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[] 87442#[L82-4, L49]don't care [366] L49-->L49-1: Formula: (let ((.cse0 (* v_thread1Thread1of1ForFork0_~i~0_7 4))) (let ((.cse1 (+ .cse0 v_~A~0.offset_1))) (and (<= (+ .cse0 v_~A~0.offset_1 4) (select |v_#length_1| v_~A~0.base_1)) (= (select (select |v_#memory_int_1| v_~A~0.base_1) .cse1) |v_thread1Thread1of1ForFork0_#t~mem2_1|) (<= 0 .cse1) (= (select |v_#valid_1| v_~A~0.base_1) 1)))) InVars {~A~0.base=v_~A~0.base_1, ~A~0.offset=v_~A~0.offset_1, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_7, #length=|v_#length_1|} OutVars{~A~0.base=v_~A~0.base_1, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_1|, ~A~0.offset=v_~A~0.offset_1, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_7, #length=|v_#length_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2] 93422#[L82-4, L49-1]don't care [368] L49-1-->L49-2: Formula: (= v_~sum1~0_1 (+ v_~sum1~0_2 |v_thread1Thread1of1ForFork0_#t~mem2_3|)) InVars {~sum1~0=v_~sum1~0_2, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_3|} OutVars{~sum1~0=v_~sum1~0_1, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_3|} AuxVars[] AssignedVars[~sum1~0] 90888#[L82-4, L49-2]don't care [369] L49-2-->L48-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2] 90890#[L82-4, L48-2]don't care [370] L48-2-->L48-3: Formula: (= v_thread1Thread1of1ForFork0_~i~0_9 |v_thread1Thread1of1ForFork0_#t~post1_1|) InVars {thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_9} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_9, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1] 94950#[L82-4, L48-3]don't care [371] L48-3-->L48-4: Formula: (= v_thread1Thread1of1ForFork0_~i~0_11 (+ |v_thread1Thread1of1ForFork0_#t~post1_3| 1)) InVars {thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_3|} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_11, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0] 94952#[L82-4, L48-4]don't care [372] L48-4-->L48-5: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1] 87436#[L82-4, L48-5]don't care [2022-07-22 11:59:29,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:59:29,204 INFO L85 PathProgramCache]: Analyzing trace with hash 2103366631, now seen corresponding path program 1 times [2022-07-22 11:59:29,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:59:29,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133335609] [2022-07-22 11:59:29,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:59:29,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:59:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:59:29,232 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:59:29,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:59:29,268 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:59:29,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:59:29,269 INFO L85 PathProgramCache]: Analyzing trace with hash 616186447, now seen corresponding path program 2 times [2022-07-22 11:59:29,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:59:29,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337657979] [2022-07-22 11:59:29,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:59:29,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:59:29,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:59:29,274 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:59:29,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:59:29,279 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:59:29,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:59:29,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1843814313, now seen corresponding path program 1 times [2022-07-22 11:59:29,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:59:29,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772815121] [2022-07-22 11:59:29,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:59:29,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:59:29,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:59:29,303 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:59:29,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:59:29,338 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:59:31,515 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 11:59:31,516 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 11:59:31,516 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 11:59:31,516 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 11:59:31,516 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 11:59:31,516 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:59:31,516 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 11:59:31,516 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 11:59:31,516 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-sum-array-hom.wvr.c_BEv2_Iteration4_Lasso [2022-07-22 11:59:31,516 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 11:59:31,517 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 11:59:31,536 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-22 11:59:31,538 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-22 11:59:31,540 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-22 11:59:31,542 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-22 11:59:31,543 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-22 11:59:31,545 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-22 11:59:31,546 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-22 11:59:31,548 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-22 11:59:31,550 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-22 11:59:31,552 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-22 11:59:31,554 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-22 11:59:31,556 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-22 11:59:31,559 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-22 11:59:31,561 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-22 11:59:31,564 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-22 11:59:31,861 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:910) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:819) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:253) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:356) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.runCegarLoops(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:331) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-22 11:59:31,865 INFO L158 Benchmark]: Toolchain (without parser) took 17033.99ms. Allocated memory was 163.6MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 138.0MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 382.8MB. Max. memory is 8.0GB. [2022-07-22 11:59:31,866 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 163.6MB. Free memory is still 133.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 11:59:31,867 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.77ms. Allocated memory is still 163.6MB. Free memory was 137.8MB in the beginning and 126.8MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-07-22 11:59:31,867 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.62ms. Allocated memory is still 163.6MB. Free memory was 126.8MB in the beginning and 125.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 11:59:31,868 INFO L158 Benchmark]: Boogie Preprocessor took 54.07ms. Allocated memory is still 163.6MB. Free memory was 125.0MB in the beginning and 123.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-22 11:59:31,869 INFO L158 Benchmark]: RCFGBuilder took 766.22ms. Allocated memory is still 163.6MB. Free memory was 123.5MB in the beginning and 143.9MB in the end (delta: -20.4MB). Peak memory consumption was 17.6MB. Max. memory is 8.0GB. [2022-07-22 11:59:31,870 INFO L158 Benchmark]: BuchiAutomizer took 15773.68ms. Allocated memory was 163.6MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 143.4MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 387.2MB. Max. memory is 8.0GB. [2022-07-22 11:59:31,873 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 163.6MB. Free memory is still 133.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 371.77ms. Allocated memory is still 163.6MB. Free memory was 137.8MB in the beginning and 126.8MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.62ms. Allocated memory is still 163.6MB. Free memory was 126.8MB in the beginning and 125.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.07ms. Allocated memory is still 163.6MB. Free memory was 125.0MB in the beginning and 123.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 766.22ms. Allocated memory is still 163.6MB. Free memory was 123.5MB in the beginning and 143.9MB in the end (delta: -20.4MB). Peak memory consumption was 17.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 15773.68ms. Allocated memory was 163.6MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 143.4MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 387.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-22 11:59:31,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...