/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-channel-sum.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-0d686a6 [2022-07-26 14:15:20,179 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-26 14:15:20,190 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-26 14:15:20,226 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-26 14:15:20,227 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-26 14:15:20,227 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-26 14:15:20,228 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-26 14:15:20,229 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-26 14:15:20,230 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-26 14:15:20,231 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-26 14:15:20,231 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-26 14:15:20,232 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-26 14:15:20,232 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-26 14:15:20,233 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-26 14:15:20,233 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-26 14:15:20,234 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-26 14:15:20,235 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-26 14:15:20,235 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-26 14:15:20,236 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-26 14:15:20,237 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-26 14:15:20,238 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-26 14:15:20,239 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-26 14:15:20,239 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-26 14:15:20,240 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-26 14:15:20,240 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-26 14:15:20,242 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-26 14:15:20,242 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-26 14:15:20,242 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-26 14:15:20,243 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-26 14:15:20,243 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-26 14:15:20,244 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-26 14:15:20,244 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-26 14:15:20,244 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-26 14:15:20,245 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-26 14:15:20,245 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-26 14:15:20,246 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-26 14:15:20,246 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-26 14:15:20,247 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-26 14:15:20,247 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-26 14:15:20,247 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-26 14:15:20,248 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-26 14:15:20,248 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-26 14:15:20,249 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-syntacticLbe.epf [2022-07-26 14:15:20,262 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-26 14:15:20,262 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-26 14:15:20,263 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-26 14:15:20,263 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-26 14:15:20,264 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-26 14:15:20,264 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-26 14:15:20,264 INFO L138 SettingsManager]: * Use SBE=true [2022-07-26 14:15:20,264 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-26 14:15:20,264 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-26 14:15:20,264 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-26 14:15:20,264 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-26 14:15:20,264 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-26 14:15:20,264 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-26 14:15:20,265 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-26 14:15:20,265 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-26 14:15:20,265 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-26 14:15:20,265 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-26 14:15:20,265 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-26 14:15:20,265 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-26 14:15:20,265 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-26 14:15:20,265 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-26 14:15:20,265 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-26 14:15:20,265 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-26 14:15:20,265 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-26 14:15:20,266 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-26 14:15:20,266 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-26 14:15:20,266 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-26 14:15:20,266 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-26 14:15:20,266 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-26 14:15:20,266 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-26 14:15:20,266 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-26 14:15:20,266 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-07-26 14:15:20,267 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-26 14:15:20,267 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-07-26 14:15:20,459 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-26 14:15:20,482 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-26 14:15:20,485 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-26 14:15:20,486 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-26 14:15:20,486 INFO L275 PluginConnector]: CDTParser initialized [2022-07-26 14:15:20,487 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c [2022-07-26 14:15:20,535 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17396f1b4/b36170d8bc534a8bae09236536cb6240/FLAGeb1c7e33d [2022-07-26 14:15:20,866 INFO L306 CDTParser]: Found 1 translation units. [2022-07-26 14:15:20,866 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c [2022-07-26 14:15:20,873 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17396f1b4/b36170d8bc534a8bae09236536cb6240/FLAGeb1c7e33d [2022-07-26 14:15:20,886 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17396f1b4/b36170d8bc534a8bae09236536cb6240 [2022-07-26 14:15:20,889 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-26 14:15:20,891 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-26 14:15:20,892 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-26 14:15:20,892 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-26 14:15:20,894 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-26 14:15:20,894 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.07 02:15:20" (1/1) ... [2022-07-26 14:15:20,895 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@479e0ca0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:15:20, skipping insertion in model container [2022-07-26 14:15:20,895 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.07 02:15:20" (1/1) ... [2022-07-26 14:15:20,900 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-26 14:15:20,917 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-26 14:15:21,110 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-channel-sum.wvr.c[2947,2960] [2022-07-26 14:15:21,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 14:15:21,127 INFO L203 MainTranslator]: Completed pre-run [2022-07-26 14:15:21,157 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-channel-sum.wvr.c[2947,2960] [2022-07-26 14:15:21,163 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 14:15:21,175 INFO L208 MainTranslator]: Completed translation [2022-07-26 14:15:21,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:15:21 WrapperNode [2022-07-26 14:15:21,176 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-26 14:15:21,177 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-26 14:15:21,177 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-26 14:15:21,177 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-26 14:15:21,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:15:21" (1/1) ... [2022-07-26 14:15:21,192 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:15:21" (1/1) ... [2022-07-26 14:15:21,216 INFO L137 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 148 [2022-07-26 14:15:21,217 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-26 14:15:21,217 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-26 14:15:21,218 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-26 14:15:21,218 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-26 14:15:21,223 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:15:21" (1/1) ... [2022-07-26 14:15:21,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:15:21" (1/1) ... [2022-07-26 14:15:21,235 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:15:21" (1/1) ... [2022-07-26 14:15:21,236 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:15:21" (1/1) ... [2022-07-26 14:15:21,239 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:15:21" (1/1) ... [2022-07-26 14:15:21,244 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:15:21" (1/1) ... [2022-07-26 14:15:21,245 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:15:21" (1/1) ... [2022-07-26 14:15:21,247 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-26 14:15:21,247 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-26 14:15:21,247 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-26 14:15:21,247 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-26 14:15:21,252 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:15:21" (1/1) ... [2022-07-26 14:15:21,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:21,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:21,283 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:21,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-26 14:15:21,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-26 14:15:21,311 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-26 14:15:21,311 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-26 14:15:21,312 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-26 14:15:21,312 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-26 14:15:21,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-26 14:15:21,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-26 14:15:21,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-26 14:15:21,312 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-26 14:15:21,312 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-26 14:15:21,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-26 14:15:21,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-26 14:15:21,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-26 14:15:21,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-26 14:15:21,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-26 14:15:21,313 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-26 14:15:21,396 INFO L234 CfgBuilder]: Building ICFG [2022-07-26 14:15:21,398 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-26 14:15:21,662 INFO L275 CfgBuilder]: Performing block encoding [2022-07-26 14:15:21,714 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-26 14:15:21,714 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-26 14:15:21,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.07 02:15:21 BoogieIcfgContainer [2022-07-26 14:15:21,718 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-26 14:15:21,719 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-26 14:15:21,719 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-26 14:15:21,722 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-26 14:15:21,723 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 14:15:21,723 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.07 02:15:20" (1/3) ... [2022-07-26 14:15:21,723 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@36b1d0e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.07 02:15:21, skipping insertion in model container [2022-07-26 14:15:21,724 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 14:15:21,724 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:15:21" (2/3) ... [2022-07-26 14:15:21,724 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@36b1d0e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.07 02:15:21, skipping insertion in model container [2022-07-26 14:15:21,724 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 14:15:21,724 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.07 02:15:21" (3/3) ... [2022-07-26 14:15:21,725 INFO L322 chiAutomizerObserver]: Analyzing ICFG popl20-channel-sum.wvr.c [2022-07-26 14:15:21,791 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-26 14:15:21,814 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 134 places, 140 transitions, 296 flow [2022-07-26 14:15:21,857 INFO L129 PetriNetUnfolder]: 11/136 cut-off events. [2022-07-26 14:15:21,858 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-26 14:15:21,861 INFO L84 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 136 events. 11/136 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 126 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2022-07-26 14:15:21,861 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 140 transitions, 296 flow [2022-07-26 14:15:21,869 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 136 transitions, 284 flow [2022-07-26 14:15:21,872 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-07-26 14:15:21,877 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 136 transitions, 284 flow [2022-07-26 14:15:21,879 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 136 transitions, 284 flow [2022-07-26 14:15:21,879 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 132 places, 136 transitions, 284 flow [2022-07-26 14:15:21,897 INFO L129 PetriNetUnfolder]: 11/136 cut-off events. [2022-07-26 14:15:21,897 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-26 14:15:21,898 INFO L84 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 136 events. 11/136 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 129 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2022-07-26 14:15:21,899 INFO L116 LiptonReduction]: Number of co-enabled transitions 1292 [2022-07-26 14:15:25,778 INFO L131 LiptonReduction]: Checked pairs total: 1475 [2022-07-26 14:15:25,779 INFO L133 LiptonReduction]: Total number of compositions: 150 [2022-07-26 14:15:25,790 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2022-07-26 14:15:25,790 INFO L302 stractBuchiCegarLoop]: Hoare is false [2022-07-26 14:15:25,790 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-26 14:15:25,790 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-26 14:15:25,790 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-26 14:15:25,791 INFO L306 stractBuchiCegarLoop]: Difference is false [2022-07-26 14:15:25,791 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-26 14:15:25,791 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-26 14:15:25,792 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-26 14:15:25,812 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 23 [2022-07-26 14:15:25,812 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:15:25,812 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:15:25,815 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-26 14:15:25,815 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:15:25,816 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-26 14:15:25,816 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 42 states, but on-demand construction may add more states [2022-07-26 14:15:25,818 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 23 [2022-07-26 14:15:25,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:15:25,818 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:15:25,818 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-26 14:15:25,818 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:15:25,822 INFO L733 eck$LassoCheckResult]: Stem: 137#[ULTIMATE.startENTRY]don't care [587] ULTIMATE.startENTRY-->L115-6: Formula: (let ((.cse2 (store |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse0 (select |v_#memory_int_In_5| 1)) (.cse1 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2| 0) (= (select .cse0 1) 0) (= |v_#length_Out_6| (store (store (store |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (= (select |v_#length_In_7| 2) 25) (= 0 |v_#NULL.base_Out_2|) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= v_~element~0_Out_6 0) (= v_~queue~0.offset_Out_2 0) (= 48 (select .cse0 0)) (= v_~queue~0.base_Out_2 0) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 1) |v_#valid_Out_10|) (= (select |v_#valid_In_7| 0) 0) (= |v_#NULL.offset_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| |v_#StackHeapBarrier_In_3|) (< 0 |v_#StackHeapBarrier_In_3|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= (select |v_#valid_In_7| 2) 1) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= (select |v_#valid_In_7| 1) 1) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|) (= v_~back~0_Out_6 v_~front~0_Out_2) (= v_~n~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_7| 1)) (= v_~sum~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 0)) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| 0))))) InVars {#memory_int=|v_#memory_int_In_5|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_7|, #valid=|v_#valid_In_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ~sum~0=v_~sum~0_Out_2, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_Out_2|, #length=|v_#length_Out_6|, ~front~0=v_~front~0_Out_2, ULTIMATE.start_main_#t~ret10#1.base=|v_ULTIMATE.start_main_#t~ret10#1.base_Out_2|, ~queue~0.offset=v_~queue~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|, ULTIMATE.start_main_#t~ret10#1.offset=|v_ULTIMATE.start_main_#t~ret10#1.offset_Out_2|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_Out_2|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ~back~0=v_~back~0_Out_6, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ~queue~0.base=v_~queue~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ~element~0=v_~element~0_Out_6, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_Out_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, #valid=|v_#valid_Out_10|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet9#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ~sum~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #length, ~front~0, ULTIMATE.start_main_#t~ret10#1.base, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~ret10#1.offset, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_#res#1, ~back~0, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~element~0, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 140#[L115-6]don't care [2022-07-26 14:15:25,822 INFO L735 eck$LassoCheckResult]: Loop: 140#[L115-6]don't care [554] L115-6-->L115-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|))) (and (<= 0 .cse0) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_28|) (= (store |v_#memory_int_89| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21| (store (select |v_#memory_int_89| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_13|)) |v_#memory_int_88|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_38|) (= (select |v_#valid_138| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) 1) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21| 4) (select |v_#length_111| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29|, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_13|, #valid=|v_#valid_138|, #memory_int=|v_#memory_int_89|, #length=|v_#length_111|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_38|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_28|, #valid=|v_#valid_138|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_13|, #memory_int=|v_#memory_int_88|, #length=|v_#length_111|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_38|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #memory_int] 140#[L115-6]don't care [2022-07-26 14:15:25,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:25,825 INFO L85 PathProgramCache]: Analyzing trace with hash 618, now seen corresponding path program 1 times [2022-07-26 14:15:25,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:25,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029669041] [2022-07-26 14:15:25,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:25,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:25,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:25,905 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:15:25,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:25,928 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:15:25,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:25,930 INFO L85 PathProgramCache]: Analyzing trace with hash 585, now seen corresponding path program 1 times [2022-07-26 14:15:25,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:25,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762958168] [2022-07-26 14:15:25,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:25,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:25,937 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:15:25,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:25,942 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:15:25,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:25,943 INFO L85 PathProgramCache]: Analyzing trace with hash 19712, now seen corresponding path program 1 times [2022-07-26 14:15:25,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:25,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830950234] [2022-07-26 14:15:25,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:25,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:25,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:25,962 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:15:25,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:25,981 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:15:26,311 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:15:26,312 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:15:26,312 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:15:26,312 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:15:26,312 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 14:15:26,312 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:26,312 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:15:26,312 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:15:26,313 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-channel-sum.wvr.c_BEv2_Iteration1_Lasso [2022-07-26 14:15:26,313 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:15:26,313 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:15:26,326 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:26,330 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:26,331 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:26,332 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:26,334 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:26,336 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:26,337 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:26,338 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:26,341 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:26,558 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:26,560 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:26,562 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:26,564 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:26,565 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:26,567 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:26,569 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:26,572 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:26,573 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:26,576 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:26,578 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:26,580 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:26,582 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:26,583 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:26,585 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:26,587 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:26,590 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:26,592 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:26,594 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:26,596 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:26,597 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:26,599 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:26,911 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:15:26,914 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 14:15:26,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:26,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:26,916 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:26,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-26 14:15:26,918 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:26,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:26,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:26,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:26,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:26,928 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:26,928 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:26,940 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:26,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:26,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:26,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:26,960 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:26,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-26 14:15:26,962 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:26,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:26,967 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:26,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:26,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:26,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:26,968 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:26,968 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:26,977 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:26,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:26,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:26,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:26,994 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:26,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-26 14:15:26,996 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:27,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:27,002 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:27,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:27,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:27,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:27,003 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:27,003 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:27,012 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:27,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:27,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:27,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:27,028 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:27,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-26 14:15:27,030 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:27,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:27,035 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:27,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:27,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:27,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:27,036 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:27,036 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:27,043 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:27,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:27,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:27,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:27,060 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:27,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-26 14:15:27,062 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:27,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:27,067 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:27,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:27,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:27,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:27,068 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:27,068 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:27,069 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:27,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:27,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:27,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:27,088 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:27,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-26 14:15:27,090 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:27,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:27,095 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:27,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:27,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:27,096 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:27,097 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:27,097 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:27,105 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:27,121 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-26 14:15:27,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:27,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:27,122 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:27,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-26 14:15:27,124 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:27,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:27,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:27,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:27,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:27,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:27,130 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:27,130 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:27,142 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:27,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:27,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:27,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:27,158 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:27,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-26 14:15:27,160 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:27,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:27,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:27,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:27,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:27,167 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:27,168 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:27,179 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:27,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:27,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:27,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:27,196 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:27,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-26 14:15:27,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:27,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:27,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:27,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:27,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:27,205 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:27,205 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:27,217 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:27,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:27,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:27,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:27,236 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:27,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:27,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:27,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:27,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:27,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:27,248 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:27,249 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:27,260 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:27,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-26 14:15:27,278 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-26 14:15:27,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:27,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:27,280 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:27,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-26 14:15:27,282 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:27,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:27,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:27,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:27,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:27,289 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:27,289 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:27,305 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:27,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:27,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:27,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:27,324 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:27,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-26 14:15:27,326 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:27,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:27,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:27,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:27,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:27,334 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:27,334 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:27,350 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:27,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:27,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:27,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:27,369 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:27,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-26 14:15:27,372 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:27,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:27,378 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-07-26 14:15:27,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:27,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:27,381 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-26 14:15:27,381 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:27,397 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:27,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:27,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:27,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:27,414 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:27,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-26 14:15:27,416 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:27,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:27,421 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:27,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:27,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:27,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:27,422 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:27,422 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:27,434 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:27,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:27,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:27,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:27,451 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:27,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-26 14:15:27,453 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:27,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:27,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:27,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:27,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:27,463 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:27,464 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:27,480 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 14:15:27,539 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-07-26 14:15:27,539 INFO L444 ModelExtractionUtils]: 10 out of 22 variables were initially zero. Simplification set additionally 9 variables to zero. [2022-07-26 14:15:27,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:27,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:27,542 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:27,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-26 14:15:27,543 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 14:15:27,561 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-26 14:15:27,561 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 14:15:27,561 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1) = -1*ULTIMATE.start_create_fresh_int_array_~i~0#1 + 1*ULTIMATE.start_create_fresh_int_array_~size#1 Supporting invariants [] [2022-07-26 14:15:27,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:27,620 INFO L156 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2022-07-26 14:15:27,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:27,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:15:27,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 14:15:27,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:15:27,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:15:27,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-26 14:15:27,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:15:27,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:15:27,691 INFO L141 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-26 14:15:27,693 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 42 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-26 14:15:27,737 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 42 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 84 states and 188 transitions. Complement of second has 5 states. [2022-07-26 14:15:27,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-26 14:15:27,741 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-26 14:15:27,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-07-26 14:15:27,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 1 letters. Loop has 1 letters. [2022-07-26 14:15:27,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:15:27,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-26 14:15:27,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:15:27,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 1 letters. Loop has 2 letters. [2022-07-26 14:15:27,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:15:27,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 188 transitions. [2022-07-26 14:15:27,747 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 22 [2022-07-26 14:15:27,750 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 38 states and 85 transitions. [2022-07-26 14:15:27,751 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2022-07-26 14:15:27,751 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2022-07-26 14:15:27,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 85 transitions. [2022-07-26 14:15:27,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:15:27,752 INFO L220 hiAutomatonCegarLoop]: Abstraction has 38 states and 85 transitions. [2022-07-26 14:15:27,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 85 transitions. [2022-07-26 14:15:27,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:27,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-07-26 14:15:27,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.236842105263158) internal successors, (85), 37 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:15:27,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 85 transitions. [2022-07-26 14:15:27,812 INFO L242 hiAutomatonCegarLoop]: Abstraction has 38 states and 85 transitions. [2022-07-26 14:15:27,812 INFO L426 stractBuchiCegarLoop]: Abstraction has 38 states and 85 transitions. [2022-07-26 14:15:27,812 INFO L333 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-26 14:15:27,812 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 85 transitions. [2022-07-26 14:15:27,817 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 22 [2022-07-26 14:15:27,817 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:15:27,817 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:15:27,818 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-26 14:15:27,818 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 14:15:27,819 INFO L733 eck$LassoCheckResult]: Stem: 455#[ULTIMATE.startENTRY]don't care [587] ULTIMATE.startENTRY-->L115-6: Formula: (let ((.cse2 (store |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse0 (select |v_#memory_int_In_5| 1)) (.cse1 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2| 0) (= (select .cse0 1) 0) (= |v_#length_Out_6| (store (store (store |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (= (select |v_#length_In_7| 2) 25) (= 0 |v_#NULL.base_Out_2|) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= v_~element~0_Out_6 0) (= v_~queue~0.offset_Out_2 0) (= 48 (select .cse0 0)) (= v_~queue~0.base_Out_2 0) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 1) |v_#valid_Out_10|) (= (select |v_#valid_In_7| 0) 0) (= |v_#NULL.offset_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| |v_#StackHeapBarrier_In_3|) (< 0 |v_#StackHeapBarrier_In_3|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= (select |v_#valid_In_7| 2) 1) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= (select |v_#valid_In_7| 1) 1) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|) (= v_~back~0_Out_6 v_~front~0_Out_2) (= v_~n~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_7| 1)) (= v_~sum~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 0)) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| 0))))) InVars {#memory_int=|v_#memory_int_In_5|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_7|, #valid=|v_#valid_In_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ~sum~0=v_~sum~0_Out_2, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_Out_2|, #length=|v_#length_Out_6|, ~front~0=v_~front~0_Out_2, ULTIMATE.start_main_#t~ret10#1.base=|v_ULTIMATE.start_main_#t~ret10#1.base_Out_2|, ~queue~0.offset=v_~queue~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|, ULTIMATE.start_main_#t~ret10#1.offset=|v_ULTIMATE.start_main_#t~ret10#1.offset_Out_2|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_Out_2|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ~back~0=v_~back~0_Out_6, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ~queue~0.base=v_~queue~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ~element~0=v_~element~0_Out_6, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_Out_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, #valid=|v_#valid_Out_10|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet9#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ~sum~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #length, ~front~0, ULTIMATE.start_main_#t~ret10#1.base, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~ret10#1.offset, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_#res#1, ~back~0, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~element~0, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 439#[L115-6]don't care [563] L115-6-->L99-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre11#1_27| |v_#pthreadsForks_32|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36| |v_ULTIMATE.start_create_fresh_int_array_~size#1_48|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18| v_~queue~0.base_48) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) (= (select |v_#valid_144| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) 1) (= |v_#memory_int_94| (store |v_#memory_int_95| |v_ULTIMATE.start_main_~#t1~0#1.base_43| (store (select |v_#memory_int_95| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre11#1_27|))) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_115| |v_ULTIMATE.start_main_~#t1~0#1.base_43|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18| v_~queue~0.offset_48) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, #pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36|, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_95|, #length=|v_#length_115|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|} OutVars{ULTIMATE.start_main_#t~ret10#1.base=|v_ULTIMATE.start_main_#t~ret10#1.base_23|, ~queue~0.offset=v_~queue~0.offset_48, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_27|, ULTIMATE.start_main_#t~ret10#1.offset=|v_ULTIMATE.start_main_#t~ret10#1.offset_23|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ~queue~0.base=v_~queue~0.base_48, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18|, #pthreadsForks=|v_#pthreadsForks_31|, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_94|, #length=|v_#length_115|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret10#1.base, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~ret10#1.offset, #pthreadsForks, #memory_int, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base] 441#[L99-3]don't care [435] L99-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_8|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_8|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_10|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_10|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~cond~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_thidvar0] 457#[thread1ENTRY, L99-4]don't care [392] thread1ENTRY-->L57: Formula: (= (ite (= (ite (< v_~front~0_1 v_~back~0_1) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork1_~cond~0#1_1|) InVars {~back~0=v_~back~0_1, ~front~0=v_~front~0_1} OutVars{~back~0=v_~back~0_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_1|, ~front~0=v_~front~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~cond~0#1] 449#[L57, L99-4]don't care [2022-07-26 14:15:27,821 INFO L735 eck$LassoCheckResult]: Loop: 449#[L57, L99-4]don't care [572] L57-->L53: Formula: (let ((.cse0 (* v_~front~0_In_1 4))) (let ((.cse1 (+ v_~queue~0.offset_In_1 .cse0))) (and (<= (+ v_~queue~0.offset_In_1 .cse0 4) (select |v_#length_In_3| v_~queue~0.base_In_1)) (not (= 0 (mod |v_thread1Thread1of1ForFork1_~cond~0#1_In_3| 256))) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|) (= (select (select |v_#memory_int_In_1| v_~queue~0.base_In_1) .cse1) v_~element~0_Out_2) (= (select |v_#valid_In_3| v_~queue~0.base_In_1) 1) (<= 0 .cse1) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| (ite (and (< v_~front~0_In_1 v_~n~0_In_1) (<= 0 v_~front~0_In_1)) 1 0))))) InVars {~queue~0.offset=v_~queue~0.offset_In_1, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, ~queue~0.base=v_~queue~0.base_In_1, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_3|, ~front~0=v_~front~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_In_1, ~queue~0.base=v_~queue~0.base_In_1, ~element~0=v_~element~0_Out_2, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_Out_2|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_3|, ~front~0=v_~front~0_In_1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[~element~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 451#[L53, L99-4]don't care [541] L53-->L57: Formula: (and (= v_~sum~0_17 (+ v_~element~0_14 v_~sum~0_18)) (= (ite (= (ite (< v_~front~0_40 v_~back~0_82) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork1_~cond~0#1_21|) (= v_~front~0_40 (+ v_~front~0_41 1))) InVars {~sum~0=v_~sum~0_18, ~element~0=v_~element~0_14, ~back~0=v_~back~0_82, ~front~0=v_~front~0_41} OutVars{~sum~0=v_~sum~0_17, thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_15|, ~element~0=v_~element~0_14, ~back~0=v_~back~0_82, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_21|, ~front~0=v_~front~0_40} AuxVars[] AssignedVars[~sum~0, thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_~cond~0#1, ~front~0] 449#[L57, L99-4]don't care [2022-07-26 14:15:27,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:27,821 INFO L85 PathProgramCache]: Analyzing trace with hash 18965758, now seen corresponding path program 1 times [2022-07-26 14:15:27,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:27,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459595250] [2022-07-26 14:15:27,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:27,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:27,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:27,865 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:15:27,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:27,893 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:15:27,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:27,893 INFO L85 PathProgramCache]: Analyzing trace with hash 19234, now seen corresponding path program 1 times [2022-07-26 14:15:27,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:27,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104029299] [2022-07-26 14:15:27,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:27,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:27,913 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:15:27,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:27,923 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:15:27,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:27,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1046242527, now seen corresponding path program 1 times [2022-07-26 14:15:27,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:27,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484368172] [2022-07-26 14:15:27,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:27,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:15:27,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:15:27,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:15:27,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484368172] [2022-07-26 14:15:27,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484368172] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 14:15:27,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 14:15:27,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-26 14:15:27,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990628423] [2022-07-26 14:15:27,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 14:15:28,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:15:28,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-26 14:15:28,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-26 14:15:28,084 INFO L87 Difference]: Start difference. First operand 38 states and 85 transitions. cyclomatic complexity: 62 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:15:28,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:15:28,137 INFO L93 Difference]: Finished difference Result 65 states and 130 transitions. [2022-07-26 14:15:28,137 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 130 transitions. [2022-07-26 14:15:28,145 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 22 [2022-07-26 14:15:28,146 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 38 states and 84 transitions. [2022-07-26 14:15:28,146 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2022-07-26 14:15:28,146 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2022-07-26 14:15:28,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 84 transitions. [2022-07-26 14:15:28,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:15:28,146 INFO L220 hiAutomatonCegarLoop]: Abstraction has 38 states and 84 transitions. [2022-07-26 14:15:28,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 84 transitions. [2022-07-26 14:15:28,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-07-26 14:15:28,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.210526315789474) internal successors, (84), 37 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:15:28,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 84 transitions. [2022-07-26 14:15:28,152 INFO L242 hiAutomatonCegarLoop]: Abstraction has 38 states and 84 transitions. [2022-07-26 14:15:28,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-26 14:15:28,154 INFO L426 stractBuchiCegarLoop]: Abstraction has 38 states and 84 transitions. [2022-07-26 14:15:28,154 INFO L333 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-26 14:15:28,154 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 84 transitions. [2022-07-26 14:15:28,155 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 22 [2022-07-26 14:15:28,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:15:28,155 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:15:28,155 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-26 14:15:28,155 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 14:15:28,156 INFO L733 eck$LassoCheckResult]: Stem: 607#[ULTIMATE.startENTRY]don't care [587] ULTIMATE.startENTRY-->L115-6: Formula: (let ((.cse2 (store |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse0 (select |v_#memory_int_In_5| 1)) (.cse1 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2| 0) (= (select .cse0 1) 0) (= |v_#length_Out_6| (store (store (store |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (= (select |v_#length_In_7| 2) 25) (= 0 |v_#NULL.base_Out_2|) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= v_~element~0_Out_6 0) (= v_~queue~0.offset_Out_2 0) (= 48 (select .cse0 0)) (= v_~queue~0.base_Out_2 0) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 1) |v_#valid_Out_10|) (= (select |v_#valid_In_7| 0) 0) (= |v_#NULL.offset_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| |v_#StackHeapBarrier_In_3|) (< 0 |v_#StackHeapBarrier_In_3|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= (select |v_#valid_In_7| 2) 1) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= (select |v_#valid_In_7| 1) 1) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|) (= v_~back~0_Out_6 v_~front~0_Out_2) (= v_~n~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_7| 1)) (= v_~sum~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 0)) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| 0))))) InVars {#memory_int=|v_#memory_int_In_5|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_7|, #valid=|v_#valid_In_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ~sum~0=v_~sum~0_Out_2, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_Out_2|, #length=|v_#length_Out_6|, ~front~0=v_~front~0_Out_2, ULTIMATE.start_main_#t~ret10#1.base=|v_ULTIMATE.start_main_#t~ret10#1.base_Out_2|, ~queue~0.offset=v_~queue~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|, ULTIMATE.start_main_#t~ret10#1.offset=|v_ULTIMATE.start_main_#t~ret10#1.offset_Out_2|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_Out_2|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ~back~0=v_~back~0_Out_6, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ~queue~0.base=v_~queue~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ~element~0=v_~element~0_Out_6, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_Out_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, #valid=|v_#valid_Out_10|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet9#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ~sum~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #length, ~front~0, ULTIMATE.start_main_#t~ret10#1.base, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~ret10#1.offset, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_#res#1, ~back~0, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~element~0, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 591#[L115-6]don't care [554] L115-6-->L115-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|))) (and (<= 0 .cse0) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_28|) (= (store |v_#memory_int_89| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21| (store (select |v_#memory_int_89| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_13|)) |v_#memory_int_88|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_38|) (= (select |v_#valid_138| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) 1) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21| 4) (select |v_#length_111| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29|, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_13|, #valid=|v_#valid_138|, #memory_int=|v_#memory_int_89|, #length=|v_#length_111|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_38|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_28|, #valid=|v_#valid_138|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_13|, #memory_int=|v_#memory_int_88|, #length=|v_#length_111|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_38|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #memory_int] 593#[L115-6]don't care [563] L115-6-->L99-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre11#1_27| |v_#pthreadsForks_32|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36| |v_ULTIMATE.start_create_fresh_int_array_~size#1_48|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18| v_~queue~0.base_48) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) (= (select |v_#valid_144| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) 1) (= |v_#memory_int_94| (store |v_#memory_int_95| |v_ULTIMATE.start_main_~#t1~0#1.base_43| (store (select |v_#memory_int_95| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre11#1_27|))) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_115| |v_ULTIMATE.start_main_~#t1~0#1.base_43|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18| v_~queue~0.offset_48) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, #pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36|, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_95|, #length=|v_#length_115|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|} OutVars{ULTIMATE.start_main_#t~ret10#1.base=|v_ULTIMATE.start_main_#t~ret10#1.base_23|, ~queue~0.offset=v_~queue~0.offset_48, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_27|, ULTIMATE.start_main_#t~ret10#1.offset=|v_ULTIMATE.start_main_#t~ret10#1.offset_23|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ~queue~0.base=v_~queue~0.base_48, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18|, #pthreadsForks=|v_#pthreadsForks_31|, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_94|, #length=|v_#length_115|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret10#1.base, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~ret10#1.offset, #pthreadsForks, #memory_int, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base] 595#[L99-3]don't care [435] L99-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_8|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_8|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_10|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_10|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~cond~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_thidvar0] 609#[thread1ENTRY, L99-4]don't care [392] thread1ENTRY-->L57: Formula: (= (ite (= (ite (< v_~front~0_1 v_~back~0_1) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork1_~cond~0#1_1|) InVars {~back~0=v_~back~0_1, ~front~0=v_~front~0_1} OutVars{~back~0=v_~back~0_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_1|, ~front~0=v_~front~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~cond~0#1] 601#[L57, L99-4]don't care [2022-07-26 14:15:28,156 INFO L735 eck$LassoCheckResult]: Loop: 601#[L57, L99-4]don't care [572] L57-->L53: Formula: (let ((.cse0 (* v_~front~0_In_1 4))) (let ((.cse1 (+ v_~queue~0.offset_In_1 .cse0))) (and (<= (+ v_~queue~0.offset_In_1 .cse0 4) (select |v_#length_In_3| v_~queue~0.base_In_1)) (not (= 0 (mod |v_thread1Thread1of1ForFork1_~cond~0#1_In_3| 256))) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|) (= (select (select |v_#memory_int_In_1| v_~queue~0.base_In_1) .cse1) v_~element~0_Out_2) (= (select |v_#valid_In_3| v_~queue~0.base_In_1) 1) (<= 0 .cse1) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| (ite (and (< v_~front~0_In_1 v_~n~0_In_1) (<= 0 v_~front~0_In_1)) 1 0))))) InVars {~queue~0.offset=v_~queue~0.offset_In_1, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, ~queue~0.base=v_~queue~0.base_In_1, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_3|, ~front~0=v_~front~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_In_1, ~queue~0.base=v_~queue~0.base_In_1, ~element~0=v_~element~0_Out_2, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_Out_2|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_3|, ~front~0=v_~front~0_In_1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[~element~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 603#[L53, L99-4]don't care [541] L53-->L57: Formula: (and (= v_~sum~0_17 (+ v_~element~0_14 v_~sum~0_18)) (= (ite (= (ite (< v_~front~0_40 v_~back~0_82) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork1_~cond~0#1_21|) (= v_~front~0_40 (+ v_~front~0_41 1))) InVars {~sum~0=v_~sum~0_18, ~element~0=v_~element~0_14, ~back~0=v_~back~0_82, ~front~0=v_~front~0_41} OutVars{~sum~0=v_~sum~0_17, thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_15|, ~element~0=v_~element~0_14, ~back~0=v_~back~0_82, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_21|, ~front~0=v_~front~0_40} AuxVars[] AssignedVars[~sum~0, thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_~cond~0#1, ~front~0] 601#[L57, L99-4]don't care [2022-07-26 14:15:28,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:28,157 INFO L85 PathProgramCache]: Analyzing trace with hash 587795112, now seen corresponding path program 1 times [2022-07-26 14:15:28,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:28,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854513002] [2022-07-26 14:15:28,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:28,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:28,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:28,191 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:15:28,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:28,221 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:15:28,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:28,222 INFO L85 PathProgramCache]: Analyzing trace with hash 19234, now seen corresponding path program 2 times [2022-07-26 14:15:28,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:28,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887538137] [2022-07-26 14:15:28,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:28,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:28,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:28,227 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:15:28,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:28,241 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:15:28,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:28,242 INFO L85 PathProgramCache]: Analyzing trace with hash -2064562167, now seen corresponding path program 1 times [2022-07-26 14:15:28,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:28,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316790530] [2022-07-26 14:15:28,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:28,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:28,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:15:28,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-26 14:15:28,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:15:28,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316790530] [2022-07-26 14:15:28,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316790530] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 14:15:28,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 14:15:28,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-26 14:15:28,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350384118] [2022-07-26 14:15:28,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 14:15:28,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:15:28,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-26 14:15:28,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-26 14:15:28,414 INFO L87 Difference]: Start difference. First operand 38 states and 84 transitions. cyclomatic complexity: 61 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:15:28,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:15:28,468 INFO L93 Difference]: Finished difference Result 46 states and 96 transitions. [2022-07-26 14:15:28,468 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 96 transitions. [2022-07-26 14:15:28,471 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 14 [2022-07-26 14:15:28,473 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 42 states and 88 transitions. [2022-07-26 14:15:28,473 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2022-07-26 14:15:28,473 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2022-07-26 14:15:28,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 88 transitions. [2022-07-26 14:15:28,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:15:28,474 INFO L220 hiAutomatonCegarLoop]: Abstraction has 42 states and 88 transitions. [2022-07-26 14:15:28,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 88 transitions. [2022-07-26 14:15:28,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2022-07-26 14:15:28,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 37 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:15:28,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 81 transitions. [2022-07-26 14:15:28,482 INFO L242 hiAutomatonCegarLoop]: Abstraction has 38 states and 81 transitions. [2022-07-26 14:15:28,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-26 14:15:28,483 INFO L426 stractBuchiCegarLoop]: Abstraction has 38 states and 81 transitions. [2022-07-26 14:15:28,483 INFO L333 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-26 14:15:28,483 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 81 transitions. [2022-07-26 14:15:28,486 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 14 [2022-07-26 14:15:28,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:15:28,486 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:15:28,487 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:15:28,487 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:15:28,488 INFO L733 eck$LassoCheckResult]: Stem: 738#[ULTIMATE.startENTRY]don't care [587] ULTIMATE.startENTRY-->L115-6: Formula: (let ((.cse2 (store |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse0 (select |v_#memory_int_In_5| 1)) (.cse1 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2| 0) (= (select .cse0 1) 0) (= |v_#length_Out_6| (store (store (store |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (= (select |v_#length_In_7| 2) 25) (= 0 |v_#NULL.base_Out_2|) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= v_~element~0_Out_6 0) (= v_~queue~0.offset_Out_2 0) (= 48 (select .cse0 0)) (= v_~queue~0.base_Out_2 0) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 1) |v_#valid_Out_10|) (= (select |v_#valid_In_7| 0) 0) (= |v_#NULL.offset_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| |v_#StackHeapBarrier_In_3|) (< 0 |v_#StackHeapBarrier_In_3|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= (select |v_#valid_In_7| 2) 1) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= (select |v_#valid_In_7| 1) 1) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|) (= v_~back~0_Out_6 v_~front~0_Out_2) (= v_~n~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_7| 1)) (= v_~sum~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 0)) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| 0))))) InVars {#memory_int=|v_#memory_int_In_5|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_7|, #valid=|v_#valid_In_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ~sum~0=v_~sum~0_Out_2, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_Out_2|, #length=|v_#length_Out_6|, ~front~0=v_~front~0_Out_2, ULTIMATE.start_main_#t~ret10#1.base=|v_ULTIMATE.start_main_#t~ret10#1.base_Out_2|, ~queue~0.offset=v_~queue~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|, ULTIMATE.start_main_#t~ret10#1.offset=|v_ULTIMATE.start_main_#t~ret10#1.offset_Out_2|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_Out_2|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ~back~0=v_~back~0_Out_6, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ~queue~0.base=v_~queue~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ~element~0=v_~element~0_Out_6, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_Out_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, #valid=|v_#valid_Out_10|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet9#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ~sum~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #length, ~front~0, ULTIMATE.start_main_#t~ret10#1.base, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~ret10#1.offset, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_#res#1, ~back~0, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~element~0, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 718#[L115-6]don't care [554] L115-6-->L115-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|))) (and (<= 0 .cse0) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_28|) (= (store |v_#memory_int_89| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21| (store (select |v_#memory_int_89| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_13|)) |v_#memory_int_88|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_38|) (= (select |v_#valid_138| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) 1) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21| 4) (select |v_#length_111| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29|, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_13|, #valid=|v_#valid_138|, #memory_int=|v_#memory_int_89|, #length=|v_#length_111|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_38|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_28|, #valid=|v_#valid_138|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_13|, #memory_int=|v_#memory_int_88|, #length=|v_#length_111|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_38|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #memory_int] 720#[L115-6]don't care [563] L115-6-->L99-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre11#1_27| |v_#pthreadsForks_32|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36| |v_ULTIMATE.start_create_fresh_int_array_~size#1_48|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18| v_~queue~0.base_48) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) (= (select |v_#valid_144| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) 1) (= |v_#memory_int_94| (store |v_#memory_int_95| |v_ULTIMATE.start_main_~#t1~0#1.base_43| (store (select |v_#memory_int_95| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre11#1_27|))) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_115| |v_ULTIMATE.start_main_~#t1~0#1.base_43|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18| v_~queue~0.offset_48) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, #pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36|, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_95|, #length=|v_#length_115|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|} OutVars{ULTIMATE.start_main_#t~ret10#1.base=|v_ULTIMATE.start_main_#t~ret10#1.base_23|, ~queue~0.offset=v_~queue~0.offset_48, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_27|, ULTIMATE.start_main_#t~ret10#1.offset=|v_ULTIMATE.start_main_#t~ret10#1.offset_23|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ~queue~0.base=v_~queue~0.base_48, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18|, #pthreadsForks=|v_#pthreadsForks_31|, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_94|, #length=|v_#length_115|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret10#1.base, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~ret10#1.offset, #pthreadsForks, #memory_int, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base] 722#[L99-3]don't care [435] L99-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_8|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_8|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_10|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_10|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~cond~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_thidvar0] 740#[thread1ENTRY, L99-4]don't care [537] L99-4-->L100-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre13#1_17| |v_#pthreadsForks_24|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_85| |v_ULTIMATE.start_main_~#t2~0#1.base_25|)) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (store |v_#memory_int_73| |v_ULTIMATE.start_main_~#t2~0#1.base_25| (store (select |v_#memory_int_73| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre13#1_17|)) |v_#memory_int_72|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|) (= (select |v_#valid_104| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) 1)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_73|, #length=|v_#length_85|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_17|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_72|, #length=|v_#length_85|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ULTIMATE.start_main_#t~pre11#1, #memory_int, ULTIMATE.start_main_#t~nondet12#1] 674#[thread1ENTRY, L100-3]don't care [432] L100-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre13#1_6|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|, thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_12|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_8|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_4|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_4|, thread2Thread1of1ForFork0_#t~nondet3#1=|v_thread2Thread1of1ForFork0_#t~nondet3#1_10|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_4|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_8|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~flag~0#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~nondet3#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] 676#[L100-4, thread2ENTRY, thread1ENTRY]don't care [414] thread2ENTRY-->L65-4: Formula: (= |v_thread2Thread1of1ForFork0_~flag~0#1_1| 1) InVars {} OutVars{thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~flag~0#1] 696#[L100-4, L65-4, thread1ENTRY]don't care [573] L65-4-->L65-4: Formula: (let ((.cse11 (* v_~back~0_In_1 4))) (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork0_~flag~0#1_In_1| 256) 0)) (.cse12 (+ .cse11 v_~queue~0.offset_In_3))) (let ((.cse0 (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) (.cse1 (<= 0 .cse12)) (.cse3 (select (select |v_#memory_int_In_3| v_~queue~0.base_In_3) .cse12)) (.cse4 (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0))) (.cse5 (= (+ v_~back~0_In_1 1) v_~back~0_Out_2)) (.cse6 (= (select |v_#valid_In_5| v_~queue~0.base_In_3) 1)) (.cse7 (not (= (mod |v_thread2Thread1of1ForFork0_#t~nondet3#1_In_3| 256) 0))) (.cse8 (<= (+ .cse11 v_~queue~0.offset_In_3 4) (select |v_#length_In_5| v_~queue~0.base_In_3))) (.cse9 (= (ite (= (ite .cse2 1 0) 0) 0 1) |v_thread2Thread1of1ForFork0_~flag~0#1_Out_2|)) (.cse10 (not (= (ite (and (<= 0 v_~back~0_In_1) (< v_~back~0_In_1 v_~n~0_In_3)) 1 0) 0)))) (or (and .cse0 .cse1 (not .cse2) (= |v_thread2Thread1of1ForFork0_#t~post7#1_In_1| |v_thread2Thread1of1ForFork0_#t~post7#1_Out_2|) (= (ite (= .cse3 1) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) .cse4 (= |v_thread2Thread1of1ForFork0_#t~mem6#1_Out_2| |v_thread2Thread1of1ForFork0_#t~mem6#1_In_1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse1 (= (ite (= (- 1) .cse3) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread2Thread1of1ForFork0_#t~mem4#1_In_1| |v_thread2Thread1of1ForFork0_#t~mem4#1_Out_2|) .cse4 .cse5 (= |v_thread2Thread1of1ForFork0_#t~post5#1_Out_2| |v_thread2Thread1of1ForFork0_#t~post5#1_In_1|) .cse6 .cse7 .cse8 .cse9 .cse10))))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_In_1|, ~back~0=v_~back~0_In_1, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_In_1|, thread2Thread1of1ForFork0_#t~nondet3#1=|v_thread2Thread1of1ForFork0_#t~nondet3#1_In_3|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_In_1|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_In_1|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_In_3|, #length=|v_#length_In_5|, ~n~0=v_~n~0_In_3} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_Out_2|, ~back~0=v_~back~0_Out_2, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_Out_2|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_Out_2|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_Out_2|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_Out_2|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_In_3|, #length=|v_#length_In_5|, ~n~0=v_~n~0_In_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_~flag~0#1, thread2Thread1of1ForFork0_#t~mem4#1, ~back~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~nondet3#1] 748#[L100-4, L65-4, thread1ENTRY]don't care [2022-07-26 14:15:28,489 INFO L735 eck$LassoCheckResult]: Loop: 748#[L100-4, L65-4, thread1ENTRY]don't care [573] L65-4-->L65-4: Formula: (let ((.cse11 (* v_~back~0_In_1 4))) (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork0_~flag~0#1_In_1| 256) 0)) (.cse12 (+ .cse11 v_~queue~0.offset_In_3))) (let ((.cse0 (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) (.cse1 (<= 0 .cse12)) (.cse3 (select (select |v_#memory_int_In_3| v_~queue~0.base_In_3) .cse12)) (.cse4 (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0))) (.cse5 (= (+ v_~back~0_In_1 1) v_~back~0_Out_2)) (.cse6 (= (select |v_#valid_In_5| v_~queue~0.base_In_3) 1)) (.cse7 (not (= (mod |v_thread2Thread1of1ForFork0_#t~nondet3#1_In_3| 256) 0))) (.cse8 (<= (+ .cse11 v_~queue~0.offset_In_3 4) (select |v_#length_In_5| v_~queue~0.base_In_3))) (.cse9 (= (ite (= (ite .cse2 1 0) 0) 0 1) |v_thread2Thread1of1ForFork0_~flag~0#1_Out_2|)) (.cse10 (not (= (ite (and (<= 0 v_~back~0_In_1) (< v_~back~0_In_1 v_~n~0_In_3)) 1 0) 0)))) (or (and .cse0 .cse1 (not .cse2) (= |v_thread2Thread1of1ForFork0_#t~post7#1_In_1| |v_thread2Thread1of1ForFork0_#t~post7#1_Out_2|) (= (ite (= .cse3 1) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) .cse4 (= |v_thread2Thread1of1ForFork0_#t~mem6#1_Out_2| |v_thread2Thread1of1ForFork0_#t~mem6#1_In_1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse1 (= (ite (= (- 1) .cse3) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread2Thread1of1ForFork0_#t~mem4#1_In_1| |v_thread2Thread1of1ForFork0_#t~mem4#1_Out_2|) .cse4 .cse5 (= |v_thread2Thread1of1ForFork0_#t~post5#1_Out_2| |v_thread2Thread1of1ForFork0_#t~post5#1_In_1|) .cse6 .cse7 .cse8 .cse9 .cse10))))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_In_1|, ~back~0=v_~back~0_In_1, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_In_1|, thread2Thread1of1ForFork0_#t~nondet3#1=|v_thread2Thread1of1ForFork0_#t~nondet3#1_In_3|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_In_1|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_In_1|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_In_3|, #length=|v_#length_In_5|, ~n~0=v_~n~0_In_3} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_Out_2|, ~back~0=v_~back~0_Out_2, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_Out_2|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_Out_2|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_Out_2|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_Out_2|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_In_3|, #length=|v_#length_In_5|, ~n~0=v_~n~0_In_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_~flag~0#1, thread2Thread1of1ForFork0_#t~mem4#1, ~back~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~nondet3#1] 748#[L100-4, L65-4, thread1ENTRY]don't care [2022-07-26 14:15:28,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:28,489 INFO L85 PathProgramCache]: Analyzing trace with hash 427264054, now seen corresponding path program 1 times [2022-07-26 14:15:28,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:28,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557298254] [2022-07-26 14:15:28,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:28,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:28,524 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:15:28,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:28,563 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:15:28,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:28,569 INFO L85 PathProgramCache]: Analyzing trace with hash 604, now seen corresponding path program 1 times [2022-07-26 14:15:28,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:28,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592231304] [2022-07-26 14:15:28,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:28,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:28,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:28,577 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:15:28,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:28,582 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:15:28,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:28,582 INFO L85 PathProgramCache]: Analyzing trace with hash 360284359, now seen corresponding path program 2 times [2022-07-26 14:15:28,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:28,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12229886] [2022-07-26 14:15:28,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:28,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:15:28,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:15:28,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:15:28,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12229886] [2022-07-26 14:15:28,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12229886] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-26 14:15:28,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81756006] [2022-07-26 14:15:28,648 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-26 14:15:28,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-26 14:15:28,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:28,649 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-26 14:15:28,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-26 14:15:28,708 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-26 14:15:28,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-26 14:15:28,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-26 14:15:28,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:15:28,759 INFO L356 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-07-26 14:15:28,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-07-26 14:15:28,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:15:28,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-26 14:15:29,133 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-26 14:15:29,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 315 treesize of output 267 [2022-07-26 14:15:29,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 267 treesize of output 259 [2022-07-26 14:15:29,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:15:29,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81756006] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-26 14:15:29,347 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-26 14:15:29,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 13 [2022-07-26 14:15:29,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458761041] [2022-07-26 14:15:29,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-26 14:15:29,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:15:29,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-26 14:15:29,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-07-26 14:15:29,599 INFO L87 Difference]: Start difference. First operand 38 states and 81 transitions. cyclomatic complexity: 54 Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:15:29,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:15:29,955 INFO L93 Difference]: Finished difference Result 78 states and 157 transitions. [2022-07-26 14:15:29,956 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 157 transitions. [2022-07-26 14:15:29,956 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 22 [2022-07-26 14:15:29,957 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 64 states and 130 transitions. [2022-07-26 14:15:29,957 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2022-07-26 14:15:29,957 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2022-07-26 14:15:29,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 130 transitions. [2022-07-26 14:15:29,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:15:29,958 INFO L220 hiAutomatonCegarLoop]: Abstraction has 64 states and 130 transitions. [2022-07-26 14:15:29,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 130 transitions. [2022-07-26 14:15:29,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2022-07-26 14:15:29,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 2.086206896551724) internal successors, (121), 57 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:15:29,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 121 transitions. [2022-07-26 14:15:29,960 INFO L242 hiAutomatonCegarLoop]: Abstraction has 58 states and 121 transitions. [2022-07-26 14:15:29,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-26 14:15:29,963 INFO L426 stractBuchiCegarLoop]: Abstraction has 58 states and 121 transitions. [2022-07-26 14:15:29,963 INFO L333 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-26 14:15:29,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 121 transitions. [2022-07-26 14:15:29,963 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 18 [2022-07-26 14:15:29,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:15:29,963 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:15:29,964 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:15:29,964 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 14:15:29,964 INFO L733 eck$LassoCheckResult]: Stem: 982#[ULTIMATE.startENTRY]don't care [587] ULTIMATE.startENTRY-->L115-6: Formula: (let ((.cse2 (store |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse0 (select |v_#memory_int_In_5| 1)) (.cse1 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2| 0) (= (select .cse0 1) 0) (= |v_#length_Out_6| (store (store (store |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (= (select |v_#length_In_7| 2) 25) (= 0 |v_#NULL.base_Out_2|) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= v_~element~0_Out_6 0) (= v_~queue~0.offset_Out_2 0) (= 48 (select .cse0 0)) (= v_~queue~0.base_Out_2 0) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 1) |v_#valid_Out_10|) (= (select |v_#valid_In_7| 0) 0) (= |v_#NULL.offset_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| |v_#StackHeapBarrier_In_3|) (< 0 |v_#StackHeapBarrier_In_3|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= (select |v_#valid_In_7| 2) 1) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= (select |v_#valid_In_7| 1) 1) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|) (= v_~back~0_Out_6 v_~front~0_Out_2) (= v_~n~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_7| 1)) (= v_~sum~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 0)) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| 0))))) InVars {#memory_int=|v_#memory_int_In_5|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_7|, #valid=|v_#valid_In_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ~sum~0=v_~sum~0_Out_2, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_Out_2|, #length=|v_#length_Out_6|, ~front~0=v_~front~0_Out_2, ULTIMATE.start_main_#t~ret10#1.base=|v_ULTIMATE.start_main_#t~ret10#1.base_Out_2|, ~queue~0.offset=v_~queue~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|, ULTIMATE.start_main_#t~ret10#1.offset=|v_ULTIMATE.start_main_#t~ret10#1.offset_Out_2|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_Out_2|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ~back~0=v_~back~0_Out_6, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ~queue~0.base=v_~queue~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ~element~0=v_~element~0_Out_6, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_Out_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, #valid=|v_#valid_Out_10|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet9#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ~sum~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #length, ~front~0, ULTIMATE.start_main_#t~ret10#1.base, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~ret10#1.offset, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_#res#1, ~back~0, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~element~0, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 954#[L115-6]don't care [554] L115-6-->L115-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|))) (and (<= 0 .cse0) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_28|) (= (store |v_#memory_int_89| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21| (store (select |v_#memory_int_89| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_13|)) |v_#memory_int_88|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_38|) (= (select |v_#valid_138| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) 1) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21| 4) (select |v_#length_111| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29|, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_13|, #valid=|v_#valid_138|, #memory_int=|v_#memory_int_89|, #length=|v_#length_111|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_38|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_28|, #valid=|v_#valid_138|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_13|, #memory_int=|v_#memory_int_88|, #length=|v_#length_111|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_38|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #memory_int] 956#[L115-6]don't care [563] L115-6-->L99-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre11#1_27| |v_#pthreadsForks_32|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36| |v_ULTIMATE.start_create_fresh_int_array_~size#1_48|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18| v_~queue~0.base_48) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) (= (select |v_#valid_144| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) 1) (= |v_#memory_int_94| (store |v_#memory_int_95| |v_ULTIMATE.start_main_~#t1~0#1.base_43| (store (select |v_#memory_int_95| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre11#1_27|))) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_115| |v_ULTIMATE.start_main_~#t1~0#1.base_43|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18| v_~queue~0.offset_48) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, #pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36|, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_95|, #length=|v_#length_115|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|} OutVars{ULTIMATE.start_main_#t~ret10#1.base=|v_ULTIMATE.start_main_#t~ret10#1.base_23|, ~queue~0.offset=v_~queue~0.offset_48, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_27|, ULTIMATE.start_main_#t~ret10#1.offset=|v_ULTIMATE.start_main_#t~ret10#1.offset_23|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ~queue~0.base=v_~queue~0.base_48, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18|, #pthreadsForks=|v_#pthreadsForks_31|, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_94|, #length=|v_#length_115|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret10#1.base, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~ret10#1.offset, #pthreadsForks, #memory_int, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base] 1016#[L99-3]don't care [435] L99-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_8|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_8|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_10|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_10|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~cond~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_thidvar0] 1014#[thread1ENTRY, L99-4]don't care [392] thread1ENTRY-->L57: Formula: (= (ite (= (ite (< v_~front~0_1 v_~back~0_1) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork1_~cond~0#1_1|) InVars {~back~0=v_~back~0_1, ~front~0=v_~front~0_1} OutVars{~back~0=v_~back~0_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_1|, ~front~0=v_~front~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~cond~0#1] 1012#[L57, L99-4]don't care [537] L99-4-->L100-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre13#1_17| |v_#pthreadsForks_24|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_85| |v_ULTIMATE.start_main_~#t2~0#1.base_25|)) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (store |v_#memory_int_73| |v_ULTIMATE.start_main_~#t2~0#1.base_25| (store (select |v_#memory_int_73| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre13#1_17|)) |v_#memory_int_72|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|) (= (select |v_#valid_104| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) 1)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_73|, #length=|v_#length_85|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_17|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_72|, #length=|v_#length_85|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ULTIMATE.start_main_#t~pre11#1, #memory_int, ULTIMATE.start_main_#t~nondet12#1] 1004#[L100-3, L57]don't care [432] L100-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre13#1_6|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|, thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_12|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_8|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_4|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_4|, thread2Thread1of1ForFork0_#t~nondet3#1=|v_thread2Thread1of1ForFork0_#t~nondet3#1_10|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_4|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_8|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~flag~0#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~nondet3#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] 936#[L100-4, L57, thread2ENTRY]don't care [414] thread2ENTRY-->L65-4: Formula: (= |v_thread2Thread1of1ForFork0_~flag~0#1_1| 1) InVars {} OutVars{thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~flag~0#1] 940#[L100-4, L65-4, L57]don't care [573] L65-4-->L65-4: Formula: (let ((.cse11 (* v_~back~0_In_1 4))) (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork0_~flag~0#1_In_1| 256) 0)) (.cse12 (+ .cse11 v_~queue~0.offset_In_3))) (let ((.cse0 (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) (.cse1 (<= 0 .cse12)) (.cse3 (select (select |v_#memory_int_In_3| v_~queue~0.base_In_3) .cse12)) (.cse4 (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0))) (.cse5 (= (+ v_~back~0_In_1 1) v_~back~0_Out_2)) (.cse6 (= (select |v_#valid_In_5| v_~queue~0.base_In_3) 1)) (.cse7 (not (= (mod |v_thread2Thread1of1ForFork0_#t~nondet3#1_In_3| 256) 0))) (.cse8 (<= (+ .cse11 v_~queue~0.offset_In_3 4) (select |v_#length_In_5| v_~queue~0.base_In_3))) (.cse9 (= (ite (= (ite .cse2 1 0) 0) 0 1) |v_thread2Thread1of1ForFork0_~flag~0#1_Out_2|)) (.cse10 (not (= (ite (and (<= 0 v_~back~0_In_1) (< v_~back~0_In_1 v_~n~0_In_3)) 1 0) 0)))) (or (and .cse0 .cse1 (not .cse2) (= |v_thread2Thread1of1ForFork0_#t~post7#1_In_1| |v_thread2Thread1of1ForFork0_#t~post7#1_Out_2|) (= (ite (= .cse3 1) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) .cse4 (= |v_thread2Thread1of1ForFork0_#t~mem6#1_Out_2| |v_thread2Thread1of1ForFork0_#t~mem6#1_In_1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse1 (= (ite (= (- 1) .cse3) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread2Thread1of1ForFork0_#t~mem4#1_In_1| |v_thread2Thread1of1ForFork0_#t~mem4#1_Out_2|) .cse4 .cse5 (= |v_thread2Thread1of1ForFork0_#t~post5#1_Out_2| |v_thread2Thread1of1ForFork0_#t~post5#1_In_1|) .cse6 .cse7 .cse8 .cse9 .cse10))))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_In_1|, ~back~0=v_~back~0_In_1, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_In_1|, thread2Thread1of1ForFork0_#t~nondet3#1=|v_thread2Thread1of1ForFork0_#t~nondet3#1_In_3|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_In_1|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_In_1|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_In_3|, #length=|v_#length_In_5|, ~n~0=v_~n~0_In_3} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_Out_2|, ~back~0=v_~back~0_Out_2, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_Out_2|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_Out_2|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_Out_2|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_Out_2|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_In_3|, #length=|v_#length_In_5|, ~n~0=v_~n~0_In_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_~flag~0#1, thread2Thread1of1ForFork0_#t~mem4#1, ~back~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~nondet3#1] 946#[L100-4, L65-4, L57]don't care [2022-07-26 14:15:29,964 INFO L735 eck$LassoCheckResult]: Loop: 946#[L100-4, L65-4, L57]don't care [572] L57-->L53: Formula: (let ((.cse0 (* v_~front~0_In_1 4))) (let ((.cse1 (+ v_~queue~0.offset_In_1 .cse0))) (and (<= (+ v_~queue~0.offset_In_1 .cse0 4) (select |v_#length_In_3| v_~queue~0.base_In_1)) (not (= 0 (mod |v_thread1Thread1of1ForFork1_~cond~0#1_In_3| 256))) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|) (= (select (select |v_#memory_int_In_1| v_~queue~0.base_In_1) .cse1) v_~element~0_Out_2) (= (select |v_#valid_In_3| v_~queue~0.base_In_1) 1) (<= 0 .cse1) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| (ite (and (< v_~front~0_In_1 v_~n~0_In_1) (<= 0 v_~front~0_In_1)) 1 0))))) InVars {~queue~0.offset=v_~queue~0.offset_In_1, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, ~queue~0.base=v_~queue~0.base_In_1, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_3|, ~front~0=v_~front~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_In_1, ~queue~0.base=v_~queue~0.base_In_1, ~element~0=v_~element~0_Out_2, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_Out_2|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_3|, ~front~0=v_~front~0_In_1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[~element~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 948#[L100-4, L65-4, L53]don't care [541] L53-->L57: Formula: (and (= v_~sum~0_17 (+ v_~element~0_14 v_~sum~0_18)) (= (ite (= (ite (< v_~front~0_40 v_~back~0_82) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork1_~cond~0#1_21|) (= v_~front~0_40 (+ v_~front~0_41 1))) InVars {~sum~0=v_~sum~0_18, ~element~0=v_~element~0_14, ~back~0=v_~back~0_82, ~front~0=v_~front~0_41} OutVars{~sum~0=v_~sum~0_17, thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_15|, ~element~0=v_~element~0_14, ~back~0=v_~back~0_82, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_21|, ~front~0=v_~front~0_40} AuxVars[] AssignedVars[~sum~0, thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_~cond~0#1, ~front~0] 946#[L100-4, L65-4, L57]don't care [2022-07-26 14:15:29,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:29,965 INFO L85 PathProgramCache]: Analyzing trace with hash 229514238, now seen corresponding path program 1 times [2022-07-26 14:15:29,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:29,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011593780] [2022-07-26 14:15:29,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:29,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:29,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:29,980 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:15:29,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:29,998 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:15:29,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:29,998 INFO L85 PathProgramCache]: Analyzing trace with hash 19234, now seen corresponding path program 3 times [2022-07-26 14:15:29,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:29,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377321133] [2022-07-26 14:15:29,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:29,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:30,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:30,002 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:15:30,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:30,005 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:15:30,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:30,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1519868895, now seen corresponding path program 1 times [2022-07-26 14:15:30,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:30,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970682676] [2022-07-26 14:15:30,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:30,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:30,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:15:30,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-26 14:15:30,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:15:30,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970682676] [2022-07-26 14:15:30,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970682676] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 14:15:30,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 14:15:30,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-26 14:15:30,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210333992] [2022-07-26 14:15:30,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 14:15:30,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:15:30,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-26 14:15:30,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-26 14:15:30,167 INFO L87 Difference]: Start difference. First operand 58 states and 121 transitions. cyclomatic complexity: 76 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 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-26 14:15:30,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:15:30,214 INFO L93 Difference]: Finished difference Result 72 states and 146 transitions. [2022-07-26 14:15:30,214 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 146 transitions. [2022-07-26 14:15:30,215 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 24 [2022-07-26 14:15:30,215 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 62 states and 126 transitions. [2022-07-26 14:15:30,215 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2022-07-26 14:15:30,215 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2022-07-26 14:15:30,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 126 transitions. [2022-07-26 14:15:30,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:15:30,216 INFO L220 hiAutomatonCegarLoop]: Abstraction has 62 states and 126 transitions. [2022-07-26 14:15:30,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 126 transitions. [2022-07-26 14:15:30,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2022-07-26 14:15:30,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 2.0576923076923075) internal successors, (107), 51 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:15:30,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 107 transitions. [2022-07-26 14:15:30,219 INFO L242 hiAutomatonCegarLoop]: Abstraction has 52 states and 107 transitions. [2022-07-26 14:15:30,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-26 14:15:30,220 INFO L426 stractBuchiCegarLoop]: Abstraction has 52 states and 107 transitions. [2022-07-26 14:15:30,220 INFO L333 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-26 14:15:30,220 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 107 transitions. [2022-07-26 14:15:30,221 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 20 [2022-07-26 14:15:30,221 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:15:30,221 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:15:30,221 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:15:30,221 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 14:15:30,222 INFO L733 eck$LassoCheckResult]: Stem: 1170#[ULTIMATE.startENTRY]don't care [587] ULTIMATE.startENTRY-->L115-6: Formula: (let ((.cse2 (store |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse0 (select |v_#memory_int_In_5| 1)) (.cse1 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2| 0) (= (select .cse0 1) 0) (= |v_#length_Out_6| (store (store (store |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (= (select |v_#length_In_7| 2) 25) (= 0 |v_#NULL.base_Out_2|) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= v_~element~0_Out_6 0) (= v_~queue~0.offset_Out_2 0) (= 48 (select .cse0 0)) (= v_~queue~0.base_Out_2 0) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 1) |v_#valid_Out_10|) (= (select |v_#valid_In_7| 0) 0) (= |v_#NULL.offset_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| |v_#StackHeapBarrier_In_3|) (< 0 |v_#StackHeapBarrier_In_3|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= (select |v_#valid_In_7| 2) 1) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= (select |v_#valid_In_7| 1) 1) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|) (= v_~back~0_Out_6 v_~front~0_Out_2) (= v_~n~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_7| 1)) (= v_~sum~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 0)) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| 0))))) InVars {#memory_int=|v_#memory_int_In_5|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_7|, #valid=|v_#valid_In_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ~sum~0=v_~sum~0_Out_2, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_Out_2|, #length=|v_#length_Out_6|, ~front~0=v_~front~0_Out_2, ULTIMATE.start_main_#t~ret10#1.base=|v_ULTIMATE.start_main_#t~ret10#1.base_Out_2|, ~queue~0.offset=v_~queue~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|, ULTIMATE.start_main_#t~ret10#1.offset=|v_ULTIMATE.start_main_#t~ret10#1.offset_Out_2|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_Out_2|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ~back~0=v_~back~0_Out_6, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ~queue~0.base=v_~queue~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ~element~0=v_~element~0_Out_6, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_Out_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, #valid=|v_#valid_Out_10|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet9#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ~sum~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #length, ~front~0, ULTIMATE.start_main_#t~ret10#1.base, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~ret10#1.offset, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_#res#1, ~back~0, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~element~0, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1146#[L115-6]don't care [554] L115-6-->L115-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|))) (and (<= 0 .cse0) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_28|) (= (store |v_#memory_int_89| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21| (store (select |v_#memory_int_89| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_13|)) |v_#memory_int_88|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_38|) (= (select |v_#valid_138| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) 1) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21| 4) (select |v_#length_111| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29|, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_13|, #valid=|v_#valid_138|, #memory_int=|v_#memory_int_89|, #length=|v_#length_111|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_38|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_28|, #valid=|v_#valid_138|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_13|, #memory_int=|v_#memory_int_88|, #length=|v_#length_111|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_38|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #memory_int] 1148#[L115-6]don't care [563] L115-6-->L99-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre11#1_27| |v_#pthreadsForks_32|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36| |v_ULTIMATE.start_create_fresh_int_array_~size#1_48|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18| v_~queue~0.base_48) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) (= (select |v_#valid_144| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) 1) (= |v_#memory_int_94| (store |v_#memory_int_95| |v_ULTIMATE.start_main_~#t1~0#1.base_43| (store (select |v_#memory_int_95| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre11#1_27|))) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_115| |v_ULTIMATE.start_main_~#t1~0#1.base_43|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18| v_~queue~0.offset_48) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, #pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36|, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_95|, #length=|v_#length_115|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|} OutVars{ULTIMATE.start_main_#t~ret10#1.base=|v_ULTIMATE.start_main_#t~ret10#1.base_23|, ~queue~0.offset=v_~queue~0.offset_48, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_27|, ULTIMATE.start_main_#t~ret10#1.offset=|v_ULTIMATE.start_main_#t~ret10#1.offset_23|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ~queue~0.base=v_~queue~0.base_48, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18|, #pthreadsForks=|v_#pthreadsForks_31|, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_94|, #length=|v_#length_115|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret10#1.base, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~ret10#1.offset, #pthreadsForks, #memory_int, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base] 1150#[L99-3]don't care [435] L99-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_8|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_8|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_10|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_10|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~cond~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_thidvar0] 1172#[thread1ENTRY, L99-4]don't care [537] L99-4-->L100-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre13#1_17| |v_#pthreadsForks_24|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_85| |v_ULTIMATE.start_main_~#t2~0#1.base_25|)) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (store |v_#memory_int_73| |v_ULTIMATE.start_main_~#t2~0#1.base_25| (store (select |v_#memory_int_73| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre13#1_17|)) |v_#memory_int_72|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|) (= (select |v_#valid_104| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) 1)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_73|, #length=|v_#length_85|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_17|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_72|, #length=|v_#length_85|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ULTIMATE.start_main_#t~pre11#1, #memory_int, ULTIMATE.start_main_#t~nondet12#1] 1106#[thread1ENTRY, L100-3]don't care [432] L100-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre13#1_6|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|, thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_12|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_8|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_4|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_4|, thread2Thread1of1ForFork0_#t~nondet3#1=|v_thread2Thread1of1ForFork0_#t~nondet3#1_10|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_4|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_8|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~flag~0#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~nondet3#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] 1108#[L100-4, thread2ENTRY, thread1ENTRY]don't care [414] thread2ENTRY-->L65-4: Formula: (= |v_thread2Thread1of1ForFork0_~flag~0#1_1| 1) InVars {} OutVars{thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~flag~0#1] 1128#[L100-4, L65-4, thread1ENTRY]don't care [573] L65-4-->L65-4: Formula: (let ((.cse11 (* v_~back~0_In_1 4))) (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork0_~flag~0#1_In_1| 256) 0)) (.cse12 (+ .cse11 v_~queue~0.offset_In_3))) (let ((.cse0 (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) (.cse1 (<= 0 .cse12)) (.cse3 (select (select |v_#memory_int_In_3| v_~queue~0.base_In_3) .cse12)) (.cse4 (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0))) (.cse5 (= (+ v_~back~0_In_1 1) v_~back~0_Out_2)) (.cse6 (= (select |v_#valid_In_5| v_~queue~0.base_In_3) 1)) (.cse7 (not (= (mod |v_thread2Thread1of1ForFork0_#t~nondet3#1_In_3| 256) 0))) (.cse8 (<= (+ .cse11 v_~queue~0.offset_In_3 4) (select |v_#length_In_5| v_~queue~0.base_In_3))) (.cse9 (= (ite (= (ite .cse2 1 0) 0) 0 1) |v_thread2Thread1of1ForFork0_~flag~0#1_Out_2|)) (.cse10 (not (= (ite (and (<= 0 v_~back~0_In_1) (< v_~back~0_In_1 v_~n~0_In_3)) 1 0) 0)))) (or (and .cse0 .cse1 (not .cse2) (= |v_thread2Thread1of1ForFork0_#t~post7#1_In_1| |v_thread2Thread1of1ForFork0_#t~post7#1_Out_2|) (= (ite (= .cse3 1) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) .cse4 (= |v_thread2Thread1of1ForFork0_#t~mem6#1_Out_2| |v_thread2Thread1of1ForFork0_#t~mem6#1_In_1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse1 (= (ite (= (- 1) .cse3) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread2Thread1of1ForFork0_#t~mem4#1_In_1| |v_thread2Thread1of1ForFork0_#t~mem4#1_Out_2|) .cse4 .cse5 (= |v_thread2Thread1of1ForFork0_#t~post5#1_Out_2| |v_thread2Thread1of1ForFork0_#t~post5#1_In_1|) .cse6 .cse7 .cse8 .cse9 .cse10))))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_In_1|, ~back~0=v_~back~0_In_1, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_In_1|, thread2Thread1of1ForFork0_#t~nondet3#1=|v_thread2Thread1of1ForFork0_#t~nondet3#1_In_3|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_In_1|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_In_1|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_In_3|, #length=|v_#length_In_5|, ~n~0=v_~n~0_In_3} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_Out_2|, ~back~0=v_~back~0_Out_2, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_Out_2|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_Out_2|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_Out_2|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_Out_2|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_In_3|, #length=|v_#length_In_5|, ~n~0=v_~n~0_In_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_~flag~0#1, thread2Thread1of1ForFork0_#t~mem4#1, ~back~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~nondet3#1] 1182#[L100-4, L65-4, thread1ENTRY]don't care [392] thread1ENTRY-->L57: Formula: (= (ite (= (ite (< v_~front~0_1 v_~back~0_1) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork1_~cond~0#1_1|) InVars {~back~0=v_~back~0_1, ~front~0=v_~front~0_1} OutVars{~back~0=v_~back~0_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_1|, ~front~0=v_~front~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~cond~0#1] 1206#[L100-4, L65-4, L57]don't care [2022-07-26 14:15:30,222 INFO L735 eck$LassoCheckResult]: Loop: 1206#[L100-4, L65-4, L57]don't care [572] L57-->L53: Formula: (let ((.cse0 (* v_~front~0_In_1 4))) (let ((.cse1 (+ v_~queue~0.offset_In_1 .cse0))) (and (<= (+ v_~queue~0.offset_In_1 .cse0 4) (select |v_#length_In_3| v_~queue~0.base_In_1)) (not (= 0 (mod |v_thread1Thread1of1ForFork1_~cond~0#1_In_3| 256))) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|) (= (select (select |v_#memory_int_In_1| v_~queue~0.base_In_1) .cse1) v_~element~0_Out_2) (= (select |v_#valid_In_3| v_~queue~0.base_In_1) 1) (<= 0 .cse1) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| (ite (and (< v_~front~0_In_1 v_~n~0_In_1) (<= 0 v_~front~0_In_1)) 1 0))))) InVars {~queue~0.offset=v_~queue~0.offset_In_1, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, ~queue~0.base=v_~queue~0.base_In_1, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_3|, ~front~0=v_~front~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_In_1, ~queue~0.base=v_~queue~0.base_In_1, ~element~0=v_~element~0_Out_2, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_Out_2|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_3|, ~front~0=v_~front~0_In_1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[~element~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 1208#[L100-4, L65-4, L53]don't care [541] L53-->L57: Formula: (and (= v_~sum~0_17 (+ v_~element~0_14 v_~sum~0_18)) (= (ite (= (ite (< v_~front~0_40 v_~back~0_82) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork1_~cond~0#1_21|) (= v_~front~0_40 (+ v_~front~0_41 1))) InVars {~sum~0=v_~sum~0_18, ~element~0=v_~element~0_14, ~back~0=v_~back~0_82, ~front~0=v_~front~0_41} OutVars{~sum~0=v_~sum~0_17, thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_15|, ~element~0=v_~element~0_14, ~back~0=v_~back~0_82, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_21|, ~front~0=v_~front~0_40} AuxVars[] AssignedVars[~sum~0, thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_~cond~0#1, ~front~0] 1206#[L100-4, L65-4, L57]don't care [2022-07-26 14:15:30,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:30,222 INFO L85 PathProgramCache]: Analyzing trace with hash 360284178, now seen corresponding path program 2 times [2022-07-26 14:15:30,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:30,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730749033] [2022-07-26 14:15:30,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:30,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:30,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:30,240 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:15:30,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:30,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:15:30,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:30,257 INFO L85 PathProgramCache]: Analyzing trace with hash 19234, now seen corresponding path program 4 times [2022-07-26 14:15:30,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:30,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070090614] [2022-07-26 14:15:30,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:30,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:30,261 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:15:30,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:30,264 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:15:30,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:30,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1659237645, now seen corresponding path program 2 times [2022-07-26 14:15:30,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:30,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530028792] [2022-07-26 14:15:30,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:30,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:30,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:30,284 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:15:30,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:30,301 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:15:31,531 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:15:31,531 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:15:31,531 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:15:31,531 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:15:31,531 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 14:15:31,531 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:31,531 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:15:31,531 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:15:31,531 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-channel-sum.wvr.c_BEv2_Iteration6_Lasso [2022-07-26 14:15:31,531 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:15:31,531 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:15:31,534 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:31,538 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:31,540 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:31,541 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:31,542 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:31,544 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:31,545 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:31,546 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:31,548 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:31,549 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:31,550 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:31,551 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:31,553 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:31,559 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:32,244 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:32,246 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:32,249 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:32,250 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:32,253 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:32,255 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:32,256 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:32,258 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:32,260 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:32,261 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:32,262 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:32,264 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:32,265 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:32,266 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:32,267 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:32,269 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:32,271 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:32,272 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:32,274 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:32,277 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:32,279 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:32,280 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:32,281 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:32,282 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:32,283 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:32,828 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:15:32,828 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 14:15:32,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:32,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:32,829 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:32,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-26 14:15:32,872 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:32,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:32,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:32,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:32,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:32,879 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:32,879 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:32,882 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:32,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:32,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:32,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:32,898 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:32,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-26 14:15:32,902 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:32,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:32,907 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:32,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:32,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:32,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:32,908 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:32,908 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:32,919 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:32,933 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-26 14:15:32,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:32,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:32,935 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:32,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-26 14:15:32,936 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:32,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:32,941 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:32,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:32,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:32,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:32,942 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:32,942 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:32,943 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:32,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:32,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:32,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:32,958 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:32,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-26 14:15:32,960 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:32,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:32,965 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:32,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:32,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:32,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:32,966 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:32,966 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:32,971 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:32,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:32,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:32,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:32,988 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:32,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-26 14:15:32,990 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:32,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:32,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:32,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:32,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:32,996 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:32,996 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:32,998 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:33,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:33,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:33,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:33,016 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:33,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-26 14:15:33,017 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:33,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:33,023 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:33,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:33,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:33,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:33,023 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:33,023 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:33,024 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:33,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:33,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:33,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:33,039 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:33,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-26 14:15:33,041 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:33,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:33,046 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:33,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:33,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:33,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:33,047 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:33,047 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:33,047 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:33,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-07-26 14:15:33,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:33,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:33,063 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:33,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-26 14:15:33,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-26 14:15:33,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:33,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:33,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:33,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:33,071 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:33,071 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:33,087 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:33,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:33,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:33,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:33,106 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:33,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-26 14:15:33,108 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:33,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:33,114 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:33,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:33,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:33,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:33,114 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:33,114 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:33,130 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:33,145 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-26 14:15:33,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:33,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:33,146 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:33,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-26 14:15:33,148 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:33,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:33,153 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:33,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:33,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:33,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:33,154 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:33,154 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:33,154 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:33,170 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-26 14:15:33,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:33,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:33,172 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:33,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-26 14:15:33,174 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:33,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:33,179 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:33,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:33,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:33,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:33,180 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:33,180 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:33,185 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:33,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-07-26 14:15:33,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:33,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:33,202 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:33,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-07-26 14:15:33,203 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:33,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:33,209 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:33,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:33,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:33,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:33,209 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:33,209 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:33,210 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:33,225 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-26 14:15:33,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:33,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:33,226 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:33,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-07-26 14:15:33,228 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:33,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:33,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:33,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:33,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:33,234 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:33,234 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:33,236 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:33,251 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-26 14:15:33,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:33,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:33,252 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:33,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-07-26 14:15:33,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-26 14:15:33,259 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:33,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:33,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:33,260 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:33,266 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:33,266 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:33,269 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:33,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-07-26 14:15:33,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:33,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:33,285 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:33,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-07-26 14:15:33,287 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:33,292 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:33,292 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:33,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:33,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:33,294 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:33,294 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:33,296 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:33,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:33,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:33,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:33,312 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:33,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-07-26 14:15:33,313 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:33,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:33,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:33,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:33,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:33,322 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:33,322 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:33,327 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:33,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:33,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:33,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:33,347 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:33,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-07-26 14:15:33,348 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:33,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:33,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:33,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:33,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:33,355 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:33,355 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:33,357 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:33,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:33,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:33,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:33,374 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:33,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-07-26 14:15:33,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-26 14:15:33,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:33,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:33,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:33,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:33,382 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:33,382 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:33,386 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:33,401 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-26 14:15:33,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:33,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:33,402 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:33,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-07-26 14:15:33,404 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:33,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:33,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:33,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:33,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:33,411 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:33,411 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:33,413 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:33,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-07-26 14:15:33,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:33,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:33,429 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:33,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-07-26 14:15:33,430 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:33,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:33,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:33,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:33,436 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:33,438 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:33,438 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:33,450 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:33,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:33,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:33,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:33,467 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:33,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-07-26 14:15:33,469 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:33,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:33,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:33,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:33,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:33,483 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:33,483 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:33,499 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 14:15:33,530 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2022-07-26 14:15:33,530 INFO L444 ModelExtractionUtils]: 8 out of 43 variables were initially zero. Simplification set additionally 30 variables to zero. [2022-07-26 14:15:33,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:33,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:33,538 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:33,551 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 14:15:33,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-07-26 14:15:33,568 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-26 14:15:33,568 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 14:15:33,568 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ~queue~0.base)_1, ~front~0) = 3*v_rep(select #length ~queue~0.base)_1 - 4*~front~0 Supporting invariants [-2*~back~0 + 1*v_rep(select #length ~queue~0.base)_1 >= 0] [2022-07-26 14:15:33,584 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-26 14:15:33,679 INFO L156 tatePredicateManager]: 33 out of 35 supporting invariants were superfluous and have been removed [2022-07-26 14:15:33,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:33,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:15:33,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-26 14:15:33,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:15:33,745 INFO L356 Elim1Store]: treesize reduction 37, result has 37.3 percent of original size [2022-07-26 14:15:33,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 29 [2022-07-26 14:15:33,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-26 14:15:33,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2022-07-26 14:15:33,895 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-26 14:15:33,896 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-26 14:15:33,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:15:33,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-26 14:15:33,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:15:33,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:15:33,938 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2022-07-26 14:15:33,938 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 107 transitions. cyclomatic complexity: 70 Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 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-26 14:15:33,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:34,145 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 107 transitions. cyclomatic complexity: 70. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 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 102 states and 222 transitions. Complement of second has 12 states. [2022-07-26 14:15:34,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 5 stem states 2 non-accepting loop states 2 accepting loop states [2022-07-26 14:15:34,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 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-26 14:15:34,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2022-07-26 14:15:34,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 32 transitions. Stem has 9 letters. Loop has 2 letters. [2022-07-26 14:15:34,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:15:34,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 32 transitions. Stem has 11 letters. Loop has 2 letters. [2022-07-26 14:15:34,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:15:34,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 32 transitions. Stem has 9 letters. Loop has 4 letters. [2022-07-26 14:15:34,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:15:34,148 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 222 transitions. [2022-07-26 14:15:34,149 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 16 [2022-07-26 14:15:34,149 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 65 states and 147 transitions. [2022-07-26 14:15:34,149 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2022-07-26 14:15:34,150 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2022-07-26 14:15:34,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 147 transitions. [2022-07-26 14:15:34,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:15:34,150 INFO L220 hiAutomatonCegarLoop]: Abstraction has 65 states and 147 transitions. [2022-07-26 14:15:34,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 147 transitions. [2022-07-26 14:15:34,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 39. [2022-07-26 14:15:34,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 38 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:15:34,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 82 transitions. [2022-07-26 14:15:34,152 INFO L242 hiAutomatonCegarLoop]: Abstraction has 39 states and 82 transitions. [2022-07-26 14:15:34,152 INFO L426 stractBuchiCegarLoop]: Abstraction has 39 states and 82 transitions. [2022-07-26 14:15:34,152 INFO L333 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-26 14:15:34,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 82 transitions. [2022-07-26 14:15:34,153 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 16 [2022-07-26 14:15:34,153 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:15:34,153 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:15:34,153 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:15:34,153 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:15:34,153 INFO L733 eck$LassoCheckResult]: Stem: 1593#[ULTIMATE.startENTRY]don't care [587] ULTIMATE.startENTRY-->L115-6: Formula: (let ((.cse2 (store |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse0 (select |v_#memory_int_In_5| 1)) (.cse1 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2| 0) (= (select .cse0 1) 0) (= |v_#length_Out_6| (store (store (store |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (= (select |v_#length_In_7| 2) 25) (= 0 |v_#NULL.base_Out_2|) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= v_~element~0_Out_6 0) (= v_~queue~0.offset_Out_2 0) (= 48 (select .cse0 0)) (= v_~queue~0.base_Out_2 0) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 1) |v_#valid_Out_10|) (= (select |v_#valid_In_7| 0) 0) (= |v_#NULL.offset_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| |v_#StackHeapBarrier_In_3|) (< 0 |v_#StackHeapBarrier_In_3|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= (select |v_#valid_In_7| 2) 1) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= (select |v_#valid_In_7| 1) 1) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|) (= v_~back~0_Out_6 v_~front~0_Out_2) (= v_~n~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_7| 1)) (= v_~sum~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 0)) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| 0))))) InVars {#memory_int=|v_#memory_int_In_5|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_7|, #valid=|v_#valid_In_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ~sum~0=v_~sum~0_Out_2, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_Out_2|, #length=|v_#length_Out_6|, ~front~0=v_~front~0_Out_2, ULTIMATE.start_main_#t~ret10#1.base=|v_ULTIMATE.start_main_#t~ret10#1.base_Out_2|, ~queue~0.offset=v_~queue~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|, ULTIMATE.start_main_#t~ret10#1.offset=|v_ULTIMATE.start_main_#t~ret10#1.offset_Out_2|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_Out_2|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ~back~0=v_~back~0_Out_6, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ~queue~0.base=v_~queue~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ~element~0=v_~element~0_Out_6, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_Out_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, #valid=|v_#valid_Out_10|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet9#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ~sum~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #length, ~front~0, ULTIMATE.start_main_#t~ret10#1.base, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~ret10#1.offset, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_#res#1, ~back~0, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~element~0, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1571#[L115-6]don't care [554] L115-6-->L115-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|))) (and (<= 0 .cse0) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_28|) (= (store |v_#memory_int_89| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21| (store (select |v_#memory_int_89| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_13|)) |v_#memory_int_88|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_38|) (= (select |v_#valid_138| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) 1) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21| 4) (select |v_#length_111| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29|, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_13|, #valid=|v_#valid_138|, #memory_int=|v_#memory_int_89|, #length=|v_#length_111|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_38|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_28|, #valid=|v_#valid_138|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_13|, #memory_int=|v_#memory_int_88|, #length=|v_#length_111|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_38|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #memory_int] 1573#[L115-6]don't care [554] L115-6-->L115-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|))) (and (<= 0 .cse0) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_28|) (= (store |v_#memory_int_89| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21| (store (select |v_#memory_int_89| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_13|)) |v_#memory_int_88|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_38|) (= (select |v_#valid_138| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) 1) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21| 4) (select |v_#length_111| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29|, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_13|, #valid=|v_#valid_138|, #memory_int=|v_#memory_int_89|, #length=|v_#length_111|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_38|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_28|, #valid=|v_#valid_138|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_13|, #memory_int=|v_#memory_int_88|, #length=|v_#length_111|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_38|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #memory_int] 1575#[L115-6]don't care [563] L115-6-->L99-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre11#1_27| |v_#pthreadsForks_32|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36| |v_ULTIMATE.start_create_fresh_int_array_~size#1_48|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18| v_~queue~0.base_48) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) (= (select |v_#valid_144| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) 1) (= |v_#memory_int_94| (store |v_#memory_int_95| |v_ULTIMATE.start_main_~#t1~0#1.base_43| (store (select |v_#memory_int_95| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre11#1_27|))) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_115| |v_ULTIMATE.start_main_~#t1~0#1.base_43|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18| v_~queue~0.offset_48) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, #pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36|, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_95|, #length=|v_#length_115|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|} OutVars{ULTIMATE.start_main_#t~ret10#1.base=|v_ULTIMATE.start_main_#t~ret10#1.base_23|, ~queue~0.offset=v_~queue~0.offset_48, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_27|, ULTIMATE.start_main_#t~ret10#1.offset=|v_ULTIMATE.start_main_#t~ret10#1.offset_23|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ~queue~0.base=v_~queue~0.base_48, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18|, #pthreadsForks=|v_#pthreadsForks_31|, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_94|, #length=|v_#length_115|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret10#1.base, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~ret10#1.offset, #pthreadsForks, #memory_int, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base] 1603#[L99-3]don't care [435] L99-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_8|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_8|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_10|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_10|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~cond~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_thidvar0] 1595#[thread1ENTRY, L99-4]don't care [392] thread1ENTRY-->L57: Formula: (= (ite (= (ite (< v_~front~0_1 v_~back~0_1) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork1_~cond~0#1_1|) InVars {~back~0=v_~back~0_1, ~front~0=v_~front~0_1} OutVars{~back~0=v_~back~0_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_1|, ~front~0=v_~front~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~cond~0#1] 1583#[L57, L99-4]don't care [537] L99-4-->L100-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre13#1_17| |v_#pthreadsForks_24|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_85| |v_ULTIMATE.start_main_~#t2~0#1.base_25|)) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (store |v_#memory_int_73| |v_ULTIMATE.start_main_~#t2~0#1.base_25| (store (select |v_#memory_int_73| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre13#1_17|)) |v_#memory_int_72|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|) (= (select |v_#valid_104| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) 1)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_73|, #length=|v_#length_85|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_17|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_72|, #length=|v_#length_85|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ULTIMATE.start_main_#t~pre11#1, #memory_int, ULTIMATE.start_main_#t~nondet12#1] 1535#[L100-3, L57]don't care [432] L100-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre13#1_6|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|, thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_12|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_8|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_4|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_4|, thread2Thread1of1ForFork0_#t~nondet3#1=|v_thread2Thread1of1ForFork0_#t~nondet3#1_10|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_4|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_8|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~flag~0#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~nondet3#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] 1547#[L100-4, L57, thread2ENTRY]don't care [414] thread2ENTRY-->L65-4: Formula: (= |v_thread2Thread1of1ForFork0_~flag~0#1_1| 1) InVars {} OutVars{thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~flag~0#1] 1563#[L100-4, L65-4, L57]don't care [2022-07-26 14:15:34,153 INFO L735 eck$LassoCheckResult]: Loop: 1563#[L100-4, L65-4, L57]don't care [573] L65-4-->L65-4: Formula: (let ((.cse11 (* v_~back~0_In_1 4))) (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork0_~flag~0#1_In_1| 256) 0)) (.cse12 (+ .cse11 v_~queue~0.offset_In_3))) (let ((.cse0 (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) (.cse1 (<= 0 .cse12)) (.cse3 (select (select |v_#memory_int_In_3| v_~queue~0.base_In_3) .cse12)) (.cse4 (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0))) (.cse5 (= (+ v_~back~0_In_1 1) v_~back~0_Out_2)) (.cse6 (= (select |v_#valid_In_5| v_~queue~0.base_In_3) 1)) (.cse7 (not (= (mod |v_thread2Thread1of1ForFork0_#t~nondet3#1_In_3| 256) 0))) (.cse8 (<= (+ .cse11 v_~queue~0.offset_In_3 4) (select |v_#length_In_5| v_~queue~0.base_In_3))) (.cse9 (= (ite (= (ite .cse2 1 0) 0) 0 1) |v_thread2Thread1of1ForFork0_~flag~0#1_Out_2|)) (.cse10 (not (= (ite (and (<= 0 v_~back~0_In_1) (< v_~back~0_In_1 v_~n~0_In_3)) 1 0) 0)))) (or (and .cse0 .cse1 (not .cse2) (= |v_thread2Thread1of1ForFork0_#t~post7#1_In_1| |v_thread2Thread1of1ForFork0_#t~post7#1_Out_2|) (= (ite (= .cse3 1) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) .cse4 (= |v_thread2Thread1of1ForFork0_#t~mem6#1_Out_2| |v_thread2Thread1of1ForFork0_#t~mem6#1_In_1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse1 (= (ite (= (- 1) .cse3) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread2Thread1of1ForFork0_#t~mem4#1_In_1| |v_thread2Thread1of1ForFork0_#t~mem4#1_Out_2|) .cse4 .cse5 (= |v_thread2Thread1of1ForFork0_#t~post5#1_Out_2| |v_thread2Thread1of1ForFork0_#t~post5#1_In_1|) .cse6 .cse7 .cse8 .cse9 .cse10))))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_In_1|, ~back~0=v_~back~0_In_1, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_In_1|, thread2Thread1of1ForFork0_#t~nondet3#1=|v_thread2Thread1of1ForFork0_#t~nondet3#1_In_3|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_In_1|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_In_1|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_In_3|, #length=|v_#length_In_5|, ~n~0=v_~n~0_In_3} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_Out_2|, ~back~0=v_~back~0_Out_2, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_Out_2|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_Out_2|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_Out_2|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_Out_2|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_In_3|, #length=|v_#length_In_5|, ~n~0=v_~n~0_In_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_~flag~0#1, thread2Thread1of1ForFork0_#t~mem4#1, ~back~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~nondet3#1] 1563#[L100-4, L65-4, L57]don't care [2022-07-26 14:15:34,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:34,154 INFO L85 PathProgramCache]: Analyzing trace with hash 236972745, now seen corresponding path program 1 times [2022-07-26 14:15:34,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:34,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946890578] [2022-07-26 14:15:34,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:34,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:34,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:34,164 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:15:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:34,181 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:15:34,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:34,181 INFO L85 PathProgramCache]: Analyzing trace with hash 604, now seen corresponding path program 2 times [2022-07-26 14:15:34,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:34,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256856014] [2022-07-26 14:15:34,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:34,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:34,185 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:15:34,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:34,188 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:15:34,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:34,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1243778924, now seen corresponding path program 3 times [2022-07-26 14:15:34,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:34,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834739628] [2022-07-26 14:15:34,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:34,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:34,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:34,217 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:15:34,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:34,239 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:15:35,430 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:15:35,430 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:15:35,430 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:15:35,430 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:15:35,430 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 14:15:35,430 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:35,430 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:15:35,430 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:15:35,430 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-channel-sum.wvr.c_BEv2_Iteration7_Lasso [2022-07-26 14:15:35,430 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:15:35,430 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:15:35,435 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:35,436 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:36,067 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:36,070 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:36,072 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:36,082 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:36,084 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:36,086 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:36,087 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:36,089 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:36,090 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:36,091 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:36,093 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:36,094 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:36,095 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:36,097 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:36,099 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:36,101 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:36,102 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:36,104 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:36,105 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:36,107 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:36,109 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:36,111 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:36,112 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:36,114 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:36,115 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:36,117 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:36,118 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:36,120 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:36,121 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:36,122 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:36,124 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:36,125 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:36,128 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:36,129 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:36,130 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:36,131 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:36,467 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2022-07-26 14:15:36,765 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:15:36,765 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 14:15:36,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:36,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:36,766 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:36,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-07-26 14:15:36,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-26 14:15:36,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:36,781 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:15:36,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:36,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:36,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:36,782 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:15:36,782 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:15:36,791 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:36,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:36,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:36,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:36,810 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:36,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-07-26 14:15:36,811 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:36,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:36,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:36,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:36,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:36,818 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:36,818 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:36,820 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:36,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2022-07-26 14:15:36,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:36,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:36,836 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:36,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-07-26 14:15:36,838 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:36,843 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:36,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:36,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:36,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:36,844 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:36,844 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:36,846 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:36,862 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-26 14:15:36,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:36,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:36,863 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:36,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-07-26 14:15:36,865 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:36,871 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:36,871 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:36,871 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:36,871 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:36,872 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:36,872 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:36,887 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:36,903 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-26 14:15:36,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:36,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:36,904 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:36,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-07-26 14:15:36,906 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:36,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:36,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:36,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:36,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:36,913 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:36,913 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:36,928 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:36,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:36,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:36,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:36,945 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:36,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-07-26 14:15:36,947 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:36,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:36,954 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-07-26 14:15:36,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:36,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:36,957 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-26 14:15:36,957 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:36,976 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:36,991 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-26 14:15:36,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:36,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:36,993 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:36,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-07-26 14:15:36,995 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:37,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:37,001 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:37,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:37,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:37,002 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:37,002 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:37,017 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:37,032 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-26 14:15:37,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:37,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:37,034 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:37,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-07-26 14:15:37,035 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:37,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:37,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:37,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:37,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:37,042 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:37,042 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:37,058 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:37,076 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-26 14:15:37,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:37,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:37,077 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:37,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-07-26 14:15:37,079 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:37,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:37,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:37,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:37,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:37,086 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:37,086 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:37,096 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:37,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2022-07-26 14:15:37,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:37,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:37,113 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:37,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-07-26 14:15:37,115 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:37,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:37,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:37,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:37,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:37,122 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:37,122 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:37,124 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:37,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2022-07-26 14:15:37,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:37,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:37,140 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:37,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-07-26 14:15:37,141 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:37,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:37,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:37,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:37,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:37,149 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:37,149 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:37,163 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:37,178 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-26 14:15:37,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:37,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:37,179 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:37,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-07-26 14:15:37,181 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:37,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:37,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:37,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:37,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:37,188 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:37,188 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:37,190 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:37,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2022-07-26 14:15:37,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:37,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:37,205 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:37,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-07-26 14:15:37,207 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:37,212 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:37,212 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:37,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:37,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:37,215 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:37,215 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:37,219 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:37,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2022-07-26 14:15:37,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:37,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:37,234 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:37,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-07-26 14:15:37,236 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:37,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:37,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:37,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:37,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:37,243 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:37,243 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:37,245 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:37,259 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-26 14:15:37,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:37,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:37,260 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:37,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-07-26 14:15:37,262 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:37,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:37,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:37,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:37,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:37,268 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:37,268 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:37,270 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:37,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2022-07-26 14:15:37,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:37,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:37,286 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:37,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-07-26 14:15:37,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-26 14:15:37,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:37,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:37,294 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-26 14:15:37,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:37,308 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-07-26 14:15:37,309 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-07-26 14:15:37,338 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:37,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2022-07-26 14:15:37,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:37,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:37,354 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:37,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-07-26 14:15:37,356 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:37,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:37,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:37,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:37,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:37,363 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:37,363 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:37,365 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:37,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:37,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:37,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:37,382 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:37,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-07-26 14:15:37,384 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:37,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:37,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:37,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:37,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:37,391 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:37,391 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:37,393 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:37,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:37,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:37,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:37,409 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:37,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-07-26 14:15:37,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-26 14:15:37,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:37,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:37,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:37,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:37,428 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:37,428 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:37,439 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 14:15:37,454 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2022-07-26 14:15:37,454 INFO L444 ModelExtractionUtils]: 17 out of 43 variables were initially zero. Simplification set additionally 23 variables to zero. [2022-07-26 14:15:37,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:37,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:37,455 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-26 14:15:37,456 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-26 14:15:37,457 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 14:15:37,463 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-26 14:15:37,464 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 14:15:37,464 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~back~0, ~n~0) = -1*~back~0 + 1*~n~0 Supporting invariants [] [2022-07-26 14:15:37,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2022-07-26 14:15:37,563 INFO L156 tatePredicateManager]: 34 out of 34 supporting invariants were superfluous and have been removed [2022-07-26 14:15:37,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:37,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:15:37,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 14:15:37,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:15:37,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:15:37,610 WARN L261 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-26 14:15:37,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:15:37,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:15:37,611 INFO L141 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-26 14:15:37,611 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 82 transitions. cyclomatic complexity: 56 Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:15:37,639 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 82 transitions. cyclomatic complexity: 56. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 89 states and 212 transitions. Complement of second has 4 states. [2022-07-26 14:15:37,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-26 14:15:37,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:15:37,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-07-26 14:15:37,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 9 letters. Loop has 1 letters. [2022-07-26 14:15:37,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:15:37,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 10 letters. Loop has 1 letters. [2022-07-26 14:15:37,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:15:37,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 9 letters. Loop has 2 letters. [2022-07-26 14:15:37,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:15:37,640 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 212 transitions. [2022-07-26 14:15:37,641 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-07-26 14:15:37,642 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 43 states and 95 transitions. [2022-07-26 14:15:37,642 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2022-07-26 14:15:37,642 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2022-07-26 14:15:37,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 95 transitions. [2022-07-26 14:15:37,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 14:15:37,642 INFO L220 hiAutomatonCegarLoop]: Abstraction has 43 states and 95 transitions. [2022-07-26 14:15:37,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 95 transitions. [2022-07-26 14:15:37,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2022-07-26 14:15:37,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.2941176470588234) internal successors, (78), 33 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:15:37,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 78 transitions. [2022-07-26 14:15:37,644 INFO L242 hiAutomatonCegarLoop]: Abstraction has 34 states and 78 transitions. [2022-07-26 14:15:37,644 INFO L426 stractBuchiCegarLoop]: Abstraction has 34 states and 78 transitions. [2022-07-26 14:15:37,644 INFO L333 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-26 14:15:37,644 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 78 transitions. [2022-07-26 14:15:37,644 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2022-07-26 14:15:37,644 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:15:37,644 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:15:37,644 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:15:37,645 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 14:15:37,645 INFO L733 eck$LassoCheckResult]: Stem: 1892#[ULTIMATE.startENTRY]don't care [587] ULTIMATE.startENTRY-->L115-6: Formula: (let ((.cse2 (store |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse0 (select |v_#memory_int_In_5| 1)) (.cse1 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2| 0) (= (select .cse0 1) 0) (= |v_#length_Out_6| (store (store (store |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (= (select |v_#length_In_7| 2) 25) (= 0 |v_#NULL.base_Out_2|) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= v_~element~0_Out_6 0) (= v_~queue~0.offset_Out_2 0) (= 48 (select .cse0 0)) (= v_~queue~0.base_Out_2 0) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 1) |v_#valid_Out_10|) (= (select |v_#valid_In_7| 0) 0) (= |v_#NULL.offset_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| |v_#StackHeapBarrier_In_3|) (< 0 |v_#StackHeapBarrier_In_3|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= (select |v_#valid_In_7| 2) 1) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= (select |v_#valid_In_7| 1) 1) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|) (= v_~back~0_Out_6 v_~front~0_Out_2) (= v_~n~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_7| 1)) (= v_~sum~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 0)) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| 0))))) InVars {#memory_int=|v_#memory_int_In_5|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_7|, #valid=|v_#valid_In_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ~sum~0=v_~sum~0_Out_2, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_Out_2|, #length=|v_#length_Out_6|, ~front~0=v_~front~0_Out_2, ULTIMATE.start_main_#t~ret10#1.base=|v_ULTIMATE.start_main_#t~ret10#1.base_Out_2|, ~queue~0.offset=v_~queue~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|, ULTIMATE.start_main_#t~ret10#1.offset=|v_ULTIMATE.start_main_#t~ret10#1.offset_Out_2|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_Out_2|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ~back~0=v_~back~0_Out_6, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ~queue~0.base=v_~queue~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ~element~0=v_~element~0_Out_6, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_Out_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, #valid=|v_#valid_Out_10|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet9#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ~sum~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #length, ~front~0, ULTIMATE.start_main_#t~ret10#1.base, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~ret10#1.offset, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_#res#1, ~back~0, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~element~0, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1894#[L115-6]don't care [554] L115-6-->L115-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|))) (and (<= 0 .cse0) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_28|) (= (store |v_#memory_int_89| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21| (store (select |v_#memory_int_89| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_13|)) |v_#memory_int_88|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_38|) (= (select |v_#valid_138| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) 1) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21| 4) (select |v_#length_111| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29|, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_13|, #valid=|v_#valid_138|, #memory_int=|v_#memory_int_89|, #length=|v_#length_111|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_38|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_28|, #valid=|v_#valid_138|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_13|, #memory_int=|v_#memory_int_88|, #length=|v_#length_111|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_38|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #memory_int] 1932#[L115-6]don't care [554] L115-6-->L115-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|))) (and (<= 0 .cse0) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_28|) (= (store |v_#memory_int_89| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21| (store (select |v_#memory_int_89| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_13|)) |v_#memory_int_88|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_38|) (= (select |v_#valid_138| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) 1) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21| 4) (select |v_#length_111| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29|, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_13|, #valid=|v_#valid_138|, #memory_int=|v_#memory_int_89|, #length=|v_#length_111|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_38|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_28|, #valid=|v_#valid_138|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_13|, #memory_int=|v_#memory_int_88|, #length=|v_#length_111|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_38|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #memory_int] 1934#[L115-6]don't care [563] L115-6-->L99-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre11#1_27| |v_#pthreadsForks_32|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36| |v_ULTIMATE.start_create_fresh_int_array_~size#1_48|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18| v_~queue~0.base_48) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) (= (select |v_#valid_144| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) 1) (= |v_#memory_int_94| (store |v_#memory_int_95| |v_ULTIMATE.start_main_~#t1~0#1.base_43| (store (select |v_#memory_int_95| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre11#1_27|))) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_115| |v_ULTIMATE.start_main_~#t1~0#1.base_43|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18| v_~queue~0.offset_48) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, #pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36|, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_95|, #length=|v_#length_115|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|} OutVars{ULTIMATE.start_main_#t~ret10#1.base=|v_ULTIMATE.start_main_#t~ret10#1.base_23|, ~queue~0.offset=v_~queue~0.offset_48, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_27|, ULTIMATE.start_main_#t~ret10#1.offset=|v_ULTIMATE.start_main_#t~ret10#1.offset_23|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ~queue~0.base=v_~queue~0.base_48, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18|, #pthreadsForks=|v_#pthreadsForks_31|, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_94|, #length=|v_#length_115|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret10#1.base, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~ret10#1.offset, #pthreadsForks, #memory_int, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base] 1902#[L99-3]don't care [435] L99-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_8|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_8|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_10|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_10|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~cond~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_thidvar0] 1900#[thread1ENTRY, L99-4]don't care [537] L99-4-->L100-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre13#1_17| |v_#pthreadsForks_24|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_85| |v_ULTIMATE.start_main_~#t2~0#1.base_25|)) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (store |v_#memory_int_73| |v_ULTIMATE.start_main_~#t2~0#1.base_25| (store (select |v_#memory_int_73| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre13#1_17|)) |v_#memory_int_72|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|) (= (select |v_#valid_104| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) 1)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_73|, #length=|v_#length_85|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_17|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_72|, #length=|v_#length_85|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ULTIMATE.start_main_#t~pre11#1, #memory_int, ULTIMATE.start_main_#t~nondet12#1] 1882#[thread1ENTRY, L100-3]don't care [432] L100-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre13#1_6|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|, thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_12|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_8|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_4|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_4|, thread2Thread1of1ForFork0_#t~nondet3#1=|v_thread2Thread1of1ForFork0_#t~nondet3#1_10|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_4|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_8|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~flag~0#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~nondet3#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] 1884#[L100-4, thread2ENTRY, thread1ENTRY]don't care [414] thread2ENTRY-->L65-4: Formula: (= |v_thread2Thread1of1ForFork0_~flag~0#1_1| 1) InVars {} OutVars{thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~flag~0#1] 1916#[L100-4, L65-4, thread1ENTRY]don't care [573] L65-4-->L65-4: Formula: (let ((.cse11 (* v_~back~0_In_1 4))) (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork0_~flag~0#1_In_1| 256) 0)) (.cse12 (+ .cse11 v_~queue~0.offset_In_3))) (let ((.cse0 (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) (.cse1 (<= 0 .cse12)) (.cse3 (select (select |v_#memory_int_In_3| v_~queue~0.base_In_3) .cse12)) (.cse4 (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0))) (.cse5 (= (+ v_~back~0_In_1 1) v_~back~0_Out_2)) (.cse6 (= (select |v_#valid_In_5| v_~queue~0.base_In_3) 1)) (.cse7 (not (= (mod |v_thread2Thread1of1ForFork0_#t~nondet3#1_In_3| 256) 0))) (.cse8 (<= (+ .cse11 v_~queue~0.offset_In_3 4) (select |v_#length_In_5| v_~queue~0.base_In_3))) (.cse9 (= (ite (= (ite .cse2 1 0) 0) 0 1) |v_thread2Thread1of1ForFork0_~flag~0#1_Out_2|)) (.cse10 (not (= (ite (and (<= 0 v_~back~0_In_1) (< v_~back~0_In_1 v_~n~0_In_3)) 1 0) 0)))) (or (and .cse0 .cse1 (not .cse2) (= |v_thread2Thread1of1ForFork0_#t~post7#1_In_1| |v_thread2Thread1of1ForFork0_#t~post7#1_Out_2|) (= (ite (= .cse3 1) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) .cse4 (= |v_thread2Thread1of1ForFork0_#t~mem6#1_Out_2| |v_thread2Thread1of1ForFork0_#t~mem6#1_In_1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse1 (= (ite (= (- 1) .cse3) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread2Thread1of1ForFork0_#t~mem4#1_In_1| |v_thread2Thread1of1ForFork0_#t~mem4#1_Out_2|) .cse4 .cse5 (= |v_thread2Thread1of1ForFork0_#t~post5#1_Out_2| |v_thread2Thread1of1ForFork0_#t~post5#1_In_1|) .cse6 .cse7 .cse8 .cse9 .cse10))))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_In_1|, ~back~0=v_~back~0_In_1, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_In_1|, thread2Thread1of1ForFork0_#t~nondet3#1=|v_thread2Thread1of1ForFork0_#t~nondet3#1_In_3|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_In_1|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_In_1|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_In_3|, #length=|v_#length_In_5|, ~n~0=v_~n~0_In_3} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_Out_2|, ~back~0=v_~back~0_Out_2, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_Out_2|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_Out_2|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_Out_2|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_Out_2|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_In_3|, #length=|v_#length_In_5|, ~n~0=v_~n~0_In_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_~flag~0#1, thread2Thread1of1ForFork0_#t~mem4#1, ~back~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~nondet3#1] 1942#[L100-4, L65-4, thread1ENTRY]don't care [392] thread1ENTRY-->L57: Formula: (= (ite (= (ite (< v_~front~0_1 v_~back~0_1) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork1_~cond~0#1_1|) InVars {~back~0=v_~back~0_1, ~front~0=v_~front~0_1} OutVars{~back~0=v_~back~0_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_1|, ~front~0=v_~front~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~cond~0#1] 1920#[L100-4, L65-4, L57]don't care [2022-07-26 14:15:37,645 INFO L735 eck$LassoCheckResult]: Loop: 1920#[L100-4, L65-4, L57]don't care [572] L57-->L53: Formula: (let ((.cse0 (* v_~front~0_In_1 4))) (let ((.cse1 (+ v_~queue~0.offset_In_1 .cse0))) (and (<= (+ v_~queue~0.offset_In_1 .cse0 4) (select |v_#length_In_3| v_~queue~0.base_In_1)) (not (= 0 (mod |v_thread1Thread1of1ForFork1_~cond~0#1_In_3| 256))) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|) (= (select (select |v_#memory_int_In_1| v_~queue~0.base_In_1) .cse1) v_~element~0_Out_2) (= (select |v_#valid_In_3| v_~queue~0.base_In_1) 1) (<= 0 .cse1) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| (ite (and (< v_~front~0_In_1 v_~n~0_In_1) (<= 0 v_~front~0_In_1)) 1 0))))) InVars {~queue~0.offset=v_~queue~0.offset_In_1, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, ~queue~0.base=v_~queue~0.base_In_1, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_3|, ~front~0=v_~front~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_In_1, ~queue~0.base=v_~queue~0.base_In_1, ~element~0=v_~element~0_Out_2, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_Out_2|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_3|, ~front~0=v_~front~0_In_1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[~element~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 1922#[L100-4, L65-4, L53]don't care [541] L53-->L57: Formula: (and (= v_~sum~0_17 (+ v_~element~0_14 v_~sum~0_18)) (= (ite (= (ite (< v_~front~0_40 v_~back~0_82) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork1_~cond~0#1_21|) (= v_~front~0_40 (+ v_~front~0_41 1))) InVars {~sum~0=v_~sum~0_18, ~element~0=v_~element~0_14, ~back~0=v_~back~0_82, ~front~0=v_~front~0_41} OutVars{~sum~0=v_~sum~0_17, thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_15|, ~element~0=v_~element~0_14, ~back~0=v_~back~0_82, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_21|, ~front~0=v_~front~0_40} AuxVars[] AssignedVars[~sum~0, thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_~cond~0#1, ~front~0] 1920#[L100-4, L65-4, L57]don't care [2022-07-26 14:15:37,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:37,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1113008984, now seen corresponding path program 4 times [2022-07-26 14:15:37,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:37,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626409473] [2022-07-26 14:15:37,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:37,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:37,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:37,663 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:15:37,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:37,675 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:15:37,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:37,676 INFO L85 PathProgramCache]: Analyzing trace with hash 19234, now seen corresponding path program 5 times [2022-07-26 14:15:37,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:37,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912752607] [2022-07-26 14:15:37,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:37,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:37,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:37,679 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:15:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:37,682 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:15:37,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:37,682 INFO L85 PathProgramCache]: Analyzing trace with hash -154758647, now seen corresponding path program 3 times [2022-07-26 14:15:37,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:15:37,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5460200] [2022-07-26 14:15:37,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:15:37,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:15:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:37,699 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:15:37,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:15:37,711 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:15:38,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:39,373 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:15:39,373 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:15:39,373 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:15:39,373 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:15:39,373 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 14:15:39,373 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:39,373 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:15:39,373 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:15:39,373 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-channel-sum.wvr.c_BEv2_Iteration8_Lasso [2022-07-26 14:15:39,373 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:15:39,373 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:15:39,376 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:40,029 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:40,034 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:40,036 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:40,039 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:40,040 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:40,041 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:40,042 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:40,043 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:40,045 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:40,048 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:40,050 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:40,051 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:40,052 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:40,053 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:40,055 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:40,056 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:40,058 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:40,059 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:40,060 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:40,068 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:40,070 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:40,071 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:40,073 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:40,074 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:40,075 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:40,076 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:40,078 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:40,079 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:40,081 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:40,082 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:40,085 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:40,086 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:40,088 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:40,089 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:40,090 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:40,091 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:40,092 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:40,094 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:15:40,786 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:15:40,786 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 14:15:40,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:40,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:40,787 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:40,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-07-26 14:15:40,790 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:40,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:40,795 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-07-26 14:15:40,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:40,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:40,798 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-26 14:15:40,798 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:40,805 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:40,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:40,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:40,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:40,822 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:40,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2022-07-26 14:15:40,826 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:40,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:40,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:40,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:40,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:40,833 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:40,833 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:40,834 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:40,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:40,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:40,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:40,850 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:40,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2022-07-26 14:15:40,852 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:40,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:40,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:40,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:40,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:40,858 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:40,858 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:40,860 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:40,875 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-26 14:15:40,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:40,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:40,876 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:40,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2022-07-26 14:15:40,878 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:40,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:40,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:40,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:40,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:40,884 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:40,884 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:40,886 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:40,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:40,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:40,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:40,902 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:40,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2022-07-26 14:15:40,903 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:40,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:40,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:40,909 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:40,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:40,910 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:40,910 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:40,912 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:40,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:40,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:40,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:40,928 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:40,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2022-07-26 14:15:40,930 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:40,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:40,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:40,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:40,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:40,936 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:40,936 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:40,938 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:40,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:40,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:40,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:40,954 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:40,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2022-07-26 14:15:40,957 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:40,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:40,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:40,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:40,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:40,964 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:40,964 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:40,967 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:40,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:40,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:40,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:40,983 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:40,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2022-07-26 14:15:40,985 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:40,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:40,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:40,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:40,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:40,991 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:40,991 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:40,993 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:41,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2022-07-26 14:15:41,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:41,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:41,009 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:41,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2022-07-26 14:15:41,011 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:41,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:41,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:41,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:41,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:41,018 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:41,018 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:41,020 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:41,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2022-07-26 14:15:41,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:41,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:41,035 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:41,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2022-07-26 14:15:41,037 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:41,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:41,042 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:41,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:41,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:41,043 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:41,044 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:41,045 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:41,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:41,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:41,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:41,062 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:41,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2022-07-26 14:15:41,064 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:41,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:41,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:41,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:41,069 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:41,071 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:41,071 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:41,083 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:41,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2022-07-26 14:15:41,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:41,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:41,102 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:41,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2022-07-26 14:15:41,104 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:41,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:41,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:41,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:15:41,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:41,110 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:15:41,110 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:15:41,112 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:15:41,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:41,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:41,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:41,128 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:41,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2022-07-26 14:15:41,129 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 14:15:41,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:15:41,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:15:41,135 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-26 14:15:41,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:15:41,155 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-07-26 14:15:41,155 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-07-26 14:15:41,201 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 14:15:41,286 INFO L443 ModelExtractionUtils]: Simplification made 21 calls to the SMT solver. [2022-07-26 14:15:41,286 INFO L444 ModelExtractionUtils]: 31 out of 76 variables were initially zero. Simplification set additionally 41 variables to zero. [2022-07-26 14:15:41,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:15:41,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:15:41,287 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:15:41,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2022-07-26 14:15:41,290 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 14:15:41,321 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2022-07-26 14:15:41,321 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 14:15:41,321 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~queue~0.offset, v_rep(select #length ~queue~0.base)_3, ~front~0) = -1*~queue~0.offset + 1*v_rep(select #length ~queue~0.base)_3 - 4*~front~0 Supporting invariants [] [2022-07-26 14:15:41,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2022-07-26 14:15:41,430 INFO L156 tatePredicateManager]: 34 out of 34 supporting invariants were superfluous and have been removed [2022-07-26 14:15:41,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:15:41,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:15:41,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 14:15:41,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:15:41,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:15:41,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-26 14:15:41,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:15:41,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:15:41,486 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-26 14:15:41,486 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 78 transitions. cyclomatic complexity: 53 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-26 14:15:41,513 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 78 transitions. cyclomatic complexity: 53. 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 70 states and 166 transitions. Complement of second has 6 states. [2022-07-26 14:15:41,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-26 14:15:41,514 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-26 14:15:41,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2022-07-26 14:15:41,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 10 letters. Loop has 2 letters. [2022-07-26 14:15:41,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:15:41,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 12 letters. Loop has 2 letters. [2022-07-26 14:15:41,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:15:41,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 10 letters. Loop has 4 letters. [2022-07-26 14:15:41,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:15:41,515 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 166 transitions. [2022-07-26 14:15:41,515 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-26 14:15:41,516 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 0 states and 0 transitions. [2022-07-26 14:15:41,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-26 14:15:41,516 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-26 14:15:41,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-26 14:15:41,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:15:41,516 INFO L220 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-26 14:15:41,516 INFO L242 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-26 14:15:41,516 INFO L426 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-26 14:15:41,516 INFO L333 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-26 14:15:41,516 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-26 14:15:41,516 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-26 14:15:41,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-26 14:15:41,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.07 02:15:41 BoogieIcfgContainer [2022-07-26 14:15:41,522 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-26 14:15:41,522 INFO L158 Benchmark]: Toolchain (without parser) took 20631.24ms. Allocated memory was 192.9MB in the beginning and 287.3MB in the end (delta: 94.4MB). Free memory was 141.9MB in the beginning and 169.6MB in the end (delta: -27.6MB). Peak memory consumption was 67.4MB. Max. memory is 8.0GB. [2022-07-26 14:15:41,522 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 192.9MB. Free memory was 158.4MB in the beginning and 158.2MB in the end (delta: 151.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-07-26 14:15:41,522 INFO L158 Benchmark]: CACSL2BoogieTranslator took 284.19ms. Allocated memory is still 192.9MB. Free memory was 141.8MB in the beginning and 166.5MB in the end (delta: -24.7MB). Peak memory consumption was 13.3MB. Max. memory is 8.0GB. [2022-07-26 14:15:41,522 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.16ms. Allocated memory is still 192.9MB. Free memory was 166.5MB in the beginning and 164.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-26 14:15:41,523 INFO L158 Benchmark]: Boogie Preprocessor took 29.17ms. Allocated memory is still 192.9MB. Free memory was 164.4MB in the beginning and 163.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-26 14:15:41,523 INFO L158 Benchmark]: RCFGBuilder took 470.88ms. Allocated memory is still 192.9MB. Free memory was 163.0MB in the beginning and 144.7MB in the end (delta: 18.2MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-07-26 14:15:41,523 INFO L158 Benchmark]: BuchiAutomizer took 19802.99ms. Allocated memory was 192.9MB in the beginning and 287.3MB in the end (delta: 94.4MB). Free memory was 144.7MB in the beginning and 169.6MB in the end (delta: -24.8MB). Peak memory consumption was 69.8MB. Max. memory is 8.0GB. [2022-07-26 14:15:41,524 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.09ms. Allocated memory is still 192.9MB. Free memory was 158.4MB in the beginning and 158.2MB in the end (delta: 151.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 284.19ms. Allocated memory is still 192.9MB. Free memory was 141.8MB in the beginning and 166.5MB in the end (delta: -24.7MB). Peak memory consumption was 13.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.16ms. Allocated memory is still 192.9MB. Free memory was 166.5MB in the beginning and 164.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.17ms. Allocated memory is still 192.9MB. Free memory was 164.4MB in the beginning and 163.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 470.88ms. Allocated memory is still 192.9MB. Free memory was 163.0MB in the beginning and 144.7MB in the end (delta: 18.2MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * BuchiAutomizer took 19802.99ms. Allocated memory was 192.9MB in the beginning and 287.3MB in the end (delta: 94.4MB). Free memory was 144.7MB in the beginning and 169.6MB in the end (delta: -24.8MB). Peak memory consumption was 69.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (4 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function size + -1 * i and consists of 4 locations. One deterministic module has affine ranking function -4 * front + 3 * unknown-#length-unknown[queue] and consists of 9 locations. One deterministic module has affine ranking function n + -1 * back and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[queue] + -4 * front + -1 * queue and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 19.7s and 9 iterations. TraceHistogramMax:2. Analysis of lassos took 14.2s. Construction of modules took 0.3s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 7. Minimization of nondet autom 1. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 55 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 218 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 215 mSDsluCounter, 52 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 198 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 516 IncrementalHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 18 mSDtfsCounter, 516 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital357 mio100 ax107 hnf100 lsp92 ukn68 mio100 lsp42 div125 bol100 ite100 ukn100 eq172 hnf93 smp84 dnf145 smp81 tf100 neg99 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 53ms VariablesStem: 1 VariablesLoop: 13 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 3.9s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 132 PlacesBefore, 22 PlacesAfterwards, 136 TransitionsBefore, 18 TransitionsAfterwards, 1292 CoEnabledTransitionPairs, 8 FixpointIterations, 80 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 17 TrivialYvCompositions, 11 ConcurrentYvCompositions, 8 ChoiceCompositions, 150 TotalNumberOfCompositions, 1475 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1369, positive: 1343, positive conditional: 0, positive unconditional: 1343, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 746, positive: 736, positive conditional: 0, positive unconditional: 736, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1369, positive: 607, positive conditional: 0, positive unconditional: 607, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 746, unknown conditional: 0, unknown unconditional: 746] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 24, Positive conditional cache size: 0, Positive unconditional cache size: 24, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2 RESULT: Ultimate proved your program to be correct! [2022-07-26 14:15:41,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2022-07-26 14:15:41,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-07-26 14:15:41,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...