/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-queue-add-2-nl.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-0d686a6 [2022-07-26 13:36:42,363 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-26 13:36:42,377 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-26 13:36:42,429 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-26 13:36:42,443 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-26 13:36:42,444 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-26 13:36:42,450 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-26 13:36:42,454 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-26 13:36:42,457 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-26 13:36:42,460 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-26 13:36:42,461 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-26 13:36:42,462 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-26 13:36:42,462 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-26 13:36:42,464 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-26 13:36:42,465 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-26 13:36:42,465 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-26 13:36:42,466 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-26 13:36:42,466 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-26 13:36:42,469 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-26 13:36:42,473 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-26 13:36:42,480 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-26 13:36:42,481 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-26 13:36:42,482 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-26 13:36:42,482 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-26 13:36:42,484 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-26 13:36:42,486 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-26 13:36:42,486 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-26 13:36:42,486 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-26 13:36:42,487 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-26 13:36:42,487 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-26 13:36:42,495 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-26 13:36:42,495 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-26 13:36:42,497 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-26 13:36:42,498 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-26 13:36:42,498 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-26 13:36:42,499 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-26 13:36:42,499 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-26 13:36:42,499 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-26 13:36:42,499 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-26 13:36:42,499 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-26 13:36:42,500 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-26 13:36:42,501 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-26 13:36:42,502 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2022-07-26 13:36:42,526 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-26 13:36:42,526 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-26 13:36:42,526 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-26 13:36:42,526 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-26 13:36:42,528 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-26 13:36:42,528 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-26 13:36:42,528 INFO L138 SettingsManager]: * Use SBE=true [2022-07-26 13:36:42,528 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-26 13:36:42,528 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-26 13:36:42,529 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-26 13:36:42,529 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-26 13:36:42,529 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-26 13:36:42,529 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-26 13:36:42,529 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-26 13:36:42,530 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-26 13:36:42,530 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-26 13:36:42,530 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-26 13:36:42,530 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-26 13:36:42,530 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-26 13:36:42,530 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-26 13:36:42,530 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-26 13:36:42,530 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-26 13:36:42,530 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-26 13:36:42,531 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-26 13:36:42,531 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-26 13:36:42,531 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-26 13:36:42,531 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-26 13:36:42,531 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-26 13:36:42,531 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-26 13:36:42,531 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-26 13:36:42,531 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-26 13:36:42,532 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-26 13:36:42,533 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-26 13:36:42,533 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-26 13:36:42,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-26 13:36:42,763 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-26 13:36:42,765 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-26 13:36:42,766 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-26 13:36:42,767 INFO L275 PluginConnector]: CDTParser initialized [2022-07-26 13:36:42,768 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-queue-add-2-nl.wvr.c [2022-07-26 13:36:42,818 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0685c8392/d524997828ee4e87abcf05876281aa9b/FLAG8067a0d32 [2022-07-26 13:36:43,150 INFO L306 CDTParser]: Found 1 translation units. [2022-07-26 13:36:43,150 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-queue-add-2-nl.wvr.c [2022-07-26 13:36:43,157 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0685c8392/d524997828ee4e87abcf05876281aa9b/FLAG8067a0d32 [2022-07-26 13:36:43,570 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0685c8392/d524997828ee4e87abcf05876281aa9b [2022-07-26 13:36:43,572 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-26 13:36:43,573 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-26 13:36:43,577 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-26 13:36:43,578 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-26 13:36:43,581 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-26 13:36:43,581 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.07 01:36:43" (1/1) ... [2022-07-26 13:36:43,582 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dee59ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:36:43, skipping insertion in model container [2022-07-26 13:36:43,583 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.07 01:36:43" (1/1) ... [2022-07-26 13:36:43,589 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-26 13:36:43,611 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-26 13:36:43,762 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-queue-add-2-nl.wvr.c[2870,2883] [2022-07-26 13:36:43,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 13:36:43,774 INFO L203 MainTranslator]: Completed pre-run [2022-07-26 13:36:43,791 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-queue-add-2-nl.wvr.c[2870,2883] [2022-07-26 13:36:43,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 13:36:43,803 INFO L208 MainTranslator]: Completed translation [2022-07-26 13:36:43,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:36:43 WrapperNode [2022-07-26 13:36:43,803 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-26 13:36:43,804 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-26 13:36:43,804 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-26 13:36:43,804 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-26 13:36:43,809 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:36:43" (1/1) ... [2022-07-26 13:36:43,815 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:36:43" (1/1) ... [2022-07-26 13:36:43,831 INFO L137 Inliner]: procedures = 25, calls = 39, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 159 [2022-07-26 13:36:43,831 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-26 13:36:43,832 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-26 13:36:43,832 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-26 13:36:43,832 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-26 13:36:43,837 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:36:43" (1/1) ... [2022-07-26 13:36:43,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:36:43" (1/1) ... [2022-07-26 13:36:43,840 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:36:43" (1/1) ... [2022-07-26 13:36:43,840 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:36:43" (1/1) ... [2022-07-26 13:36:43,844 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:36:43" (1/1) ... [2022-07-26 13:36:43,847 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:36:43" (1/1) ... [2022-07-26 13:36:43,849 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:36:43" (1/1) ... [2022-07-26 13:36:43,850 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-26 13:36:43,851 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-26 13:36:43,851 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-26 13:36:43,851 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-26 13:36:43,852 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:36:43" (1/1) ... [2022-07-26 13:36:43,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:43,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:43,889 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-26 13:36:43,892 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-26 13:36:43,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-26 13:36:43,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-26 13:36:43,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-26 13:36:43,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-26 13:36:43,926 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-26 13:36:43,926 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-26 13:36:43,926 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-26 13:36:43,928 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-26 13:36:43,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-26 13:36:43,929 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-26 13:36:43,929 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-26 13:36:43,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-26 13:36:43,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-26 13:36:43,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-26 13:36:43,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-26 13:36:43,931 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-26 13:36:44,012 INFO L234 CfgBuilder]: Building ICFG [2022-07-26 13:36:44,013 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-26 13:36:44,276 INFO L275 CfgBuilder]: Performing block encoding [2022-07-26 13:36:44,394 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-26 13:36:44,395 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-26 13:36:44,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.07 01:36:44 BoogieIcfgContainer [2022-07-26 13:36:44,397 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-26 13:36:44,398 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-26 13:36:44,398 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-26 13:36:44,401 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-26 13:36:44,402 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 13:36:44,402 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.07 01:36:43" (1/3) ... [2022-07-26 13:36:44,403 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@398751c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.07 01:36:44, skipping insertion in model container [2022-07-26 13:36:44,403 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 13:36:44,403 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:36:43" (2/3) ... [2022-07-26 13:36:44,403 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@398751c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.07 01:36:44, skipping insertion in model container [2022-07-26 13:36:44,403 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 13:36:44,403 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.07 01:36:44" (3/3) ... [2022-07-26 13:36:44,406 INFO L322 chiAutomizerObserver]: Analyzing ICFG popl20-more-queue-add-2-nl.wvr.c [2022-07-26 13:36:44,500 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-26 13:36:44,528 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 136 places, 142 transitions, 300 flow [2022-07-26 13:36:44,579 INFO L129 PetriNetUnfolder]: 11/138 cut-off events. [2022-07-26 13:36:44,579 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-26 13:36:44,582 INFO L84 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 138 events. 11/138 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 77 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 102. Up to 3 conditions per place. [2022-07-26 13:36:44,582 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 142 transitions, 300 flow [2022-07-26 13:36:44,586 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 138 transitions, 288 flow [2022-07-26 13:36:44,598 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2022-07-26 13:36:44,598 INFO L302 stractBuchiCegarLoop]: Hoare is false [2022-07-26 13:36:44,598 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-26 13:36:44,598 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-26 13:36:44,598 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-26 13:36:44,599 INFO L306 stractBuchiCegarLoop]: Difference is false [2022-07-26 13:36:44,599 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-26 13:36:44,599 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-26 13:36:44,601 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-26 13:36:44,789 INFO L131 ngComponentsAnalysis]: Automaton has 58 accepting balls. 417 [2022-07-26 13:36:44,789 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:36:44,789 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:36:44,794 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] [2022-07-26 13:36:44,794 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-26 13:36:44,794 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-26 13:36:44,794 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 676 states, but on-demand construction may add more states [2022-07-26 13:36:44,825 INFO L131 ngComponentsAnalysis]: Automaton has 58 accepting balls. 417 [2022-07-26 13:36:44,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:36:44,825 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:36:44,827 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] [2022-07-26 13:36:44,828 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-26 13:36:44,833 INFO L733 eck$LassoCheckResult]: Stem: 139#[ULTIMATE.startENTRY]don't care [430] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 142#[L-1]don't care [342] 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] 144#[L-1-1]don't care [442] 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[] 146#[L-1-2]don't care [443] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 148#[L21]don't care [403] 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[] 150#[L21-1]don't care [425] 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[] 152#[L21-2]don't care [353] 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[] 154#[L21-3]don't care [395] L21-3-->L21-4: Formula: (and (= 33 (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[] 156#[L21-4]don't care [372] L21-4-->L43: Formula: (and (= v_~q~0.offset_4 0) (= v_~q~0.base_4 0)) InVars {} OutVars{~q~0.base=v_~q~0.base_4, ~q~0.offset=v_~q~0.offset_4} AuxVars[] AssignedVars[~q~0.base, ~q~0.offset] 158#[L43]don't care [434] L43-->L43-1: Formula: (= v_~q_front~0_5 0) InVars {} OutVars{~q_front~0=v_~q_front~0_5} AuxVars[] AssignedVars[~q_front~0] 160#[L43-1]don't care [338] L43-1-->L43-2: Formula: (= v_~q_back~0_10 0) InVars {} OutVars{~q_back~0=v_~q_back~0_10} AuxVars[] AssignedVars[~q_back~0] 162#[L43-2]don't care [358] L43-2-->L43-3: Formula: (= v_~n~0_4 0) InVars {} OutVars{~n~0=v_~n~0_4} AuxVars[] AssignedVars[~n~0] 164#[L43-3]don't care [363] L43-3-->L43-4: Formula: (= v_~s~0_4 0) InVars {} OutVars{~s~0=v_~s~0_4} AuxVars[] AssignedVars[~s~0] 166#[L43-4]don't care [433] L43-4-->L44: Formula: (= v_~N~0_3 0) InVars {} OutVars{~N~0=v_~N~0_3} AuxVars[] AssignedVars[~N~0] 168#[L44]don't care [339] L44-->L44-1: Formula: (= v_~x~0_5 0) InVars {} OutVars{~x~0=v_~x~0_5} AuxVars[] AssignedVars[~x~0] 170#[L44-1]don't care [386] L44-1-->L44-2: Formula: (= v_~y~0_3 0) InVars {} OutVars{~y~0=v_~y~0_3} AuxVars[] AssignedVars[~y~0] 172#[L44-2]don't care [389] L44-2-->L-1-3: Formula: (= v_~C~0_4 0) InVars {} OutVars{~C~0=v_~C~0_4} AuxVars[] AssignedVars[~C~0] 174#[L-1-3]don't care [445] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 176#[L-1-4]don't care [348] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 178#[L-1-5]don't care [321] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 180#[L-1-6]don't care [421] L-1-6-->L87: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_1|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_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~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_1|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_1|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~mem18#1, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~ret12#1.base] 182#[L87]don't care [360] L87-->L87-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] 184#[L87-1]don't care [317] L87-1-->L87-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] 186#[L87-2]don't care [314] L87-2-->L89: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_2| v_~C~0_5) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} OutVars{~C~0=v_~C~0_5, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[~C~0] 188#[L89]don't care [383] L89-->L90: 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] 190#[L90]don't care [435] L90-->L90-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_2| v_~N~0_4) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[~N~0] 192#[L90-1]don't care [332] L90-1-->L91: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] 194#[L91]don't care [333] L91-->L91-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_2| v_~n~0_5) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} OutVars{~n~0=v_~n~0_5, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[~n~0] 196#[L91-1]don't care [340] L91-1-->L92: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] 198#[L92]don't care [418] L92-->L92-1: Formula: (= v_~q_front~0_6 |v_ULTIMATE.start_main_#t~nondet11#1_2|) InVars {ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|, ~q_front~0=v_~q_front~0_6} AuxVars[] AssignedVars[~q_front~0] 200#[L92-1]don't care [407] L92-1-->L93: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1] 202#[L93]don't care [337] L93-->L94: Formula: (= v_~q_front~0_7 v_~q_back~0_11) InVars {~q_front~0=v_~q_front~0_7} OutVars{~q_back~0=v_~q_back~0_11, ~q_front~0=v_~q_front~0_7} AuxVars[] AssignedVars[~q_back~0] 204#[L94]don't care [429] L94-->L94-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 206#[L94-1]don't care [387] L94-1-->L94-2: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~n~0_6) InVars {~n~0=v_~n~0_6} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~n~0=v_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 208#[L94-2]don't care [410] L94-2-->L94-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 210#[L94-3]don't care [388] L94-3-->L110: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_1|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_~size#1] 212#[L110]don't care [379] L110-->L111: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1] 214#[L111]don't care [327] L111-->L111-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 216#[L111-1]don't care [422] L111-1-->L111-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_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] 218#[L111-2]don't care [404] L111-2-->L38: 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] 220#[L38]don't care [373] L38-->L39: 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] 222#[L39]don't care [428] L39-->L38-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[] 226#[L38-1]don't care [396] L38-1-->L112: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 228#[L112]don't care [356] L112-->L112-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 230#[L112-1]don't care [376] L112-1-->L112-2: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_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] 232#[L112-2]don't care [440] L112-2-->L38-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] 234#[L38-2]don't care [439] L38-2-->L39-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] 236#[L39-3]don't care [355] L39-3-->L38-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[] 240#[L38-3]don't care [341] L38-3-->L114: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 242#[L114]don't care [357] L114-->L114-1: Formula: (and (= (store |v_#valid_12| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| 1) |v_#valid_11|) (= (select |v_#valid_12| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2|) 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_2| 0) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| |v_#StackHeapBarrier_4|) (= (store |v_#length_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 4)) |v_#length_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_11|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #valid=|v_#valid_11|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2|, #length=|v_#length_10|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, #length] 244#[L114-1]don't care [400] L114-1-->L114-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 246#[L114-2]don't care [343] L114-2-->L115: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base] 248#[L115]don't care [364] L115-->L115-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~1#1] 250#[L115-6]don't care [2022-07-26 13:36:44,837 INFO L735 eck$LassoCheckResult]: Loop: 250#[L115-6]don't care [346] L115-6-->L116: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_4| |v_ULTIMATE.start_create_fresh_int_array_~size#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[] 254#[L116]don't care [335] L116-->L116-1: Formula: (let ((.cse0 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_5|))) (let ((.cse1 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse0))) (and (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse0 4) (select |v_#length_12| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|)) (= (select |v_#valid_13| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1) (<= 0 .cse1) (= (store |v_#memory_int_7| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_7| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_2|)) |v_#memory_int_6|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_2|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_5|, #length=|v_#length_12|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_2|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_5|, #length=|v_#length_12|} AuxVars[] AssignedVars[#memory_int] 258#[L116-1]don't care [405] L116-1-->L115-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet21#1] 262#[L115-3]don't care [365] L115-3-->L115-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_2|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post20#1] 266#[L115-4]don't care [370] L115-4-->L115-5: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_7|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~1#1] 270#[L115-5]don't care [334] L115-5-->L115-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post20#1] 250#[L115-6]don't care [2022-07-26 13:36:44,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:36:44,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1750324363, now seen corresponding path program 1 times [2022-07-26 13:36:44,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:36:44,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038557028] [2022-07-26 13:36:44,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:36:44,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:36:44,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:36:44,970 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:36:45,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:36:45,028 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:36:45,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:36:45,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1769904502, now seen corresponding path program 1 times [2022-07-26 13:36:45,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:36:45,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96110377] [2022-07-26 13:36:45,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:36:45,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:36:45,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:36:45,055 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:36:45,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:36:45,066 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:36:45,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:36:45,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1635003134, now seen corresponding path program 1 times [2022-07-26 13:36:45,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:36:45,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5248396] [2022-07-26 13:36:45,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:36:45,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:36:45,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:36:45,113 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:36:45,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:36:45,165 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:36:45,894 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 13:36:45,895 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 13:36:45,895 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 13:36:45,895 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 13:36:45,895 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 13:36:45,895 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:45,895 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 13:36:45,895 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 13:36:45,895 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-queue-add-2-nl.wvr.c_BEv2_Iteration1_Lasso [2022-07-26 13:36:45,896 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 13:36:45,896 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 13:36:45,910 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:45,915 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:45,917 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:45,919 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:45,920 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:45,922 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:45,924 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:45,926 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:45,928 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:45,934 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:45,935 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:45,937 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:45,940 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:45,941 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:45,943 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:45,945 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:45,946 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:45,948 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:46,198 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:46,205 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:46,207 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:46,208 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:46,210 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:46,211 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:46,213 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:46,217 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:46,219 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:46,222 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:46,223 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:46,225 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:46,226 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:46,228 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:46,230 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:46,233 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:46,234 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:46,235 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:46,598 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 13:36:46,601 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 13:36:46,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:46,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:46,640 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-26 13:36:46,655 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-26 13:36:46,658 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-26 13:36:46,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:46,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:46,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:46,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:46,670 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:46,670 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:46,686 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:46,704 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-26 13:36:46,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:46,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:46,706 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-26 13:36:46,706 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-26 13:36:46,708 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-26 13:36:46,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:46,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:46,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:46,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:46,717 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:46,717 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:46,732 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:46,749 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-26 13:36:46,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:46,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:46,750 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-26 13:36:46,753 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-26 13:36:46,754 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-26 13:36:46,760 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:46,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:46,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:46,760 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:46,763 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:46,763 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:46,780 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:46,797 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-26 13:36:46,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:46,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:46,798 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-26 13:36:46,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-26 13:36:46,815 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-26 13:36:46,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:46,819 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:36:46,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:46,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:46,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:46,820 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:36:46,820 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:36:46,835 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:46,852 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-26 13:36:46,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:46,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:46,854 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-26 13:36:46,867 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-26 13:36:46,868 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-26 13:36:46,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:46,873 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:36:46,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:46,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:46,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:46,874 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:36:46,874 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:36:46,881 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:46,896 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-26 13:36:46,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:46,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:46,897 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-26 13:36:46,898 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-26 13:36:46,900 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-26 13:36:46,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:46,905 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:36:46,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:46,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:46,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:46,906 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:36:46,906 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:36:46,918 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:46,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-07-26 13:36:46,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:46,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:46,935 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-26 13:36:46,936 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-26 13:36:46,937 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-26 13:36:46,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:46,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:46,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:46,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:46,944 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:46,944 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:46,967 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:46,984 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-26 13:36:46,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:46,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:46,986 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-26 13:36:47,002 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-26 13:36:47,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:47,008 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:36:47,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:47,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:47,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:47,008 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:36:47,008 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:36:47,009 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-26 13:36:47,009 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:47,036 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-26 13:36:47,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:47,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:47,039 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-26 13:36:47,076 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-26 13:36:47,077 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-26 13:36:47,082 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:47,082 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:36:47,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:47,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:47,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:47,084 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:36:47,084 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:36:47,099 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:47,139 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-26 13:36:47,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:47,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:47,144 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-26 13:36:47,146 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-26 13:36:47,146 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-26 13:36:47,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:47,153 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:36:47,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:47,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:47,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:47,153 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:36:47,153 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:36:47,154 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:47,171 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-26 13:36:47,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:47,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:47,173 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-26 13:36:47,174 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-26 13:36:47,175 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-26 13:36:47,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:47,182 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:36:47,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:47,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:47,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:47,182 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:36:47,182 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:36:47,207 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:47,222 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-26 13:36:47,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:47,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:47,224 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-26 13:36:47,225 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-26 13:36:47,226 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-26 13:36:47,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:47,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:47,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:47,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:47,233 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:47,234 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:47,248 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:47,265 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-26 13:36:47,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:47,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:47,267 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-26 13:36:47,267 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-26 13:36:47,269 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-26 13:36:47,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:47,275 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:36:47,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:47,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:47,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:47,275 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:36:47,275 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:36:47,290 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:47,307 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-26 13:36:47,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:47,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:47,309 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-26 13:36:47,310 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-26 13:36:47,311 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-26 13:36:47,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:47,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:47,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:47,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:47,335 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:47,335 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:47,350 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:47,367 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-26 13:36:47,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:47,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:47,368 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-26 13:36:47,369 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-26 13:36:47,381 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-26 13:36:47,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:47,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:47,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:47,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:47,388 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:47,389 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:47,404 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:47,421 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-26 13:36:47,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:47,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:47,422 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-26 13:36:47,423 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-26 13:36:47,424 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-26 13:36:47,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:47,430 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:36:47,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:47,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:47,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:47,431 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:36:47,431 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:36:47,446 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:47,463 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-26 13:36:47,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:47,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:47,464 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-26 13:36:47,466 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-26 13:36:47,467 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-26 13:36:47,476 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:47,476 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:36:47,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:47,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:47,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:47,477 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:36:47,477 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:36:47,480 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:47,499 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-26 13:36:47,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:47,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:47,501 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-26 13:36:47,502 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-26 13:36:47,503 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-26 13:36:47,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:47,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:47,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:47,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:47,522 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:47,522 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:47,529 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:47,546 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-26 13:36:47,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:47,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:47,547 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-26 13:36:47,549 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-26 13:36:47,549 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-26 13:36:47,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:47,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:47,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:47,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:47,571 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:47,571 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:47,573 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:47,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2022-07-26 13:36:47,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:47,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:47,590 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-26 13:36:47,592 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-26 13:36:47,593 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-26 13:36:47,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:47,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:47,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:47,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:47,601 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:47,601 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:47,619 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:47,635 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-26 13:36:47,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:47,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:47,636 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-26 13:36:47,644 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-26 13:36:47,644 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-26 13:36:47,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:47,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:47,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:47,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:47,653 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:47,653 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:47,668 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:47,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-26 13:36:47,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:47,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:47,684 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-26 13:36:47,686 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-26 13:36:47,687 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-26 13:36:47,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:47,693 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:36:47,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:47,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:47,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:47,693 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:36:47,694 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:36:47,702 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:47,717 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-26 13:36:47,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:47,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:47,719 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-26 13:36:47,720 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-26 13:36:47,722 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-26 13:36:47,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:47,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:47,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:47,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:47,736 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:47,736 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:47,751 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:47,766 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-26 13:36:47,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:47,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:47,768 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-26 13:36:47,768 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-26 13:36:47,769 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-26 13:36:47,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:47,775 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-07-26 13:36:47,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:47,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:47,778 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-26 13:36:47,778 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:47,790 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:47,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-26 13:36:47,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:47,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:47,808 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-26 13:36:47,809 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-26 13:36:47,809 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-26 13:36:47,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:47,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:47,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:47,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:47,827 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:47,828 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:47,843 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:47,863 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-26 13:36:47,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:47,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:47,865 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-26 13:36:47,865 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-26 13:36:47,867 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-26 13:36:47,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:47,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:47,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:47,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:47,875 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:47,875 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:47,877 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:47,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-07-26 13:36:47,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:47,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:47,895 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-26 13:36:47,896 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-26 13:36:47,898 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-26 13:36:47,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:47,906 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:47,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:47,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:47,908 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:47,908 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:47,921 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:47,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-07-26 13:36:47,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:47,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:47,937 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-26 13:36:47,938 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-26 13:36:47,939 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-26 13:36:47,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:47,945 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:36:47,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:47,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:47,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:47,946 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:36:47,946 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:36:47,951 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:47,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-07-26 13:36:47,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:47,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:47,968 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-26 13:36:47,969 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-26 13:36:47,970 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-26 13:36:47,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:47,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:47,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:47,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:47,978 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:47,978 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:47,986 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:48,002 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-26 13:36:48,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:48,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:48,003 INFO L229 MonitoredProcess]: Starting monitored process 31 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-26 13:36:48,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-07-26 13:36:48,005 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-26 13:36:48,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:48,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:48,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:48,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:48,038 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:48,039 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:48,054 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:48,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-07-26 13:36:48,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:48,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:48,070 INFO L229 MonitoredProcess]: Starting monitored process 32 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-26 13:36:48,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-07-26 13:36:48,072 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-26 13:36:48,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:48,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:48,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:48,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:48,079 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:48,080 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:48,095 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:48,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-07-26 13:36:48,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:48,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:48,111 INFO L229 MonitoredProcess]: Starting monitored process 33 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-26 13:36:48,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-07-26 13:36:48,113 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-26 13:36:48,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:48,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:48,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:48,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:48,120 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:48,120 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:48,127 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:48,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-07-26 13:36:48,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:48,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:48,143 INFO L229 MonitoredProcess]: Starting monitored process 34 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-26 13:36:48,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-07-26 13:36:48,145 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-26 13:36:48,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:48,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:48,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:48,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:48,156 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:48,156 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:48,172 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 13:36:48,187 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2022-07-26 13:36:48,187 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. [2022-07-26 13:36:48,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:48,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:48,189 INFO L229 MonitoredProcess]: Starting monitored process 35 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-26 13:36:48,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-07-26 13:36:48,191 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 13:36:48,208 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-26 13:36:48,208 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 13:36:48,209 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_~size#1) = -1*ULTIMATE.start_create_fresh_int_array_~i~1#1 + 1*ULTIMATE.start_create_fresh_int_array_~size#1 Supporting invariants [] [2022-07-26 13:36:48,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-07-26 13:36:48,253 INFO L156 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2022-07-26 13:36:48,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:36:48,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:36:48,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 13:36:48,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 13:36:48,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:36:48,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-26 13:36:48,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 13:36:48,428 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-26 13:36:48,455 INFO L141 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-26 13:36:48,458 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 676 states, but on-demand construction may add more states Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 13:36:48,601 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 676 states, but on-demand construction may add more states. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1918 states and 5057 transitions. Complement of second has 9 states. [2022-07-26 13:36:48,603 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-26 13:36:48,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 13:36:48,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 227 transitions. [2022-07-26 13:36:48,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 227 transitions. Stem has 53 letters. Loop has 6 letters. [2022-07-26 13:36:48,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:36:48,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 227 transitions. Stem has 59 letters. Loop has 6 letters. [2022-07-26 13:36:48,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:36:48,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 227 transitions. Stem has 53 letters. Loop has 12 letters. [2022-07-26 13:36:48,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:36:48,612 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1918 states and 5057 transitions. [2022-07-26 13:36:48,631 INFO L131 ngComponentsAnalysis]: Automaton has 57 accepting balls. 411 [2022-07-26 13:36:48,643 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1918 states to 590 states and 1420 transitions. [2022-07-26 13:36:48,644 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 582 [2022-07-26 13:36:48,646 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 584 [2022-07-26 13:36:48,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 590 states and 1420 transitions. [2022-07-26 13:36:48,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 13:36:48,649 INFO L220 hiAutomatonCegarLoop]: Abstraction has 590 states and 1420 transitions. [2022-07-26 13:36:48,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states and 1420 transitions. [2022-07-26 13:36:48,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 589. [2022-07-26 13:36:48,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 589 states have (on average 2.409168081494058) internal successors, (1419), 588 states have internal predecessors, (1419), 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-26 13:36:48,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 1419 transitions. [2022-07-26 13:36:48,710 INFO L242 hiAutomatonCegarLoop]: Abstraction has 589 states and 1419 transitions. [2022-07-26 13:36:48,710 INFO L426 stractBuchiCegarLoop]: Abstraction has 589 states and 1419 transitions. [2022-07-26 13:36:48,710 INFO L333 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-26 13:36:48,710 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 589 states and 1419 transitions. [2022-07-26 13:36:48,713 INFO L131 ngComponentsAnalysis]: Automaton has 57 accepting balls. 411 [2022-07-26 13:36:48,713 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:36:48,713 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:36:48,716 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, 1] [2022-07-26 13:36:48,716 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-26 13:36:48,718 INFO L733 eck$LassoCheckResult]: Stem: 4848#[ULTIMATE.startENTRY]don't care [430] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 4832#[L-1]don't care [342] 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] 4834#[L-1-1]don't care [442] 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[] 4850#[L-1-2]don't care [443] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 4806#[L21]don't care [403] 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[] 4708#[L21-1]don't care [425] 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[] 4550#[L21-2]don't care [353] 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[] 4552#[L21-3]don't care [395] L21-3-->L21-4: Formula: (and (= 33 (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[] 4086#[L21-4]don't care [372] L21-4-->L43: Formula: (and (= v_~q~0.offset_4 0) (= v_~q~0.base_4 0)) InVars {} OutVars{~q~0.base=v_~q~0.base_4, ~q~0.offset=v_~q~0.offset_4} AuxVars[] AssignedVars[~q~0.base, ~q~0.offset] 4088#[L43]don't care [434] L43-->L43-1: Formula: (= v_~q_front~0_5 0) InVars {} OutVars{~q_front~0=v_~q_front~0_5} AuxVars[] AssignedVars[~q_front~0] 4522#[L43-1]don't care [338] L43-1-->L43-2: Formula: (= v_~q_back~0_10 0) InVars {} OutVars{~q_back~0=v_~q_back~0_10} AuxVars[] AssignedVars[~q_back~0] 4524#[L43-2]don't care [358] L43-2-->L43-3: Formula: (= v_~n~0_4 0) InVars {} OutVars{~n~0=v_~n~0_4} AuxVars[] AssignedVars[~n~0] 4578#[L43-3]don't care [363] L43-3-->L43-4: Formula: (= v_~s~0_4 0) InVars {} OutVars{~s~0=v_~s~0_4} AuxVars[] AssignedVars[~s~0] 4396#[L43-4]don't care [433] L43-4-->L44: Formula: (= v_~N~0_3 0) InVars {} OutVars{~N~0=v_~N~0_3} AuxVars[] AssignedVars[~N~0] 4398#[L44]don't care [339] L44-->L44-1: Formula: (= v_~x~0_5 0) InVars {} OutVars{~x~0=v_~x~0_5} AuxVars[] AssignedVars[~x~0] 4132#[L44-1]don't care [386] L44-1-->L44-2: Formula: (= v_~y~0_3 0) InVars {} OutVars{~y~0=v_~y~0_3} AuxVars[] AssignedVars[~y~0] 4134#[L44-2]don't care [389] L44-2-->L-1-3: Formula: (= v_~C~0_4 0) InVars {} OutVars{~C~0=v_~C~0_4} AuxVars[] AssignedVars[~C~0] 4748#[L-1-3]don't care [445] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 3968#[L-1-4]don't care [348] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 3970#[L-1-5]don't care [321] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 4688#[L-1-6]don't care [421] L-1-6-->L87: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_1|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_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~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_1|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_1|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~mem18#1, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~ret12#1.base] 4690#[L87]don't care [360] L87-->L87-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] 4780#[L87-1]don't care [317] L87-1-->L87-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] 3698#[L87-2]don't care [314] L87-2-->L89: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_2| v_~C~0_5) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} OutVars{~C~0=v_~C~0_5, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[~C~0] 3700#[L89]don't care [383] L89-->L90: 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] 4616#[L90]don't care [435] L90-->L90-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_2| v_~N~0_4) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[~N~0] 4816#[L90-1]don't care [332] L90-1-->L91: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] 4478#[L91]don't care [333] L91-->L91-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_2| v_~n~0_5) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} OutVars{~n~0=v_~n~0_5, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[~n~0] 4480#[L91-1]don't care [340] L91-1-->L92: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] 4346#[L92]don't care [418] L92-->L92-1: Formula: (= v_~q_front~0_6 |v_ULTIMATE.start_main_#t~nondet11#1_2|) InVars {ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|, ~q_front~0=v_~q_front~0_6} AuxVars[] AssignedVars[~q_front~0] 4348#[L92-1]don't care [407] L92-1-->L93: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1] 4778#[L93]don't care [337] L93-->L94: Formula: (= v_~q_front~0_7 v_~q_back~0_11) InVars {~q_front~0=v_~q_front~0_7} OutVars{~q_back~0=v_~q_back~0_11, ~q_front~0=v_~q_front~0_7} AuxVars[] AssignedVars[~q_back~0] 4392#[L94]don't care [429] L94-->L94-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 4144#[L94-1]don't care [387] L94-1-->L94-2: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~n~0_6) InVars {~n~0=v_~n~0_6} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~n~0=v_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 4146#[L94-2]don't care [410] L94-2-->L94-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 4286#[L94-3]don't care [388] L94-3-->L110: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_1|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_~size#1] 4794#[L110]don't care [379] L110-->L111: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1] 4472#[L111]don't care [327] L111-->L111-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 4350#[L111-1]don't care [422] L111-1-->L111-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_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] 4352#[L111-2]don't care [404] L111-2-->L38: 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] 4808#[L38]don't care [373] L38-->L39: 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] 4838#[L39]don't care [428] L39-->L38-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[] 4654#[L38-1]don't care [396] L38-1-->L112: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 4562#[L112]don't care [356] L112-->L112-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 4564#[L112-1]don't care [376] L112-1-->L112-2: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_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] 4822#[L112-2]don't care [440] L112-2-->L38-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] 4820#[L38-2]don't care [439] L38-2-->L39-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] 3990#[L39-3]don't care [355] L39-3-->L38-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[] 3934#[L38-3]don't care [341] L38-3-->L114: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 3936#[L114]don't care [357] L114-->L114-1: Formula: (and (= (store |v_#valid_12| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| 1) |v_#valid_11|) (= (select |v_#valid_12| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2|) 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_2| 0) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| |v_#StackHeapBarrier_4|) (= (store |v_#length_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 4)) |v_#length_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_11|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #valid=|v_#valid_11|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2|, #length=|v_#length_10|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, #length] 4664#[L114-1]don't care [400] L114-1-->L114-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 4666#[L114-2]don't care [343] L114-2-->L115: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base] 4058#[L115]don't care [364] L115-->L115-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~1#1] 4060#[L115-6]don't care [345] L115-6-->L115-7: Formula: (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_6|)) InVars {ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[] 3960#[L115-7]don't care [349] L115-7-->L118: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 3966#[L118]don't care [399] L118-->L94-4: Formula: (and (= |v_ULTIMATE.start_main_#t~ret12#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|) (= |v_ULTIMATE.start_main_#t~ret12#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_2|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base] 3724#[L94-4]don't care [316] L94-4-->L94-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 3726#[L94-5]don't care [415] L94-5-->L94-6: Formula: (and (= v_~q~0.offset_5 |v_ULTIMATE.start_main_#t~ret12#1.offset_3|) (= v_~q~0.base_5 |v_ULTIMATE.start_main_#t~ret12#1.base_3|)) InVars {ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_3|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_3|} OutVars{~q~0.base=v_~q~0.base_5, ~q~0.offset=v_~q~0.offset_5, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_3|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_3|} AuxVars[] AssignedVars[~q~0.base, ~q~0.offset] 4826#[L94-6]don't care [444] L94-6-->L96: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_4|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base] 4686#[L96]don't care [419] L96-->L96-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 4608#[L96-1]don't care [380] L96-1-->L96-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| (ite (<= 0 v_~N~0_5) 1 0)) InVars {~N~0=v_~N~0_5} OutVars{~N~0=v_~N~0_5, 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] 4474#[L96-2]don't care [331] L96-2-->L38-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] 4476#[L38-4]don't care [384] L38-4-->L39-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] 4842#[L39-6]don't care [447] L39-6-->L38-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[] 3694#[L38-5]don't care [313] L38-5-->L99: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 3696#[L99]don't care [414] L99-->L99-1: Formula: (= |v_ULTIMATE.start_main_#t~pre13#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1] 3976#[L99-1]don't care [352] L99-1-->L99-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 3978#[L99-2]don't care [423] L99-2-->L99-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_13| |v_ULTIMATE.start_main_~#t1~0#1.base_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~pre13#1_3|)) |v_#memory_int_8|) (= (select |v_#valid_14| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, 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~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, 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] 4814#[L99-3]don't care [481] L99-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre13#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_4|, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_4|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_8|, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_4|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_12|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~post1#1, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 4844#[L99-4, thread1ENTRY]don't care [451] thread1ENTRY-->L49-5: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] 4624#[L49-5, L99-4]don't care [2022-07-26 13:36:48,719 INFO L735 eck$LassoCheckResult]: Loop: 4624#[L49-5, L99-4]don't care [454] L49-5-->L50: Formula: (< |v_thread1Thread1of1ForFork1_~i~0#1_5| v_~N~0_2) InVars {thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_5|, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_5|, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[] 4628#[L99-4, L50]don't care [456] L50-->L54: Formula: (let ((.cse1 (* v_~q_back~0_77 4))) (let ((.cse0 (+ v_~q~0.offset_30 .cse1))) (and (= (select |v_#valid_46| v_~q~0.base_30) 1) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_3| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3| (ite (= (select (select |v_#memory_int_38| v_~q~0.base_30) .cse0) 1) 1 0)) (<= (+ v_~q~0.offset_30 4 .cse1) (select |v_#length_41| v_~q~0.base_30)) (not (= (ite (and (<= 0 v_~q_back~0_77) (< v_~q_back~0_77 v_~n~0_25)) 1 0) 0)) (<= 0 .cse0) (= (+ v_~q_back~0_77 1) v_~q_back~0_76) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|)))) InVars {~q_back~0=v_~q_back~0_77, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_38|, #length=|v_#length_41|, ~q~0.base=v_~q~0.base_30, ~n~0=v_~n~0_25, ~q~0.offset=v_~q~0.offset_30} OutVars{~q_back~0=v_~q_back~0_76, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_38|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, #length=|v_#length_41|, ~q~0.base=v_~q~0.base_30, ~n~0=v_~n~0_25, ~q~0.offset=v_~q~0.offset_30, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|} AuxVars[] AssignedVars[~q_back~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 3920#[L99-4, L54]don't care [458] L54-->L49-2: Formula: (= (+ v_~C~0_1 v_~x~0_2) v_~x~0_1) InVars {~C~0=v_~C~0_1, ~x~0=v_~x~0_2} OutVars{~C~0=v_~C~0_1, ~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] 3924#[L99-4, L49-2]don't care [460] L49-2-->L49-3: Formula: (= |v_thread1Thread1of1ForFork1_#t~post1#1_1| |v_thread1Thread1of1ForFork1_~i~0#1_7|) InVars {thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_7|} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_7|, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1] 4840#[L99-4, L49-3]don't care [462] L49-3-->L49-4: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_9| (+ |v_thread1Thread1of1ForFork1_#t~post1#1_3| 1)) InVars {thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_3|} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_9|, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] 4824#[L49-4, L99-4]don't care [463] L49-4-->L49-5: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1] 4624#[L49-5, L99-4]don't care [2022-07-26 13:36:48,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:36:48,719 INFO L85 PathProgramCache]: Analyzing trace with hash 10953660, now seen corresponding path program 1 times [2022-07-26 13:36:48,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:36:48,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357338831] [2022-07-26 13:36:48,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:36:48,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:36:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:36:48,772 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:36:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:36:48,813 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:36:48,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:36:48,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1435463046, now seen corresponding path program 1 times [2022-07-26 13:36:48,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:36:48,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38789633] [2022-07-26 13:36:48,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:36:48,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:36:48,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:36:48,828 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:36:48,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:36:48,838 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:36:48,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:36:48,838 INFO L85 PathProgramCache]: Analyzing trace with hash 457021697, now seen corresponding path program 1 times [2022-07-26 13:36:48,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:36:48,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230702281] [2022-07-26 13:36:48,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:36:48,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:36:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:36:48,942 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-26 13:36:48,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 13:36:48,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230702281] [2022-07-26 13:36:48,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230702281] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 13:36:48,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 13:36:48,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-26 13:36:48,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135899482] [2022-07-26 13:36:48,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 13:36:49,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 13:36:49,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-26 13:36:49,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-26 13:36:49,041 INFO L87 Difference]: Start difference. First operand 589 states and 1419 transitions. cyclomatic complexity: 888 Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 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-26 13:36:49,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 13:36:49,105 INFO L93 Difference]: Finished difference Result 696 states and 1624 transitions. [2022-07-26 13:36:49,105 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 696 states and 1624 transitions. [2022-07-26 13:36:49,110 INFO L131 ngComponentsAnalysis]: Automaton has 57 accepting balls. 411 [2022-07-26 13:36:49,113 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 696 states to 593 states and 1422 transitions. [2022-07-26 13:36:49,113 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 583 [2022-07-26 13:36:49,114 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 583 [2022-07-26 13:36:49,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 593 states and 1422 transitions. [2022-07-26 13:36:49,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 13:36:49,119 INFO L220 hiAutomatonCegarLoop]: Abstraction has 593 states and 1422 transitions. [2022-07-26 13:36:49,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states and 1422 transitions. [2022-07-26 13:36:49,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 589. [2022-07-26 13:36:49,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 589 states have (on average 2.4074702886247876) internal successors, (1418), 588 states have internal predecessors, (1418), 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-26 13:36:49,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 1418 transitions. [2022-07-26 13:36:49,130 INFO L242 hiAutomatonCegarLoop]: Abstraction has 589 states and 1418 transitions. [2022-07-26 13:36:49,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-26 13:36:49,131 INFO L426 stractBuchiCegarLoop]: Abstraction has 589 states and 1418 transitions. [2022-07-26 13:36:49,131 INFO L333 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-26 13:36:49,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 589 states and 1418 transitions. [2022-07-26 13:36:49,134 INFO L131 ngComponentsAnalysis]: Automaton has 57 accepting balls. 411 [2022-07-26 13:36:49,134 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:36:49,134 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:36:49,137 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 13:36:49,137 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-26 13:36:49,138 INFO L733 eck$LassoCheckResult]: Stem: 6739#[ULTIMATE.startENTRY]don't care [430] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 6723#[L-1]don't care [342] 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] 6725#[L-1-1]don't care [442] 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[] 6741#[L-1-2]don't care [443] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 6699#[L21]don't care [403] 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[] 6599#[L21-1]don't care [425] 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[] 6441#[L21-2]don't care [353] 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[] 6443#[L21-3]don't care [395] L21-3-->L21-4: Formula: (and (= 33 (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[] 5975#[L21-4]don't care [372] L21-4-->L43: Formula: (and (= v_~q~0.offset_4 0) (= v_~q~0.base_4 0)) InVars {} OutVars{~q~0.base=v_~q~0.base_4, ~q~0.offset=v_~q~0.offset_4} AuxVars[] AssignedVars[~q~0.base, ~q~0.offset] 5977#[L43]don't care [434] L43-->L43-1: Formula: (= v_~q_front~0_5 0) InVars {} OutVars{~q_front~0=v_~q_front~0_5} AuxVars[] AssignedVars[~q_front~0] 6413#[L43-1]don't care [338] L43-1-->L43-2: Formula: (= v_~q_back~0_10 0) InVars {} OutVars{~q_back~0=v_~q_back~0_10} AuxVars[] AssignedVars[~q_back~0] 6415#[L43-2]don't care [358] L43-2-->L43-3: Formula: (= v_~n~0_4 0) InVars {} OutVars{~n~0=v_~n~0_4} AuxVars[] AssignedVars[~n~0] 6469#[L43-3]don't care [363] L43-3-->L43-4: Formula: (= v_~s~0_4 0) InVars {} OutVars{~s~0=v_~s~0_4} AuxVars[] AssignedVars[~s~0] 6285#[L43-4]don't care [433] L43-4-->L44: Formula: (= v_~N~0_3 0) InVars {} OutVars{~N~0=v_~N~0_3} AuxVars[] AssignedVars[~N~0] 6287#[L44]don't care [339] L44-->L44-1: Formula: (= v_~x~0_5 0) InVars {} OutVars{~x~0=v_~x~0_5} AuxVars[] AssignedVars[~x~0] 6021#[L44-1]don't care [386] L44-1-->L44-2: Formula: (= v_~y~0_3 0) InVars {} OutVars{~y~0=v_~y~0_3} AuxVars[] AssignedVars[~y~0] 6023#[L44-2]don't care [389] L44-2-->L-1-3: Formula: (= v_~C~0_4 0) InVars {} OutVars{~C~0=v_~C~0_4} AuxVars[] AssignedVars[~C~0] 6639#[L-1-3]don't care [445] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 5855#[L-1-4]don't care [348] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 5857#[L-1-5]don't care [321] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 6579#[L-1-6]don't care [421] L-1-6-->L87: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_1|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_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~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_1|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_1|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~mem18#1, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~ret12#1.base] 6581#[L87]don't care [360] L87-->L87-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] 6671#[L87-1]don't care [317] L87-1-->L87-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] 5589#[L87-2]don't care [314] L87-2-->L89: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_2| v_~C~0_5) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} OutVars{~C~0=v_~C~0_5, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[~C~0] 5591#[L89]don't care [383] L89-->L90: 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] 6507#[L90]don't care [435] L90-->L90-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_2| v_~N~0_4) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[~N~0] 6707#[L90-1]don't care [332] L90-1-->L91: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] 6369#[L91]don't care [333] L91-->L91-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_2| v_~n~0_5) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} OutVars{~n~0=v_~n~0_5, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[~n~0] 6371#[L91-1]don't care [340] L91-1-->L92: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] 6235#[L92]don't care [418] L92-->L92-1: Formula: (= v_~q_front~0_6 |v_ULTIMATE.start_main_#t~nondet11#1_2|) InVars {ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|, ~q_front~0=v_~q_front~0_6} AuxVars[] AssignedVars[~q_front~0] 6237#[L92-1]don't care [407] L92-1-->L93: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1] 6669#[L93]don't care [337] L93-->L94: Formula: (= v_~q_front~0_7 v_~q_back~0_11) InVars {~q_front~0=v_~q_front~0_7} OutVars{~q_back~0=v_~q_back~0_11, ~q_front~0=v_~q_front~0_7} AuxVars[] AssignedVars[~q_back~0] 6281#[L94]don't care [429] L94-->L94-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 6033#[L94-1]don't care [387] L94-1-->L94-2: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~n~0_6) InVars {~n~0=v_~n~0_6} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~n~0=v_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 6035#[L94-2]don't care [410] L94-2-->L94-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 6175#[L94-3]don't care [388] L94-3-->L110: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_1|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_~size#1] 6685#[L110]don't care [379] L110-->L111: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1] 6361#[L111]don't care [327] L111-->L111-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 6239#[L111-1]don't care [422] L111-1-->L111-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_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] 6241#[L111-2]don't care [404] L111-2-->L38: 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] 6697#[L38]don't care [373] L38-->L39: 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] 6729#[L39]don't care [428] L39-->L38-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[] 6545#[L38-1]don't care [396] L38-1-->L112: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 6453#[L112]don't care [356] L112-->L112-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 6455#[L112-1]don't care [376] L112-1-->L112-2: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_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] 6713#[L112-2]don't care [440] L112-2-->L38-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] 6711#[L38-2]don't care [439] L38-2-->L39-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] 5881#[L39-3]don't care [355] L39-3-->L38-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[] 5825#[L38-3]don't care [341] L38-3-->L114: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 5827#[L114]don't care [357] L114-->L114-1: Formula: (and (= (store |v_#valid_12| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| 1) |v_#valid_11|) (= (select |v_#valid_12| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2|) 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_2| 0) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| |v_#StackHeapBarrier_4|) (= (store |v_#length_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 4)) |v_#length_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_11|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #valid=|v_#valid_11|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2|, #length=|v_#length_10|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, #length] 6555#[L114-1]don't care [400] L114-1-->L114-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 6557#[L114-2]don't care [343] L114-2-->L115: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base] 5949#[L115]don't care [364] L115-->L115-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~1#1] 5849#[L115-6]don't care [346] L115-6-->L116: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_4| |v_ULTIMATE.start_create_fresh_int_array_~size#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[] 5851#[L116]don't care [335] L116-->L116-1: Formula: (let ((.cse0 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_5|))) (let ((.cse1 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse0))) (and (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse0 4) (select |v_#length_12| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|)) (= (select |v_#valid_13| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1) (<= 0 .cse1) (= (store |v_#memory_int_7| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_7| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_2|)) |v_#memory_int_6|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_2|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_5|, #length=|v_#length_12|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_2|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_5|, #length=|v_#length_12|} AuxVars[] AssignedVars[#memory_int] 6395#[L116-1]don't care [405] L116-1-->L115-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet21#1] 6471#[L115-3]don't care [365] L115-3-->L115-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_2|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post20#1] 6473#[L115-4]don't care [370] L115-4-->L115-5: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_7|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~1#1] 6375#[L115-5]don't care [334] L115-5-->L115-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post20#1] 6377#[L115-6]don't care [345] L115-6-->L115-7: Formula: (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_6|)) InVars {ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[] 5859#[L115-7]don't care [349] L115-7-->L118: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 5861#[L118]don't care [399] L118-->L94-4: Formula: (and (= |v_ULTIMATE.start_main_#t~ret12#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|) (= |v_ULTIMATE.start_main_#t~ret12#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_2|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base] 5615#[L94-4]don't care [316] L94-4-->L94-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 5617#[L94-5]don't care [415] L94-5-->L94-6: Formula: (and (= v_~q~0.offset_5 |v_ULTIMATE.start_main_#t~ret12#1.offset_3|) (= v_~q~0.base_5 |v_ULTIMATE.start_main_#t~ret12#1.base_3|)) InVars {ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_3|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_3|} OutVars{~q~0.base=v_~q~0.base_5, ~q~0.offset=v_~q~0.offset_5, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_3|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_3|} AuxVars[] AssignedVars[~q~0.base, ~q~0.offset] 6717#[L94-6]don't care [444] L94-6-->L96: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_4|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base] 6577#[L96]don't care [419] L96-->L96-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 6505#[L96-1]don't care [380] L96-1-->L96-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| (ite (<= 0 v_~N~0_5) 1 0)) InVars {~N~0=v_~N~0_5} OutVars{~N~0=v_~N~0_5, 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] 6363#[L96-2]don't care [331] L96-2-->L38-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] 6365#[L38-4]don't care [384] L38-4-->L39-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] 6733#[L39-6]don't care [447] L39-6-->L38-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[] 5577#[L38-5]don't care [313] L38-5-->L99: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 5579#[L99]don't care [414] L99-->L99-1: Formula: (= |v_ULTIMATE.start_main_#t~pre13#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1] 5867#[L99-1]don't care [352] L99-1-->L99-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 5869#[L99-2]don't care [423] L99-2-->L99-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_13| |v_ULTIMATE.start_main_~#t1~0#1.base_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~pre13#1_3|)) |v_#memory_int_8|) (= (select |v_#valid_14| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, 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~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, 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] 6705#[L99-3]don't care [481] L99-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre13#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_4|, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_4|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_8|, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_4|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_12|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~post1#1, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 6735#[L99-4, thread1ENTRY]don't care [451] thread1ENTRY-->L49-5: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] 6515#[L49-5, L99-4]don't care [2022-07-26 13:36:49,138 INFO L735 eck$LassoCheckResult]: Loop: 6515#[L49-5, L99-4]don't care [454] L49-5-->L50: Formula: (< |v_thread1Thread1of1ForFork1_~i~0#1_5| v_~N~0_2) InVars {thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_5|, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_5|, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[] 6519#[L99-4, L50]don't care [456] L50-->L54: Formula: (let ((.cse1 (* v_~q_back~0_77 4))) (let ((.cse0 (+ v_~q~0.offset_30 .cse1))) (and (= (select |v_#valid_46| v_~q~0.base_30) 1) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_3| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3| (ite (= (select (select |v_#memory_int_38| v_~q~0.base_30) .cse0) 1) 1 0)) (<= (+ v_~q~0.offset_30 4 .cse1) (select |v_#length_41| v_~q~0.base_30)) (not (= (ite (and (<= 0 v_~q_back~0_77) (< v_~q_back~0_77 v_~n~0_25)) 1 0) 0)) (<= 0 .cse0) (= (+ v_~q_back~0_77 1) v_~q_back~0_76) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|)))) InVars {~q_back~0=v_~q_back~0_77, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_38|, #length=|v_#length_41|, ~q~0.base=v_~q~0.base_30, ~n~0=v_~n~0_25, ~q~0.offset=v_~q~0.offset_30} OutVars{~q_back~0=v_~q_back~0_76, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_38|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, #length=|v_#length_41|, ~q~0.base=v_~q~0.base_30, ~n~0=v_~n~0_25, ~q~0.offset=v_~q~0.offset_30, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|} AuxVars[] AssignedVars[~q_back~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 5811#[L99-4, L54]don't care [458] L54-->L49-2: Formula: (= (+ v_~C~0_1 v_~x~0_2) v_~x~0_1) InVars {~C~0=v_~C~0_1, ~x~0=v_~x~0_2} OutVars{~C~0=v_~C~0_1, ~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] 5815#[L99-4, L49-2]don't care [460] L49-2-->L49-3: Formula: (= |v_thread1Thread1of1ForFork1_#t~post1#1_1| |v_thread1Thread1of1ForFork1_~i~0#1_7|) InVars {thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_7|} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_7|, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1] 6731#[L99-4, L49-3]don't care [462] L49-3-->L49-4: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_9| (+ |v_thread1Thread1of1ForFork1_#t~post1#1_3| 1)) InVars {thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_3|} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_9|, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] 6715#[L49-4, L99-4]don't care [463] L49-4-->L49-5: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1] 6515#[L49-5, L99-4]don't care [2022-07-26 13:36:49,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:36:49,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1609627821, now seen corresponding path program 1 times [2022-07-26 13:36:49,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:36:49,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451652348] [2022-07-26 13:36:49,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:36:49,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:36:49,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:36:49,167 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:36:49,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:36:49,205 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:36:49,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:36:49,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1435463046, now seen corresponding path program 2 times [2022-07-26 13:36:49,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:36:49,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632405397] [2022-07-26 13:36:49,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:36:49,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:36:49,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:36:49,209 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:36:49,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:36:49,220 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:36:49,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:36:49,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1413730472, now seen corresponding path program 1 times [2022-07-26 13:36:49,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:36:49,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710158818] [2022-07-26 13:36:49,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:36:49,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:36:49,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:36:49,277 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:36:49,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:36:49,296 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:36:49,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2022-07-26 13:36:50,225 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 13:36:50,226 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 13:36:50,226 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 13:36:50,226 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 13:36:50,226 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 13:36:50,226 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:50,226 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 13:36:50,226 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 13:36:50,226 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-queue-add-2-nl.wvr.c_BEv2_Iteration3_Lasso [2022-07-26 13:36:50,226 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 13:36:50,226 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 13:36:50,229 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:50,234 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:50,235 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:50,236 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:50,237 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:50,238 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:50,240 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:50,242 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:50,243 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:50,244 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:50,245 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:50,246 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:50,247 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:50,249 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:50,251 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:50,253 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:50,255 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:50,256 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:50,257 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:50,258 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:50,271 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:50,273 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:50,274 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:50,278 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:50,279 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:50,280 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:50,281 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:50,282 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:50,286 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:50,287 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:50,288 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:50,290 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:50,290 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:50,292 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:50,293 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:50,294 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:50,713 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:50,715 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:36:51,179 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 13:36:51,179 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 13:36:51,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:51,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:51,190 INFO L229 MonitoredProcess]: Starting monitored process 36 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-26 13:36:51,192 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-26 13:36:51,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:51,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:51,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:51,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:51,200 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:51,200 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:51,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-07-26 13:36:51,218 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:51,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-07-26 13:36:51,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:51,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:51,258 INFO L229 MonitoredProcess]: Starting monitored process 37 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-26 13:36:51,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-07-26 13:36:51,261 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-26 13:36:51,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:51,267 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:36:51,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:51,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:51,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:51,279 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:36:51,279 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:36:51,284 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:51,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-07-26 13:36:51,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:51,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:51,302 INFO L229 MonitoredProcess]: Starting monitored process 38 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-26 13:36:51,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-07-26 13:36:51,304 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-26 13:36:51,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:51,310 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:36:51,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:51,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:51,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:51,311 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:36:51,311 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:36:51,327 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:51,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-07-26 13:36:51,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:51,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:51,344 INFO L229 MonitoredProcess]: Starting monitored process 39 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-26 13:36:51,351 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-26 13:36:51,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:51,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:51,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:51,358 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:51,360 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:51,360 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:51,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-07-26 13:36:51,371 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:51,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-07-26 13:36:51,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:51,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:51,388 INFO L229 MonitoredProcess]: Starting monitored process 40 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-26 13:36:51,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-07-26 13:36:51,425 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-26 13:36:51,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:51,432 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:36:51,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:51,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:51,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:51,433 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:36:51,433 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:36:51,439 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:51,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-07-26 13:36:51,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:51,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:51,463 INFO L229 MonitoredProcess]: Starting monitored process 41 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-26 13:36:51,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-07-26 13:36:51,467 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-26 13:36:51,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:51,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:51,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:51,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:51,475 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:51,475 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:51,477 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:51,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-07-26 13:36:51,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:51,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:51,498 INFO L229 MonitoredProcess]: Starting monitored process 42 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-26 13:36:51,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-07-26 13:36:51,499 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-26 13:36:51,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:51,506 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:36:51,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:51,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:51,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:51,507 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:36:51,507 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:36:51,509 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:51,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2022-07-26 13:36:51,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:51,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:51,530 INFO L229 MonitoredProcess]: Starting monitored process 43 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-26 13:36:51,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-07-26 13:36:51,532 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-26 13:36:51,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:51,539 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:36:51,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:51,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:51,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:51,540 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:36:51,540 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:36:51,543 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:51,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-07-26 13:36:51,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:51,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:51,568 INFO L229 MonitoredProcess]: Starting monitored process 44 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-26 13:36:51,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-07-26 13:36:51,571 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-26 13:36:51,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:51,577 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:36:51,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:51,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:51,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:51,578 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:36:51,578 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:36:51,580 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:51,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-07-26 13:36:51,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:51,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:51,599 INFO L229 MonitoredProcess]: Starting monitored process 45 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-26 13:36:51,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-07-26 13:36:51,601 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-26 13:36:51,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:51,608 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:36:51,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:51,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:51,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:51,609 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:36:51,609 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:36:51,611 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:51,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2022-07-26 13:36:51,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:51,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:51,634 INFO L229 MonitoredProcess]: Starting monitored process 46 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-26 13:36:51,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-07-26 13:36:51,636 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-26 13:36:51,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:51,643 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:36:51,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:51,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:51,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:51,643 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:36:51,643 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:36:51,657 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:51,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2022-07-26 13:36:51,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:51,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:51,676 INFO L229 MonitoredProcess]: Starting monitored process 47 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-26 13:36:51,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-07-26 13:36:51,678 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-26 13:36:51,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:51,685 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:36:51,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:51,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:51,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:51,694 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:36:51,694 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:36:51,695 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:51,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2022-07-26 13:36:51,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:51,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:51,712 INFO L229 MonitoredProcess]: Starting monitored process 48 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-26 13:36:51,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-07-26 13:36:51,714 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-26 13:36:51,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:51,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:51,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:51,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:51,721 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:51,721 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:51,724 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:51,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2022-07-26 13:36:51,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:51,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:51,741 INFO L229 MonitoredProcess]: Starting monitored process 49 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-26 13:36:51,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-07-26 13:36:51,742 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-26 13:36:51,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:51,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:51,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:51,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:51,759 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:51,759 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:51,771 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:51,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2022-07-26 13:36:51,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:51,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:51,793 INFO L229 MonitoredProcess]: Starting monitored process 50 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-26 13:36:51,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-07-26 13:36:51,795 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-26 13:36:51,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:51,801 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:36:51,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:51,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:51,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:51,802 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:36:51,802 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:36:51,803 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:51,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2022-07-26 13:36:51,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:51,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:51,833 INFO L229 MonitoredProcess]: Starting monitored process 51 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-26 13:36:51,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-07-26 13:36:51,835 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-26 13:36:51,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:51,841 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:36:51,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:51,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:51,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:51,842 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:36:51,842 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:36:51,857 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:51,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2022-07-26 13:36:51,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:51,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:51,874 INFO L229 MonitoredProcess]: Starting monitored process 52 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-26 13:36:51,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-07-26 13:36:51,876 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-26 13:36:51,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:51,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:51,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:51,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:51,883 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:51,883 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:51,886 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:51,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2022-07-26 13:36:51,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:51,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:51,906 INFO L229 MonitoredProcess]: Starting monitored process 53 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-26 13:36:51,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-07-26 13:36:51,908 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-26 13:36:51,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:51,915 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:36:51,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:51,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:51,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:51,915 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:36:51,915 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:36:51,935 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:51,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2022-07-26 13:36:51,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:51,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:51,953 INFO L229 MonitoredProcess]: Starting monitored process 54 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-26 13:36:51,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-07-26 13:36:51,955 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-26 13:36:51,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:51,962 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:36:51,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:51,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:51,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:51,962 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:36:51,962 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:36:51,977 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:51,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2022-07-26 13:36:51,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:51,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:51,993 INFO L229 MonitoredProcess]: Starting monitored process 55 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-26 13:36:51,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-07-26 13:36:51,995 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-26 13:36:52,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:52,001 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:36:52,001 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:52,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:52,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:52,002 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:36:52,002 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:36:52,016 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:52,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2022-07-26 13:36:52,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:52,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:52,033 INFO L229 MonitoredProcess]: Starting monitored process 56 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-26 13:36:52,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-07-26 13:36:52,035 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-26 13:36:52,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:52,040 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:36:52,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:52,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:52,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:52,041 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:36:52,041 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:36:52,056 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:52,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2022-07-26 13:36:52,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:52,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:52,075 INFO L229 MonitoredProcess]: Starting monitored process 57 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-26 13:36:52,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-07-26 13:36:52,077 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-26 13:36:52,082 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:52,082 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:36:52,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:52,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:52,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:52,083 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:36:52,083 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:36:52,083 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:36:52,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2022-07-26 13:36:52,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:52,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:52,101 INFO L229 MonitoredProcess]: Starting monitored process 58 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-26 13:36:52,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-07-26 13:36:52,103 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-26 13:36:52,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:36:52,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:36:52,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:36:52,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:36:52,115 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:36:52,115 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:36:52,118 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 13:36:52,126 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2022-07-26 13:36:52,127 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2022-07-26 13:36:52,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:36:52,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:52,128 INFO L229 MonitoredProcess]: Starting monitored process 59 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-26 13:36:52,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-07-26 13:36:52,129 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 13:36:52,142 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-26 13:36:52,143 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 13:36:52,143 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~N~0, thread1Thread1of1ForFork1_~i~0#1) = 1*~N~0 - 1*thread1Thread1of1ForFork1_~i~0#1 Supporting invariants [] [2022-07-26 13:36:52,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2022-07-26 13:36:52,241 INFO L156 tatePredicateManager]: 25 out of 25 supporting invariants were superfluous and have been removed [2022-07-26 13:36:52,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:36:52,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:36:52,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 13:36:52,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 13:36:52,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2022-07-26 13:36:52,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:36:52,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-26 13:36:52,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 13:36:52,419 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-26 13:36:52,419 INFO L141 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-26 13:36:52,419 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 589 states and 1418 transitions. cyclomatic complexity: 887 Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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-26 13:36:52,474 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 589 states and 1418 transitions. cyclomatic complexity: 887. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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 1315 states and 3625 transitions. Complement of second has 8 states. [2022-07-26 13:36:52,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-07-26 13:36:52,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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-26 13:36:52,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 188 transitions. [2022-07-26 13:36:52,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 188 transitions. Stem has 76 letters. Loop has 6 letters. [2022-07-26 13:36:52,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:36:52,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 188 transitions. Stem has 82 letters. Loop has 6 letters. [2022-07-26 13:36:52,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:36:52,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 188 transitions. Stem has 76 letters. Loop has 12 letters. [2022-07-26 13:36:52,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:36:52,479 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1315 states and 3625 transitions. [2022-07-26 13:36:52,487 INFO L131 ngComponentsAnalysis]: Automaton has 51 accepting balls. 255 [2022-07-26 13:36:52,494 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1315 states to 908 states and 2456 transitions. [2022-07-26 13:36:52,494 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 530 [2022-07-26 13:36:52,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 665 [2022-07-26 13:36:52,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 908 states and 2456 transitions. [2022-07-26 13:36:52,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 13:36:52,496 INFO L220 hiAutomatonCegarLoop]: Abstraction has 908 states and 2456 transitions. [2022-07-26 13:36:52,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states and 2456 transitions. [2022-07-26 13:36:52,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 775. [2022-07-26 13:36:52,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 775 states have (on average 2.6748387096774193) internal successors, (2073), 774 states have internal predecessors, (2073), 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-26 13:36:52,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 2073 transitions. [2022-07-26 13:36:52,509 INFO L242 hiAutomatonCegarLoop]: Abstraction has 775 states and 2073 transitions. [2022-07-26 13:36:52,509 INFO L426 stractBuchiCegarLoop]: Abstraction has 775 states and 2073 transitions. [2022-07-26 13:36:52,509 INFO L333 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-26 13:36:52,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 775 states and 2073 transitions. [2022-07-26 13:36:52,513 INFO L131 ngComponentsAnalysis]: Automaton has 51 accepting balls. 255 [2022-07-26 13:36:52,513 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:36:52,513 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:36:52,515 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 13:36:52,515 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-26 13:36:52,517 INFO L733 eck$LassoCheckResult]: Stem: 9970#[ULTIMATE.startENTRY]don't care [430] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 9934#[L-1]don't care [342] 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] 9936#[L-1-1]don't care [442] 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[] 9976#[L-1-2]don't care [443] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 9872#[L21]don't care [403] 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[] 9734#[L21-1]don't care [425] 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[] 9530#[L21-2]don't care [353] 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[] 9532#[L21-3]don't care [395] L21-3-->L21-4: Formula: (and (= 33 (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[] 8930#[L21-4]don't care [372] L21-4-->L43: Formula: (and (= v_~q~0.offset_4 0) (= v_~q~0.base_4 0)) InVars {} OutVars{~q~0.base=v_~q~0.base_4, ~q~0.offset=v_~q~0.offset_4} AuxVars[] AssignedVars[~q~0.base, ~q~0.offset] 8932#[L43]don't care [434] L43-->L43-1: Formula: (= v_~q_front~0_5 0) InVars {} OutVars{~q_front~0=v_~q_front~0_5} AuxVars[] AssignedVars[~q_front~0] 9486#[L43-1]don't care [338] L43-1-->L43-2: Formula: (= v_~q_back~0_10 0) InVars {} OutVars{~q_back~0=v_~q_back~0_10} AuxVars[] AssignedVars[~q_back~0] 9488#[L43-2]don't care [358] L43-2-->L43-3: Formula: (= v_~n~0_4 0) InVars {} OutVars{~n~0=v_~n~0_4} AuxVars[] AssignedVars[~n~0] 9574#[L43-3]don't care [363] L43-3-->L43-4: Formula: (= v_~s~0_4 0) InVars {} OutVars{~s~0=v_~s~0_4} AuxVars[] AssignedVars[~s~0] 9348#[L43-4]don't care [433] L43-4-->L44: Formula: (= v_~N~0_3 0) InVars {} OutVars{~N~0=v_~N~0_3} AuxVars[] AssignedVars[~N~0] 9350#[L44]don't care [339] L44-->L44-1: Formula: (= v_~x~0_5 0) InVars {} OutVars{~x~0=v_~x~0_5} AuxVars[] AssignedVars[~x~0] 8998#[L44-1]don't care [386] L44-1-->L44-2: Formula: (= v_~y~0_3 0) InVars {} OutVars{~y~0=v_~y~0_3} AuxVars[] AssignedVars[~y~0] 9000#[L44-2]don't care [389] L44-2-->L-1-3: Formula: (= v_~C~0_4 0) InVars {} OutVars{~C~0=v_~C~0_4} AuxVars[] AssignedVars[~C~0] 9798#[L-1-3]don't care [445] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 8802#[L-1-4]don't care [348] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 8804#[L-1-5]don't care [321] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 9716#[L-1-6]don't care [421] L-1-6-->L87: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_1|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_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~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_1|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_1|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~mem18#1, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~ret12#1.base] 9718#[L87]don't care [360] L87-->L87-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] 9840#[L87-1]don't care [317] L87-1-->L87-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] 8450#[L87-2]don't care [314] L87-2-->L89: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_2| v_~C~0_5) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} OutVars{~C~0=v_~C~0_5, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[~C~0] 8452#[L89]don't care [383] L89-->L90: 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] 9618#[L90]don't care [435] L90-->L90-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_2| v_~N~0_4) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[~N~0] 9896#[L90-1]don't care [332] L90-1-->L91: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] 9446#[L91]don't care [333] L91-->L91-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_2| v_~n~0_5) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} OutVars{~n~0=v_~n~0_5, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[~n~0] 9448#[L91-1]don't care [340] L91-1-->L92: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] 9294#[L92]don't care [418] L92-->L92-1: Formula: (= v_~q_front~0_6 |v_ULTIMATE.start_main_#t~nondet11#1_2|) InVars {ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|, ~q_front~0=v_~q_front~0_6} AuxVars[] AssignedVars[~q_front~0] 9296#[L92-1]don't care [407] L92-1-->L93: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1] 9836#[L93]don't care [337] L93-->L94: Formula: (= v_~q_front~0_7 v_~q_back~0_11) InVars {~q_front~0=v_~q_front~0_7} OutVars{~q_back~0=v_~q_back~0_11, ~q_front~0=v_~q_front~0_7} AuxVars[] AssignedVars[~q_back~0] 9342#[L94]don't care [429] L94-->L94-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 9016#[L94-1]don't care [387] L94-1-->L94-2: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~n~0_6) InVars {~n~0=v_~n~0_6} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~n~0=v_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 9018#[L94-2]don't care [410] L94-2-->L94-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 9216#[L94-3]don't care [388] L94-3-->L110: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_1|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_~size#1] 9860#[L110]don't care [379] L110-->L111: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1] 9440#[L111]don't care [327] L111-->L111-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 9298#[L111-1]don't care [422] L111-1-->L111-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_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] 9300#[L111-2]don't care [404] L111-2-->L38: 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] 9874#[L38]don't care [373] L38-->L39: 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] 9946#[L39]don't care [428] L39-->L38-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[] 9672#[L38-1]don't care [396] L38-1-->L112: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 9546#[L112]don't care [356] L112-->L112-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 9548#[L112-1]don't care [376] L112-1-->L112-2: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_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] 9902#[L112-2]don't care [440] L112-2-->L38-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] 9900#[L38-2]don't care [439] L38-2-->L39-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] 8822#[L39-3]don't care [355] L39-3-->L38-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[] 8764#[L38-3]don't care [341] L38-3-->L114: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 8766#[L114]don't care [357] L114-->L114-1: Formula: (and (= (store |v_#valid_12| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| 1) |v_#valid_11|) (= (select |v_#valid_12| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2|) 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_2| 0) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| |v_#StackHeapBarrier_4|) (= (store |v_#length_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 4)) |v_#length_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_11|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #valid=|v_#valid_11|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2|, #length=|v_#length_10|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, #length] 9688#[L114-1]don't care [400] L114-1-->L114-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 9690#[L114-2]don't care [343] L114-2-->L115: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base] 8892#[L115]don't care [364] L115-->L115-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~1#1] 8894#[L115-6]don't care [346] L115-6-->L116: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_4| |v_ULTIMATE.start_create_fresh_int_array_~size#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[] 8798#[L116]don't care [335] L116-->L116-1: Formula: (let ((.cse0 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_5|))) (let ((.cse1 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse0))) (and (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse0 4) (select |v_#length_12| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|)) (= (select |v_#valid_13| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1) (<= 0 .cse1) (= (store |v_#memory_int_7| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_7| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_2|)) |v_#memory_int_6|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_2|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_5|, #length=|v_#length_12|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_2|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_5|, #length=|v_#length_12|} AuxVars[] AssignedVars[#memory_int] 9472#[L116-1]don't care [405] L116-1-->L115-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet21#1] 9576#[L115-3]don't care [365] L115-3-->L115-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_2|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post20#1] 9578#[L115-4]don't care [370] L115-4-->L115-5: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_7|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~1#1] 9456#[L115-5]don't care [334] L115-5-->L115-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post20#1] 8792#[L115-6]don't care [345] L115-6-->L115-7: Formula: (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_6|)) InVars {ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[] 8794#[L115-7]don't care [349] L115-7-->L118: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 8800#[L118]don't care [399] L118-->L94-4: Formula: (and (= |v_ULTIMATE.start_main_#t~ret12#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|) (= |v_ULTIMATE.start_main_#t~ret12#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_2|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base] 8482#[L94-4]don't care [316] L94-4-->L94-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 8484#[L94-5]don't care [415] L94-5-->L94-6: Formula: (and (= v_~q~0.offset_5 |v_ULTIMATE.start_main_#t~ret12#1.offset_3|) (= v_~q~0.base_5 |v_ULTIMATE.start_main_#t~ret12#1.base_3|)) InVars {ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_3|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_3|} OutVars{~q~0.base=v_~q~0.base_5, ~q~0.offset=v_~q~0.offset_5, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_3|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_3|} AuxVars[] AssignedVars[~q~0.base, ~q~0.offset] 9908#[L94-6]don't care [444] L94-6-->L96: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_4|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base] 9714#[L96]don't care [419] L96-->L96-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 9614#[L96-1]don't care [380] L96-1-->L96-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| (ite (<= 0 v_~N~0_5) 1 0)) InVars {~N~0=v_~N~0_5} OutVars{~N~0=v_~N~0_5, 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] 9442#[L96-2]don't care [331] L96-2-->L38-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] 9444#[L38-4]don't care [384] L38-4-->L39-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] 9952#[L39-6]don't care [447] L39-6-->L38-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[] 8438#[L38-5]don't care [313] L38-5-->L99: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 8440#[L99]don't care [414] L99-->L99-1: Formula: (= |v_ULTIMATE.start_main_#t~pre13#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1] 8810#[L99-1]don't care [352] L99-1-->L99-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 8812#[L99-2]don't care [423] L99-2-->L99-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_13| |v_ULTIMATE.start_main_~#t1~0#1.base_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~pre13#1_3|)) |v_#memory_int_8|) (= (select |v_#valid_14| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, 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~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, 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] 9884#[L99-3]don't care [481] L99-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre13#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_4|, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_4|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_8|, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_4|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_12|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~post1#1, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 9958#[L99-4, thread1ENTRY]don't care [424] L99-4-->L99-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1] 9848#[L99-5, thread1ENTRY]don't care [401] L99-5-->L100: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet14#1] 9850#[thread1ENTRY, L100]don't care [361] L100-->L100-1: Formula: (= |v_ULTIMATE.start_main_#t~pre15#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre15#1] 9594#[L100-1, thread1ENTRY]don't care [385] L100-1-->L100-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 9596#[L100-2, thread1ENTRY]don't care [406] L100-2-->L100-3: Formula: (and (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|) (select |v_#length_14| |v_ULTIMATE.start_main_~#t2~0#1.base_3|)) (= (select |v_#valid_15| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) 1) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|) (= (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~pre15#1_3|)) |v_#memory_int_10|)) InVars {ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_11|, #length=|v_#length_14|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] 9608#[L100-3, thread1ENTRY]don't care [478] L100-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre15#1_6|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_12|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1] 9612#[thread2ENTRY, L100-4, thread1ENTRY]don't care [464] thread2ENTRY-->L69: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~j~0#1] 8962#[L69, L100-4, thread1ENTRY]don't care [465] L69-->L70-2: Formula: (= v_~s~0_1 0) InVars {} OutVars{~s~0=v_~s~0_1} AuxVars[] AssignedVars[~s~0] 8964#[L70-2, L100-4, thread1ENTRY]don't care [2022-07-26 13:36:52,518 INFO L735 eck$LassoCheckResult]: Loop: 8964#[L70-2, L100-4, thread1ENTRY]don't care [468] L70-2-->L71: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 9876#[L100-4, thread1ENTRY, L71]don't care [470] L71-->L75: Formula: (let ((.cse1 (* v_~q_front~0_31 4))) (let ((.cse0 (+ v_~q~0.offset_32 .cse1))) (and (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= (select |v_#valid_48| v_~q~0.base_32) 1) (= (select (select |v_#memory_int_40| v_~q~0.base_32) .cse0) |v_thread2Thread1of1ForFork0_~j~0#1_3|) (<= (+ v_~q~0.offset_32 .cse1 4) (select |v_#length_43| v_~q~0.base_32)) (<= 0 .cse0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (= (ite (and (<= 0 v_~q_front~0_31) (< v_~q_front~0_31 v_~n~0_29) (< v_~q_front~0_31 v_~q_back~0_82)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~q_front~0_31 1) v_~q_front~0_30)))) InVars {~q_back~0=v_~q_back~0_82, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_40|, #length=|v_#length_43|, ~q~0.base=v_~q~0.base_32, ~n~0=v_~n~0_29, ~q~0.offset=v_~q~0.offset_32, ~q_front~0=v_~q_front~0_31} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q_back~0=v_~q_back~0_82, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, ~q~0.base=v_~q~0.base_32, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, ~q~0.offset=v_~q~0.offset_32, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_40|, #length=|v_#length_43|, ~n~0=v_~n~0_29, ~q_front~0=v_~q_front~0_30} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, ~q_front~0] 9586#[L75, L100-4, thread1ENTRY]don't care [472] L75-->L77: Formula: (= (+ |v_thread2Thread1of1ForFork0_~j~0#1_5| v_~s~0_3) v_~s~0_2) InVars {thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_5|, ~s~0=v_~s~0_3} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_5|, ~s~0=v_~s~0_2} AuxVars[] AssignedVars[~s~0] 9590#[L100-4, L77, thread1ENTRY]don't care [473] L77-->L78: Formula: (= (+ v_~C~0_3 v_~y~0_2) v_~y~0_1) InVars {~y~0=v_~y~0_2, ~C~0=v_~C~0_3} OutVars{~y~0=v_~y~0_1, ~C~0=v_~C~0_3} AuxVars[] AssignedVars[~y~0] 9510#[L100-4, L78, thread1ENTRY]don't care [475] L78-->L70-2: Formula: (not (= |v_thread2Thread1of1ForFork0_~j~0#1_9| 0)) InVars {thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_9|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_9|} AuxVars[] AssignedVars[] 8964#[L70-2, L100-4, thread1ENTRY]don't care [2022-07-26 13:36:52,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:36:52,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1025922778, now seen corresponding path program 1 times [2022-07-26 13:36:52,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:36:52,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141894808] [2022-07-26 13:36:52,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:36:52,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:36:52,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:36:52,542 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:36:52,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:36:52,566 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:36:52,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:36:52,567 INFO L85 PathProgramCache]: Analyzing trace with hash 475307479, now seen corresponding path program 1 times [2022-07-26 13:36:52,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:36:52,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328431720] [2022-07-26 13:36:52,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:36:52,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:36:52,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:36:52,570 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:36:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:36:52,572 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:36:52,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:36:52,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1509926558, now seen corresponding path program 1 times [2022-07-26 13:36:52,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:36:52,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322050822] [2022-07-26 13:36:52,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:36:52,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:36:52,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:36:52,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-26 13:36:52,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 13:36:52,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322050822] [2022-07-26 13:36:52,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322050822] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 13:36:52,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 13:36:52,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-26 13:36:52,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49485014] [2022-07-26 13:36:52,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 13:36:52,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 13:36:52,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-26 13:36:52,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-26 13:36:52,692 INFO L87 Difference]: Start difference. First operand 775 states and 2073 transitions. cyclomatic complexity: 1368 Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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-26 13:36:52,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 13:36:52,706 INFO L93 Difference]: Finished difference Result 859 states and 2227 transitions. [2022-07-26 13:36:52,706 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 859 states and 2227 transitions. [2022-07-26 13:36:52,712 INFO L131 ngComponentsAnalysis]: Automaton has 47 accepting balls. 235 [2022-07-26 13:36:52,716 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 859 states to 859 states and 2227 transitions. [2022-07-26 13:36:52,716 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 573 [2022-07-26 13:36:52,717 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 573 [2022-07-26 13:36:52,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 859 states and 2227 transitions. [2022-07-26 13:36:52,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 13:36:52,717 INFO L220 hiAutomatonCegarLoop]: Abstraction has 859 states and 2227 transitions. [2022-07-26 13:36:52,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states and 2227 transitions. [2022-07-26 13:36:52,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 859. [2022-07-26 13:36:52,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 859 states have (on average 2.5925494761350407) internal successors, (2227), 858 states have internal predecessors, (2227), 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-26 13:36:52,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 2227 transitions. [2022-07-26 13:36:52,731 INFO L242 hiAutomatonCegarLoop]: Abstraction has 859 states and 2227 transitions. [2022-07-26 13:36:52,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-26 13:36:52,732 INFO L426 stractBuchiCegarLoop]: Abstraction has 859 states and 2227 transitions. [2022-07-26 13:36:52,732 INFO L333 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-26 13:36:52,733 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 859 states and 2227 transitions. [2022-07-26 13:36:52,736 INFO L131 ngComponentsAnalysis]: Automaton has 47 accepting balls. 235 [2022-07-26 13:36:52,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:36:52,737 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:36:52,737 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 13:36:52,737 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-26 13:36:52,738 INFO L733 eck$LassoCheckResult]: Stem: 12455#[ULTIMATE.startENTRY]don't care [430] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 12411#[L-1]don't care [342] 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] 12413#[L-1-1]don't care [442] 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[] 12459#[L-1-2]don't care [443] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 12337#[L21]don't care [403] 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[] 12179#[L21-1]don't care [425] 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[] 11961#[L21-2]don't care [353] 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[] 11963#[L21-3]don't care [395] L21-3-->L21-4: Formula: (and (= 33 (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[] 11337#[L21-4]don't care [372] L21-4-->L43: Formula: (and (= v_~q~0.offset_4 0) (= v_~q~0.base_4 0)) InVars {} OutVars{~q~0.base=v_~q~0.base_4, ~q~0.offset=v_~q~0.offset_4} AuxVars[] AssignedVars[~q~0.base, ~q~0.offset] 11339#[L43]don't care [434] L43-->L43-1: Formula: (= v_~q_front~0_5 0) InVars {} OutVars{~q_front~0=v_~q_front~0_5} AuxVars[] AssignedVars[~q_front~0] 11923#[L43-1]don't care [338] L43-1-->L43-2: Formula: (= v_~q_back~0_10 0) InVars {} OutVars{~q_back~0=v_~q_back~0_10} AuxVars[] AssignedVars[~q_back~0] 11925#[L43-2]don't care [358] L43-2-->L43-3: Formula: (= v_~n~0_4 0) InVars {} OutVars{~n~0=v_~n~0_4} AuxVars[] AssignedVars[~n~0] 12009#[L43-3]don't care [363] L43-3-->L43-4: Formula: (= v_~s~0_4 0) InVars {} OutVars{~s~0=v_~s~0_4} AuxVars[] AssignedVars[~s~0] 11777#[L43-4]don't care [433] L43-4-->L44: Formula: (= v_~N~0_3 0) InVars {} OutVars{~N~0=v_~N~0_3} AuxVars[] AssignedVars[~N~0] 11779#[L44]don't care [339] L44-->L44-1: Formula: (= v_~x~0_5 0) InVars {} OutVars{~x~0=v_~x~0_5} AuxVars[] AssignedVars[~x~0] 11405#[L44-1]don't care [386] L44-1-->L44-2: Formula: (= v_~y~0_3 0) InVars {} OutVars{~y~0=v_~y~0_3} AuxVars[] AssignedVars[~y~0] 11407#[L44-2]don't care [389] L44-2-->L-1-3: Formula: (= v_~C~0_4 0) InVars {} OutVars{~C~0=v_~C~0_4} AuxVars[] AssignedVars[~C~0] 12233#[L-1-3]don't care [445] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 11203#[L-1-4]don't care [348] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 11205#[L-1-5]don't care [321] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 12165#[L-1-6]don't care [421] L-1-6-->L87: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_1|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_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~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_1|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_1|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~mem18#1, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~ret12#1.base] 12167#[L87]don't care [360] L87-->L87-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] 12293#[L87-1]don't care [317] L87-1-->L87-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] 10867#[L87-2]don't care [314] L87-2-->L89: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_2| v_~C~0_5) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} OutVars{~C~0=v_~C~0_5, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[~C~0] 10869#[L89]don't care [383] L89-->L90: 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] 12049#[L90]don't care [435] L90-->L90-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_2| v_~N~0_4) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[~N~0] 12365#[L90-1]don't care [332] L90-1-->L91: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] 11883#[L91]don't care [333] L91-->L91-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_2| v_~n~0_5) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} OutVars{~n~0=v_~n~0_5, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[~n~0] 11885#[L91-1]don't care [340] L91-1-->L92: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] 11715#[L92]don't care [418] L92-->L92-1: Formula: (= v_~q_front~0_6 |v_ULTIMATE.start_main_#t~nondet11#1_2|) InVars {ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|, ~q_front~0=v_~q_front~0_6} AuxVars[] AssignedVars[~q_front~0] 11717#[L92-1]don't care [407] L92-1-->L93: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1] 12287#[L93]don't care [337] L93-->L94: Formula: (= v_~q_front~0_7 v_~q_back~0_11) InVars {~q_front~0=v_~q_front~0_7} OutVars{~q_back~0=v_~q_back~0_11, ~q_front~0=v_~q_front~0_7} AuxVars[] AssignedVars[~q_back~0] 11771#[L94]don't care [429] L94-->L94-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 11423#[L94-1]don't care [387] L94-1-->L94-2: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~n~0_6) InVars {~n~0=v_~n~0_6} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~n~0=v_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 11425#[L94-2]don't care [410] L94-2-->L94-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 11623#[L94-3]don't care [388] L94-3-->L110: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_1|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_~size#1] 12313#[L110]don't care [379] L110-->L111: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1] 11877#[L111]don't care [327] L111-->L111-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 11719#[L111-1]don't care [422] L111-1-->L111-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_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] 11721#[L111-2]don't care [404] L111-2-->L38: 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] 12339#[L38]don't care [373] L38-->L39: 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] 12427#[L39]don't care [428] L39-->L38-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[] 12115#[L38-1]don't care [396] L38-1-->L112: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 11977#[L112]don't care [356] L112-->L112-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 11979#[L112-1]don't care [376] L112-1-->L112-2: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_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] 12371#[L112-2]don't care [440] L112-2-->L38-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] 12369#[L38-2]don't care [439] L38-2-->L39-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] 11225#[L39-3]don't care [355] L39-3-->L38-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[] 11171#[L38-3]don't care [341] L38-3-->L114: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 11173#[L114]don't care [357] L114-->L114-1: Formula: (and (= (store |v_#valid_12| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| 1) |v_#valid_11|) (= (select |v_#valid_12| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2|) 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_2| 0) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| |v_#StackHeapBarrier_4|) (= (store |v_#length_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 4)) |v_#length_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_11|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #valid=|v_#valid_11|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2|, #length=|v_#length_10|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, #length] 12135#[L114-1]don't care [400] L114-1-->L114-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 12137#[L114-2]don't care [343] L114-2-->L115: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base] 11295#[L115]don't care [364] L115-->L115-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~1#1] 11297#[L115-6]don't care [346] L115-6-->L116: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_4| |v_ULTIMATE.start_create_fresh_int_array_~size#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[] 11201#[L116]don't care [335] L116-->L116-1: Formula: (let ((.cse0 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_5|))) (let ((.cse1 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse0))) (and (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse0 4) (select |v_#length_12| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|)) (= (select |v_#valid_13| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1) (<= 0 .cse1) (= (store |v_#memory_int_7| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_7| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_2|)) |v_#memory_int_6|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_2|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_5|, #length=|v_#length_12|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_2|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_5|, #length=|v_#length_12|} AuxVars[] AssignedVars[#memory_int] 11909#[L116-1]don't care [405] L116-1-->L115-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet21#1] 12011#[L115-3]don't care [365] L115-3-->L115-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_2|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post20#1] 12013#[L115-4]don't care [370] L115-4-->L115-5: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_7|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~1#1] 11893#[L115-5]don't care [334] L115-5-->L115-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post20#1] 11195#[L115-6]don't care [345] L115-6-->L115-7: Formula: (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_6|)) InVars {ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[] 11197#[L115-7]don't care [349] L115-7-->L118: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 11207#[L118]don't care [399] L118-->L94-4: Formula: (and (= |v_ULTIMATE.start_main_#t~ret12#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|) (= |v_ULTIMATE.start_main_#t~ret12#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_2|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base] 10903#[L94-4]don't care [316] L94-4-->L94-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 10905#[L94-5]don't care [415] L94-5-->L94-6: Formula: (and (= v_~q~0.offset_5 |v_ULTIMATE.start_main_#t~ret12#1.offset_3|) (= v_~q~0.base_5 |v_ULTIMATE.start_main_#t~ret12#1.base_3|)) InVars {ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_3|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_3|} OutVars{~q~0.base=v_~q~0.base_5, ~q~0.offset=v_~q~0.offset_5, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_3|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_3|} AuxVars[] AssignedVars[~q~0.base, ~q~0.offset] 12379#[L94-6]don't care [444] L94-6-->L96: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_4|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base] 12163#[L96]don't care [419] L96-->L96-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 12045#[L96-1]don't care [380] L96-1-->L96-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| (ite (<= 0 v_~N~0_5) 1 0)) InVars {~N~0=v_~N~0_5} OutVars{~N~0=v_~N~0_5, 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] 11879#[L96-2]don't care [331] L96-2-->L38-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] 11881#[L38-4]don't care [384] L38-4-->L39-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] 12433#[L39-6]don't care [447] L39-6-->L38-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[] 10863#[L38-5]don't care [313] L38-5-->L99: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 10865#[L99]don't care [414] L99-->L99-1: Formula: (= |v_ULTIMATE.start_main_#t~pre13#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1] 11213#[L99-1]don't care [352] L99-1-->L99-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 11215#[L99-2]don't care [423] L99-2-->L99-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_13| |v_ULTIMATE.start_main_~#t1~0#1.base_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~pre13#1_3|)) |v_#memory_int_8|) (= (select |v_#valid_14| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, 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~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, 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] 12349#[L99-3]don't care [481] L99-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre13#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_4|, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_4|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_8|, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_4|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_12|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~post1#1, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 12441#[L99-4, thread1ENTRY]don't care [451] thread1ENTRY-->L49-5: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] 12059#[L49-5, L99-4]don't care [453] L49-5-->L49-6: Formula: (not (< |v_thread1Thread1of1ForFork1_~i~0#1_3| v_~N~0_1)) InVars {thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_3|, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_3|, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[] 12061#[L49-6, L99-4]don't care [455] L49-6-->L61: Formula: (let ((.cse1 (* v_~q_back~0_89 4))) (let ((.cse0 (+ v_~q~0.offset_34 .cse1))) (and (= v_~q_back~0_88 (+ v_~q_back~0_89 1)) (<= 0 .cse0) (<= (+ v_~q~0.offset_34 .cse1 4) (select |v_#length_45| v_~q~0.base_34)) (= (ite (= (select (select |v_#memory_int_42| v_~q~0.base_34) .cse0) 0) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (not (= (ite (and (< v_~q_back~0_89 v_~n~0_31) (<= 0 v_~q_back~0_89)) 1 0) 0)) (= (select |v_#valid_50| v_~q~0.base_34) 1) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0))))) InVars {~q_back~0=v_~q_back~0_89, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_42|, #length=|v_#length_45|, ~q~0.base=v_~q~0.base_34, ~n~0=v_~n~0_31, ~q~0.offset=v_~q~0.offset_34} OutVars{thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_1|, ~q_back~0=v_~q_back~0_88, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, #valid=|v_#valid_50|, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_1|, #memory_int=|v_#memory_int_42|, #length=|v_#length_45|, ~q~0.base=v_~q~0.base_34, ~n~0=v_~n~0_31, ~q~0.offset=v_~q~0.offset_34, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem4#1, ~q_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 12315#[L61, L99-4]don't care [424] L99-4-->L99-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1] 11253#[L61, L99-5]don't care [401] L99-5-->L100: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet14#1] 11905#[L61, L100]don't care [361] L100-->L100-1: Formula: (= |v_ULTIMATE.start_main_#t~pre15#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre15#1] 12117#[L61, L100-1]don't care [385] L100-1-->L100-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 11819#[L100-2, L61]don't care [406] L100-2-->L100-3: Formula: (and (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|) (select |v_#length_14| |v_ULTIMATE.start_main_~#t2~0#1.base_3|)) (= (select |v_#valid_15| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) 1) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|) (= (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~pre15#1_3|)) |v_#memory_int_10|)) InVars {ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_11|, #length=|v_#length_14|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] 11113#[L100-3, L61]don't care [478] L100-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre15#1_6|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_12|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1] 11753#[thread2ENTRY, L100-4, L61]don't care [464] thread2ENTRY-->L69: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~j~0#1] 12241#[L69, L100-4, L61]don't care [465] L69-->L70-2: Formula: (= v_~s~0_1 0) InVars {} OutVars{~s~0=v_~s~0_1} AuxVars[] AssignedVars[~s~0] 12225#[L70-2, L100-4, L61]don't care [2022-07-26 13:36:52,738 INFO L735 eck$LassoCheckResult]: Loop: 12225#[L70-2, L100-4, L61]don't care [468] L70-2-->L71: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 12015#[L100-4, L61, L71]don't care [470] L71-->L75: Formula: (let ((.cse1 (* v_~q_front~0_31 4))) (let ((.cse0 (+ v_~q~0.offset_32 .cse1))) (and (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= (select |v_#valid_48| v_~q~0.base_32) 1) (= (select (select |v_#memory_int_40| v_~q~0.base_32) .cse0) |v_thread2Thread1of1ForFork0_~j~0#1_3|) (<= (+ v_~q~0.offset_32 .cse1 4) (select |v_#length_43| v_~q~0.base_32)) (<= 0 .cse0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (= (ite (and (<= 0 v_~q_front~0_31) (< v_~q_front~0_31 v_~n~0_29) (< v_~q_front~0_31 v_~q_back~0_82)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~q_front~0_31 1) v_~q_front~0_30)))) InVars {~q_back~0=v_~q_back~0_82, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_40|, #length=|v_#length_43|, ~q~0.base=v_~q~0.base_32, ~n~0=v_~n~0_29, ~q~0.offset=v_~q~0.offset_32, ~q_front~0=v_~q_front~0_31} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q_back~0=v_~q_back~0_82, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, ~q~0.base=v_~q~0.base_32, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, ~q~0.offset=v_~q~0.offset_32, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_40|, #length=|v_#length_43|, ~n~0=v_~n~0_29, ~q_front~0=v_~q_front~0_30} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, ~q_front~0] 11503#[L75, L100-4, L61]don't care [472] L75-->L77: Formula: (= (+ |v_thread2Thread1of1ForFork0_~j~0#1_5| v_~s~0_3) v_~s~0_2) InVars {thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_5|, ~s~0=v_~s~0_3} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_5|, ~s~0=v_~s~0_2} AuxVars[] AssignedVars[~s~0] 11505#[L100-4, L61, L77]don't care [473] L77-->L78: Formula: (= (+ v_~C~0_3 v_~y~0_2) v_~y~0_1) InVars {~y~0=v_~y~0_2, ~C~0=v_~C~0_3} OutVars{~y~0=v_~y~0_1, ~C~0=v_~C~0_3} AuxVars[] AssignedVars[~y~0] 11903#[L78, L100-4, L61]don't care [475] L78-->L70-2: Formula: (not (= |v_thread2Thread1of1ForFork0_~j~0#1_9| 0)) InVars {thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_9|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_9|} AuxVars[] AssignedVars[] 12225#[L70-2, L100-4, L61]don't care [2022-07-26 13:36:52,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:36:52,738 INFO L85 PathProgramCache]: Analyzing trace with hash -746950497, now seen corresponding path program 1 times [2022-07-26 13:36:52,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:36:52,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864601649] [2022-07-26 13:36:52,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:36:52,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:36:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:36:52,754 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:36:52,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:36:52,768 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:36:52,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:36:52,769 INFO L85 PathProgramCache]: Analyzing trace with hash 475307479, now seen corresponding path program 2 times [2022-07-26 13:36:52,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:36:52,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487453872] [2022-07-26 13:36:52,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:36:52,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:36:52,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:36:52,771 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:36:52,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:36:52,774 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:36:52,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:36:52,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1854021639, now seen corresponding path program 1 times [2022-07-26 13:36:52,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:36:52,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535387870] [2022-07-26 13:36:52,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:36:52,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:36:52,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:36:53,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 13:36:53,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 13:36:53,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535387870] [2022-07-26 13:36:53,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535387870] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-26 13:36:53,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326819900] [2022-07-26 13:36:53,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:36:53,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-26 13:36:53,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:36:53,154 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-26 13:36:53,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-07-26 13:36:53,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:36:53,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-26 13:36:53,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 13:36:53,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-26 13:36:53,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-26 13:36:53,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-26 13:36:53,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-26 13:36:54,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-07-26 13:36:54,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 13:36:54,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-26 13:36:54,075 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_134 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_134) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) 0)) is different from false [2022-07-26 13:36:54,896 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-26 13:36:54,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 45 [2022-07-26 13:36:54,903 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-26 13:36:54,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 100 [2022-07-26 13:36:54,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 48 [2022-07-26 13:36:54,914 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-26 13:36:54,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 55 [2022-07-26 13:36:55,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 13:36:55,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326819900] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-26 13:36:55,478 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-26 13:36:55,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21, 19] total 53 [2022-07-26 13:36:55,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104405509] [2022-07-26 13:36:55,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-26 13:36:55,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 13:36:55,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-07-26 13:36:55,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=2506, Unknown=9, NotChecked=102, Total=2862 [2022-07-26 13:36:55,567 INFO L87 Difference]: Start difference. First operand 859 states and 2227 transitions. cyclomatic complexity: 1434 Second operand has 54 states, 53 states have (on average 4.245283018867925) internal successors, (225), 54 states have internal predecessors, (225), 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-26 13:36:58,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 13:36:58,872 INFO L93 Difference]: Finished difference Result 3229 states and 8311 transitions. [2022-07-26 13:36:58,873 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3229 states and 8311 transitions. [2022-07-26 13:36:58,903 INFO L131 ngComponentsAnalysis]: Automaton has 122 accepting balls. 610 [2022-07-26 13:36:58,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3229 states to 2509 states and 6621 transitions. [2022-07-26 13:36:58,917 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1543 [2022-07-26 13:36:58,919 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1543 [2022-07-26 13:36:58,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2509 states and 6621 transitions. [2022-07-26 13:36:58,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 13:36:58,920 INFO L220 hiAutomatonCegarLoop]: Abstraction has 2509 states and 6621 transitions. [2022-07-26 13:36:58,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2509 states and 6621 transitions. [2022-07-26 13:36:58,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2509 to 1230. [2022-07-26 13:36:58,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 1230 states have (on average 2.6634146341463416) internal successors, (3276), 1229 states have internal predecessors, (3276), 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-26 13:36:58,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 3276 transitions. [2022-07-26 13:36:58,950 INFO L242 hiAutomatonCegarLoop]: Abstraction has 1230 states and 3276 transitions. [2022-07-26 13:36:58,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-26 13:36:58,953 INFO L426 stractBuchiCegarLoop]: Abstraction has 1230 states and 3276 transitions. [2022-07-26 13:36:58,953 INFO L333 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-26 13:36:58,953 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1230 states and 3276 transitions. [2022-07-26 13:36:58,958 INFO L131 ngComponentsAnalysis]: Automaton has 59 accepting balls. 295 [2022-07-26 13:36:58,958 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:36:58,958 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:36:58,960 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 13:36:58,960 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-26 13:36:58,961 INFO L733 eck$LassoCheckResult]: Stem: 18114#[ULTIMATE.startENTRY]don't care [430] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 18052#[L-1]don't care [342] 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] 18054#[L-1-1]don't care [442] 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[] 18122#[L-1-2]don't care [443] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 17970#[L21]don't care [403] 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[] 17818#[L21-1]don't care [425] 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[] 17604#[L21-2]don't care [353] 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[] 17606#[L21-3]don't care [395] L21-3-->L21-4: Formula: (and (= 33 (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[] 16962#[L21-4]don't care [372] L21-4-->L43: Formula: (and (= v_~q~0.offset_4 0) (= v_~q~0.base_4 0)) InVars {} OutVars{~q~0.base=v_~q~0.base_4, ~q~0.offset=v_~q~0.offset_4} AuxVars[] AssignedVars[~q~0.base, ~q~0.offset] 16964#[L43]don't care [434] L43-->L43-1: Formula: (= v_~q_front~0_5 0) InVars {} OutVars{~q_front~0=v_~q_front~0_5} AuxVars[] AssignedVars[~q_front~0] 17560#[L43-1]don't care [338] L43-1-->L43-2: Formula: (= v_~q_back~0_10 0) InVars {} OutVars{~q_back~0=v_~q_back~0_10} AuxVars[] AssignedVars[~q_back~0] 17562#[L43-2]don't care [358] L43-2-->L43-3: Formula: (= v_~n~0_4 0) InVars {} OutVars{~n~0=v_~n~0_4} AuxVars[] AssignedVars[~n~0] 17644#[L43-3]don't care [363] L43-3-->L43-4: Formula: (= v_~s~0_4 0) InVars {} OutVars{~s~0=v_~s~0_4} AuxVars[] AssignedVars[~s~0] 17406#[L43-4]don't care [433] L43-4-->L44: Formula: (= v_~N~0_3 0) InVars {} OutVars{~N~0=v_~N~0_3} AuxVars[] AssignedVars[~N~0] 17408#[L44]don't care [339] L44-->L44-1: Formula: (= v_~x~0_5 0) InVars {} OutVars{~x~0=v_~x~0_5} AuxVars[] AssignedVars[~x~0] 17030#[L44-1]don't care [386] L44-1-->L44-2: Formula: (= v_~y~0_3 0) InVars {} OutVars{~y~0=v_~y~0_3} AuxVars[] AssignedVars[~y~0] 17032#[L44-2]don't care [389] L44-2-->L-1-3: Formula: (= v_~C~0_4 0) InVars {} OutVars{~C~0=v_~C~0_4} AuxVars[] AssignedVars[~C~0] 17878#[L-1-3]don't care [445] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 16832#[L-1-4]don't care [348] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 16834#[L-1-5]don't care [321] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 17788#[L-1-6]don't care [421] L-1-6-->L87: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_1|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_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~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_1|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_1|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~mem18#1, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~ret12#1.base] 17790#[L87]don't care [360] L87-->L87-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] 17924#[L87-1]don't care [317] L87-1-->L87-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] 16484#[L87-2]don't care [314] L87-2-->L89: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_2| v_~C~0_5) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} OutVars{~C~0=v_~C~0_5, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[~C~0] 16486#[L89]don't care [383] L89-->L90: 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] 17682#[L90]don't care [435] L90-->L90-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_2| v_~N~0_4) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[~N~0] 18012#[L90-1]don't care [332] L90-1-->L91: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] 17522#[L91]don't care [333] L91-->L91-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_2| v_~n~0_5) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} OutVars{~n~0=v_~n~0_5, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[~n~0] 17524#[L91-1]don't care [340] L91-1-->L92: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] 17346#[L92]don't care [418] L92-->L92-1: Formula: (= v_~q_front~0_6 |v_ULTIMATE.start_main_#t~nondet11#1_2|) InVars {ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|, ~q_front~0=v_~q_front~0_6} AuxVars[] AssignedVars[~q_front~0] 17348#[L92-1]don't care [407] L92-1-->L93: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1] 17922#[L93]don't care [337] L93-->L94: Formula: (= v_~q_front~0_7 v_~q_back~0_11) InVars {~q_front~0=v_~q_front~0_7} OutVars{~q_back~0=v_~q_back~0_11, ~q_front~0=v_~q_front~0_7} AuxVars[] AssignedVars[~q_back~0] 17400#[L94]don't care [429] L94-->L94-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 17050#[L94-1]don't care [387] L94-1-->L94-2: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~n~0_6) InVars {~n~0=v_~n~0_6} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~n~0=v_~n~0_6} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 17052#[L94-2]don't care [410] L94-2-->L94-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 17258#[L94-3]don't care [388] L94-3-->L110: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_1|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_~size#1] 17944#[L110]don't care [379] L110-->L111: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1] 17516#[L111]don't care [327] L111-->L111-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 17350#[L111-1]don't care [422] L111-1-->L111-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_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] 17352#[L111-2]don't care [404] L111-2-->L38: 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] 17974#[L38]don't care [373] L38-->L39: 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] 18074#[L39]don't care [428] L39-->L38-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[] 17740#[L38-1]don't care [396] L38-1-->L112: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 17616#[L112]don't care [356] L112-->L112-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 17618#[L112-1]don't care [376] L112-1-->L112-2: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_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] 18018#[L112-2]don't care [440] L112-2-->L38-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] 18016#[L38-2]don't care [439] L38-2-->L39-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] 16852#[L39-3]don't care [355] L39-3-->L38-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[] 16796#[L38-3]don't care [341] L38-3-->L114: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 16798#[L114]don't care [357] L114-->L114-1: Formula: (and (= (store |v_#valid_12| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| 1) |v_#valid_11|) (= (select |v_#valid_12| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2|) 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_2| 0) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| |v_#StackHeapBarrier_4|) (= (store |v_#length_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 4)) |v_#length_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_11|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #valid=|v_#valid_11|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2|, #length=|v_#length_10|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, #length] 17758#[L114-1]don't care [400] L114-1-->L114-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 17760#[L114-2]don't care [343] L114-2-->L115: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base] 16920#[L115]don't care [364] L115-->L115-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~1#1] 16922#[L115-6]don't care [346] L115-6-->L116: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_4| |v_ULTIMATE.start_create_fresh_int_array_~size#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[] 18566#[L116]don't care [335] L116-->L116-1: Formula: (let ((.cse0 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_5|))) (let ((.cse1 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse0))) (and (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse0 4) (select |v_#length_12| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|)) (= (select |v_#valid_13| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1) (<= 0 .cse1) (= (store |v_#memory_int_7| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_7| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_2|)) |v_#memory_int_6|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_2|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_5|, #length=|v_#length_12|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_2|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_5|, #length=|v_#length_12|} AuxVars[] AssignedVars[#memory_int] 18564#[L116-1]don't care [405] L116-1-->L115-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet21#1] 18560#[L115-3]don't care [365] L115-3-->L115-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_2|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post20#1] 18556#[L115-4]don't care [370] L115-4-->L115-5: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_7|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~1#1] 18554#[L115-5]don't care [334] L115-5-->L115-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post20#1] 18550#[L115-6]don't care [345] L115-6-->L115-7: Formula: (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_6|)) InVars {ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[] 18546#[L115-7]don't care [349] L115-7-->L118: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 18544#[L118]don't care [399] L118-->L94-4: Formula: (and (= |v_ULTIMATE.start_main_#t~ret12#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|) (= |v_ULTIMATE.start_main_#t~ret12#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_2|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base] 18538#[L94-4]don't care [316] L94-4-->L94-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 18532#[L94-5]don't care [415] L94-5-->L94-6: Formula: (and (= v_~q~0.offset_5 |v_ULTIMATE.start_main_#t~ret12#1.offset_3|) (= v_~q~0.base_5 |v_ULTIMATE.start_main_#t~ret12#1.base_3|)) InVars {ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_3|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_3|} OutVars{~q~0.base=v_~q~0.base_5, ~q~0.offset=v_~q~0.offset_5, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_3|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_3|} AuxVars[] AssignedVars[~q~0.base, ~q~0.offset] 18530#[L94-6]don't care [444] L94-6-->L96: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_4|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base] 18528#[L96]don't care [419] L96-->L96-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 18524#[L96-1]don't care [380] L96-1-->L96-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| (ite (<= 0 v_~N~0_5) 1 0)) InVars {~N~0=v_~N~0_5} OutVars{~N~0=v_~N~0_5, 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] 18520#[L96-2]don't care [331] L96-2-->L38-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] 18516#[L38-4]don't care [384] L38-4-->L39-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] 18512#[L39-6]don't care [447] L39-6-->L38-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[] 18510#[L38-5]don't care [313] L38-5-->L99: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 18508#[L99]don't care [414] L99-->L99-1: Formula: (= |v_ULTIMATE.start_main_#t~pre13#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1] 18506#[L99-1]don't care [352] L99-1-->L99-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 18504#[L99-2]don't care [423] L99-2-->L99-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_13| |v_ULTIMATE.start_main_~#t1~0#1.base_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~pre13#1_3|)) |v_#memory_int_8|) (= (select |v_#valid_14| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, 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~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, 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] 18502#[L99-3]don't care [481] L99-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre13#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_4|, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_4|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_8|, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_4|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_12|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_#t~post1#1, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 18500#[L99-4, thread1ENTRY]don't care [451] thread1ENTRY-->L49-5: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] 18496#[L49-5, L99-4]don't care [454] L49-5-->L50: Formula: (< |v_thread1Thread1of1ForFork1_~i~0#1_5| v_~N~0_2) InVars {thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_5|, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_5|, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[] 18498#[L99-4, L50]don't care [424] L99-4-->L99-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1] 18060#[L99-5, L50]don't care [401] L99-5-->L100: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet14#1] 17274#[L50, L100]don't care [456] L50-->L54: Formula: (let ((.cse1 (* v_~q_back~0_77 4))) (let ((.cse0 (+ v_~q~0.offset_30 .cse1))) (and (= (select |v_#valid_46| v_~q~0.base_30) 1) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_3| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3| (ite (= (select (select |v_#memory_int_38| v_~q~0.base_30) .cse0) 1) 1 0)) (<= (+ v_~q~0.offset_30 4 .cse1) (select |v_#length_41| v_~q~0.base_30)) (not (= (ite (and (<= 0 v_~q_back~0_77) (< v_~q_back~0_77 v_~n~0_25)) 1 0) 0)) (<= 0 .cse0) (= (+ v_~q_back~0_77 1) v_~q_back~0_76) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|)))) InVars {~q_back~0=v_~q_back~0_77, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_38|, #length=|v_#length_41|, ~q~0.base=v_~q~0.base_30, ~n~0=v_~n~0_25, ~q~0.offset=v_~q~0.offset_30} OutVars{~q_back~0=v_~q_back~0_76, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_38|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, #length=|v_#length_41|, ~q~0.base=v_~q~0.base_30, ~n~0=v_~n~0_25, ~q~0.offset=v_~q~0.offset_30, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|} AuxVars[] AssignedVars[~q_back~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 17186#[L54, L100]don't care [361] L100-->L100-1: Formula: (= |v_ULTIMATE.start_main_#t~pre15#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre15#1] 17478#[L100-1, L54]don't care [385] L100-1-->L100-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 17468#[L100-2, L54]don't care [406] L100-2-->L100-3: Formula: (and (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|) (select |v_#length_14| |v_ULTIMATE.start_main_~#t2~0#1.base_3|)) (= (select |v_#valid_15| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) 1) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|) (= (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~pre15#1_3|)) |v_#memory_int_10|)) InVars {ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_11|, #length=|v_#length_14|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] 17036#[L100-3, L54]don't care [478] L100-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre15#1_6|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_12|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1] 17284#[thread2ENTRY, L100-4, L54]don't care [464] thread2ENTRY-->L69: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~j~0#1] 17512#[L69, L100-4, L54]don't care [465] L69-->L70-2: Formula: (= v_~s~0_1 0) InVars {} OutVars{~s~0=v_~s~0_1} AuxVars[] AssignedVars[~s~0] 16492#[L70-2, L100-4, L54]don't care [2022-07-26 13:36:58,961 INFO L735 eck$LassoCheckResult]: Loop: 16492#[L70-2, L100-4, L54]don't care [468] L70-2-->L71: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 16744#[L100-4, L54, L71]don't care [470] L71-->L75: Formula: (let ((.cse1 (* v_~q_front~0_31 4))) (let ((.cse0 (+ v_~q~0.offset_32 .cse1))) (and (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= (select |v_#valid_48| v_~q~0.base_32) 1) (= (select (select |v_#memory_int_40| v_~q~0.base_32) .cse0) |v_thread2Thread1of1ForFork0_~j~0#1_3|) (<= (+ v_~q~0.offset_32 .cse1 4) (select |v_#length_43| v_~q~0.base_32)) (<= 0 .cse0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (= (ite (and (<= 0 v_~q_front~0_31) (< v_~q_front~0_31 v_~n~0_29) (< v_~q_front~0_31 v_~q_back~0_82)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~q_front~0_31 1) v_~q_front~0_30)))) InVars {~q_back~0=v_~q_back~0_82, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_40|, #length=|v_#length_43|, ~q~0.base=v_~q~0.base_32, ~n~0=v_~n~0_29, ~q~0.offset=v_~q~0.offset_32, ~q_front~0=v_~q_front~0_31} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q_back~0=v_~q_back~0_82, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, ~q~0.base=v_~q~0.base_32, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, ~q~0.offset=v_~q~0.offset_32, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_40|, #length=|v_#length_43|, ~n~0=v_~n~0_29, ~q_front~0=v_~q_front~0_30} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, ~q_front~0] 17880#[L75, L100-4, L54]don't care [472] L75-->L77: Formula: (= (+ |v_thread2Thread1of1ForFork0_~j~0#1_5| v_~s~0_3) v_~s~0_2) InVars {thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_5|, ~s~0=v_~s~0_3} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_5|, ~s~0=v_~s~0_2} AuxVars[] AssignedVars[~s~0] 17244#[L100-4, L54, L77]don't care [473] L77-->L78: Formula: (= (+ v_~C~0_3 v_~y~0_2) v_~y~0_1) InVars {~y~0=v_~y~0_2, ~C~0=v_~C~0_3} OutVars{~y~0=v_~y~0_1, ~C~0=v_~C~0_3} AuxVars[] AssignedVars[~y~0] 17290#[L78, L100-4, L54]don't care [475] L78-->L70-2: Formula: (not (= |v_thread2Thread1of1ForFork0_~j~0#1_9| 0)) InVars {thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_9|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_9|} AuxVars[] AssignedVars[] 16492#[L70-2, L100-4, L54]don't care [2022-07-26 13:36:58,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:36:58,961 INFO L85 PathProgramCache]: Analyzing trace with hash -608820339, now seen corresponding path program 1 times [2022-07-26 13:36:58,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:36:58,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724673097] [2022-07-26 13:36:58,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:36:58,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:36:58,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:36:58,984 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:36:58,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:36:59,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:36:59,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:36:59,011 INFO L85 PathProgramCache]: Analyzing trace with hash 475307479, now seen corresponding path program 3 times [2022-07-26 13:36:59,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:36:59,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821351584] [2022-07-26 13:36:59,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:36:59,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:36:59,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:36:59,016 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:36:59,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:36:59,018 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:36:59,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:36:59,019 INFO L85 PathProgramCache]: Analyzing trace with hash -891104821, now seen corresponding path program 1 times [2022-07-26 13:36:59,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:36:59,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915020815] [2022-07-26 13:36:59,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:36:59,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:36:59,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:36:59,047 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:36:59,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:36:59,075 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:37:00,523 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 13:37:00,524 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 13:37:00,524 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 13:37:00,524 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 13:37:00,524 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 13:37:00,524 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:37:00,524 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 13:37:00,524 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 13:37:00,524 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-queue-add-2-nl.wvr.c_BEv2_Iteration6_Lasso [2022-07-26 13:37:00,524 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 13:37:00,524 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 13:37:00,526 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:37:00,527 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:37:00,528 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:37:00,529 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:37:00,530 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:37:01,020 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:37:01,021 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:37:01,022 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:37:01,023 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:37:01,024 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:37:01,025 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:37:01,026 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:37:01,029 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:37:01,030 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:37:01,031 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:37:01,032 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:37:01,033 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:37:01,035 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:37:01,037 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:37:01,038 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:37:01,039 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:37:01,039 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:37:01,040 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:37:01,041 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:37:01,042 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:37:01,043 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:37:01,044 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:37:01,045 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:37:01,046 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:37:01,047 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:37:01,048 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:37:01,049 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:37:01,050 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:37:01,050 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:37:01,051 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:37:01,052 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:37:01,053 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:37:01,055 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:37:01,056 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:37:01,057 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:37:01,058 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:37:01,059 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:37:01,060 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:37:01,428 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 13:37:01,428 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 13:37:01,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:37:01,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:37:01,433 INFO L229 MonitoredProcess]: Starting monitored process 61 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-26 13:37:01,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-07-26 13:37:01,435 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-26 13:37:01,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:37:01,440 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:37:01,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:37:01,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:37:01,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:37:01,441 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:37:01,441 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:37:01,449 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:37:01,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2022-07-26 13:37:01,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:37:01,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:37:01,465 INFO L229 MonitoredProcess]: Starting monitored process 62 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-26 13:37:01,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2022-07-26 13:37:01,487 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-26 13:37:01,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:37:01,494 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:37:01,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:37:01,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:37:01,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:37:01,494 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:37:01,494 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:37:01,505 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:37:01,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2022-07-26 13:37:01,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:37:01,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:37:01,522 INFO L229 MonitoredProcess]: Starting monitored process 63 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-26 13:37:01,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2022-07-26 13:37:01,524 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-26 13:37:01,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:37:01,530 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:37:01,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:37:01,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:37:01,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:37:01,531 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:37:01,531 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:37:01,531 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:37:01,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2022-07-26 13:37:01,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:37:01,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:37:01,548 INFO L229 MonitoredProcess]: Starting monitored process 64 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-26 13:37:01,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2022-07-26 13:37:01,551 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-26 13:37:01,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:37:01,557 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:37:01,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:37:01,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:37:01,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:37:01,557 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:37:01,557 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:37:01,558 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:37:01,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2022-07-26 13:37:01,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:37:01,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:37:01,575 INFO L229 MonitoredProcess]: Starting monitored process 65 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-26 13:37:01,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2022-07-26 13:37:01,577 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:37:01,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:37:01,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:37:01,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:37:01,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:37:01,584 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:37:01,584 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:37:01,586 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:37:01,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2022-07-26 13:37:01,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:37:01,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:37:01,602 INFO L229 MonitoredProcess]: Starting monitored process 66 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-26 13:37:01,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2022-07-26 13:37:01,605 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-26 13:37:01,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:37:01,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:37:01,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:37:01,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:37:01,612 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:37:01,613 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:37:01,615 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:37:01,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2022-07-26 13:37:01,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:37:01,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:37:01,631 INFO L229 MonitoredProcess]: Starting monitored process 67 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-26 13:37:01,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2022-07-26 13:37:01,634 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-26 13:37:01,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:37:01,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:37:01,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:37:01,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:37:01,652 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:37:01,652 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:37:01,657 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:37:01,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2022-07-26 13:37:01,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:37:01,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:37:01,680 INFO L229 MonitoredProcess]: Starting monitored process 68 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-26 13:37:01,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2022-07-26 13:37:01,683 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-26 13:37:01,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:37:01,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:37:01,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:37:01,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:37:01,690 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:37:01,690 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:37:01,692 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:37:01,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2022-07-26 13:37:01,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:37:01,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:37:01,723 INFO L229 MonitoredProcess]: Starting monitored process 69 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-26 13:37:01,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2022-07-26 13:37:01,738 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-26 13:37:01,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:37:01,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:37:01,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:37:01,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:37:01,746 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:37:01,746 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:37:01,748 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:37:01,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2022-07-26 13:37:01,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:37:01,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:37:01,780 INFO L229 MonitoredProcess]: Starting monitored process 70 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-26 13:37:01,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2022-07-26 13:37:01,800 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-26 13:37:01,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:37:01,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:37:01,806 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-26 13:37:01,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:37:01,815 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-07-26 13:37:01,815 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-07-26 13:37:01,839 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:37:01,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2022-07-26 13:37:01,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:37:01,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:37:01,856 INFO L229 MonitoredProcess]: Starting monitored process 71 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-26 13:37:01,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2022-07-26 13:37:01,858 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-26 13:37:01,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:37:01,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:37:01,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:37:01,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:37:01,866 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:37:01,866 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:37:01,868 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:37:01,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2022-07-26 13:37:01,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:37:01,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:37:01,885 INFO L229 MonitoredProcess]: Starting monitored process 72 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-26 13:37:01,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2022-07-26 13:37:01,886 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-26 13:37:01,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:37:01,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:37:01,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:37:01,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:37:01,894 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:37:01,894 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:37:01,898 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:37:01,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2022-07-26 13:37:01,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:37:01,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:37:01,914 INFO L229 MonitoredProcess]: Starting monitored process 73 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-26 13:37:01,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2022-07-26 13:37:01,915 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-26 13:37:01,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:37:01,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:37:01,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:37:01,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:37:01,923 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:37:01,923 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:37:01,926 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:37:01,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2022-07-26 13:37:01,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:37:01,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:37:01,943 INFO L229 MonitoredProcess]: Starting monitored process 74 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-26 13:37:01,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2022-07-26 13:37:01,944 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-26 13:37:01,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:37:01,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:37:01,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:37:01,952 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:37:01,958 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:37:01,958 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:37:01,973 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 13:37:01,995 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-07-26 13:37:01,995 INFO L444 ModelExtractionUtils]: 7 out of 43 variables were initially zero. Simplification set additionally 33 variables to zero. [2022-07-26 13:37:01,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:37:01,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:37:01,996 INFO L229 MonitoredProcess]: Starting monitored process 75 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-26 13:37:01,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2022-07-26 13:37:01,998 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 13:37:02,004 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-26 13:37:02,005 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 13:37:02,005 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~n~0, ~q_front~0) = 1*~n~0 - 1*~q_front~0 Supporting invariants [] [2022-07-26 13:37:02,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2022-07-26 13:37:02,135 INFO L156 tatePredicateManager]: 31 out of 31 supporting invariants were superfluous and have been removed [2022-07-26 13:37:02,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:37:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:37:02,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 13:37:02,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 13:37:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:37:02,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-26 13:37:02,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 13:37:02,366 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-26 13:37:02,367 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-26 13:37:02,367 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1230 states and 3276 transitions. cyclomatic complexity: 2136 Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-26 13:37:02,422 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1230 states and 3276 transitions. cyclomatic complexity: 2136. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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 2777 states and 8302 transitions. Complement of second has 4 states. [2022-07-26 13:37:02,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-26 13:37:02,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-26 13:37:02,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2022-07-26 13:37:02,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 144 transitions. Stem has 86 letters. Loop has 5 letters. [2022-07-26 13:37:02,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:37:02,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 144 transitions. Stem has 91 letters. Loop has 5 letters. [2022-07-26 13:37:02,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:37:02,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 144 transitions. Stem has 86 letters. Loop has 10 letters. [2022-07-26 13:37:02,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:37:02,424 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2777 states and 8302 transitions. [2022-07-26 13:37:02,456 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-26 13:37:02,456 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2777 states to 0 states and 0 transitions. [2022-07-26 13:37:02,456 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-26 13:37:02,456 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-26 13:37:02,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-26 13:37:02,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 13:37:02,456 INFO L220 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-26 13:37:02,457 INFO L242 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-26 13:37:02,457 INFO L426 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-26 13:37:02,457 INFO L333 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-26 13:37:02,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-26 13:37:02,457 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-26 13:37:02,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-26 13:37:02,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.07 01:37:02 BoogieIcfgContainer [2022-07-26 13:37:02,469 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-26 13:37:02,469 INFO L158 Benchmark]: Toolchain (without parser) took 18896.47ms. Allocated memory was 180.4MB in the beginning and 325.1MB in the end (delta: 144.7MB). Free memory was 130.3MB in the beginning and 188.6MB in the end (delta: -58.2MB). Peak memory consumption was 87.5MB. Max. memory is 8.0GB. [2022-07-26 13:37:02,469 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 180.4MB. Free memory is still 146.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-26 13:37:02,483 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.34ms. Allocated memory is still 180.4MB. Free memory was 130.1MB in the beginning and 155.0MB in the end (delta: -24.9MB). Peak memory consumption was 14.9MB. Max. memory is 8.0GB. [2022-07-26 13:37:02,483 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.16ms. Allocated memory is still 180.4MB. Free memory was 154.8MB in the beginning and 153.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-26 13:37:02,484 INFO L158 Benchmark]: Boogie Preprocessor took 18.57ms. Allocated memory is still 180.4MB. Free memory was 153.0MB in the beginning and 151.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-26 13:37:02,484 INFO L158 Benchmark]: RCFGBuilder took 545.47ms. Allocated memory is still 180.4MB. Free memory was 151.4MB in the beginning and 129.1MB in the end (delta: 22.3MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2022-07-26 13:37:02,484 INFO L158 Benchmark]: BuchiAutomizer took 18070.85ms. Allocated memory was 180.4MB in the beginning and 325.1MB in the end (delta: 144.7MB). Free memory was 129.1MB in the beginning and 188.6MB in the end (delta: -59.5MB). Peak memory consumption was 86.2MB. Max. memory is 8.0GB. [2022-07-26 13:37:02,485 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.13ms. Allocated memory is still 180.4MB. Free memory is still 146.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 226.34ms. Allocated memory is still 180.4MB. Free memory was 130.1MB in the beginning and 155.0MB in the end (delta: -24.9MB). Peak memory consumption was 14.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.16ms. Allocated memory is still 180.4MB. Free memory was 154.8MB in the beginning and 153.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.57ms. Allocated memory is still 180.4MB. Free memory was 153.0MB in the beginning and 151.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 545.47ms. Allocated memory is still 180.4MB. Free memory was 151.4MB in the beginning and 129.1MB in the end (delta: 22.3MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * BuchiAutomizer took 18070.85ms. Allocated memory was 180.4MB in the beginning and 325.1MB in the end (delta: 144.7MB). Free memory was 129.1MB in the beginning and 188.6MB in the end (delta: -59.5MB). Peak memory consumption was 86.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function size + -1 * i and consists of 6 locations. One deterministic module has affine ranking function -1 * i + N and consists of 5 locations. One deterministic module has affine ranking function n + -1 * q_front and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 54 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 17.9s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 13.0s. Construction of modules took 0.5s. Büchi inclusion checks took 3.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 1417 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2742 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2739 mSDsluCounter, 3737 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 659 IncrementalHoareTripleChecker+Unchecked, 3368 mSDsCounter, 140 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1117 IncrementalHoareTripleChecker+Invalid, 1916 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 140 mSolverCounterUnsat, 676 mSDtfsCounter, 1117 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital293 mio100 ax108 hnf100 lsp77 ukn77 mio100 lsp42 div122 bol100 ite100 ukn100 eq172 hnf92 smp86 dnf100 smp100 tf100 neg99 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 60ms VariablesStem: 5 VariablesLoop: 7 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-07-26 13:37:02,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2022-07-26 13:37:02,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0 [2022-07-26 13:37:02,917 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...