/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-syntacticLbe.epf -i ../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:49:16,718 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:49:16,721 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:49:16,771 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:49:16,772 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:49:16,773 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:49:16,780 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:49:16,785 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:49:16,795 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:49:16,796 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:49:16,797 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:49:16,799 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:49:16,799 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:49:16,800 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:49:16,802 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:49:16,803 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:49:16,804 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:49:16,805 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:49:16,807 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:49:16,809 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:49:16,811 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:49:16,812 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:49:16,813 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:49:16,814 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:49:16,815 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:49:16,818 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:49:16,819 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:49:16,819 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:49:16,820 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:49:16,821 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:49:16,822 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:49:16,822 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:49:16,823 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:49:16,824 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:49:16,825 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:49:16,826 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:49:16,826 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:49:16,827 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:49:16,827 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:49:16,827 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:49:16,829 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:49:16,829 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:49:16,830 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-syntacticLbe.epf [2022-07-22 12:49:16,860 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:49:16,860 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:49:16,861 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:49:16,861 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:49:16,862 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:49:16,863 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:49:16,863 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:49:16,863 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:49:16,863 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:49:16,864 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:49:16,864 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:49:16,864 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:49:16,864 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:49:16,865 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:49:16,865 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:49:16,865 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:49:16,865 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:49:16,865 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:49:16,866 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:49:16,866 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:49:16,866 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:49:16,866 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:49:16,866 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:49:16,866 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:49:16,867 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:49:16,867 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:49:16,867 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:49:16,867 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:49:16,867 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:49:16,868 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:49:16,868 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:49:16,868 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-07-22 12:49:16,869 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:49:16,870 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-07-22 12:49:17,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:49:17,265 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:49:17,268 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:49:17,269 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:49:17,270 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:49:17,272 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2022-07-22 12:49:17,355 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ec7a9982/6ca93c5d12f944faa69be649faa4cd55/FLAGc796f1b60 [2022-07-22 12:49:17,964 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:49:17,964 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2022-07-22 12:49:17,974 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ec7a9982/6ca93c5d12f944faa69be649faa4cd55/FLAGc796f1b60 [2022-07-22 12:49:18,270 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ec7a9982/6ca93c5d12f944faa69be649faa4cd55 [2022-07-22 12:49:18,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:49:18,278 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:49:18,280 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:49:18,280 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:49:18,285 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:49:18,286 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:49:18" (1/1) ... [2022-07-22 12:49:18,288 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6725f968 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:49:18, skipping insertion in model container [2022-07-22 12:49:18,288 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:49:18" (1/1) ... [2022-07-22 12:49:18,296 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:49:18,317 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:49:18,518 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-inc-subseq.wvr.c[2924,2937] [2022-07-22 12:49:18,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:49:18,535 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:49:18,563 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-inc-subseq.wvr.c[2924,2937] [2022-07-22 12:49:18,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:49:18,583 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:49:18,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:49:18 WrapperNode [2022-07-22 12:49:18,584 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:49:18,585 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:49:18,585 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:49:18,585 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:49:18,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:49:18" (1/1) ... [2022-07-22 12:49:18,602 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:49:18" (1/1) ... [2022-07-22 12:49:18,633 INFO L137 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 186 [2022-07-22 12:49:18,634 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:49:18,635 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:49:18,635 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:49:18,635 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:49:18,644 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:49:18" (1/1) ... [2022-07-22 12:49:18,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:49:18" (1/1) ... [2022-07-22 12:49:18,649 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:49:18" (1/1) ... [2022-07-22 12:49:18,649 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:49:18" (1/1) ... [2022-07-22 12:49:18,659 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:49:18" (1/1) ... [2022-07-22 12:49:18,665 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:49:18" (1/1) ... [2022-07-22 12:49:18,668 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:49:18" (1/1) ... [2022-07-22 12:49:18,675 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:49:18,676 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:49:18,676 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:49:18,676 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:49:18,677 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:49:18" (1/1) ... [2022-07-22 12:49:18,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:18,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:18,732 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:18,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-22 12:49:18,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:49:18,810 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 12:49:18,811 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 12:49:18,811 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 12:49:18,811 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 12:49:18,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:49:18,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:49:18,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:49:18,812 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 12:49:18,812 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 12:49:18,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 12:49:18,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:49:18,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:49:18,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:49:18,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:49:18,815 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-22 12:49:18,928 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:49:18,930 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:49:19,425 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:49:19,557 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:49:19,557 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-22 12:49:19,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:49:19 BoogieIcfgContainer [2022-07-22 12:49:19,562 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:49:19,563 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:49:19,563 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:49:19,569 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:49:19,570 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:49:19,571 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:49:18" (1/3) ... [2022-07-22 12:49:19,572 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5047e016 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:49:19, skipping insertion in model container [2022-07-22 12:49:19,572 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:49:19,572 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:49:18" (2/3) ... [2022-07-22 12:49:19,573 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5047e016 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:49:19, skipping insertion in model container [2022-07-22 12:49:19,573 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:49:19,574 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:49:19" (3/3) ... [2022-07-22 12:49:19,576 INFO L322 chiAutomizerObserver]: Analyzing ICFG popl20-more-inc-subseq.wvr.c [2022-07-22 12:49:19,712 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-22 12:49:19,767 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 175 places, 185 transitions, 386 flow [2022-07-22 12:49:19,888 INFO L129 PetriNetUnfolder]: 15/181 cut-off events. [2022-07-22 12:49:19,888 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:49:19,893 INFO L84 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 181 events. 15/181 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 97 event pairs, 0 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 147. Up to 2 conditions per place. [2022-07-22 12:49:19,894 INFO L82 GeneralOperation]: Start removeDead. Operand has 175 places, 185 transitions, 386 flow [2022-07-22 12:49:19,911 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 173 places, 181 transitions, 374 flow [2022-07-22 12:49:19,916 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-07-22 12:49:19,930 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 181 transitions, 374 flow [2022-07-22 12:49:19,934 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 173 places, 181 transitions, 374 flow [2022-07-22 12:49:19,935 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 173 places, 181 transitions, 374 flow [2022-07-22 12:49:20,004 INFO L129 PetriNetUnfolder]: 15/181 cut-off events. [2022-07-22 12:49:20,004 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:49:20,006 INFO L84 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 181 events. 15/181 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 98 event pairs, 0 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 147. Up to 2 conditions per place. [2022-07-22 12:49:20,008 INFO L116 LiptonReduction]: Number of co-enabled transitions 690 [2022-07-22 12:49:26,312 INFO L131 LiptonReduction]: Checked pairs total: 1324 [2022-07-22 12:49:26,313 INFO L133 LiptonReduction]: Total number of compositions: 194 [2022-07-22 12:49:26,336 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:49:26,336 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:49:26,336 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:49:26,336 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:49:26,336 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:49:26,336 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:49:26,337 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:49:26,337 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:49:26,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:49:26,396 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 60 [2022-07-22 12:49:26,397 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:49:26,397 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:49:26,404 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:49:26,404 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:49:26,404 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:49:26,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 73 states, but on-demand construction may add more states [2022-07-22 12:49:26,413 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 60 [2022-07-22 12:49:26,414 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:49:26,414 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:49:26,414 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:49:26,414 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:49:26,421 INFO L748 eck$LassoCheckResult]: Stem: 178#[ULTIMATE.startENTRY]don't care [741] ULTIMATE.startENTRY-->L117-6: Formula: (let ((.cse1 (store |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 1))) (let ((.cse0 (select |v_#memory_int_137| 1)) (.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53| 1))) (and (= v_~A~0.base_61 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|) (= v_~i~0_63 0) (= |v_#NULL.base_14| 0) (= v_~v_old~0_40 0) (= (select |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) 0) (= v_~A~0.offset_61 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 0)) (= 48 (select .cse0 0)) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) (= v_~n~0_64 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|) (= (select |v_#valid_234| 2) 1) (= |v_#NULL.offset_14| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_43| 0) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t2~0#1.base_53|) (= v_~new~0_37 0) (= (select |v_#valid_234| 1) 1) (= (select |v_#valid_234| 0) 0) (= (select |v_#length_197| 2) 29) (= 0 v_~queue~0.offset_55) (= (select .cse0 1) 0) (= 2 (select |v_#length_197| 1)) (< 0 |v_#StackHeapBarrier_52|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4294967296) 1073741823) 1 0)) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) (= v_~ok~0_46 1) (= v_~end~0_88 v_~start~0_68) (= (store (store (store |v_#length_197| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_53| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4)) |v_#length_195|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| |v_#StackHeapBarrier_52|) (= |v_#valid_232| (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 1)) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= v_~last~0_42 0) (= v_~queue~0.base_55 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99| 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_52|, #valid=|v_#valid_234|, #memory_int=|v_#memory_int_137|, #length=|v_#length_197|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99|, ~A~0.base=v_~A~0.base_61, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_43|, #NULL.offset=|v_#NULL.offset_14|, #length=|v_#length_195|, ~v_old~0=v_~v_old~0_40, ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_47|, ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_37|, ~new~0=v_~new~0_37, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|, ~ok~0=v_~ok~0_46, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_37|, ~i~0=v_~i~0_63, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_81|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_123|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_24|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_57|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_19|, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ~end~0=v_~end~0_88, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_51|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_33|, ~start~0=v_~start~0_68, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_57|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_47|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_33|, ~queue~0.offset=v_~queue~0.offset_55, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_81|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~N~0=v_~N~0_63, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ~queue~0.base=v_~queue~0.base_55, #NULL.base=|v_#NULL.base_14|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_34|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_30|, ~A~0.offset=v_~A~0.offset_61, #valid=|v_#valid_232|, #memory_int=|v_#memory_int_137|, ~n~0=v_~n~0_64, ~last~0=v_~last~0_42, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_53|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, #length, ~v_old~0, ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_main_#t~ret13#1.base, ~new~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~ok~0, ULTIMATE.start_main_#t~ret13#1.offset, ~i~0, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet16#1, ~end~0, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base, ~start~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, ~queue~0.offset, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, #NULL.base, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet11#1, ~A~0.offset, #valid, ~n~0, ~last~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 181#[L117-6]don't care [2022-07-22 12:49:26,422 INFO L750 eck$LassoCheckResult]: Loop: 181#[L117-6]don't care [703] L117-6-->L117-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57| .cse1))) (and (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57| .cse1 4) (select |v_#length_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| |v_ULTIMATE.start_create_fresh_int_array_~size#1_83|) (= (select |v_#valid_168| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|) 1) (= |v_#memory_int_113| (store |v_#memory_int_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57| (store (select |v_#memory_int_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_36|))) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_73| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| 1))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|, #valid=|v_#valid_168|, #memory_int=|v_#memory_int_114|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_83|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|, #valid=|v_#valid_168|, #memory_int=|v_#memory_int_113|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_73|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_83|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 181#[L117-6]don't care [2022-07-22 12:49:26,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:26,429 INFO L85 PathProgramCache]: Analyzing trace with hash 772, now seen corresponding path program 1 times [2022-07-22 12:49:26,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:26,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187269163] [2022-07-22 12:49:26,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:26,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:26,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:26,601 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:49:26,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:26,659 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:49:26,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:26,662 INFO L85 PathProgramCache]: Analyzing trace with hash 734, now seen corresponding path program 1 times [2022-07-22 12:49:26,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:26,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029478245] [2022-07-22 12:49:26,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:26,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:26,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:26,675 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:49:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:26,685 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:49:26,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:26,687 INFO L85 PathProgramCache]: Analyzing trace with hash 24635, now seen corresponding path program 1 times [2022-07-22 12:49:26,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:26,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843984704] [2022-07-22 12:49:26,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:26,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:26,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:26,764 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:49:26,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:26,819 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:49:27,730 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:49:27,731 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:49:27,731 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:49:27,731 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:49:27,732 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:49:27,732 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:27,732 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:49:27,732 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:49:27,732 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-inc-subseq.wvr.c_BEv2_Iteration1_Lasso [2022-07-22 12:49:27,732 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:49:27,733 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:49:27,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:27,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:27,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:27,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:27,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:27,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:27,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:28,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:28,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:28,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:28,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:28,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:28,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:28,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:28,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:28,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:28,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:28,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:28,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:28,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:28,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:28,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:28,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:28,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:28,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:28,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:28,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:28,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:28,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:28,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:28,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:28,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:28,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:28,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:28,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:28,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:28,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:28,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:28,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:28,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:28,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:28,641 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:49:28,646 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:49:28,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:28,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:28,651 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:28,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-22 12:49:28,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:28,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:28,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:28,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:28,678 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:28,679 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:28,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-22 12:49:28,691 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:28,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:28,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:28,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:28,737 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:28,744 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:28,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:28,752 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:28,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:28,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:28,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:28,755 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:28,755 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:28,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-22 12:49:28,766 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:28,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:28,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:28,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:28,809 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:28,815 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:28,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-22 12:49:28,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:28,824 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:28,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:28,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:28,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:28,825 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:28,825 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:28,839 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:28,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:28,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:28,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:28,887 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:28,895 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:28,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:28,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:28,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:28,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:28,908 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:28,909 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:28,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-22 12:49:28,921 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:28,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:28,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:28,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:28,966 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:28,971 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:28,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:28,981 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:28,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:28,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:28,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:28,982 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:28,982 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:28,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-22 12:49:28,993 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:29,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:29,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:29,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:29,040 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:29,046 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:29,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:29,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:29,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:29,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:29,059 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:29,060 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:29,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-22 12:49:29,076 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:29,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:29,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:29,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:29,120 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:29,125 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:29,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:29,136 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-07-22 12:49:29,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:29,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:29,140 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-22 12:49:29,141 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:29,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-22 12:49:29,157 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:29,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:29,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:29,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:29,201 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:29,206 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:29,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:29,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:29,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:29,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:29,219 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:29,219 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:29,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-22 12:49:29,231 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:29,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:29,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:29,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:29,270 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:29,274 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:29,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:29,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:29,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:29,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:29,288 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:29,288 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:29,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-22 12:49:29,301 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:29,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:29,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:29,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:29,343 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:29,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-22 12:49:29,347 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:29,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:29,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:29,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:29,358 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:29,360 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:29,360 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:29,376 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:29,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:29,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:29,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:29,412 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:29,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-22 12:49:29,415 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:29,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:29,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:29,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:29,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:29,425 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:29,425 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:29,439 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:29,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:29,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:29,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:29,465 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:29,475 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:29,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:29,484 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:29,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:29,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:29,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:29,485 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:29,485 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:29,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-22 12:49:29,497 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:29,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:29,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:29,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:29,538 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:29,543 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:29,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:29,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:29,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:29,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:29,560 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:29,560 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:29,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-22 12:49:29,581 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:49:29,622 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-07-22 12:49:29,622 INFO L444 ModelExtractionUtils]: 10 out of 22 variables were initially zero. Simplification set additionally 8 variables to zero. [2022-07-22 12:49:29,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:29,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:29,626 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:29,632 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:49:29,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-22 12:49:29,665 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:49:29,666 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:49:29,667 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1) = 2*v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1 - 1*ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset - 4*ULTIMATE.start_create_fresh_int_array_~i~1#1 Supporting invariants [] [2022-07-22 12:49:29,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:29,779 INFO L257 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2022-07-22 12:49:29,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:49:29,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:49:29,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:49:29,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:49:29,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 12:49:29,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:49:29,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:49:29,899 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-22 12:49:29,943 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 73 states, but on-demand construction may add more states Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:49:29,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:30,032 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 73 states, but on-demand construction may add more states. Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 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 76 states and 182 transitions. Complement of second has 3 states. [2022-07-22 12:49:30,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:49:30,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:49:30,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2022-07-22 12:49:30,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 1 letters. [2022-07-22 12:49:30,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:49:30,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-22 12:49:30,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:49:30,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 2 letters. [2022-07-22 12:49:30,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:49:30,045 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 182 transitions. [2022-07-22 12:49:30,050 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 59 [2022-07-22 12:49:30,057 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 70 states and 171 transitions. [2022-07-22 12:49:30,059 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2022-07-22 12:49:30,059 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2022-07-22 12:49:30,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 171 transitions. [2022-07-22 12:49:30,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:49:30,062 INFO L220 hiAutomatonCegarLoop]: Abstraction has 70 states and 171 transitions. [2022-07-22 12:49:30,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 171 transitions. [2022-07-22 12:49:30,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2022-07-22 12:49:30,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 2.449275362318841) internal successors, (169), 68 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:49:30,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 169 transitions. [2022-07-22 12:49:30,101 INFO L242 hiAutomatonCegarLoop]: Abstraction has 69 states and 169 transitions. [2022-07-22 12:49:30,101 INFO L425 stractBuchiCegarLoop]: Abstraction has 69 states and 169 transitions. [2022-07-22 12:49:30,101 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:49:30,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 169 transitions. [2022-07-22 12:49:30,103 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 59 [2022-07-22 12:49:30,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:49:30,104 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:49:30,104 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 12:49:30,104 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:49:30,105 INFO L748 eck$LassoCheckResult]: Stem: 617#[ULTIMATE.startENTRY]don't care [741] ULTIMATE.startENTRY-->L117-6: Formula: (let ((.cse1 (store |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 1))) (let ((.cse0 (select |v_#memory_int_137| 1)) (.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53| 1))) (and (= v_~A~0.base_61 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|) (= v_~i~0_63 0) (= |v_#NULL.base_14| 0) (= v_~v_old~0_40 0) (= (select |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) 0) (= v_~A~0.offset_61 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 0)) (= 48 (select .cse0 0)) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) (= v_~n~0_64 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|) (= (select |v_#valid_234| 2) 1) (= |v_#NULL.offset_14| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_43| 0) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t2~0#1.base_53|) (= v_~new~0_37 0) (= (select |v_#valid_234| 1) 1) (= (select |v_#valid_234| 0) 0) (= (select |v_#length_197| 2) 29) (= 0 v_~queue~0.offset_55) (= (select .cse0 1) 0) (= 2 (select |v_#length_197| 1)) (< 0 |v_#StackHeapBarrier_52|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4294967296) 1073741823) 1 0)) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) (= v_~ok~0_46 1) (= v_~end~0_88 v_~start~0_68) (= (store (store (store |v_#length_197| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_53| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4)) |v_#length_195|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| |v_#StackHeapBarrier_52|) (= |v_#valid_232| (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 1)) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= v_~last~0_42 0) (= v_~queue~0.base_55 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99| 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_52|, #valid=|v_#valid_234|, #memory_int=|v_#memory_int_137|, #length=|v_#length_197|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99|, ~A~0.base=v_~A~0.base_61, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_43|, #NULL.offset=|v_#NULL.offset_14|, #length=|v_#length_195|, ~v_old~0=v_~v_old~0_40, ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_47|, ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_37|, ~new~0=v_~new~0_37, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|, ~ok~0=v_~ok~0_46, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_37|, ~i~0=v_~i~0_63, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_81|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_123|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_24|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_57|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_19|, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ~end~0=v_~end~0_88, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_51|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_33|, ~start~0=v_~start~0_68, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_57|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_47|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_33|, ~queue~0.offset=v_~queue~0.offset_55, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_81|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~N~0=v_~N~0_63, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ~queue~0.base=v_~queue~0.base_55, #NULL.base=|v_#NULL.base_14|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_34|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_30|, ~A~0.offset=v_~A~0.offset_61, #valid=|v_#valid_232|, #memory_int=|v_#memory_int_137|, ~n~0=v_~n~0_64, ~last~0=v_~last~0_42, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_53|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, #length, ~v_old~0, ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_main_#t~ret13#1.base, ~new~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~ok~0, ULTIMATE.start_main_#t~ret13#1.offset, ~i~0, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet16#1, ~end~0, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base, ~start~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, ~queue~0.offset, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, #NULL.base, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet11#1, ~A~0.offset, #valid, ~n~0, ~last~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 603#[L117-6]don't care [738] L117-6-->L117-14: Formula: (and (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114| |v_ULTIMATE.start_create_fresh_int_array_~size#1_120|)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96| v_~queue~0.base_53) (= (store |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 1) |v_#valid_228|) (= (store |v_#length_192| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4)) |v_#length_191|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95| 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| v_~N~0_61) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96| v_~queue~0.offset_53) (= (select |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| |v_#StackHeapBarrier_50|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96|, #valid=|v_#valid_229|, #length=|v_#length_192|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_120|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_45|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95|, ~queue~0.offset=v_~queue~0.offset_53, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_77|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_77|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_55|, ~queue~0.base=v_~queue~0.base_53, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_119|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_55|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|, #valid=|v_#valid_228|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_31|, #length=|v_#length_191|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_49|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_main_#t~ret12#1.offset, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base] 593#[L117-14]don't care [2022-07-22 12:49:30,106 INFO L750 eck$LassoCheckResult]: Loop: 593#[L117-14]don't care [695] L117-14-->L117-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_73|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51| 4) (select |v_#length_131| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|)) (= (store |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51| (store (select |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|)) |v_#memory_int_109|) (= (select |v_#valid_158| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_110|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_109|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 593#[L117-14]don't care [2022-07-22 12:49:30,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:30,107 INFO L85 PathProgramCache]: Analyzing trace with hash 24670, now seen corresponding path program 1 times [2022-07-22 12:49:30,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:30,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145035368] [2022-07-22 12:49:30,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:30,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:30,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:30,135 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:49:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:30,189 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:49:30,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:30,190 INFO L85 PathProgramCache]: Analyzing trace with hash 726, now seen corresponding path program 1 times [2022-07-22 12:49:30,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:30,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450597006] [2022-07-22 12:49:30,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:30,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:30,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:30,209 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:49:30,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:30,224 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:49:30,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:30,225 INFO L85 PathProgramCache]: Analyzing trace with hash 765465, now seen corresponding path program 1 times [2022-07-22 12:49:30,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:30,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935775856] [2022-07-22 12:49:30,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:30,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:30,273 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:49:30,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:30,301 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:49:32,138 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:49:32,138 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:49:32,139 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:49:32,139 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:49:32,139 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:49:32,139 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:32,139 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:49:32,139 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:49:32,139 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-inc-subseq.wvr.c_BEv2_Iteration2_Lasso [2022-07-22 12:49:32,140 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:49:32,140 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:49:32,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:32,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:33,193 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:49:33,193 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:49:33,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:33,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:33,199 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:33,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-22 12:49:33,205 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:33,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:33,215 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:33,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:33,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:33,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:33,216 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:33,217 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:33,228 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:33,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:33,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:33,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:33,267 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:33,273 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:33,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:33,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:33,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:33,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:33,284 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:33,285 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:33,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-22 12:49:33,297 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:33,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:33,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:33,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:33,335 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:33,338 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:33,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-22 12:49:33,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:33,346 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:33,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:33,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:33,347 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:33,347 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:33,347 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:33,355 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:33,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:33,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:33,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:33,379 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:33,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-22 12:49:33,382 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:33,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:33,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:33,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:33,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:33,391 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:33,391 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:33,414 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:33,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:33,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:33,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:33,450 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:33,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-22 12:49:33,454 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:33,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:33,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:33,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:33,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:33,465 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:33,465 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:33,478 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:33,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:33,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:33,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:33,519 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:33,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-22 12:49:33,526 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:33,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:33,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:33,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:33,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:33,537 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:33,537 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:33,549 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:33,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:33,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:33,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:33,585 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:33,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:33,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:33,599 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:33,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:33,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:33,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:33,600 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:33,600 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:33,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-22 12:49:33,610 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:33,645 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-22 12:49:33,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:33,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:33,646 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:33,649 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:33,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:33,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:33,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:33,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:33,662 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:33,662 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:33,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-22 12:49:33,675 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:33,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:33,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:33,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:33,711 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:33,718 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:33,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-22 12:49:33,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:33,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:33,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:33,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:33,728 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:33,728 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:33,732 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:33,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-07-22 12:49:33,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:33,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:33,755 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:33,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-22 12:49:33,756 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:33,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:33,764 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:33,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:33,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:33,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:33,765 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:33,765 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:33,775 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:33,796 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-22 12:49:33,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:33,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:33,798 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:33,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-22 12:49:33,799 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:33,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:33,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:33,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:33,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:33,813 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:33,813 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:33,816 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:33,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-07-22 12:49:33,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:33,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:33,839 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:33,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-22 12:49:33,841 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:33,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:33,849 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:33,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:33,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:33,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:33,849 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:33,849 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:33,850 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:33,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-07-22 12:49:33,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:33,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:33,874 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:33,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-22 12:49:33,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-22 12:49:33,884 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:33,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:33,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:33,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:33,886 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:33,886 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:33,897 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:33,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-07-22 12:49:33,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:33,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:33,920 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:33,922 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:33,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-22 12:49:33,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:33,930 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:33,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:33,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:33,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:33,931 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:33,931 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:33,932 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:33,955 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-22 12:49:33,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:33,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:33,956 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:33,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-07-22 12:49:33,958 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:33,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:33,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:33,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:33,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:33,967 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:33,967 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:33,971 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:33,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-07-22 12:49:33,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:33,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:33,994 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-22 12:49:33,994 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-22 12:49:33,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-22 12:49:34,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:34,002 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:34,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:34,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:34,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:34,003 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:34,003 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:34,004 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:34,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-07-22 12:49:34,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:34,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:34,027 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-22 12:49:34,028 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-22 12:49:34,028 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:34,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:34,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:34,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:34,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:34,037 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:34,037 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:34,041 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:34,062 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-22 12:49:34,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:34,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:34,064 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-22 12:49:34,065 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-22 12:49:34,065 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:34,073 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:34,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:34,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:34,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:34,074 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:34,075 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:34,085 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:34,108 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-22 12:49:34,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:34,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:34,109 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-22 12:49:34,110 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-22 12:49:34,111 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:34,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:34,119 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:34,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:34,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:34,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:34,120 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:34,120 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:34,130 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:34,154 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-22 12:49:34,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:34,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:34,155 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-22 12:49:34,156 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-22 12:49:34,157 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:34,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:34,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:34,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:34,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:34,167 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:34,167 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:34,174 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:34,195 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-22 12:49:34,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:34,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:34,197 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-22 12:49:34,198 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-22 12:49:34,199 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:34,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:34,206 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:34,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:34,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:34,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:34,207 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:34,207 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:34,209 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:34,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2022-07-22 12:49:34,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:34,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:34,234 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-22 12:49:34,236 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-22 12:49:34,237 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:34,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:34,244 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:34,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:34,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:34,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:34,246 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:34,246 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:34,267 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:34,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:34,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:34,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:34,290 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-22 12:49:34,292 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:34,296 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-22 12:49:34,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:34,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:34,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:34,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:34,301 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:34,301 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:34,308 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:34,331 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-22 12:49:34,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:34,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:34,332 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-22 12:49:34,334 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:34,337 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-22 12:49:34,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:34,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:34,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:34,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:34,344 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:34,344 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:34,347 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:34,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2022-07-22 12:49:34,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:34,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:34,370 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-22 12:49:34,375 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-22 12:49:34,376 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:34,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:34,383 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:34,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:34,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:34,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:34,383 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:34,383 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:34,385 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:34,408 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-22 12:49:34,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:34,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:34,409 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-22 12:49:34,410 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-22 12:49:34,411 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:34,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:34,418 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:34,419 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:34,419 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:34,419 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:34,419 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:34,419 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:34,430 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:34,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2022-07-22 12:49:34,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:34,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:34,454 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-22 12:49:34,455 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-22 12:49:34,457 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:34,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:34,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:34,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:34,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:34,466 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:34,466 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:34,469 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:34,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:34,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:34,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:34,493 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-22 12:49:34,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-22 12:49:34,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:34,508 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:34,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:34,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:34,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:34,510 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:34,510 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:34,511 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-22 12:49:34,511 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:34,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2022-07-22 12:49:34,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:34,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:34,534 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-22 12:49:34,535 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-22 12:49:34,535 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:34,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:34,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:34,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:34,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:34,545 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:34,545 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:34,548 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:34,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:34,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:34,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:34,571 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-22 12:49:34,571 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-22 12:49:34,572 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:34,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:34,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:34,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:34,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:34,582 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:34,582 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:34,593 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:34,614 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-22 12:49:34,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:34,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:34,616 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-22 12:49:34,617 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-22 12:49:34,620 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:34,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:34,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:34,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:34,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:34,628 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:34,628 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:34,632 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:34,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:34,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:34,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:34,656 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-22 12:49:34,657 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-22 12:49:34,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-22 12:49:34,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:34,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:34,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:34,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:34,667 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:34,667 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:34,673 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:34,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:34,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:34,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:34,697 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-22 12:49:34,699 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-22 12:49:34,700 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:34,707 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:34,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:34,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:34,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:34,709 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:34,709 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:34,712 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:34,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:34,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:34,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:34,736 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-22 12:49:34,737 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-22 12:49:34,737 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:34,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:34,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:34,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:34,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:34,747 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:34,747 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:34,750 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:34,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:34,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:34,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:34,774 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-22 12:49:34,775 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-22 12:49:34,776 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:34,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:34,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:34,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:34,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:34,784 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:34,784 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:34,787 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:34,810 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-22 12:49:34,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:34,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:34,811 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-22 12:49:34,812 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-22 12:49:34,813 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:34,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:34,822 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2022-07-22 12:49:34,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:34,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:34,827 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-07-22 12:49:34,827 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:34,842 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:34,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:34,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:34,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:34,881 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-22 12:49:34,887 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:34,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:34,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:34,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:34,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:34,899 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:34,899 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:34,903 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-22 12:49:34,913 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:34,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:34,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:34,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:34,950 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-22 12:49:34,954 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:34,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:34,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:34,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:34,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:34,968 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:34,968 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:34,975 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-22 12:49:34,985 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:49:35,016 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-07-22 12:49:35,016 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. [2022-07-22 12:49:35,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:35,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:35,018 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-22 12:49:35,026 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:49:35,035 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-22 12:49:35,047 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:49:35,047 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:49:35,048 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-22 12:49:35,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:35,155 INFO L257 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2022-07-22 12:49:35,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:35,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:49:35,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:49:35,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:49:35,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:49:35,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:49:35,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:49:35,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:49:35,215 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-22 12:49:35,215 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69 states and 169 transitions. cyclomatic complexity: 114 Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:49:35,253 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69 states and 169 transitions. cyclomatic complexity: 114. Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 70 states and 171 transitions. Complement of second has 3 states. [2022-07-22 12:49:35,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:49:35,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:49:35,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 4 transitions. [2022-07-22 12:49:35,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 4 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-22 12:49:35,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:49:35,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 4 transitions. Stem has 3 letters. Loop has 1 letters. [2022-07-22 12:49:35,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:49:35,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 4 transitions. Stem has 2 letters. Loop has 2 letters. [2022-07-22 12:49:35,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:49:35,257 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 171 transitions. [2022-07-22 12:49:35,263 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 58 [2022-07-22 12:49:35,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 70 states and 171 transitions. [2022-07-22 12:49:35,269 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2022-07-22 12:49:35,269 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2022-07-22 12:49:35,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 171 transitions. [2022-07-22 12:49:35,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:49:35,271 INFO L220 hiAutomatonCegarLoop]: Abstraction has 70 states and 171 transitions. [2022-07-22 12:49:35,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 171 transitions. [2022-07-22 12:49:35,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-07-22 12:49:35,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 2.442857142857143) internal successors, (171), 69 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:49:35,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 171 transitions. [2022-07-22 12:49:35,288 INFO L242 hiAutomatonCegarLoop]: Abstraction has 70 states and 171 transitions. [2022-07-22 12:49:35,288 INFO L425 stractBuchiCegarLoop]: Abstraction has 70 states and 171 transitions. [2022-07-22 12:49:35,288 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:49:35,288 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 171 transitions. [2022-07-22 12:49:35,292 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 58 [2022-07-22 12:49:35,292 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:49:35,292 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:49:35,297 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 12:49:35,297 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:49:35,298 INFO L748 eck$LassoCheckResult]: Stem: 932#[ULTIMATE.startENTRY]don't care [741] ULTIMATE.startENTRY-->L117-6: Formula: (let ((.cse1 (store |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 1))) (let ((.cse0 (select |v_#memory_int_137| 1)) (.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53| 1))) (and (= v_~A~0.base_61 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|) (= v_~i~0_63 0) (= |v_#NULL.base_14| 0) (= v_~v_old~0_40 0) (= (select |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) 0) (= v_~A~0.offset_61 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 0)) (= 48 (select .cse0 0)) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) (= v_~n~0_64 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|) (= (select |v_#valid_234| 2) 1) (= |v_#NULL.offset_14| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_43| 0) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t2~0#1.base_53|) (= v_~new~0_37 0) (= (select |v_#valid_234| 1) 1) (= (select |v_#valid_234| 0) 0) (= (select |v_#length_197| 2) 29) (= 0 v_~queue~0.offset_55) (= (select .cse0 1) 0) (= 2 (select |v_#length_197| 1)) (< 0 |v_#StackHeapBarrier_52|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4294967296) 1073741823) 1 0)) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) (= v_~ok~0_46 1) (= v_~end~0_88 v_~start~0_68) (= (store (store (store |v_#length_197| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_53| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4)) |v_#length_195|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| |v_#StackHeapBarrier_52|) (= |v_#valid_232| (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 1)) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= v_~last~0_42 0) (= v_~queue~0.base_55 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99| 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_52|, #valid=|v_#valid_234|, #memory_int=|v_#memory_int_137|, #length=|v_#length_197|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99|, ~A~0.base=v_~A~0.base_61, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_43|, #NULL.offset=|v_#NULL.offset_14|, #length=|v_#length_195|, ~v_old~0=v_~v_old~0_40, ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_47|, ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_37|, ~new~0=v_~new~0_37, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|, ~ok~0=v_~ok~0_46, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_37|, ~i~0=v_~i~0_63, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_81|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_123|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_24|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_57|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_19|, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ~end~0=v_~end~0_88, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_51|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_33|, ~start~0=v_~start~0_68, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_57|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_47|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_33|, ~queue~0.offset=v_~queue~0.offset_55, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_81|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~N~0=v_~N~0_63, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ~queue~0.base=v_~queue~0.base_55, #NULL.base=|v_#NULL.base_14|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_34|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_30|, ~A~0.offset=v_~A~0.offset_61, #valid=|v_#valid_232|, #memory_int=|v_#memory_int_137|, ~n~0=v_~n~0_64, ~last~0=v_~last~0_42, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_53|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, #length, ~v_old~0, ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_main_#t~ret13#1.base, ~new~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~ok~0, ULTIMATE.start_main_#t~ret13#1.offset, ~i~0, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet16#1, ~end~0, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base, ~start~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, ~queue~0.offset, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, #NULL.base, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet11#1, ~A~0.offset, #valid, ~n~0, ~last~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 918#[L117-6]don't care [738] L117-6-->L117-14: Formula: (and (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114| |v_ULTIMATE.start_create_fresh_int_array_~size#1_120|)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96| v_~queue~0.base_53) (= (store |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 1) |v_#valid_228|) (= (store |v_#length_192| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4)) |v_#length_191|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95| 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| v_~N~0_61) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96| v_~queue~0.offset_53) (= (select |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| |v_#StackHeapBarrier_50|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96|, #valid=|v_#valid_229|, #length=|v_#length_192|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_120|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_45|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95|, ~queue~0.offset=v_~queue~0.offset_53, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_77|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_77|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_55|, ~queue~0.base=v_~queue~0.base_53, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_119|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_55|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|, #valid=|v_#valid_228|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_31|, #length=|v_#length_191|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_49|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_main_#t~ret12#1.offset, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base] 906#[L117-14]don't care [740] L117-14-->L101-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (<= 0 v_~A~0.offset_Out_2) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre15#1_Out_2|)) |v_#memory_int_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (< 0 v_~N~0_In_3) 1 0)) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ 4 v_~A~0.offset_Out_2) (select |v_#length_In_7| v_~A~0.base_Out_2)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| v_~A~0.base_Out_2) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= (select |v_#valid_In_7| v_~A~0.base_Out_2) 1) (= (select (select |v_#memory_int_In_1| v_~A~0.base_Out_2) v_~A~0.offset_Out_2) v_~v_old~0_Out_2) (= v_~v_old~0_Out_2 v_~last~0_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre15#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| v_~A~0.offset_Out_2) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, #pthreadsForks=|v_#pthreadsForks_In_1|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, #length=|v_#length_In_7|, ~N~0=v_~N~0_In_3, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|} OutVars{ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_Out_2|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_Out_2|, ~N~0=v_~N~0_In_3, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_Out_2|, ~A~0.offset=v_~A~0.offset_Out_2, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_7|, ~v_old~0=v_~v_old~0_Out_2, ~last~0=v_~last~0_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret13#1.base, ~A~0.base, ULTIMATE.start_main_#t~ret13#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~mem14#1, ~A~0.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~v_old~0, ~last~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 812#[L101-3]don't care [542] L101-3-->L59: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre15#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_4|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_12|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 814#[L101-4, L59]don't care [2022-07-22 12:49:35,298 INFO L750 eck$LassoCheckResult]: Loop: 814#[L101-4, L59]don't care [652] L59-->L49-4: Formula: (let ((.cse1 (* v_~i~0_55 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_33))) (and (<= 0 .cse0) (= (select (select |v_#memory_int_81| v_~A~0.base_33) .cse0) |v_thread1Thread1of1ForFork0_#t~mem1#1_23|) (= (select |v_#valid_104| v_~A~0.base_33) 1) (<= (+ .cse1 v_~A~0.offset_33 4) (select |v_#length_89| v_~A~0.base_33)) (< v_~i~0_55 v_~N~0_31) (not (<= v_~last~0_16 |v_thread1Thread1of1ForFork0_#t~mem1#1_23|))))) InVars {~A~0.base=v_~A~0.base_33, ~A~0.offset=v_~A~0.offset_33, ~i~0=v_~i~0_55, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_81|, #length=|v_#length_89|, ~N~0=v_~N~0_31, ~last~0=v_~last~0_16} OutVars{~A~0.base=v_~A~0.base_33, ~A~0.offset=v_~A~0.offset_33, ~i~0=v_~i~0_55, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_81|, #length=|v_#length_89|, ~N~0=v_~N~0_31, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_23|, ~last~0=v_~last~0_16} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 820#[L101-4, L49-4]don't care [563] L49-4-->L59: Formula: (= v_~i~0_31 (+ v_~i~0_32 1)) InVars {~i~0=v_~i~0_32} OutVars{~i~0=v_~i~0_31, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_13|} AuxVars[] AssignedVars[~i~0, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] 814#[L101-4, L59]don't care [2022-07-22 12:49:35,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:35,299 INFO L85 PathProgramCache]: Analyzing trace with hash 23731352, now seen corresponding path program 1 times [2022-07-22 12:49:35,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:35,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161129717] [2022-07-22 12:49:35,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:35,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:35,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:49:35,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:35,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:49:35,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:49:35,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161129717] [2022-07-22 12:49:35,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161129717] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:49:35,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:49:35,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 12:49:35,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071714804] [2022-07-22 12:49:35,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:49:35,459 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-07-22 12:49:35,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:35,459 INFO L85 PathProgramCache]: Analyzing trace with hash 21736, now seen corresponding path program 1 times [2022-07-22 12:49:35,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:35,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730980326] [2022-07-22 12:49:35,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:35,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:35,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:35,466 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:49:35,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:35,471 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:49:35,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:49:35,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 12:49:35,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 12:49:35,509 INFO L87 Difference]: Start difference. First operand 70 states and 171 transitions. cyclomatic complexity: 115 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:49:35,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:49:35,565 INFO L93 Difference]: Finished difference Result 70 states and 170 transitions. [2022-07-22 12:49:35,565 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 170 transitions. [2022-07-22 12:49:35,567 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 58 [2022-07-22 12:49:35,568 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 70 states and 170 transitions. [2022-07-22 12:49:35,568 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2022-07-22 12:49:35,569 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2022-07-22 12:49:35,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 170 transitions. [2022-07-22 12:49:35,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:49:35,570 INFO L220 hiAutomatonCegarLoop]: Abstraction has 70 states and 170 transitions. [2022-07-22 12:49:35,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 170 transitions. [2022-07-22 12:49:35,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-07-22 12:49:35,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 2.4285714285714284) internal successors, (170), 69 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:49:35,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 170 transitions. [2022-07-22 12:49:35,583 INFO L242 hiAutomatonCegarLoop]: Abstraction has 70 states and 170 transitions. [2022-07-22 12:49:35,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 12:49:35,587 INFO L425 stractBuchiCegarLoop]: Abstraction has 70 states and 170 transitions. [2022-07-22 12:49:35,587 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 12:49:35,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 170 transitions. [2022-07-22 12:49:35,589 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 58 [2022-07-22 12:49:35,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:49:35,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:49:35,589 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 12:49:35,589 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:49:35,591 INFO L748 eck$LassoCheckResult]: Stem: 1148#[ULTIMATE.startENTRY]don't care [741] ULTIMATE.startENTRY-->L117-6: Formula: (let ((.cse1 (store |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 1))) (let ((.cse0 (select |v_#memory_int_137| 1)) (.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53| 1))) (and (= v_~A~0.base_61 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|) (= v_~i~0_63 0) (= |v_#NULL.base_14| 0) (= v_~v_old~0_40 0) (= (select |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) 0) (= v_~A~0.offset_61 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 0)) (= 48 (select .cse0 0)) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) (= v_~n~0_64 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|) (= (select |v_#valid_234| 2) 1) (= |v_#NULL.offset_14| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_43| 0) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t2~0#1.base_53|) (= v_~new~0_37 0) (= (select |v_#valid_234| 1) 1) (= (select |v_#valid_234| 0) 0) (= (select |v_#length_197| 2) 29) (= 0 v_~queue~0.offset_55) (= (select .cse0 1) 0) (= 2 (select |v_#length_197| 1)) (< 0 |v_#StackHeapBarrier_52|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4294967296) 1073741823) 1 0)) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) (= v_~ok~0_46 1) (= v_~end~0_88 v_~start~0_68) (= (store (store (store |v_#length_197| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_53| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4)) |v_#length_195|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| |v_#StackHeapBarrier_52|) (= |v_#valid_232| (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 1)) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= v_~last~0_42 0) (= v_~queue~0.base_55 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99| 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_52|, #valid=|v_#valid_234|, #memory_int=|v_#memory_int_137|, #length=|v_#length_197|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99|, ~A~0.base=v_~A~0.base_61, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_43|, #NULL.offset=|v_#NULL.offset_14|, #length=|v_#length_195|, ~v_old~0=v_~v_old~0_40, ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_47|, ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_37|, ~new~0=v_~new~0_37, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|, ~ok~0=v_~ok~0_46, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_37|, ~i~0=v_~i~0_63, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_81|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_123|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_24|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_57|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_19|, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ~end~0=v_~end~0_88, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_51|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_33|, ~start~0=v_~start~0_68, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_57|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_47|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_33|, ~queue~0.offset=v_~queue~0.offset_55, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_81|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~N~0=v_~N~0_63, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ~queue~0.base=v_~queue~0.base_55, #NULL.base=|v_#NULL.base_14|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_34|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_30|, ~A~0.offset=v_~A~0.offset_61, #valid=|v_#valid_232|, #memory_int=|v_#memory_int_137|, ~n~0=v_~n~0_64, ~last~0=v_~last~0_42, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_53|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, #length, ~v_old~0, ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_main_#t~ret13#1.base, ~new~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~ok~0, ULTIMATE.start_main_#t~ret13#1.offset, ~i~0, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet16#1, ~end~0, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base, ~start~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, ~queue~0.offset, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, #NULL.base, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet11#1, ~A~0.offset, #valid, ~n~0, ~last~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1134#[L117-6]don't care [738] L117-6-->L117-14: Formula: (and (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114| |v_ULTIMATE.start_create_fresh_int_array_~size#1_120|)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96| v_~queue~0.base_53) (= (store |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 1) |v_#valid_228|) (= (store |v_#length_192| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4)) |v_#length_191|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95| 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| v_~N~0_61) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96| v_~queue~0.offset_53) (= (select |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| |v_#StackHeapBarrier_50|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96|, #valid=|v_#valid_229|, #length=|v_#length_192|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_120|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_45|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95|, ~queue~0.offset=v_~queue~0.offset_53, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_77|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_77|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_55|, ~queue~0.base=v_~queue~0.base_53, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_119|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_55|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|, #valid=|v_#valid_228|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_31|, #length=|v_#length_191|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_49|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_main_#t~ret12#1.offset, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base] 1124#[L117-14]don't care [695] L117-14-->L117-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_73|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51| 4) (select |v_#length_131| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|)) (= (store |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51| (store (select |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|)) |v_#memory_int_109|) (= (select |v_#valid_158| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_110|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_109|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 1126#[L117-14]don't care [740] L117-14-->L101-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (<= 0 v_~A~0.offset_Out_2) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre15#1_Out_2|)) |v_#memory_int_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (< 0 v_~N~0_In_3) 1 0)) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ 4 v_~A~0.offset_Out_2) (select |v_#length_In_7| v_~A~0.base_Out_2)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| v_~A~0.base_Out_2) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= (select |v_#valid_In_7| v_~A~0.base_Out_2) 1) (= (select (select |v_#memory_int_In_1| v_~A~0.base_Out_2) v_~A~0.offset_Out_2) v_~v_old~0_Out_2) (= v_~v_old~0_Out_2 v_~last~0_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre15#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| v_~A~0.offset_Out_2) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, #pthreadsForks=|v_#pthreadsForks_In_1|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, #length=|v_#length_In_7|, ~N~0=v_~N~0_In_3, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|} OutVars{ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_Out_2|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_Out_2|, ~N~0=v_~N~0_In_3, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_Out_2|, ~A~0.offset=v_~A~0.offset_Out_2, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_7|, ~v_old~0=v_~v_old~0_Out_2, ~last~0=v_~last~0_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret13#1.base, ~A~0.base, ULTIMATE.start_main_#t~ret13#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~mem14#1, ~A~0.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~v_old~0, ~last~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1022#[L101-3]don't care [542] L101-3-->L59: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre15#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_4|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_12|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 1024#[L101-4, L59]don't care [2022-07-22 12:49:35,591 INFO L750 eck$LassoCheckResult]: Loop: 1024#[L101-4, L59]don't care [652] L59-->L49-4: Formula: (let ((.cse1 (* v_~i~0_55 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_33))) (and (<= 0 .cse0) (= (select (select |v_#memory_int_81| v_~A~0.base_33) .cse0) |v_thread1Thread1of1ForFork0_#t~mem1#1_23|) (= (select |v_#valid_104| v_~A~0.base_33) 1) (<= (+ .cse1 v_~A~0.offset_33 4) (select |v_#length_89| v_~A~0.base_33)) (< v_~i~0_55 v_~N~0_31) (not (<= v_~last~0_16 |v_thread1Thread1of1ForFork0_#t~mem1#1_23|))))) InVars {~A~0.base=v_~A~0.base_33, ~A~0.offset=v_~A~0.offset_33, ~i~0=v_~i~0_55, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_81|, #length=|v_#length_89|, ~N~0=v_~N~0_31, ~last~0=v_~last~0_16} OutVars{~A~0.base=v_~A~0.base_33, ~A~0.offset=v_~A~0.offset_33, ~i~0=v_~i~0_55, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_81|, #length=|v_#length_89|, ~N~0=v_~N~0_31, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_23|, ~last~0=v_~last~0_16} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 1036#[L101-4, L49-4]don't care [563] L49-4-->L59: Formula: (= v_~i~0_31 (+ v_~i~0_32 1)) InVars {~i~0=v_~i~0_32} OutVars{~i~0=v_~i~0_31, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_13|} AuxVars[] AssignedVars[~i~0, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] 1024#[L101-4, L59]don't care [2022-07-22 12:49:35,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:35,592 INFO L85 PathProgramCache]: Analyzing trace with hash 735635347, now seen corresponding path program 1 times [2022-07-22 12:49:35,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:35,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662368847] [2022-07-22 12:49:35,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:35,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:35,639 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:49:35,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:35,713 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:49:35,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:35,714 INFO L85 PathProgramCache]: Analyzing trace with hash 21736, now seen corresponding path program 2 times [2022-07-22 12:49:35,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:35,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251956650] [2022-07-22 12:49:35,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:35,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:35,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:35,729 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:49:35,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:35,735 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:49:35,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:35,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1724014598, now seen corresponding path program 1 times [2022-07-22 12:49:35,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:35,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295228508] [2022-07-22 12:49:35,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:35,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:35,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:49:35,847 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-22 12:49:35,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:49:35,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295228508] [2022-07-22 12:49:35,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295228508] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:49:35,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:49:35,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 12:49:35,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007863481] [2022-07-22 12:49:35,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:49:35,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:49:35,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 12:49:35,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 12:49:35,890 INFO L87 Difference]: Start difference. First operand 70 states and 170 transitions. cyclomatic complexity: 114 Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:49:36,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:49:36,016 INFO L93 Difference]: Finished difference Result 133 states and 328 transitions. [2022-07-22 12:49:36,016 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 328 transitions. [2022-07-22 12:49:36,019 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 86 [2022-07-22 12:49:36,022 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 133 states and 328 transitions. [2022-07-22 12:49:36,022 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 131 [2022-07-22 12:49:36,023 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 131 [2022-07-22 12:49:36,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 133 states and 328 transitions. [2022-07-22 12:49:36,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:49:36,024 INFO L220 hiAutomatonCegarLoop]: Abstraction has 133 states and 328 transitions. [2022-07-22 12:49:36,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states and 328 transitions. [2022-07-22 12:49:36,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 71. [2022-07-22 12:49:36,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 2.436619718309859) internal successors, (173), 70 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:49:36,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 173 transitions. [2022-07-22 12:49:36,032 INFO L242 hiAutomatonCegarLoop]: Abstraction has 71 states and 173 transitions. [2022-07-22 12:49:36,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 12:49:36,033 INFO L425 stractBuchiCegarLoop]: Abstraction has 71 states and 173 transitions. [2022-07-22 12:49:36,033 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 12:49:36,034 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 173 transitions. [2022-07-22 12:49:36,035 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 58 [2022-07-22 12:49:36,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:49:36,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:49:36,035 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:49:36,035 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:49:36,037 INFO L748 eck$LassoCheckResult]: Stem: 1437#[ULTIMATE.startENTRY]don't care [741] ULTIMATE.startENTRY-->L117-6: Formula: (let ((.cse1 (store |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 1))) (let ((.cse0 (select |v_#memory_int_137| 1)) (.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53| 1))) (and (= v_~A~0.base_61 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|) (= v_~i~0_63 0) (= |v_#NULL.base_14| 0) (= v_~v_old~0_40 0) (= (select |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) 0) (= v_~A~0.offset_61 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 0)) (= 48 (select .cse0 0)) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) (= v_~n~0_64 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|) (= (select |v_#valid_234| 2) 1) (= |v_#NULL.offset_14| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_43| 0) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t2~0#1.base_53|) (= v_~new~0_37 0) (= (select |v_#valid_234| 1) 1) (= (select |v_#valid_234| 0) 0) (= (select |v_#length_197| 2) 29) (= 0 v_~queue~0.offset_55) (= (select .cse0 1) 0) (= 2 (select |v_#length_197| 1)) (< 0 |v_#StackHeapBarrier_52|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4294967296) 1073741823) 1 0)) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) (= v_~ok~0_46 1) (= v_~end~0_88 v_~start~0_68) (= (store (store (store |v_#length_197| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_53| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4)) |v_#length_195|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| |v_#StackHeapBarrier_52|) (= |v_#valid_232| (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 1)) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= v_~last~0_42 0) (= v_~queue~0.base_55 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99| 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_52|, #valid=|v_#valid_234|, #memory_int=|v_#memory_int_137|, #length=|v_#length_197|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99|, ~A~0.base=v_~A~0.base_61, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_43|, #NULL.offset=|v_#NULL.offset_14|, #length=|v_#length_195|, ~v_old~0=v_~v_old~0_40, ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_47|, ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_37|, ~new~0=v_~new~0_37, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|, ~ok~0=v_~ok~0_46, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_37|, ~i~0=v_~i~0_63, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_81|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_123|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_24|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_57|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_19|, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ~end~0=v_~end~0_88, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_51|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_33|, ~start~0=v_~start~0_68, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_57|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_47|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_33|, ~queue~0.offset=v_~queue~0.offset_55, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_81|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~N~0=v_~N~0_63, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ~queue~0.base=v_~queue~0.base_55, #NULL.base=|v_#NULL.base_14|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_34|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_30|, ~A~0.offset=v_~A~0.offset_61, #valid=|v_#valid_232|, #memory_int=|v_#memory_int_137|, ~n~0=v_~n~0_64, ~last~0=v_~last~0_42, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_53|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, #length, ~v_old~0, ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_main_#t~ret13#1.base, ~new~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~ok~0, ULTIMATE.start_main_#t~ret13#1.offset, ~i~0, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet16#1, ~end~0, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base, ~start~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, ~queue~0.offset, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, #NULL.base, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet11#1, ~A~0.offset, #valid, ~n~0, ~last~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1423#[L117-6]don't care [738] L117-6-->L117-14: Formula: (and (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114| |v_ULTIMATE.start_create_fresh_int_array_~size#1_120|)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96| v_~queue~0.base_53) (= (store |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 1) |v_#valid_228|) (= (store |v_#length_192| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4)) |v_#length_191|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95| 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| v_~N~0_61) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96| v_~queue~0.offset_53) (= (select |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| |v_#StackHeapBarrier_50|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96|, #valid=|v_#valid_229|, #length=|v_#length_192|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_120|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_45|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95|, ~queue~0.offset=v_~queue~0.offset_53, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_77|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_77|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_55|, ~queue~0.base=v_~queue~0.base_53, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_119|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_55|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|, #valid=|v_#valid_228|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_31|, #length=|v_#length_191|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_49|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_main_#t~ret12#1.offset, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base] 1411#[L117-14]don't care [695] L117-14-->L117-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_73|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51| 4) (select |v_#length_131| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|)) (= (store |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51| (store (select |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|)) |v_#memory_int_109|) (= (select |v_#valid_158| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_110|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_109|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 1413#[L117-14]don't care [740] L117-14-->L101-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (<= 0 v_~A~0.offset_Out_2) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre15#1_Out_2|)) |v_#memory_int_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (< 0 v_~N~0_In_3) 1 0)) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ 4 v_~A~0.offset_Out_2) (select |v_#length_In_7| v_~A~0.base_Out_2)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| v_~A~0.base_Out_2) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= (select |v_#valid_In_7| v_~A~0.base_Out_2) 1) (= (select (select |v_#memory_int_In_1| v_~A~0.base_Out_2) v_~A~0.offset_Out_2) v_~v_old~0_Out_2) (= v_~v_old~0_Out_2 v_~last~0_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre15#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| v_~A~0.offset_Out_2) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, #pthreadsForks=|v_#pthreadsForks_In_1|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, #length=|v_#length_In_7|, ~N~0=v_~N~0_In_3, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|} OutVars{ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_Out_2|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_Out_2|, ~N~0=v_~N~0_In_3, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_Out_2|, ~A~0.offset=v_~A~0.offset_Out_2, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_7|, ~v_old~0=v_~v_old~0_Out_2, ~last~0=v_~last~0_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret13#1.base, ~A~0.base, ULTIMATE.start_main_#t~ret13#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~mem14#1, ~A~0.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~v_old~0, ~last~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1315#[L101-3]don't care [542] L101-3-->L59: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre15#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_4|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_12|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 1317#[L101-4, L59]don't care [694] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_106| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_106| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre17#1_19|)) |v_#memory_int_105|) (= |v_ULTIMATE.start_main_#t~pre17#1_19| |v_#pthreadsForks_24|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_29| 4) (select |v_#length_129| |v_ULTIMATE.start_main_~#t2~0#1.base_35|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_29|) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (select |v_#valid_156| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) 1)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_106|, #length=|v_#length_129|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_11|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_105|, #length=|v_#length_129|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_19|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_19|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] 1319#[L59, L102-3]don't care [2022-07-22 12:49:36,037 INFO L750 eck$LassoCheckResult]: Loop: 1319#[L59, L102-3]don't care [652] L59-->L49-4: Formula: (let ((.cse1 (* v_~i~0_55 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_33))) (and (<= 0 .cse0) (= (select (select |v_#memory_int_81| v_~A~0.base_33) .cse0) |v_thread1Thread1of1ForFork0_#t~mem1#1_23|) (= (select |v_#valid_104| v_~A~0.base_33) 1) (<= (+ .cse1 v_~A~0.offset_33 4) (select |v_#length_89| v_~A~0.base_33)) (< v_~i~0_55 v_~N~0_31) (not (<= v_~last~0_16 |v_thread1Thread1of1ForFork0_#t~mem1#1_23|))))) InVars {~A~0.base=v_~A~0.base_33, ~A~0.offset=v_~A~0.offset_33, ~i~0=v_~i~0_55, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_81|, #length=|v_#length_89|, ~N~0=v_~N~0_31, ~last~0=v_~last~0_16} OutVars{~A~0.base=v_~A~0.base_33, ~A~0.offset=v_~A~0.offset_33, ~i~0=v_~i~0_55, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_81|, #length=|v_#length_89|, ~N~0=v_~N~0_31, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_23|, ~last~0=v_~last~0_16} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 1331#[L49-4, L102-3]don't care [563] L49-4-->L59: Formula: (= v_~i~0_31 (+ v_~i~0_32 1)) InVars {~i~0=v_~i~0_32} OutVars{~i~0=v_~i~0_31, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_13|} AuxVars[] AssignedVars[~i~0, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] 1319#[L59, L102-3]don't care [2022-07-22 12:49:36,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:36,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1329859971, now seen corresponding path program 1 times [2022-07-22 12:49:36,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:36,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049045579] [2022-07-22 12:49:36,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:36,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:36,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:36,068 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:49:36,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:36,095 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:49:36,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:36,096 INFO L85 PathProgramCache]: Analyzing trace with hash 21736, now seen corresponding path program 3 times [2022-07-22 12:49:36,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:36,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404147504] [2022-07-22 12:49:36,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:36,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:36,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:36,101 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:49:36,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:36,105 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:49:36,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:36,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1904801302, now seen corresponding path program 1 times [2022-07-22 12:49:36,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:36,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052219558] [2022-07-22 12:49:36,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:36,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:49:36,247 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-22 12:49:36,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:49:36,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052219558] [2022-07-22 12:49:36,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052219558] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:49:36,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:49:36,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 12:49:36,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001158134] [2022-07-22 12:49:36,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:49:36,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:49:36,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 12:49:36,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-22 12:49:36,282 INFO L87 Difference]: Start difference. First operand 71 states and 173 transitions. cyclomatic complexity: 116 Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:49:36,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:49:36,412 INFO L93 Difference]: Finished difference Result 124 states and 297 transitions. [2022-07-22 12:49:36,412 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 297 transitions. [2022-07-22 12:49:36,414 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 82 [2022-07-22 12:49:36,416 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 124 states and 297 transitions. [2022-07-22 12:49:36,416 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 122 [2022-07-22 12:49:36,416 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2022-07-22 12:49:36,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 297 transitions. [2022-07-22 12:49:36,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:49:36,418 INFO L220 hiAutomatonCegarLoop]: Abstraction has 124 states and 297 transitions. [2022-07-22 12:49:36,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 297 transitions. [2022-07-22 12:49:36,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 80. [2022-07-22 12:49:36,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 80 states have (on average 2.525) internal successors, (202), 79 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:49:36,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 202 transitions. [2022-07-22 12:49:36,425 INFO L242 hiAutomatonCegarLoop]: Abstraction has 80 states and 202 transitions. [2022-07-22 12:49:36,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 12:49:36,426 INFO L425 stractBuchiCegarLoop]: Abstraction has 80 states and 202 transitions. [2022-07-22 12:49:36,426 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-22 12:49:36,426 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 202 transitions. [2022-07-22 12:49:36,427 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 62 [2022-07-22 12:49:36,427 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:49:36,428 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:49:36,428 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:49:36,428 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-22 12:49:36,429 INFO L748 eck$LassoCheckResult]: Stem: 1736#[ULTIMATE.startENTRY]don't care [741] ULTIMATE.startENTRY-->L117-6: Formula: (let ((.cse1 (store |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 1))) (let ((.cse0 (select |v_#memory_int_137| 1)) (.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53| 1))) (and (= v_~A~0.base_61 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|) (= v_~i~0_63 0) (= |v_#NULL.base_14| 0) (= v_~v_old~0_40 0) (= (select |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) 0) (= v_~A~0.offset_61 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 0)) (= 48 (select .cse0 0)) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) (= v_~n~0_64 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|) (= (select |v_#valid_234| 2) 1) (= |v_#NULL.offset_14| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_43| 0) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t2~0#1.base_53|) (= v_~new~0_37 0) (= (select |v_#valid_234| 1) 1) (= (select |v_#valid_234| 0) 0) (= (select |v_#length_197| 2) 29) (= 0 v_~queue~0.offset_55) (= (select .cse0 1) 0) (= 2 (select |v_#length_197| 1)) (< 0 |v_#StackHeapBarrier_52|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4294967296) 1073741823) 1 0)) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) (= v_~ok~0_46 1) (= v_~end~0_88 v_~start~0_68) (= (store (store (store |v_#length_197| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_53| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4)) |v_#length_195|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| |v_#StackHeapBarrier_52|) (= |v_#valid_232| (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 1)) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= v_~last~0_42 0) (= v_~queue~0.base_55 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99| 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_52|, #valid=|v_#valid_234|, #memory_int=|v_#memory_int_137|, #length=|v_#length_197|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99|, ~A~0.base=v_~A~0.base_61, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_43|, #NULL.offset=|v_#NULL.offset_14|, #length=|v_#length_195|, ~v_old~0=v_~v_old~0_40, ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_47|, ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_37|, ~new~0=v_~new~0_37, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|, ~ok~0=v_~ok~0_46, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_37|, ~i~0=v_~i~0_63, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_81|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_123|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_24|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_57|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_19|, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ~end~0=v_~end~0_88, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_51|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_33|, ~start~0=v_~start~0_68, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_57|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_47|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_33|, ~queue~0.offset=v_~queue~0.offset_55, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_81|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~N~0=v_~N~0_63, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ~queue~0.base=v_~queue~0.base_55, #NULL.base=|v_#NULL.base_14|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_34|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_30|, ~A~0.offset=v_~A~0.offset_61, #valid=|v_#valid_232|, #memory_int=|v_#memory_int_137|, ~n~0=v_~n~0_64, ~last~0=v_~last~0_42, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_53|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, #length, ~v_old~0, ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_main_#t~ret13#1.base, ~new~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~ok~0, ULTIMATE.start_main_#t~ret13#1.offset, ~i~0, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet16#1, ~end~0, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base, ~start~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, ~queue~0.offset, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, #NULL.base, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet11#1, ~A~0.offset, #valid, ~n~0, ~last~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1720#[L117-6]don't care [738] L117-6-->L117-14: Formula: (and (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114| |v_ULTIMATE.start_create_fresh_int_array_~size#1_120|)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96| v_~queue~0.base_53) (= (store |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 1) |v_#valid_228|) (= (store |v_#length_192| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4)) |v_#length_191|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95| 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| v_~N~0_61) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96| v_~queue~0.offset_53) (= (select |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| |v_#StackHeapBarrier_50|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96|, #valid=|v_#valid_229|, #length=|v_#length_192|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_120|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_45|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95|, ~queue~0.offset=v_~queue~0.offset_53, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_77|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_77|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_55|, ~queue~0.base=v_~queue~0.base_53, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_119|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_55|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|, #valid=|v_#valid_228|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_31|, #length=|v_#length_191|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_49|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_main_#t~ret12#1.offset, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base] 1698#[L117-14]don't care [695] L117-14-->L117-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_73|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51| 4) (select |v_#length_131| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|)) (= (store |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51| (store (select |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|)) |v_#memory_int_109|) (= (select |v_#valid_158| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_110|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_109|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 1700#[L117-14]don't care [740] L117-14-->L101-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (<= 0 v_~A~0.offset_Out_2) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre15#1_Out_2|)) |v_#memory_int_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (< 0 v_~N~0_In_3) 1 0)) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ 4 v_~A~0.offset_Out_2) (select |v_#length_In_7| v_~A~0.base_Out_2)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| v_~A~0.base_Out_2) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= (select |v_#valid_In_7| v_~A~0.base_Out_2) 1) (= (select (select |v_#memory_int_In_1| v_~A~0.base_Out_2) v_~A~0.offset_Out_2) v_~v_old~0_Out_2) (= v_~v_old~0_Out_2 v_~last~0_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre15#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| v_~A~0.offset_Out_2) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, #pthreadsForks=|v_#pthreadsForks_In_1|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, #length=|v_#length_In_7|, ~N~0=v_~N~0_In_3, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|} OutVars{ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_Out_2|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_Out_2|, ~N~0=v_~N~0_In_3, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_Out_2|, ~A~0.offset=v_~A~0.offset_Out_2, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_7|, ~v_old~0=v_~v_old~0_Out_2, ~last~0=v_~last~0_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret13#1.base, ~A~0.base, ULTIMATE.start_main_#t~ret13#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~mem14#1, ~A~0.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~v_old~0, ~last~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1596#[L101-3]don't care [542] L101-3-->L59: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre15#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_4|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_12|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 1598#[L101-4, L59]don't care [651] L59-->L49-2: Formula: (let ((.cse1 (* v_~i~0_53 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_31))) (and (= (select (select |v_#memory_int_79| v_~A~0.base_31) .cse0) |v_thread1Thread1of1ForFork0_#t~mem1#1_21|) (< v_~i~0_53 v_~N~0_29) (<= 0 .cse0) (<= v_~last~0_14 |v_thread1Thread1of1ForFork0_#t~mem1#1_21|) (<= (+ .cse1 v_~A~0.offset_31 4) (select |v_#length_87| v_~A~0.base_31)) (= (select |v_#valid_102| v_~A~0.base_31) 1)))) InVars {~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, ~last~0=v_~last~0_14} OutVars{~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_21|, ~last~0=v_~last~0_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 1602#[L101-4, L49-2]don't care [2022-07-22 12:49:36,430 INFO L750 eck$LassoCheckResult]: Loop: 1602#[L101-4, L49-2]don't care [606] L49-2-->L54: Formula: (let ((.cse2 (* v_~i~0_45 4)) (.cse3 (* v_~end~0_65 4))) (let ((.cse0 (+ .cse3 v_~queue~0.offset_33)) (.cse1 (+ v_~A~0.offset_25 .cse2))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| (ite (= (select (select |v_#memory_int_59| v_~queue~0.base_33) .cse0) (select (select |v_#memory_int_59| v_~A~0.base_25) .cse1)) 1 0)) (<= (+ v_~A~0.offset_25 4 .cse2) (select |v_#length_71| v_~A~0.base_25)) (= (select |v_#valid_86| v_~queue~0.base_33) 1) (<= 0 .cse0) (<= (+ .cse3 4 v_~queue~0.offset_33) (select |v_#length_71| v_~queue~0.base_33)) (= v_~end~0_64 (+ v_~end~0_65 1)) (<= 0 .cse1) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (not (= (ite (and (< v_~end~0_65 v_~n~0_32) (<= 0 v_~end~0_65)) 1 0) 0)) (= (select |v_#valid_86| v_~A~0.base_25) 1)))) InVars {~A~0.base=v_~A~0.base_25, ~queue~0.offset=v_~queue~0.offset_33, ~A~0.offset=v_~A~0.offset_25, ~i~0=v_~i~0_45, #valid=|v_#valid_86|, #memory_int=|v_#memory_int_59|, ~end~0=v_~end~0_65, #length=|v_#length_71|, ~queue~0.base=v_~queue~0.base_33, ~n~0=v_~n~0_32} OutVars{~A~0.base=v_~A~0.base_25, ~queue~0.offset=v_~queue~0.offset_33, ~i~0=v_~i~0_45, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_5|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~queue~0.base=v_~queue~0.base_33, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~A~0.offset=v_~A~0.offset_25, #valid=|v_#valid_86|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_59|, ~end~0=v_~end~0_64, #length=|v_#length_71|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_5|, ~n~0=v_~n~0_32, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_19|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1] 1672#[L101-4, L54]don't care [567] L54-->L55-1: Formula: (let ((.cse0 (* v_~i~0_35 4))) (let ((.cse1 (+ .cse0 v_~A~0.offset_17))) (and (<= (+ .cse0 v_~A~0.offset_17 4) (select |v_#length_49| v_~A~0.base_17)) (<= 0 .cse1) (= v_~last~0_6 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= (select |v_#valid_56| v_~A~0.base_17) 1) (= (select (select |v_#memory_int_47| v_~A~0.base_17) .cse1) |v_thread1Thread1of1ForFork0_#t~mem5#1_11|)))) InVars {~A~0.base=v_~A~0.base_17, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_35, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_47|, #length=|v_#length_49|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_17, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_35, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_47|, #length=|v_#length_49|, ~last~0=v_~last~0_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] 1674#[L101-4, L55-1]don't care [562] L55-1-->L59: Formula: (= (+ v_~i~0_28 1) v_~i~0_27) InVars {~i~0=v_~i~0_28} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_9|, ~i~0=v_~i~0_27, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~i~0, thread1Thread1of1ForFork0_#t~post6#1] 1606#[L101-4, L59]don't care [651] L59-->L49-2: Formula: (let ((.cse1 (* v_~i~0_53 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_31))) (and (= (select (select |v_#memory_int_79| v_~A~0.base_31) .cse0) |v_thread1Thread1of1ForFork0_#t~mem1#1_21|) (< v_~i~0_53 v_~N~0_29) (<= 0 .cse0) (<= v_~last~0_14 |v_thread1Thread1of1ForFork0_#t~mem1#1_21|) (<= (+ .cse1 v_~A~0.offset_31 4) (select |v_#length_87| v_~A~0.base_31)) (= (select |v_#valid_102| v_~A~0.base_31) 1)))) InVars {~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, ~last~0=v_~last~0_14} OutVars{~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_21|, ~last~0=v_~last~0_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 1602#[L101-4, L49-2]don't care [2022-07-22 12:49:36,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:36,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1329859928, now seen corresponding path program 1 times [2022-07-22 12:49:36,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:36,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023350605] [2022-07-22 12:49:36,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:36,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:36,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:36,455 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:49:36,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:36,483 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:49:36,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:36,484 INFO L85 PathProgramCache]: Analyzing trace with hash 19539827, now seen corresponding path program 1 times [2022-07-22 12:49:36,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:36,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696067867] [2022-07-22 12:49:36,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:36,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:36,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:36,493 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:49:36,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:36,502 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:49:36,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:36,502 INFO L85 PathProgramCache]: Analyzing trace with hash -899042998, now seen corresponding path program 1 times [2022-07-22 12:49:36,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:36,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592933303] [2022-07-22 12:49:36,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:36,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:36,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:49:36,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 12:49:36,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:49:36,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592933303] [2022-07-22 12:49:36,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592933303] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:49:36,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:49:36,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 12:49:36,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325599883] [2022-07-22 12:49:36,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:49:36,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:49:36,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 12:49:36,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 12:49:36,741 INFO L87 Difference]: Start difference. First operand 80 states and 202 transitions. cyclomatic complexity: 138 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:49:36,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:49:36,817 INFO L93 Difference]: Finished difference Result 109 states and 250 transitions. [2022-07-22 12:49:36,818 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 250 transitions. [2022-07-22 12:49:36,819 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 62 [2022-07-22 12:49:36,821 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 80 states and 201 transitions. [2022-07-22 12:49:36,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78 [2022-07-22 12:49:36,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2022-07-22 12:49:36,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 201 transitions. [2022-07-22 12:49:36,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:49:36,828 INFO L220 hiAutomatonCegarLoop]: Abstraction has 80 states and 201 transitions. [2022-07-22 12:49:36,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 201 transitions. [2022-07-22 12:49:36,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-07-22 12:49:36,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 80 states have (on average 2.5125) internal successors, (201), 79 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:49:36,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 201 transitions. [2022-07-22 12:49:36,841 INFO L242 hiAutomatonCegarLoop]: Abstraction has 80 states and 201 transitions. [2022-07-22 12:49:36,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 12:49:36,844 INFO L425 stractBuchiCegarLoop]: Abstraction has 80 states and 201 transitions. [2022-07-22 12:49:36,845 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-22 12:49:36,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 201 transitions. [2022-07-22 12:49:36,847 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 62 [2022-07-22 12:49:36,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:49:36,847 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:49:36,847 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:49:36,847 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-22 12:49:36,848 INFO L748 eck$LassoCheckResult]: Stem: 2014#[ULTIMATE.startENTRY]don't care [741] ULTIMATE.startENTRY-->L117-6: Formula: (let ((.cse1 (store |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 1))) (let ((.cse0 (select |v_#memory_int_137| 1)) (.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53| 1))) (and (= v_~A~0.base_61 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|) (= v_~i~0_63 0) (= |v_#NULL.base_14| 0) (= v_~v_old~0_40 0) (= (select |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) 0) (= v_~A~0.offset_61 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 0)) (= 48 (select .cse0 0)) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) (= v_~n~0_64 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|) (= (select |v_#valid_234| 2) 1) (= |v_#NULL.offset_14| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_43| 0) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t2~0#1.base_53|) (= v_~new~0_37 0) (= (select |v_#valid_234| 1) 1) (= (select |v_#valid_234| 0) 0) (= (select |v_#length_197| 2) 29) (= 0 v_~queue~0.offset_55) (= (select .cse0 1) 0) (= 2 (select |v_#length_197| 1)) (< 0 |v_#StackHeapBarrier_52|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4294967296) 1073741823) 1 0)) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) (= v_~ok~0_46 1) (= v_~end~0_88 v_~start~0_68) (= (store (store (store |v_#length_197| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_53| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4)) |v_#length_195|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| |v_#StackHeapBarrier_52|) (= |v_#valid_232| (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 1)) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= v_~last~0_42 0) (= v_~queue~0.base_55 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99| 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_52|, #valid=|v_#valid_234|, #memory_int=|v_#memory_int_137|, #length=|v_#length_197|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99|, ~A~0.base=v_~A~0.base_61, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_43|, #NULL.offset=|v_#NULL.offset_14|, #length=|v_#length_195|, ~v_old~0=v_~v_old~0_40, ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_47|, ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_37|, ~new~0=v_~new~0_37, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|, ~ok~0=v_~ok~0_46, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_37|, ~i~0=v_~i~0_63, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_81|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_123|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_24|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_57|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_19|, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ~end~0=v_~end~0_88, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_51|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_33|, ~start~0=v_~start~0_68, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_57|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_47|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_33|, ~queue~0.offset=v_~queue~0.offset_55, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_81|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~N~0=v_~N~0_63, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ~queue~0.base=v_~queue~0.base_55, #NULL.base=|v_#NULL.base_14|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_34|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_30|, ~A~0.offset=v_~A~0.offset_61, #valid=|v_#valid_232|, #memory_int=|v_#memory_int_137|, ~n~0=v_~n~0_64, ~last~0=v_~last~0_42, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_53|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, #length, ~v_old~0, ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_main_#t~ret13#1.base, ~new~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~ok~0, ULTIMATE.start_main_#t~ret13#1.offset, ~i~0, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet16#1, ~end~0, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base, ~start~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, ~queue~0.offset, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, #NULL.base, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet11#1, ~A~0.offset, #valid, ~n~0, ~last~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1998#[L117-6]don't care [703] L117-6-->L117-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57| .cse1))) (and (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57| .cse1 4) (select |v_#length_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| |v_ULTIMATE.start_create_fresh_int_array_~size#1_83|) (= (select |v_#valid_168| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|) 1) (= |v_#memory_int_113| (store |v_#memory_int_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57| (store (select |v_#memory_int_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_36|))) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_73| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| 1))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|, #valid=|v_#valid_168|, #memory_int=|v_#memory_int_114|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_83|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|, #valid=|v_#valid_168|, #memory_int=|v_#memory_int_113|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_73|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_83|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 2000#[L117-6]don't care [738] L117-6-->L117-14: Formula: (and (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114| |v_ULTIMATE.start_create_fresh_int_array_~size#1_120|)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96| v_~queue~0.base_53) (= (store |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 1) |v_#valid_228|) (= (store |v_#length_192| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4)) |v_#length_191|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95| 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| v_~N~0_61) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96| v_~queue~0.offset_53) (= (select |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| |v_#StackHeapBarrier_50|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96|, #valid=|v_#valid_229|, #length=|v_#length_192|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_120|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_45|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95|, ~queue~0.offset=v_~queue~0.offset_53, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_77|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_77|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_55|, ~queue~0.base=v_~queue~0.base_53, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_119|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_55|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|, #valid=|v_#valid_228|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_31|, #length=|v_#length_191|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_49|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_main_#t~ret12#1.offset, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base] 1978#[L117-14]don't care [695] L117-14-->L117-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_73|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51| 4) (select |v_#length_131| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|)) (= (store |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51| (store (select |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|)) |v_#memory_int_109|) (= (select |v_#valid_158| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_110|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_109|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 1980#[L117-14]don't care [740] L117-14-->L101-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (<= 0 v_~A~0.offset_Out_2) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre15#1_Out_2|)) |v_#memory_int_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (< 0 v_~N~0_In_3) 1 0)) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ 4 v_~A~0.offset_Out_2) (select |v_#length_In_7| v_~A~0.base_Out_2)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| v_~A~0.base_Out_2) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= (select |v_#valid_In_7| v_~A~0.base_Out_2) 1) (= (select (select |v_#memory_int_In_1| v_~A~0.base_Out_2) v_~A~0.offset_Out_2) v_~v_old~0_Out_2) (= v_~v_old~0_Out_2 v_~last~0_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre15#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| v_~A~0.offset_Out_2) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, #pthreadsForks=|v_#pthreadsForks_In_1|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, #length=|v_#length_In_7|, ~N~0=v_~N~0_In_3, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|} OutVars{ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_Out_2|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_Out_2|, ~N~0=v_~N~0_In_3, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_Out_2|, ~A~0.offset=v_~A~0.offset_Out_2, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_7|, ~v_old~0=v_~v_old~0_Out_2, ~last~0=v_~last~0_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret13#1.base, ~A~0.base, ULTIMATE.start_main_#t~ret13#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~mem14#1, ~A~0.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~v_old~0, ~last~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1868#[L101-3]don't care [542] L101-3-->L59: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre15#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_4|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_12|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 1870#[L101-4, L59]don't care [651] L59-->L49-2: Formula: (let ((.cse1 (* v_~i~0_53 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_31))) (and (= (select (select |v_#memory_int_79| v_~A~0.base_31) .cse0) |v_thread1Thread1of1ForFork0_#t~mem1#1_21|) (< v_~i~0_53 v_~N~0_29) (<= 0 .cse0) (<= v_~last~0_14 |v_thread1Thread1of1ForFork0_#t~mem1#1_21|) (<= (+ .cse1 v_~A~0.offset_31 4) (select |v_#length_87| v_~A~0.base_31)) (= (select |v_#valid_102| v_~A~0.base_31) 1)))) InVars {~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, ~last~0=v_~last~0_14} OutVars{~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_21|, ~last~0=v_~last~0_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 1880#[L101-4, L49-2]don't care [2022-07-22 12:49:36,849 INFO L750 eck$LassoCheckResult]: Loop: 1880#[L101-4, L49-2]don't care [606] L49-2-->L54: Formula: (let ((.cse2 (* v_~i~0_45 4)) (.cse3 (* v_~end~0_65 4))) (let ((.cse0 (+ .cse3 v_~queue~0.offset_33)) (.cse1 (+ v_~A~0.offset_25 .cse2))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| (ite (= (select (select |v_#memory_int_59| v_~queue~0.base_33) .cse0) (select (select |v_#memory_int_59| v_~A~0.base_25) .cse1)) 1 0)) (<= (+ v_~A~0.offset_25 4 .cse2) (select |v_#length_71| v_~A~0.base_25)) (= (select |v_#valid_86| v_~queue~0.base_33) 1) (<= 0 .cse0) (<= (+ .cse3 4 v_~queue~0.offset_33) (select |v_#length_71| v_~queue~0.base_33)) (= v_~end~0_64 (+ v_~end~0_65 1)) (<= 0 .cse1) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (not (= (ite (and (< v_~end~0_65 v_~n~0_32) (<= 0 v_~end~0_65)) 1 0) 0)) (= (select |v_#valid_86| v_~A~0.base_25) 1)))) InVars {~A~0.base=v_~A~0.base_25, ~queue~0.offset=v_~queue~0.offset_33, ~A~0.offset=v_~A~0.offset_25, ~i~0=v_~i~0_45, #valid=|v_#valid_86|, #memory_int=|v_#memory_int_59|, ~end~0=v_~end~0_65, #length=|v_#length_71|, ~queue~0.base=v_~queue~0.base_33, ~n~0=v_~n~0_32} OutVars{~A~0.base=v_~A~0.base_25, ~queue~0.offset=v_~queue~0.offset_33, ~i~0=v_~i~0_45, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_5|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~queue~0.base=v_~queue~0.base_33, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~A~0.offset=v_~A~0.offset_25, #valid=|v_#valid_86|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_59|, ~end~0=v_~end~0_64, #length=|v_#length_71|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_5|, ~n~0=v_~n~0_32, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_19|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1] 1942#[L101-4, L54]don't care [567] L54-->L55-1: Formula: (let ((.cse0 (* v_~i~0_35 4))) (let ((.cse1 (+ .cse0 v_~A~0.offset_17))) (and (<= (+ .cse0 v_~A~0.offset_17 4) (select |v_#length_49| v_~A~0.base_17)) (<= 0 .cse1) (= v_~last~0_6 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= (select |v_#valid_56| v_~A~0.base_17) 1) (= (select (select |v_#memory_int_47| v_~A~0.base_17) .cse1) |v_thread1Thread1of1ForFork0_#t~mem5#1_11|)))) InVars {~A~0.base=v_~A~0.base_17, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_35, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_47|, #length=|v_#length_49|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_17, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_35, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_47|, #length=|v_#length_49|, ~last~0=v_~last~0_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] 1944#[L101-4, L55-1]don't care [562] L55-1-->L59: Formula: (= (+ v_~i~0_28 1) v_~i~0_27) InVars {~i~0=v_~i~0_28} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_9|, ~i~0=v_~i~0_27, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~i~0, thread1Thread1of1ForFork0_#t~post6#1] 1884#[L101-4, L59]don't care [651] L59-->L49-2: Formula: (let ((.cse1 (* v_~i~0_53 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_31))) (and (= (select (select |v_#memory_int_79| v_~A~0.base_31) .cse0) |v_thread1Thread1of1ForFork0_#t~mem1#1_21|) (< v_~i~0_53 v_~N~0_29) (<= 0 .cse0) (<= v_~last~0_14 |v_thread1Thread1of1ForFork0_#t~mem1#1_21|) (<= (+ .cse1 v_~A~0.offset_31 4) (select |v_#length_87| v_~A~0.base_31)) (= (select |v_#valid_102| v_~A~0.base_31) 1)))) InVars {~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, ~last~0=v_~last~0_14} OutVars{~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_21|, ~last~0=v_~last~0_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 1880#[L101-4, L49-2]don't care [2022-07-22 12:49:36,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:36,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1607490177, now seen corresponding path program 1 times [2022-07-22 12:49:36,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:36,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66607149] [2022-07-22 12:49:36,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:36,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:36,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:36,947 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:49:36,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:37,000 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:49:37,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:37,001 INFO L85 PathProgramCache]: Analyzing trace with hash 19539827, now seen corresponding path program 2 times [2022-07-22 12:49:37,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:37,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758778510] [2022-07-22 12:49:37,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:37,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:37,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:37,018 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:49:37,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:37,032 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:49:37,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:37,033 INFO L85 PathProgramCache]: Analyzing trace with hash -196525581, now seen corresponding path program 1 times [2022-07-22 12:49:37,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:37,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136263593] [2022-07-22 12:49:37,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:37,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:49:37,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 12:49:37,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:49:37,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136263593] [2022-07-22 12:49:37,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136263593] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 12:49:37,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169844228] [2022-07-22 12:49:37,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:37,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 12:49:37,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:37,123 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 12:49:37,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-07-22 12:49:37,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:49:37,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 12:49:37,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:49:37,298 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 12:49:37,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 12:49:37,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 12:49:37,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169844228] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 12:49:37,364 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 12:49:37,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-07-22 12:49:37,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120807894] [2022-07-22 12:49:37,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 12:49:37,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:49:37,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-22 12:49:37,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-07-22 12:49:37,556 INFO L87 Difference]: Start difference. First operand 80 states and 201 transitions. cyclomatic complexity: 137 Second operand has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:49:37,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:49:37,984 INFO L93 Difference]: Finished difference Result 205 states and 473 transitions. [2022-07-22 12:49:37,984 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 205 states and 473 transitions. [2022-07-22 12:49:37,987 INFO L131 ngComponentsAnalysis]: Automaton has 42 accepting balls. 118 [2022-07-22 12:49:37,990 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 205 states to 195 states and 450 transitions. [2022-07-22 12:49:37,990 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 191 [2022-07-22 12:49:37,991 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 191 [2022-07-22 12:49:37,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 195 states and 450 transitions. [2022-07-22 12:49:37,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:49:37,992 INFO L220 hiAutomatonCegarLoop]: Abstraction has 195 states and 450 transitions. [2022-07-22 12:49:37,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states and 450 transitions. [2022-07-22 12:49:37,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 122. [2022-07-22 12:49:38,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 122 states have (on average 2.5163934426229506) internal successors, (307), 121 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:49:38,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 307 transitions. [2022-07-22 12:49:38,001 INFO L242 hiAutomatonCegarLoop]: Abstraction has 122 states and 307 transitions. [2022-07-22 12:49:38,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 12:49:38,002 INFO L425 stractBuchiCegarLoop]: Abstraction has 122 states and 307 transitions. [2022-07-22 12:49:38,002 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-22 12:49:38,002 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 307 transitions. [2022-07-22 12:49:38,004 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 82 [2022-07-22 12:49:38,004 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:49:38,004 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:49:38,005 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2022-07-22 12:49:38,005 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-22 12:49:38,006 INFO L748 eck$LassoCheckResult]: Stem: 2488#[ULTIMATE.startENTRY]don't care [741] ULTIMATE.startENTRY-->L117-6: Formula: (let ((.cse1 (store |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 1))) (let ((.cse0 (select |v_#memory_int_137| 1)) (.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53| 1))) (and (= v_~A~0.base_61 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|) (= v_~i~0_63 0) (= |v_#NULL.base_14| 0) (= v_~v_old~0_40 0) (= (select |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) 0) (= v_~A~0.offset_61 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 0)) (= 48 (select .cse0 0)) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) (= v_~n~0_64 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|) (= (select |v_#valid_234| 2) 1) (= |v_#NULL.offset_14| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_43| 0) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t2~0#1.base_53|) (= v_~new~0_37 0) (= (select |v_#valid_234| 1) 1) (= (select |v_#valid_234| 0) 0) (= (select |v_#length_197| 2) 29) (= 0 v_~queue~0.offset_55) (= (select .cse0 1) 0) (= 2 (select |v_#length_197| 1)) (< 0 |v_#StackHeapBarrier_52|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4294967296) 1073741823) 1 0)) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) (= v_~ok~0_46 1) (= v_~end~0_88 v_~start~0_68) (= (store (store (store |v_#length_197| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_53| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4)) |v_#length_195|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| |v_#StackHeapBarrier_52|) (= |v_#valid_232| (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 1)) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= v_~last~0_42 0) (= v_~queue~0.base_55 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99| 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_52|, #valid=|v_#valid_234|, #memory_int=|v_#memory_int_137|, #length=|v_#length_197|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99|, ~A~0.base=v_~A~0.base_61, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_43|, #NULL.offset=|v_#NULL.offset_14|, #length=|v_#length_195|, ~v_old~0=v_~v_old~0_40, ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_47|, ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_37|, ~new~0=v_~new~0_37, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|, ~ok~0=v_~ok~0_46, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_37|, ~i~0=v_~i~0_63, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_81|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_123|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_24|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_57|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_19|, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ~end~0=v_~end~0_88, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_51|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_33|, ~start~0=v_~start~0_68, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_57|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_47|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_33|, ~queue~0.offset=v_~queue~0.offset_55, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_81|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~N~0=v_~N~0_63, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ~queue~0.base=v_~queue~0.base_55, #NULL.base=|v_#NULL.base_14|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_34|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_30|, ~A~0.offset=v_~A~0.offset_61, #valid=|v_#valid_232|, #memory_int=|v_#memory_int_137|, ~n~0=v_~n~0_64, ~last~0=v_~last~0_42, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_53|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, #length, ~v_old~0, ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_main_#t~ret13#1.base, ~new~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~ok~0, ULTIMATE.start_main_#t~ret13#1.offset, ~i~0, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet16#1, ~end~0, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base, ~start~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, ~queue~0.offset, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, #NULL.base, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet11#1, ~A~0.offset, #valid, ~n~0, ~last~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2452#[L117-6]don't care [703] L117-6-->L117-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57| .cse1))) (and (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57| .cse1 4) (select |v_#length_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| |v_ULTIMATE.start_create_fresh_int_array_~size#1_83|) (= (select |v_#valid_168| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|) 1) (= |v_#memory_int_113| (store |v_#memory_int_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57| (store (select |v_#memory_int_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_36|))) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_73| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| 1))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|, #valid=|v_#valid_168|, #memory_int=|v_#memory_int_114|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_83|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|, #valid=|v_#valid_168|, #memory_int=|v_#memory_int_113|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_73|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_83|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 2454#[L117-6]don't care [738] L117-6-->L117-14: Formula: (and (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114| |v_ULTIMATE.start_create_fresh_int_array_~size#1_120|)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96| v_~queue~0.base_53) (= (store |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 1) |v_#valid_228|) (= (store |v_#length_192| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4)) |v_#length_191|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95| 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| v_~N~0_61) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96| v_~queue~0.offset_53) (= (select |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| |v_#StackHeapBarrier_50|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96|, #valid=|v_#valid_229|, #length=|v_#length_192|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_120|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_45|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95|, ~queue~0.offset=v_~queue~0.offset_53, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_77|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_77|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_55|, ~queue~0.base=v_~queue~0.base_53, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_119|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_55|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|, #valid=|v_#valid_228|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_31|, #length=|v_#length_191|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_49|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_main_#t~ret12#1.offset, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base] 2430#[L117-14]don't care [695] L117-14-->L117-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_73|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51| 4) (select |v_#length_131| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|)) (= (store |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51| (store (select |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|)) |v_#memory_int_109|) (= (select |v_#valid_158| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_110|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_109|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 2432#[L117-14]don't care [695] L117-14-->L117-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_73|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51| 4) (select |v_#length_131| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|)) (= (store |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51| (store (select |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|)) |v_#memory_int_109|) (= (select |v_#valid_158| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_110|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_109|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 2434#[L117-14]don't care [740] L117-14-->L101-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (<= 0 v_~A~0.offset_Out_2) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre15#1_Out_2|)) |v_#memory_int_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (< 0 v_~N~0_In_3) 1 0)) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ 4 v_~A~0.offset_Out_2) (select |v_#length_In_7| v_~A~0.base_Out_2)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| v_~A~0.base_Out_2) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= (select |v_#valid_In_7| v_~A~0.base_Out_2) 1) (= (select (select |v_#memory_int_In_1| v_~A~0.base_Out_2) v_~A~0.offset_Out_2) v_~v_old~0_Out_2) (= v_~v_old~0_Out_2 v_~last~0_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre15#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| v_~A~0.offset_Out_2) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, #pthreadsForks=|v_#pthreadsForks_In_1|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, #length=|v_#length_In_7|, ~N~0=v_~N~0_In_3, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|} OutVars{ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_Out_2|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_Out_2|, ~N~0=v_~N~0_In_3, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_Out_2|, ~A~0.offset=v_~A~0.offset_Out_2, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_7|, ~v_old~0=v_~v_old~0_Out_2, ~last~0=v_~last~0_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret13#1.base, ~A~0.base, ULTIMATE.start_main_#t~ret13#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~mem14#1, ~A~0.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~v_old~0, ~last~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2548#[L101-3]don't care [542] L101-3-->L59: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre15#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_4|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_12|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 2524#[L101-4, L59]don't care [651] L59-->L49-2: Formula: (let ((.cse1 (* v_~i~0_53 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_31))) (and (= (select (select |v_#memory_int_79| v_~A~0.base_31) .cse0) |v_thread1Thread1of1ForFork0_#t~mem1#1_21|) (< v_~i~0_53 v_~N~0_29) (<= 0 .cse0) (<= v_~last~0_14 |v_thread1Thread1of1ForFork0_#t~mem1#1_21|) (<= (+ .cse1 v_~A~0.offset_31 4) (select |v_#length_87| v_~A~0.base_31)) (= (select |v_#valid_102| v_~A~0.base_31) 1)))) InVars {~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, ~last~0=v_~last~0_14} OutVars{~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_21|, ~last~0=v_~last~0_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 2484#[L101-4, L49-2]don't care [2022-07-22 12:49:38,007 INFO L750 eck$LassoCheckResult]: Loop: 2484#[L101-4, L49-2]don't care [606] L49-2-->L54: Formula: (let ((.cse2 (* v_~i~0_45 4)) (.cse3 (* v_~end~0_65 4))) (let ((.cse0 (+ .cse3 v_~queue~0.offset_33)) (.cse1 (+ v_~A~0.offset_25 .cse2))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| (ite (= (select (select |v_#memory_int_59| v_~queue~0.base_33) .cse0) (select (select |v_#memory_int_59| v_~A~0.base_25) .cse1)) 1 0)) (<= (+ v_~A~0.offset_25 4 .cse2) (select |v_#length_71| v_~A~0.base_25)) (= (select |v_#valid_86| v_~queue~0.base_33) 1) (<= 0 .cse0) (<= (+ .cse3 4 v_~queue~0.offset_33) (select |v_#length_71| v_~queue~0.base_33)) (= v_~end~0_64 (+ v_~end~0_65 1)) (<= 0 .cse1) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (not (= (ite (and (< v_~end~0_65 v_~n~0_32) (<= 0 v_~end~0_65)) 1 0) 0)) (= (select |v_#valid_86| v_~A~0.base_25) 1)))) InVars {~A~0.base=v_~A~0.base_25, ~queue~0.offset=v_~queue~0.offset_33, ~A~0.offset=v_~A~0.offset_25, ~i~0=v_~i~0_45, #valid=|v_#valid_86|, #memory_int=|v_#memory_int_59|, ~end~0=v_~end~0_65, #length=|v_#length_71|, ~queue~0.base=v_~queue~0.base_33, ~n~0=v_~n~0_32} OutVars{~A~0.base=v_~A~0.base_25, ~queue~0.offset=v_~queue~0.offset_33, ~i~0=v_~i~0_45, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_5|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~queue~0.base=v_~queue~0.base_33, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~A~0.offset=v_~A~0.offset_25, #valid=|v_#valid_86|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_59|, ~end~0=v_~end~0_64, #length=|v_#length_71|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_5|, ~n~0=v_~n~0_32, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_19|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1] 2396#[L101-4, L54]don't care [567] L54-->L55-1: Formula: (let ((.cse0 (* v_~i~0_35 4))) (let ((.cse1 (+ .cse0 v_~A~0.offset_17))) (and (<= (+ .cse0 v_~A~0.offset_17 4) (select |v_#length_49| v_~A~0.base_17)) (<= 0 .cse1) (= v_~last~0_6 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= (select |v_#valid_56| v_~A~0.base_17) 1) (= (select (select |v_#memory_int_47| v_~A~0.base_17) .cse1) |v_thread1Thread1of1ForFork0_#t~mem5#1_11|)))) InVars {~A~0.base=v_~A~0.base_17, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_35, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_47|, #length=|v_#length_49|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_17, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_35, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_47|, #length=|v_#length_49|, ~last~0=v_~last~0_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] 2398#[L101-4, L55-1]don't care [562] L55-1-->L59: Formula: (= (+ v_~i~0_28 1) v_~i~0_27) InVars {~i~0=v_~i~0_28} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_9|, ~i~0=v_~i~0_27, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~i~0, thread1Thread1of1ForFork0_#t~post6#1] 2344#[L101-4, L59]don't care [651] L59-->L49-2: Formula: (let ((.cse1 (* v_~i~0_53 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_31))) (and (= (select (select |v_#memory_int_79| v_~A~0.base_31) .cse0) |v_thread1Thread1of1ForFork0_#t~mem1#1_21|) (< v_~i~0_53 v_~N~0_29) (<= 0 .cse0) (<= v_~last~0_14 |v_thread1Thread1of1ForFork0_#t~mem1#1_21|) (<= (+ .cse1 v_~A~0.offset_31 4) (select |v_#length_87| v_~A~0.base_31)) (= (select |v_#valid_102| v_~A~0.base_31) 1)))) InVars {~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, ~last~0=v_~last~0_14} OutVars{~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_21|, ~last~0=v_~last~0_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 2484#[L101-4, L49-2]don't care [2022-07-22 12:49:38,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:38,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1708565110, now seen corresponding path program 2 times [2022-07-22 12:49:38,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:38,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520852354] [2022-07-22 12:49:38,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:38,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:38,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:38,035 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:49:38,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:38,059 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:49:38,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:38,060 INFO L85 PathProgramCache]: Analyzing trace with hash 19539827, now seen corresponding path program 3 times [2022-07-22 12:49:38,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:38,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699968051] [2022-07-22 12:49:38,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:38,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:38,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:38,068 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:49:38,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:38,075 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:49:38,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:38,076 INFO L85 PathProgramCache]: Analyzing trace with hash -2065196932, now seen corresponding path program 2 times [2022-07-22 12:49:38,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:38,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025333062] [2022-07-22 12:49:38,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:38,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:38,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:38,129 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:49:38,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:38,182 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:49:41,163 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:49:41,163 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:49:41,163 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:49:41,163 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:49:41,163 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:49:41,164 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:41,164 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:49:41,164 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:49:41,164 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-inc-subseq.wvr.c_BEv2_Iteration8_Lasso [2022-07-22 12:49:41,164 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:49:41,164 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:49:41,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:41,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:41,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:41,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:41,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:41,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:41,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:41,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:41,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:41,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:41,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:41,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:41,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:41,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:41,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:41,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:41,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:41,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:41,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:42,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:42,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:42,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:42,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:42,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:42,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:42,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:42,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:42,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:42,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:42,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:42,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:42,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:42,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:42,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:42,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:42,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:42,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:42,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:43,819 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:49:43,822 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:49:43,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:43,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:43,823 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-22 12:49:43,825 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-22 12:49:43,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:43,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:43,832 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:43,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:43,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:43,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:43,833 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:43,833 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:43,841 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:43,862 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-22 12:49:43,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:43,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:43,863 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-22 12:49:43,866 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-22 12:49:43,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-22 12:49:43,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:43,874 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:43,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:43,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:43,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:43,874 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:43,875 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:43,875 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:43,896 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-22 12:49:43,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:43,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:43,898 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-22 12:49:43,898 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-22 12:49:43,899 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:43,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:43,905 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:43,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:43,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:43,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:43,906 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:43,906 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:43,907 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:43,929 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-22 12:49:43,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:43,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:43,930 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-22 12:49:43,931 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-22 12:49:43,932 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:43,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:43,938 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:43,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:43,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:43,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:43,940 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:43,940 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:43,942 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:43,963 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-22 12:49:43,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:43,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:43,964 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:43,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-07-22 12:49:43,967 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:43,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:43,975 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:43,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:43,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:43,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:43,975 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:43,975 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:43,986 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:44,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2022-07-22 12:49:44,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:44,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:44,008 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-22 12:49:44,009 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-22 12:49:44,009 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:44,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:44,016 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:44,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:44,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:44,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:44,016 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:44,016 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:44,017 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:44,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2022-07-22 12:49:44,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:44,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:44,043 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-22 12:49:44,044 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-22 12:49:44,045 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:44,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:44,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:44,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:44,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:44,053 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:44,053 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:44,056 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:44,077 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-22 12:49:44,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:44,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:44,078 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-22 12:49:44,079 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-22 12:49:44,080 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:44,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:44,088 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:44,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:44,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:44,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:44,088 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:44,089 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:44,108 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:44,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2022-07-22 12:49:44,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:44,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:44,133 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-22 12:49:44,134 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-22 12:49:44,135 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:44,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:44,142 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:44,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:44,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:44,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:44,142 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:44,143 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:44,144 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:44,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2022-07-22 12:49:44,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:44,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:44,165 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-22 12:49:44,166 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-22 12:49:44,168 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:44,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:44,176 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:44,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:44,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:44,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:44,177 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:44,177 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:44,190 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:44,211 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-22 12:49:44,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:44,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:44,212 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-22 12:49:44,215 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:44,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:44,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:44,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:44,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:44,225 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:44,225 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:44,228 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-22 12:49:44,230 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:44,252 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-22 12:49:44,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:44,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:44,253 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-22 12:49:44,254 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-22 12:49:44,254 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:44,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:44,261 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:44,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:44,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:44,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:44,262 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:44,262 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:44,263 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:44,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2022-07-22 12:49:44,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:44,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:44,287 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-22 12:49:44,288 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-22 12:49:44,288 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:44,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:44,295 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:44,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:44,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:44,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:44,296 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:44,296 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:44,297 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:44,320 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-22 12:49:44,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:44,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:44,321 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-22 12:49:44,324 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:44,331 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-22 12:49:44,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:44,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:44,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:44,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:44,334 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:44,334 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:44,338 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:44,361 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-22 12:49:44,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:44,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:44,362 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-22 12:49:44,363 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-22 12:49:44,363 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:44,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:44,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:44,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:44,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:44,372 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:44,372 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:44,374 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:44,396 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-22 12:49:44,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:44,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:44,397 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-22 12:49:44,398 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-22 12:49:44,399 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:44,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:44,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:44,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:44,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:44,407 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:44,407 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:44,410 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:44,432 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-22 12:49:44,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:44,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:44,433 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-22 12:49:44,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-22 12:49:44,435 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-22 12:49:44,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:44,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:44,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:44,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:44,443 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:44,443 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:44,445 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:44,468 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-22 12:49:44,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:44,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:44,469 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-22 12:49:44,470 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-22 12:49:44,470 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:44,477 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:44,478 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:49:44,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:44,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:44,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:44,478 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:49:44,478 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:49:44,479 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:44,501 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-22 12:49:44,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:44,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:44,502 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-22 12:49:44,503 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-22 12:49:44,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-22 12:49:44,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:44,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:44,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:44,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:44,512 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:44,512 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:44,515 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:44,537 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-22 12:49:44,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:44,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:44,538 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-22 12:49:44,539 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-22 12:49:44,539 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:44,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:44,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:44,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:44,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:44,549 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:44,549 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:44,557 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:44,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2022-07-22 12:49:44,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:44,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:44,580 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:44,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2022-07-22 12:49:44,581 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:44,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:44,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:44,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:44,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:44,590 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:44,590 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:44,594 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:44,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:44,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:44,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:44,617 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:44,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2022-07-22 12:49:44,618 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:44,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:44,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:44,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:44,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:44,627 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:44,627 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:44,639 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:44,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2022-07-22 12:49:44,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:44,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:44,662 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:44,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2022-07-22 12:49:44,663 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:44,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:44,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:44,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:44,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:44,673 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:44,673 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:44,678 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:44,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2022-07-22 12:49:44,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:44,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:44,701 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:44,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2022-07-22 12:49:44,702 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:44,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:44,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:44,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:44,710 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:44,711 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:44,711 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:44,714 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:44,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:44,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:44,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:44,737 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:44,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2022-07-22 12:49:44,739 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:44,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:44,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:44,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:44,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:44,747 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:44,747 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:44,750 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:44,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:44,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:44,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:44,772 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:44,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2022-07-22 12:49:44,774 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:44,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:44,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:44,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:44,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:44,782 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:44,782 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:44,784 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:44,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2022-07-22 12:49:44,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:44,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:44,808 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:44,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2022-07-22 12:49:44,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-22 12:49:44,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:44,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:44,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:44,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:44,821 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:44,821 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:44,844 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:44,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:44,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:44,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:44,879 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:44,882 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:44,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2022-07-22 12:49:44,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:44,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:44,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:44,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:44,892 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:44,892 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:44,906 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:44,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2022-07-22 12:49:44,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:44,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:44,939 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:44,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2022-07-22 12:49:44,941 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:44,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:44,949 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:44,949 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:44,949 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:44,950 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:44,950 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:44,953 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:44,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2022-07-22 12:49:44,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:44,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:44,976 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:44,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2022-07-22 12:49:44,978 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:44,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:44,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:44,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:44,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:44,986 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:44,986 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:45,000 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:45,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2022-07-22 12:49:45,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:45,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:45,022 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:45,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2022-07-22 12:49:45,024 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:45,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:45,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:45,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:45,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:45,032 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:45,032 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:45,035 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:45,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2022-07-22 12:49:45,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:45,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:45,058 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:45,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2022-07-22 12:49:45,059 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:45,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:45,067 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2022-07-22 12:49:45,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:45,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:45,075 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-07-22 12:49:45,075 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:45,101 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:45,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:45,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:45,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:45,126 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:45,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2022-07-22 12:49:45,127 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:45,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:45,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:45,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:45,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:45,135 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:45,135 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:45,139 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:45,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:45,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:45,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:45,164 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:45,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2022-07-22 12:49:45,165 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:45,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:45,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:45,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:45,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:45,172 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:45,172 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:45,176 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:45,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2022-07-22 12:49:45,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:45,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:45,199 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:45,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2022-07-22 12:49:45,200 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:45,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:45,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:45,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:45,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:45,208 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:45,208 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:45,211 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:45,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2022-07-22 12:49:45,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:45,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:45,235 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:45,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2022-07-22 12:49:45,235 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:45,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:45,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:45,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:45,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:45,244 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:45,244 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:45,248 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:49:45,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2022-07-22 12:49:45,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:45,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:45,271 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:45,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2022-07-22 12:49:45,272 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:49:45,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:49:45,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:49:45,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:49:45,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:49:45,294 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:49:45,294 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:49:45,320 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:49:45,378 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-07-22 12:49:45,378 INFO L444 ModelExtractionUtils]: 18 out of 52 variables were initially zero. Simplification set additionally 31 variables to zero. [2022-07-22 12:49:45,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:45,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:45,379 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:49:45,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2022-07-22 12:49:45,380 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:49:45,389 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:49:45,389 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:49:45,390 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~end~0, ~n~0) = -1*~end~0 + 1*~n~0 Supporting invariants [] [2022-07-22 12:49:45,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:45,692 INFO L257 tatePredicateManager]: 50 out of 50 supporting invariants were superfluous and have been removed [2022-07-22 12:49:45,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:45,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:49:45,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:49:45,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:49:45,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:49:45,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:49:45,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:49:45,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:49:45,797 INFO L142 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-22 12:49:45,797 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 122 states and 307 transitions. cyclomatic complexity: 211 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:49:45,903 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 122 states and 307 transitions. cyclomatic complexity: 211. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 218 states and 529 transitions. Complement of second has 3 states. [2022-07-22 12:49:45,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:49:45,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:49:45,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 18 transitions. [2022-07-22 12:49:45,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 18 transitions. Stem has 8 letters. Loop has 4 letters. [2022-07-22 12:49:45,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:49:45,909 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 12:49:45,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:45,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:49:45,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:49:45,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:49:45,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:49:45,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:49:45,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:49:46,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:49:46,018 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 12:49:46,019 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 122 states and 307 transitions. cyclomatic complexity: 211 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:49:46,103 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 122 states and 307 transitions. cyclomatic complexity: 211. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 341 states and 858 transitions. Complement of second has 5 states. [2022-07-22 12:49:46,104 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-22 12:49:46,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:49:46,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-07-22 12:49:46,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 8 letters. Loop has 4 letters. [2022-07-22 12:49:46,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:49:46,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 12 letters. Loop has 4 letters. [2022-07-22 12:49:46,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:49:46,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 8 letters. Loop has 8 letters. [2022-07-22 12:49:46,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:49:46,106 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 341 states and 858 transitions. [2022-07-22 12:49:46,111 INFO L131 ngComponentsAnalysis]: Automaton has 49 accepting balls. 133 [2022-07-22 12:49:46,115 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 341 states to 303 states and 762 transitions. [2022-07-22 12:49:46,116 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 216 [2022-07-22 12:49:46,117 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 250 [2022-07-22 12:49:46,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 303 states and 762 transitions. [2022-07-22 12:49:46,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:49:46,117 INFO L220 hiAutomatonCegarLoop]: Abstraction has 303 states and 762 transitions. [2022-07-22 12:49:46,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states and 762 transitions. [2022-07-22 12:49:46,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 217. [2022-07-22 12:49:46,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 217 states have (on average 2.640552995391705) internal successors, (573), 216 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:49:46,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 573 transitions. [2022-07-22 12:49:46,128 INFO L242 hiAutomatonCegarLoop]: Abstraction has 217 states and 573 transitions. [2022-07-22 12:49:46,129 INFO L425 stractBuchiCegarLoop]: Abstraction has 217 states and 573 transitions. [2022-07-22 12:49:46,129 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-22 12:49:46,129 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 217 states and 573 transitions. [2022-07-22 12:49:46,131 INFO L131 ngComponentsAnalysis]: Automaton has 35 accepting balls. 105 [2022-07-22 12:49:46,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:49:46,131 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:49:46,132 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:49:46,132 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:49:46,133 INFO L748 eck$LassoCheckResult]: Stem: 3705#[ULTIMATE.startENTRY]don't care [741] ULTIMATE.startENTRY-->L117-6: Formula: (let ((.cse1 (store |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 1))) (let ((.cse0 (select |v_#memory_int_137| 1)) (.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53| 1))) (and (= v_~A~0.base_61 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|) (= v_~i~0_63 0) (= |v_#NULL.base_14| 0) (= v_~v_old~0_40 0) (= (select |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) 0) (= v_~A~0.offset_61 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 0)) (= 48 (select .cse0 0)) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) (= v_~n~0_64 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|) (= (select |v_#valid_234| 2) 1) (= |v_#NULL.offset_14| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_43| 0) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t2~0#1.base_53|) (= v_~new~0_37 0) (= (select |v_#valid_234| 1) 1) (= (select |v_#valid_234| 0) 0) (= (select |v_#length_197| 2) 29) (= 0 v_~queue~0.offset_55) (= (select .cse0 1) 0) (= 2 (select |v_#length_197| 1)) (< 0 |v_#StackHeapBarrier_52|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4294967296) 1073741823) 1 0)) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) (= v_~ok~0_46 1) (= v_~end~0_88 v_~start~0_68) (= (store (store (store |v_#length_197| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_53| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4)) |v_#length_195|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| |v_#StackHeapBarrier_52|) (= |v_#valid_232| (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 1)) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= v_~last~0_42 0) (= v_~queue~0.base_55 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99| 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_52|, #valid=|v_#valid_234|, #memory_int=|v_#memory_int_137|, #length=|v_#length_197|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99|, ~A~0.base=v_~A~0.base_61, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_43|, #NULL.offset=|v_#NULL.offset_14|, #length=|v_#length_195|, ~v_old~0=v_~v_old~0_40, ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_47|, ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_37|, ~new~0=v_~new~0_37, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|, ~ok~0=v_~ok~0_46, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_37|, ~i~0=v_~i~0_63, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_81|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_123|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_24|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_57|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_19|, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ~end~0=v_~end~0_88, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_51|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_33|, ~start~0=v_~start~0_68, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_57|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_47|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_33|, ~queue~0.offset=v_~queue~0.offset_55, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_81|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~N~0=v_~N~0_63, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ~queue~0.base=v_~queue~0.base_55, #NULL.base=|v_#NULL.base_14|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_34|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_30|, ~A~0.offset=v_~A~0.offset_61, #valid=|v_#valid_232|, #memory_int=|v_#memory_int_137|, ~n~0=v_~n~0_64, ~last~0=v_~last~0_42, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_53|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, #length, ~v_old~0, ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_main_#t~ret13#1.base, ~new~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~ok~0, ULTIMATE.start_main_#t~ret13#1.offset, ~i~0, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet16#1, ~end~0, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base, ~start~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, ~queue~0.offset, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, #NULL.base, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet11#1, ~A~0.offset, #valid, ~n~0, ~last~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 3659#[L117-6]don't care [703] L117-6-->L117-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57| .cse1))) (and (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57| .cse1 4) (select |v_#length_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| |v_ULTIMATE.start_create_fresh_int_array_~size#1_83|) (= (select |v_#valid_168| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|) 1) (= |v_#memory_int_113| (store |v_#memory_int_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57| (store (select |v_#memory_int_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_36|))) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_73| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| 1))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|, #valid=|v_#valid_168|, #memory_int=|v_#memory_int_114|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_83|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|, #valid=|v_#valid_168|, #memory_int=|v_#memory_int_113|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_73|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_83|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 3661#[L117-6]don't care [738] L117-6-->L117-14: Formula: (and (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114| |v_ULTIMATE.start_create_fresh_int_array_~size#1_120|)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96| v_~queue~0.base_53) (= (store |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 1) |v_#valid_228|) (= (store |v_#length_192| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4)) |v_#length_191|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95| 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| v_~N~0_61) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96| v_~queue~0.offset_53) (= (select |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| |v_#StackHeapBarrier_50|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96|, #valid=|v_#valid_229|, #length=|v_#length_192|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_120|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_45|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95|, ~queue~0.offset=v_~queue~0.offset_53, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_77|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_77|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_55|, ~queue~0.base=v_~queue~0.base_53, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_119|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_55|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|, #valid=|v_#valid_228|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_31|, #length=|v_#length_191|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_49|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_main_#t~ret12#1.offset, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base] 3611#[L117-14]don't care [695] L117-14-->L117-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_73|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51| 4) (select |v_#length_131| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|)) (= (store |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51| (store (select |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|)) |v_#memory_int_109|) (= (select |v_#valid_158| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_110|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_109|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 3613#[L117-14]don't care [740] L117-14-->L101-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (<= 0 v_~A~0.offset_Out_2) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre15#1_Out_2|)) |v_#memory_int_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (< 0 v_~N~0_In_3) 1 0)) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ 4 v_~A~0.offset_Out_2) (select |v_#length_In_7| v_~A~0.base_Out_2)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| v_~A~0.base_Out_2) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= (select |v_#valid_In_7| v_~A~0.base_Out_2) 1) (= (select (select |v_#memory_int_In_1| v_~A~0.base_Out_2) v_~A~0.offset_Out_2) v_~v_old~0_Out_2) (= v_~v_old~0_Out_2 v_~last~0_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre15#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| v_~A~0.offset_Out_2) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, #pthreadsForks=|v_#pthreadsForks_In_1|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, #length=|v_#length_In_7|, ~N~0=v_~N~0_In_3, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|} OutVars{ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_Out_2|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_Out_2|, ~N~0=v_~N~0_In_3, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_Out_2|, ~A~0.offset=v_~A~0.offset_Out_2, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_7|, ~v_old~0=v_~v_old~0_Out_2, ~last~0=v_~last~0_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret13#1.base, ~A~0.base, ULTIMATE.start_main_#t~ret13#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~mem14#1, ~A~0.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~v_old~0, ~last~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 3433#[L101-3]don't care [542] L101-3-->L59: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre15#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_4|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_12|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 3435#[L101-4, L59]don't care [694] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_106| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_106| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre17#1_19|)) |v_#memory_int_105|) (= |v_ULTIMATE.start_main_#t~pre17#1_19| |v_#pthreadsForks_24|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_29| 4) (select |v_#length_129| |v_ULTIMATE.start_main_~#t2~0#1.base_35|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_29|) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (select |v_#valid_156| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) 1)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_106|, #length=|v_#length_129|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_11|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_105|, #length=|v_#length_129|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_19|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_19|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] 3765#[L59, L102-3]don't care [545] L102-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre17#1_6|)) InVars {ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_4|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_10|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 3835#[L59, L102-4, thread2ENTRY]don't care [530] thread2ENTRY-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] 3841#[L59, L102-4, L79]don't care [2022-07-22 12:49:46,133 INFO L750 eck$LassoCheckResult]: Loop: 3841#[L59, L102-4, L79]don't care [646] L79-->L76: Formula: (let ((.cse0 (* v_~start~0_47 4))) (let ((.cse1 (+ .cse0 v_~queue~0.offset_35))) (and (<= (+ .cse0 4 v_~queue~0.offset_35) (select |v_#length_83| v_~queue~0.base_35)) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_15| 256) 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_17 256) 0)) (<= v_~v_old~0_16 v_~new~0_27)) 1 0) 0) 0 1) v_~ok~0_16) (<= 0 .cse1) (= (ite (and (< v_~start~0_47 v_~end~0_68) (<= 0 v_~start~0_47) (< v_~start~0_47 v_~n~0_36)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_7| 0)) (= (select |v_#valid_98| v_~queue~0.base_35) 1) (= v_~start~0_46 (+ v_~start~0_47 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|) (= v_~new~0_27 (select (select |v_#memory_int_75| v_~queue~0.base_35) .cse1))))) InVars {~start~0=v_~start~0_47, ~queue~0.offset=v_~queue~0.offset_35, ~ok~0=v_~ok~0_17, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_15|, #valid=|v_#valid_98|, #memory_int=|v_#memory_int_75|, #length=|v_#length_83|, ~end~0=v_~end~0_68, ~v_old~0=v_~v_old~0_16, ~queue~0.base=v_~queue~0.base_35, ~n~0=v_~n~0_36} OutVars{~new~0=v_~new~0_27, ~start~0=v_~start~0_46, ~queue~0.offset=v_~queue~0.offset_35, ~ok~0=v_~ok~0_16, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7|, ~queue~0.base=v_~queue~0.base_35, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_7|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_15|, #valid=|v_#valid_98|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_7|, #memory_int=|v_#memory_int_75|, #length=|v_#length_83|, ~end~0=v_~end~0_68, ~v_old~0=v_~v_old~0_16, ~n~0=v_~n~0_36} AuxVars[] AssignedVars[~new~0, ~start~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1] 3845#[L76, L59, L102-4]don't care [570] L76-->L79: Formula: (and (= v_~new~0_19 v_~v_old~0_6) (= |v_thread2Thread1of1ForFork1_~cond~0#1_11| (ite (= (ite (or (< v_~i~0_37 v_~N~0_11) (< v_~start~0_36 v_~end~0_60)) 1 0) 0) 0 1))) InVars {~start~0=v_~start~0_36, ~new~0=v_~new~0_19, ~i~0=v_~i~0_37, ~end~0=v_~end~0_60, ~N~0=v_~N~0_11} OutVars{~start~0=v_~start~0_36, ~new~0=v_~new~0_19, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_11|, ~i~0=v_~i~0_37, ~end~0=v_~end~0_60, ~N~0=v_~N~0_11, ~v_old~0=v_~v_old~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1, ~v_old~0] 3841#[L59, L102-4, L79]don't care [2022-07-22 12:49:46,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:46,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1390107715, now seen corresponding path program 1 times [2022-07-22 12:49:46,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:46,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476572845] [2022-07-22 12:49:46,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:46,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:46,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:46,167 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:49:46,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:46,192 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:49:46,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:46,192 INFO L85 PathProgramCache]: Analyzing trace with hash 21557, now seen corresponding path program 1 times [2022-07-22 12:49:46,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:46,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624626885] [2022-07-22 12:49:46,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:46,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:46,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:46,201 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:49:46,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:46,210 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:49:46,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:46,211 INFO L85 PathProgramCache]: Analyzing trace with hash -158664463, now seen corresponding path program 1 times [2022-07-22 12:49:46,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:46,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164033971] [2022-07-22 12:49:46,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:46,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:49:46,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 12:49:46,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:49:46,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164033971] [2022-07-22 12:49:46,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164033971] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:49:46,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:49:46,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 12:49:46,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579251294] [2022-07-22 12:49:46,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:49:46,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:49:46,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 12:49:46,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 12:49:46,536 INFO L87 Difference]: Start difference. First operand 217 states and 573 transitions. cyclomatic complexity: 401 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:49:46,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:49:46,593 INFO L93 Difference]: Finished difference Result 226 states and 566 transitions. [2022-07-22 12:49:46,593 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 226 states and 566 transitions. [2022-07-22 12:49:46,597 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 93 [2022-07-22 12:49:46,600 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 226 states to 216 states and 542 transitions. [2022-07-22 12:49:46,601 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 163 [2022-07-22 12:49:46,601 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 163 [2022-07-22 12:49:46,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 216 states and 542 transitions. [2022-07-22 12:49:46,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:49:46,601 INFO L220 hiAutomatonCegarLoop]: Abstraction has 216 states and 542 transitions. [2022-07-22 12:49:46,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states and 542 transitions. [2022-07-22 12:49:46,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 214. [2022-07-22 12:49:46,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 214 states have (on average 2.5186915887850465) internal successors, (539), 213 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:49:46,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 539 transitions. [2022-07-22 12:49:46,610 INFO L242 hiAutomatonCegarLoop]: Abstraction has 214 states and 539 transitions. [2022-07-22 12:49:46,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 12:49:46,611 INFO L425 stractBuchiCegarLoop]: Abstraction has 214 states and 539 transitions. [2022-07-22 12:49:46,612 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-22 12:49:46,612 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 214 states and 539 transitions. [2022-07-22 12:49:46,614 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 93 [2022-07-22 12:49:46,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:49:46,614 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:49:46,615 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:49:46,615 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-22 12:49:46,616 INFO L748 eck$LassoCheckResult]: Stem: 4373#[ULTIMATE.startENTRY]don't care [741] ULTIMATE.startENTRY-->L117-6: Formula: (let ((.cse1 (store |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 1))) (let ((.cse0 (select |v_#memory_int_137| 1)) (.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53| 1))) (and (= v_~A~0.base_61 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|) (= v_~i~0_63 0) (= |v_#NULL.base_14| 0) (= v_~v_old~0_40 0) (= (select |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) 0) (= v_~A~0.offset_61 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 0)) (= 48 (select .cse0 0)) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) (= v_~n~0_64 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|) (= (select |v_#valid_234| 2) 1) (= |v_#NULL.offset_14| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_43| 0) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t2~0#1.base_53|) (= v_~new~0_37 0) (= (select |v_#valid_234| 1) 1) (= (select |v_#valid_234| 0) 0) (= (select |v_#length_197| 2) 29) (= 0 v_~queue~0.offset_55) (= (select .cse0 1) 0) (= 2 (select |v_#length_197| 1)) (< 0 |v_#StackHeapBarrier_52|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4294967296) 1073741823) 1 0)) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) (= v_~ok~0_46 1) (= v_~end~0_88 v_~start~0_68) (= (store (store (store |v_#length_197| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_53| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4)) |v_#length_195|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| |v_#StackHeapBarrier_52|) (= |v_#valid_232| (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 1)) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= v_~last~0_42 0) (= v_~queue~0.base_55 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99| 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_52|, #valid=|v_#valid_234|, #memory_int=|v_#memory_int_137|, #length=|v_#length_197|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99|, ~A~0.base=v_~A~0.base_61, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_43|, #NULL.offset=|v_#NULL.offset_14|, #length=|v_#length_195|, ~v_old~0=v_~v_old~0_40, ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_47|, ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_37|, ~new~0=v_~new~0_37, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|, ~ok~0=v_~ok~0_46, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_37|, ~i~0=v_~i~0_63, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_81|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_123|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_24|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_57|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_19|, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ~end~0=v_~end~0_88, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_51|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_33|, ~start~0=v_~start~0_68, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_57|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_47|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_33|, ~queue~0.offset=v_~queue~0.offset_55, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_81|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~N~0=v_~N~0_63, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ~queue~0.base=v_~queue~0.base_55, #NULL.base=|v_#NULL.base_14|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_34|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_30|, ~A~0.offset=v_~A~0.offset_61, #valid=|v_#valid_232|, #memory_int=|v_#memory_int_137|, ~n~0=v_~n~0_64, ~last~0=v_~last~0_42, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_53|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, #length, ~v_old~0, ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_main_#t~ret13#1.base, ~new~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~ok~0, ULTIMATE.start_main_#t~ret13#1.offset, ~i~0, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet16#1, ~end~0, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base, ~start~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, ~queue~0.offset, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, #NULL.base, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet11#1, ~A~0.offset, #valid, ~n~0, ~last~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 4327#[L117-6]don't care [703] L117-6-->L117-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57| .cse1))) (and (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57| .cse1 4) (select |v_#length_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| |v_ULTIMATE.start_create_fresh_int_array_~size#1_83|) (= (select |v_#valid_168| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|) 1) (= |v_#memory_int_113| (store |v_#memory_int_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57| (store (select |v_#memory_int_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_36|))) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_73| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| 1))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|, #valid=|v_#valid_168|, #memory_int=|v_#memory_int_114|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_83|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|, #valid=|v_#valid_168|, #memory_int=|v_#memory_int_113|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_73|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_83|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 4329#[L117-6]don't care [738] L117-6-->L117-14: Formula: (and (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114| |v_ULTIMATE.start_create_fresh_int_array_~size#1_120|)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96| v_~queue~0.base_53) (= (store |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 1) |v_#valid_228|) (= (store |v_#length_192| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4)) |v_#length_191|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95| 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| v_~N~0_61) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96| v_~queue~0.offset_53) (= (select |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| |v_#StackHeapBarrier_50|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96|, #valid=|v_#valid_229|, #length=|v_#length_192|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_120|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_45|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95|, ~queue~0.offset=v_~queue~0.offset_53, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_77|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_77|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_55|, ~queue~0.base=v_~queue~0.base_53, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_119|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_55|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|, #valid=|v_#valid_228|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_31|, #length=|v_#length_191|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_49|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_main_#t~ret12#1.offset, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base] 4281#[L117-14]don't care [695] L117-14-->L117-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_73|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51| 4) (select |v_#length_131| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|)) (= (store |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51| (store (select |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|)) |v_#memory_int_109|) (= (select |v_#valid_158| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_110|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_109|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 4283#[L117-14]don't care [695] L117-14-->L117-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_73|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51| 4) (select |v_#length_131| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|)) (= (store |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51| (store (select |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|)) |v_#memory_int_109|) (= (select |v_#valid_158| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_110|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_109|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 4285#[L117-14]don't care [740] L117-14-->L101-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (<= 0 v_~A~0.offset_Out_2) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre15#1_Out_2|)) |v_#memory_int_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (< 0 v_~N~0_In_3) 1 0)) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ 4 v_~A~0.offset_Out_2) (select |v_#length_In_7| v_~A~0.base_Out_2)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| v_~A~0.base_Out_2) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= (select |v_#valid_In_7| v_~A~0.base_Out_2) 1) (= (select (select |v_#memory_int_In_1| v_~A~0.base_Out_2) v_~A~0.offset_Out_2) v_~v_old~0_Out_2) (= v_~v_old~0_Out_2 v_~last~0_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre15#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| v_~A~0.offset_Out_2) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, #pthreadsForks=|v_#pthreadsForks_In_1|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, #length=|v_#length_In_7|, ~N~0=v_~N~0_In_3, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|} OutVars{ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_Out_2|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_Out_2|, ~N~0=v_~N~0_In_3, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_Out_2|, ~A~0.offset=v_~A~0.offset_Out_2, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_7|, ~v_old~0=v_~v_old~0_Out_2, ~last~0=v_~last~0_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret13#1.base, ~A~0.base, ULTIMATE.start_main_#t~ret13#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~mem14#1, ~A~0.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~v_old~0, ~last~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 4397#[L101-3]don't care [542] L101-3-->L59: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre15#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_4|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_12|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 4393#[L101-4, L59]don't care [651] L59-->L49-2: Formula: (let ((.cse1 (* v_~i~0_53 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_31))) (and (= (select (select |v_#memory_int_79| v_~A~0.base_31) .cse0) |v_thread1Thread1of1ForFork0_#t~mem1#1_21|) (< v_~i~0_53 v_~N~0_29) (<= 0 .cse0) (<= v_~last~0_14 |v_thread1Thread1of1ForFork0_#t~mem1#1_21|) (<= (+ .cse1 v_~A~0.offset_31 4) (select |v_#length_87| v_~A~0.base_31)) (= (select |v_#valid_102| v_~A~0.base_31) 1)))) InVars {~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, ~last~0=v_~last~0_14} OutVars{~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_21|, ~last~0=v_~last~0_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 4389#[L101-4, L49-2]don't care [694] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_106| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_106| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre17#1_19|)) |v_#memory_int_105|) (= |v_ULTIMATE.start_main_#t~pre17#1_19| |v_#pthreadsForks_24|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_29| 4) (select |v_#length_129| |v_ULTIMATE.start_main_~#t2~0#1.base_35|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_29|) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (select |v_#valid_156| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) 1)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_106|, #length=|v_#length_129|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_11|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_105|, #length=|v_#length_129|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_19|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_19|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] 4391#[L102-3, L49-2]don't care [606] L49-2-->L54: Formula: (let ((.cse2 (* v_~i~0_45 4)) (.cse3 (* v_~end~0_65 4))) (let ((.cse0 (+ .cse3 v_~queue~0.offset_33)) (.cse1 (+ v_~A~0.offset_25 .cse2))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| (ite (= (select (select |v_#memory_int_59| v_~queue~0.base_33) .cse0) (select (select |v_#memory_int_59| v_~A~0.base_25) .cse1)) 1 0)) (<= (+ v_~A~0.offset_25 4 .cse2) (select |v_#length_71| v_~A~0.base_25)) (= (select |v_#valid_86| v_~queue~0.base_33) 1) (<= 0 .cse0) (<= (+ .cse3 4 v_~queue~0.offset_33) (select |v_#length_71| v_~queue~0.base_33)) (= v_~end~0_64 (+ v_~end~0_65 1)) (<= 0 .cse1) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (not (= (ite (and (< v_~end~0_65 v_~n~0_32) (<= 0 v_~end~0_65)) 1 0) 0)) (= (select |v_#valid_86| v_~A~0.base_25) 1)))) InVars {~A~0.base=v_~A~0.base_25, ~queue~0.offset=v_~queue~0.offset_33, ~A~0.offset=v_~A~0.offset_25, ~i~0=v_~i~0_45, #valid=|v_#valid_86|, #memory_int=|v_#memory_int_59|, ~end~0=v_~end~0_65, #length=|v_#length_71|, ~queue~0.base=v_~queue~0.base_33, ~n~0=v_~n~0_32} OutVars{~A~0.base=v_~A~0.base_25, ~queue~0.offset=v_~queue~0.offset_33, ~i~0=v_~i~0_45, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_5|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~queue~0.base=v_~queue~0.base_33, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~A~0.offset=v_~A~0.offset_25, #valid=|v_#valid_86|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_59|, ~end~0=v_~end~0_64, #length=|v_#length_71|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_5|, ~n~0=v_~n~0_32, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_19|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1] 4457#[L54, L102-3]don't care [2022-07-22 12:49:46,617 INFO L750 eck$LassoCheckResult]: Loop: 4457#[L54, L102-3]don't care [567] L54-->L55-1: Formula: (let ((.cse0 (* v_~i~0_35 4))) (let ((.cse1 (+ .cse0 v_~A~0.offset_17))) (and (<= (+ .cse0 v_~A~0.offset_17 4) (select |v_#length_49| v_~A~0.base_17)) (<= 0 .cse1) (= v_~last~0_6 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= (select |v_#valid_56| v_~A~0.base_17) 1) (= (select (select |v_#memory_int_47| v_~A~0.base_17) .cse1) |v_thread1Thread1of1ForFork0_#t~mem5#1_11|)))) InVars {~A~0.base=v_~A~0.base_17, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_35, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_47|, #length=|v_#length_49|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_17, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_35, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_47|, #length=|v_#length_49|, ~last~0=v_~last~0_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] 4485#[L55-1, L102-3]don't care [562] L55-1-->L59: Formula: (= (+ v_~i~0_28 1) v_~i~0_27) InVars {~i~0=v_~i~0_28} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_9|, ~i~0=v_~i~0_27, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~i~0, thread1Thread1of1ForFork0_#t~post6#1] 4479#[L59, L102-3]don't care [651] L59-->L49-2: Formula: (let ((.cse1 (* v_~i~0_53 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_31))) (and (= (select (select |v_#memory_int_79| v_~A~0.base_31) .cse0) |v_thread1Thread1of1ForFork0_#t~mem1#1_21|) (< v_~i~0_53 v_~N~0_29) (<= 0 .cse0) (<= v_~last~0_14 |v_thread1Thread1of1ForFork0_#t~mem1#1_21|) (<= (+ .cse1 v_~A~0.offset_31 4) (select |v_#length_87| v_~A~0.base_31)) (= (select |v_#valid_102| v_~A~0.base_31) 1)))) InVars {~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, ~last~0=v_~last~0_14} OutVars{~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_21|, ~last~0=v_~last~0_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 4361#[L102-3, L49-2]don't care [606] L49-2-->L54: Formula: (let ((.cse2 (* v_~i~0_45 4)) (.cse3 (* v_~end~0_65 4))) (let ((.cse0 (+ .cse3 v_~queue~0.offset_33)) (.cse1 (+ v_~A~0.offset_25 .cse2))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| (ite (= (select (select |v_#memory_int_59| v_~queue~0.base_33) .cse0) (select (select |v_#memory_int_59| v_~A~0.base_25) .cse1)) 1 0)) (<= (+ v_~A~0.offset_25 4 .cse2) (select |v_#length_71| v_~A~0.base_25)) (= (select |v_#valid_86| v_~queue~0.base_33) 1) (<= 0 .cse0) (<= (+ .cse3 4 v_~queue~0.offset_33) (select |v_#length_71| v_~queue~0.base_33)) (= v_~end~0_64 (+ v_~end~0_65 1)) (<= 0 .cse1) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (not (= (ite (and (< v_~end~0_65 v_~n~0_32) (<= 0 v_~end~0_65)) 1 0) 0)) (= (select |v_#valid_86| v_~A~0.base_25) 1)))) InVars {~A~0.base=v_~A~0.base_25, ~queue~0.offset=v_~queue~0.offset_33, ~A~0.offset=v_~A~0.offset_25, ~i~0=v_~i~0_45, #valid=|v_#valid_86|, #memory_int=|v_#memory_int_59|, ~end~0=v_~end~0_65, #length=|v_#length_71|, ~queue~0.base=v_~queue~0.base_33, ~n~0=v_~n~0_32} OutVars{~A~0.base=v_~A~0.base_25, ~queue~0.offset=v_~queue~0.offset_33, ~i~0=v_~i~0_45, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_5|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~queue~0.base=v_~queue~0.base_33, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~A~0.offset=v_~A~0.offset_25, #valid=|v_#valid_86|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_59|, ~end~0=v_~end~0_64, #length=|v_#length_71|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_5|, ~n~0=v_~n~0_32, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_19|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1] 4457#[L54, L102-3]don't care [2022-07-22 12:49:46,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:46,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1253541518, now seen corresponding path program 1 times [2022-07-22 12:49:46,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:46,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778444684] [2022-07-22 12:49:46,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:46,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:46,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:46,651 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:49:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:46,699 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:49:46,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:46,700 INFO L85 PathProgramCache]: Analyzing trace with hash 18375887, now seen corresponding path program 4 times [2022-07-22 12:49:46,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:46,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707176237] [2022-07-22 12:49:46,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:46,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:46,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:46,709 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:49:46,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:46,716 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:49:46,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:46,717 INFO L85 PathProgramCache]: Analyzing trace with hash -2118861376, now seen corresponding path program 1 times [2022-07-22 12:49:46,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:46,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097871047] [2022-07-22 12:49:46,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:46,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:46,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:49:46,783 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 12:49:46,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:49:46,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097871047] [2022-07-22 12:49:46,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097871047] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 12:49:46,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701717897] [2022-07-22 12:49:46,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:46,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 12:49:46,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:49:46,785 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 12:49:46,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Waiting until timeout for monitored process [2022-07-22 12:49:46,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:49:46,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 12:49:46,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:49:46,944 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 12:49:46,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 12:49:47,004 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 12:49:47,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701717897] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 12:49:47,004 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 12:49:47,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-07-22 12:49:47,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156638091] [2022-07-22 12:49:47,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 12:49:47,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:49:47,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-22 12:49:47,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-07-22 12:49:47,188 INFO L87 Difference]: Start difference. First operand 214 states and 539 transitions. cyclomatic complexity: 364 Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:49:47,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:49:47,336 INFO L93 Difference]: Finished difference Result 428 states and 1050 transitions. [2022-07-22 12:49:47,336 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 428 states and 1050 transitions. [2022-07-22 12:49:47,342 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 171 [2022-07-22 12:49:47,350 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 428 states to 416 states and 1018 transitions. [2022-07-22 12:49:47,350 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 320 [2022-07-22 12:49:47,351 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 328 [2022-07-22 12:49:47,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 416 states and 1018 transitions. [2022-07-22 12:49:47,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:49:47,351 INFO L220 hiAutomatonCegarLoop]: Abstraction has 416 states and 1018 transitions. [2022-07-22 12:49:47,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states and 1018 transitions. [2022-07-22 12:49:47,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 308. [2022-07-22 12:49:47,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 308 states have (on average 2.5454545454545454) internal successors, (784), 307 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:49:47,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 784 transitions. [2022-07-22 12:49:47,363 INFO L242 hiAutomatonCegarLoop]: Abstraction has 308 states and 784 transitions. [2022-07-22 12:49:47,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 12:49:47,367 INFO L425 stractBuchiCegarLoop]: Abstraction has 308 states and 784 transitions. [2022-07-22 12:49:47,367 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-22 12:49:47,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 308 states and 784 transitions. [2022-07-22 12:49:47,371 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 119 [2022-07-22 12:49:47,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:49:47,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:49:47,372 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:49:47,372 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:49:47,375 INFO L748 eck$LassoCheckResult]: Stem: 5368#[ULTIMATE.startENTRY]don't care [741] ULTIMATE.startENTRY-->L117-6: Formula: (let ((.cse1 (store |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 1))) (let ((.cse0 (select |v_#memory_int_137| 1)) (.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53| 1))) (and (= v_~A~0.base_61 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|) (= v_~i~0_63 0) (= |v_#NULL.base_14| 0) (= v_~v_old~0_40 0) (= (select |v_#valid_234| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) 0) (= v_~A~0.offset_61 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 0)) (= 48 (select .cse0 0)) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_53|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) (= v_~n~0_64 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|) (= (select |v_#valid_234| 2) 1) (= |v_#NULL.offset_14| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_43| 0) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t2~0#1.base_53|) (= v_~new~0_37 0) (= (select |v_#valid_234| 1) 1) (= (select |v_#valid_234| 0) 0) (= (select |v_#length_197| 2) 29) (= 0 v_~queue~0.offset_55) (= (select .cse0 1) 0) (= 2 (select |v_#length_197| 1)) (< 0 |v_#StackHeapBarrier_52|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4294967296) 1073741823) 1 0)) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) (= v_~ok~0_46 1) (= v_~end~0_88 v_~start~0_68) (= (store (store (store |v_#length_197| |v_ULTIMATE.start_main_~#t1~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_53| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_123| 4)) |v_#length_195|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_123|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_173| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| |v_#StackHeapBarrier_52|) (= |v_#valid_232| (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99| 1)) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= v_~last~0_42 0) (= v_~queue~0.base_55 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99| 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_52|, #valid=|v_#valid_234|, #memory_int=|v_#memory_int_137|, #length=|v_#length_197|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_99|, ~A~0.base=v_~A~0.base_61, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_43|, #NULL.offset=|v_#NULL.offset_14|, #length=|v_#length_195|, ~v_old~0=v_~v_old~0_40, ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_47|, ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_37|, ~new~0=v_~new~0_37, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_99|, ~ok~0=v_~ok~0_46, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_37|, ~i~0=v_~i~0_63, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_81|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_123|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_24|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_57|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_19|, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ~end~0=v_~end~0_88, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_51|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_33|, ~start~0=v_~start~0_68, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_117|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_57|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_47|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_35|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_173|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_33|, ~queue~0.offset=v_~queue~0.offset_55, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_81|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~N~0=v_~N~0_63, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ~queue~0.base=v_~queue~0.base_55, #NULL.base=|v_#NULL.base_14|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_34|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_30|, ~A~0.offset=v_~A~0.offset_61, #valid=|v_#valid_232|, #memory_int=|v_#memory_int_137|, ~n~0=v_~n~0_64, ~last~0=v_~last~0_42, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_53|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_137|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, #length, ~v_old~0, ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_main_#t~ret13#1.base, ~new~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~ok~0, ULTIMATE.start_main_#t~ret13#1.offset, ~i~0, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet16#1, ~end~0, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base, ~start~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, ~queue~0.offset, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, #NULL.base, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet11#1, ~A~0.offset, #valid, ~n~0, ~last~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 5300#[L117-6]don't care [703] L117-6-->L117-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57| .cse1))) (and (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57| .cse1 4) (select |v_#length_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| |v_ULTIMATE.start_create_fresh_int_array_~size#1_83|) (= (select |v_#valid_168| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|) 1) (= |v_#memory_int_113| (store |v_#memory_int_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57| (store (select |v_#memory_int_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_36|))) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_73| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74| 1))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|, #valid=|v_#valid_168|, #memory_int=|v_#memory_int_114|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_74|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_83|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_57|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_57|, #valid=|v_#valid_168|, #memory_int=|v_#memory_int_113|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_73|, #length=|v_#length_141|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_83|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 5302#[L117-6]don't care [738] L117-6-->L117-14: Formula: (and (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) 1 0) 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_119|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114| |v_ULTIMATE.start_create_fresh_int_array_~size#1_120|)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96| v_~queue~0.base_53) (= (store |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 1) |v_#valid_228|) (= (store |v_#length_192| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4)) |v_#length_191|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95| 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_119| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33| v_~N~0_61) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96| v_~queue~0.offset_53) (= (select |v_#valid_229| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| |v_#StackHeapBarrier_50|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_96|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_96|, #valid=|v_#valid_229|, #length=|v_#length_192|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_114|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_120|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_45|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_95|, ~queue~0.offset=v_~queue~0.offset_53, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_95|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_77|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_113|, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset_77|, ~N~0=v_~N~0_61, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_55|, ~queue~0.base=v_~queue~0.base_53, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_119|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_55|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_33|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_169|, #valid=|v_#valid_228|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_31|, #length=|v_#length_191|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_49|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, ULTIMATE.start_main_#t~ret12#1.offset, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1, ULTIMATE.start_main_#t~ret12#1.base] 5248#[L117-14]don't care [695] L117-14-->L117-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_73|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66| 1)) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51| 4) (select |v_#length_131| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|)) (= (store |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51| (store (select |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|)) |v_#memory_int_109|) (= (select |v_#valid_158| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_110|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_66|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet23#1_32|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post22#1_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_51|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_51|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_109|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_65|, #length=|v_#length_131|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post22#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet23#1] 5250#[L117-14]don't care [740] L117-14-->L101-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (<= 0 v_~A~0.offset_Out_2) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22| 0)) (= (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre15#1_Out_2|)) |v_#memory_int_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (< 0 v_~N~0_In_3) 1 0)) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ 4 v_~A~0.offset_Out_2) (select |v_#length_In_7| v_~A~0.base_Out_2)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14| v_~A~0.base_Out_2) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= (select |v_#valid_In_7| v_~A~0.base_Out_2) 1) (= (select (select |v_#memory_int_In_1| v_~A~0.base_Out_2) v_~A~0.offset_Out_2) v_~v_old~0_Out_2) (= v_~v_old~0_Out_2 v_~last~0_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre15#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14| v_~A~0.offset_Out_2) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, #pthreadsForks=|v_#pthreadsForks_In_1|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, #length=|v_#length_In_7|, ~N~0=v_~N~0_In_3, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|} OutVars{ULTIMATE.start_main_#t~ret13#1.base=|v_ULTIMATE.start_main_#t~ret13#1.base_Out_2|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, ULTIMATE.start_main_#t~ret13#1.offset=|v_ULTIMATE.start_main_#t~ret13#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_5|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_Out_2|, ~N~0=v_~N~0_In_3, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_11|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_Out_2|, ~A~0.offset=v_~A~0.offset_Out_2, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_22|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_7|, ~v_old~0=v_~v_old~0_Out_2, ~last~0=v_~last~0_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret13#1.base, ~A~0.base, ULTIMATE.start_main_#t~ret13#1.offset, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~mem14#1, ~A~0.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~v_old~0, ~last~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 5052#[L101-3]don't care [542] L101-3-->L59: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre15#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_4|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_12|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 5054#[L101-4, L59]don't care [694] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_106| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_106| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre17#1_19|)) |v_#memory_int_105|) (= |v_ULTIMATE.start_main_#t~pre17#1_19| |v_#pthreadsForks_24|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_29| 4) (select |v_#length_129| |v_ULTIMATE.start_main_~#t2~0#1.base_35|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_29|) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (select |v_#valid_156| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) 1)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_106|, #length=|v_#length_129|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_11|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_105|, #length=|v_#length_129|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_19|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_19|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] 5156#[L59, L102-3]don't care [545] L102-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre17#1_6|)) InVars {ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_4|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_10|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 5158#[L59, L102-4, thread2ENTRY]don't care [530] thread2ENTRY-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] 5242#[L59, L102-4, L79]don't care [651] L59-->L49-2: Formula: (let ((.cse1 (* v_~i~0_53 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_31))) (and (= (select (select |v_#memory_int_79| v_~A~0.base_31) .cse0) |v_thread1Thread1of1ForFork0_#t~mem1#1_21|) (< v_~i~0_53 v_~N~0_29) (<= 0 .cse0) (<= v_~last~0_14 |v_thread1Thread1of1ForFork0_#t~mem1#1_21|) (<= (+ .cse1 v_~A~0.offset_31 4) (select |v_#length_87| v_~A~0.base_31)) (= (select |v_#valid_102| v_~A~0.base_31) 1)))) InVars {~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, ~last~0=v_~last~0_14} OutVars{~A~0.base=v_~A~0.base_31, ~A~0.offset=v_~A~0.offset_31, ~i~0=v_~i~0_53, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_79|, #length=|v_#length_87|, ~N~0=v_~N~0_29, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_21|, ~last~0=v_~last~0_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 5218#[L102-4, L49-2, L79]don't care [606] L49-2-->L54: Formula: (let ((.cse2 (* v_~i~0_45 4)) (.cse3 (* v_~end~0_65 4))) (let ((.cse0 (+ .cse3 v_~queue~0.offset_33)) (.cse1 (+ v_~A~0.offset_25 .cse2))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| (ite (= (select (select |v_#memory_int_59| v_~queue~0.base_33) .cse0) (select (select |v_#memory_int_59| v_~A~0.base_25) .cse1)) 1 0)) (<= (+ v_~A~0.offset_25 4 .cse2) (select |v_#length_71| v_~A~0.base_25)) (= (select |v_#valid_86| v_~queue~0.base_33) 1) (<= 0 .cse0) (<= (+ .cse3 4 v_~queue~0.offset_33) (select |v_#length_71| v_~queue~0.base_33)) (= v_~end~0_64 (+ v_~end~0_65 1)) (<= 0 .cse1) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (not (= (ite (and (< v_~end~0_65 v_~n~0_32) (<= 0 v_~end~0_65)) 1 0) 0)) (= (select |v_#valid_86| v_~A~0.base_25) 1)))) InVars {~A~0.base=v_~A~0.base_25, ~queue~0.offset=v_~queue~0.offset_33, ~A~0.offset=v_~A~0.offset_25, ~i~0=v_~i~0_45, #valid=|v_#valid_86|, #memory_int=|v_#memory_int_59|, ~end~0=v_~end~0_65, #length=|v_#length_71|, ~queue~0.base=v_~queue~0.base_33, ~n~0=v_~n~0_32} OutVars{~A~0.base=v_~A~0.base_25, ~queue~0.offset=v_~queue~0.offset_33, ~i~0=v_~i~0_45, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_5|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~queue~0.base=v_~queue~0.base_33, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~A~0.offset=v_~A~0.offset_25, #valid=|v_#valid_86|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_59|, ~end~0=v_~end~0_64, #length=|v_#length_71|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_5|, ~n~0=v_~n~0_32, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_19|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1] 5038#[L102-4, L54, L79]don't care [2022-07-22 12:49:47,375 INFO L750 eck$LassoCheckResult]: Loop: 5038#[L102-4, L54, L79]don't care [646] L79-->L76: Formula: (let ((.cse0 (* v_~start~0_47 4))) (let ((.cse1 (+ .cse0 v_~queue~0.offset_35))) (and (<= (+ .cse0 4 v_~queue~0.offset_35) (select |v_#length_83| v_~queue~0.base_35)) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_15| 256) 0)) (= (ite (= (ite (and (not (= (mod v_~ok~0_17 256) 0)) (<= v_~v_old~0_16 v_~new~0_27)) 1 0) 0) 0 1) v_~ok~0_16) (<= 0 .cse1) (= (ite (and (< v_~start~0_47 v_~end~0_68) (<= 0 v_~start~0_47) (< v_~start~0_47 v_~n~0_36)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_7| 0)) (= (select |v_#valid_98| v_~queue~0.base_35) 1) (= v_~start~0_46 (+ v_~start~0_47 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|) (= v_~new~0_27 (select (select |v_#memory_int_75| v_~queue~0.base_35) .cse1))))) InVars {~start~0=v_~start~0_47, ~queue~0.offset=v_~queue~0.offset_35, ~ok~0=v_~ok~0_17, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_15|, #valid=|v_#valid_98|, #memory_int=|v_#memory_int_75|, #length=|v_#length_83|, ~end~0=v_~end~0_68, ~v_old~0=v_~v_old~0_16, ~queue~0.base=v_~queue~0.base_35, ~n~0=v_~n~0_36} OutVars{~new~0=v_~new~0_27, ~start~0=v_~start~0_46, ~queue~0.offset=v_~queue~0.offset_35, ~ok~0=v_~ok~0_16, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7|, ~queue~0.base=v_~queue~0.base_35, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_7|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_15|, #valid=|v_#valid_98|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_7|, #memory_int=|v_#memory_int_75|, #length=|v_#length_83|, ~end~0=v_~end~0_68, ~v_old~0=v_~v_old~0_16, ~n~0=v_~n~0_36} AuxVars[] AssignedVars[~new~0, ~start~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1] 5206#[L76, L102-4, L54]don't care [570] L76-->L79: Formula: (and (= v_~new~0_19 v_~v_old~0_6) (= |v_thread2Thread1of1ForFork1_~cond~0#1_11| (ite (= (ite (or (< v_~i~0_37 v_~N~0_11) (< v_~start~0_36 v_~end~0_60)) 1 0) 0) 0 1))) InVars {~start~0=v_~start~0_36, ~new~0=v_~new~0_19, ~i~0=v_~i~0_37, ~end~0=v_~end~0_60, ~N~0=v_~N~0_11} OutVars{~start~0=v_~start~0_36, ~new~0=v_~new~0_19, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_11|, ~i~0=v_~i~0_37, ~end~0=v_~end~0_60, ~N~0=v_~N~0_11, ~v_old~0=v_~v_old~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1, ~v_old~0] 5038#[L102-4, L54, L79]don't care [2022-07-22 12:49:47,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:47,376 INFO L85 PathProgramCache]: Analyzing trace with hash -158664272, now seen corresponding path program 1 times [2022-07-22 12:49:47,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:47,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843280373] [2022-07-22 12:49:47,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:47,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:47,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:47,490 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:49:47,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:47,556 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:49:47,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:47,557 INFO L85 PathProgramCache]: Analyzing trace with hash 21557, now seen corresponding path program 2 times [2022-07-22 12:49:47,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:47,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366475164] [2022-07-22 12:49:47,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:47,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:47,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:47,564 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:49:47,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:47,593 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:49:47,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:49:47,597 INFO L85 PathProgramCache]: Analyzing trace with hash 2142477860, now seen corresponding path program 1 times [2022-07-22 12:49:47,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:49:47,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907748352] [2022-07-22 12:49:47,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:49:47,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:49:47,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:47,655 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:49:47,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:49:47,742 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:49:52,520 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:49:52,521 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:49:52,521 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:49:52,521 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:49:52,521 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:49:52,521 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:49:52,521 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:49:52,521 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:49:52,521 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-inc-subseq.wvr.c_BEv2_Iteration11_Lasso [2022-07-22 12:49:52,521 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:49:52,521 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:49:52,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:52,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:52,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:52,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:52,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:52,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:52,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:52,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:52,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:52,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:52,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:52,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:52,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:52,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:52,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:52,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:52,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:49:53,238 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:910) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:819) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:253) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:356) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.runCegarLoops(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:331) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-22 12:49:53,241 INFO L158 Benchmark]: Toolchain (without parser) took 34966.42ms. Allocated memory was 162.5MB in the beginning and 282.1MB in the end (delta: 119.5MB). Free memory was 136.3MB in the beginning and 99.0MB in the end (delta: 37.2MB). Peak memory consumption was 173.4MB. Max. memory is 8.0GB. [2022-07-22 12:49:53,241 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 162.5MB. Free memory is still 132.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:49:53,242 INFO L158 Benchmark]: CACSL2BoogieTranslator took 303.77ms. Allocated memory is still 162.5MB. Free memory was 136.0MB in the beginning and 124.9MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-07-22 12:49:53,242 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.42ms. Allocated memory is still 162.5MB. Free memory was 124.9MB in the beginning and 122.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:49:53,243 INFO L158 Benchmark]: Boogie Preprocessor took 40.32ms. Allocated memory is still 162.5MB. Free memory was 122.8MB in the beginning and 121.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-22 12:49:53,243 INFO L158 Benchmark]: RCFGBuilder took 886.21ms. Allocated memory is still 162.5MB. Free memory was 121.0MB in the beginning and 134.4MB in the end (delta: -13.4MB). Peak memory consumption was 20.0MB. Max. memory is 8.0GB. [2022-07-22 12:49:53,243 INFO L158 Benchmark]: BuchiAutomizer took 33677.13ms. Allocated memory was 162.5MB in the beginning and 282.1MB in the end (delta: 119.5MB). Free memory was 134.4MB in the beginning and 99.0MB in the end (delta: 35.4MB). Peak memory consumption was 171.2MB. Max. memory is 8.0GB. [2022-07-22 12:49:53,245 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.22ms. Allocated memory is still 162.5MB. Free memory is still 132.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 303.77ms. Allocated memory is still 162.5MB. Free memory was 136.0MB in the beginning and 124.9MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.42ms. Allocated memory is still 162.5MB. Free memory was 124.9MB in the beginning and 122.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.32ms. Allocated memory is still 162.5MB. Free memory was 122.8MB in the beginning and 121.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 886.21ms. Allocated memory is still 162.5MB. Free memory was 121.0MB in the beginning and 134.4MB in the end (delta: -13.4MB). Peak memory consumption was 20.0MB. Max. memory is 8.0GB. * BuchiAutomizer took 33677.13ms. Allocated memory was 162.5MB in the beginning and 282.1MB in the end (delta: 119.5MB). Free memory was 134.4MB in the beginning and 99.0MB in the end (delta: 35.4MB). Peak memory consumption was 171.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.4s, 173 PlacesBefore, 26 PlacesAfterwards, 181 TransitionsBefore, 24 TransitionsAfterwards, 690 CoEnabledTransitionPairs, 7 FixpointIterations, 132 TrivialSequentialCompositions, 18 ConcurrentSequentialCompositions, 28 TrivialYvCompositions, 6 ConcurrentYvCompositions, 10 ChoiceCompositions, 194 TotalNumberOfCompositions, 1324 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 972, positive: 898, positive conditional: 0, positive unconditional: 898, negative: 74, negative conditional: 0, negative unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 391, positive: 375, positive conditional: 0, positive unconditional: 375, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 972, positive: 523, positive conditional: 0, positive unconditional: 523, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 391, unknown conditional: 0, unknown unconditional: 391] , Statistics on independence cache: Total cache size (in pairs): 54, Positive cache size: 47, Positive conditional cache size: 0, Positive unconditional cache size: 47, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7 - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-22 12:49:53,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Forceful destruction successful, exit code 0 [2022-07-22 12:49:53,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2022-07-22 12:49:53,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...