/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/parallel-misc-1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:44:43,067 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:44:43,070 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:44:43,128 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:44:43,129 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:44:43,131 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:44:43,138 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:44:43,143 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:44:43,146 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:44:43,154 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:44:43,155 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:44:43,166 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:44:43,167 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:44:43,171 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:44:43,172 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:44:43,179 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:44:43,181 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:44:43,182 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:44:43,186 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:44:43,193 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:44:43,197 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:44:43,198 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:44:43,199 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:44:43,202 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:44:43,204 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:44:43,213 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:44:43,214 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:44:43,214 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:44:43,215 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:44:43,216 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:44:43,217 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:44:43,217 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:44:43,220 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:44:43,221 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:44:43,222 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:44:43,223 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:44:43,223 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:44:43,224 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:44:43,224 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:44:43,225 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:44:43,227 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:44:43,229 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:44:43,236 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-syntacticLbe.epf [2022-07-22 12:44:43,285 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:44:43,285 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:44:43,285 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:44:43,286 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:44:43,287 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:44:43,287 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:44:43,288 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:44:43,288 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:44:43,288 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:44:43,289 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:44:43,289 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:44:43,290 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:44:43,290 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:44:43,290 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:44:43,290 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:44:43,290 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:44:43,291 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:44:43,291 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:44:43,291 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:44:43,291 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:44:43,291 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:44:43,292 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:44:43,292 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:44:43,292 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:44:43,292 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:44:43,292 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:44:43,293 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:44:43,293 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:44:43,293 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:44:43,294 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:44:43,294 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:44:43,294 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-07-22 12:44:43,297 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:44:43,298 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-07-22 12:44:43,685 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:44:43,727 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:44:43,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:44:43,732 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:44:43,733 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:44:43,734 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c [2022-07-22 12:44:43,817 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99a0ae478/ebfb16469b8a4c1681eeba52fc2d46d7/FLAG9db2834d4 [2022-07-22 12:44:44,462 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:44:44,463 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c [2022-07-22 12:44:44,477 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99a0ae478/ebfb16469b8a4c1681eeba52fc2d46d7/FLAG9db2834d4 [2022-07-22 12:44:44,816 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99a0ae478/ebfb16469b8a4c1681eeba52fc2d46d7 [2022-07-22 12:44:44,819 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:44:44,825 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:44:44,827 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:44:44,828 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:44:44,832 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:44:44,833 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:44:44" (1/1) ... [2022-07-22 12:44:44,834 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@517de169 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:44:44, skipping insertion in model container [2022-07-22 12:44:44,835 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:44:44" (1/1) ... [2022-07-22 12:44:44,843 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:44:44,867 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:44:45,086 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/parallel-misc-1.wvr.c[2755,2768] [2022-07-22 12:44:45,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:44:45,109 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:44:45,139 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/parallel-misc-1.wvr.c[2755,2768] [2022-07-22 12:44:45,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:44:45,166 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:44:45,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:44:45 WrapperNode [2022-07-22 12:44:45,167 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:44:45,168 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:44:45,169 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:44:45,169 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:44:45,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:44:45" (1/1) ... [2022-07-22 12:44:45,191 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:44:45" (1/1) ... [2022-07-22 12:44:45,230 INFO L137 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 17, calls inlined = 31, statements flattened = 259 [2022-07-22 12:44:45,230 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:44:45,231 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:44:45,231 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:44:45,231 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:44:45,243 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:44:45" (1/1) ... [2022-07-22 12:44:45,243 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:44:45" (1/1) ... [2022-07-22 12:44:45,252 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:44:45" (1/1) ... [2022-07-22 12:44:45,252 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:44:45" (1/1) ... [2022-07-22 12:44:45,276 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:44:45" (1/1) ... [2022-07-22 12:44:45,288 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:44:45" (1/1) ... [2022-07-22 12:44:45,291 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:44:45" (1/1) ... [2022-07-22 12:44:45,296 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:44:45,297 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:44:45,298 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:44:45,298 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:44:45,299 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:44:45" (1/1) ... [2022-07-22 12:44:45,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:45,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:45,350 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:44:45,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-22 12:44:45,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:44:45,456 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 12:44:45,457 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 12:44:45,457 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 12:44:45,457 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 12:44:45,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:44:45,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:44:45,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:44:45,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 12:44:45,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:44:45,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:44:45,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:44:45,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:44:45,463 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-22 12:44:45,614 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:44:45,617 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:44:46,240 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:44:46,262 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:44:46,262 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-22 12:44:46,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:44:46 BoogieIcfgContainer [2022-07-22 12:44:46,267 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:44:46,268 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:44:46,269 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:44:46,273 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:44:46,275 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:44:46,275 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:44:44" (1/3) ... [2022-07-22 12:44:46,276 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1064d8e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:44:46, skipping insertion in model container [2022-07-22 12:44:46,277 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:44:46,277 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:44:45" (2/3) ... [2022-07-22 12:44:46,277 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1064d8e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:44:46, skipping insertion in model container [2022-07-22 12:44:46,278 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:44:46,278 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:44:46" (3/3) ... [2022-07-22 12:44:46,280 INFO L322 chiAutomizerObserver]: Analyzing ICFG parallel-misc-1.wvr.c [2022-07-22 12:44:46,530 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-22 12:44:46,581 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 356 places, 379 transitions, 774 flow [2022-07-22 12:44:46,794 INFO L129 PetriNetUnfolder]: 28/375 cut-off events. [2022-07-22 12:44:46,795 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:44:46,806 INFO L84 FinitePrefix]: Finished finitePrefix Result has 384 conditions, 375 events. 28/375 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 901 event pairs, 0 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 263. Up to 2 conditions per place. [2022-07-22 12:44:46,806 INFO L82 GeneralOperation]: Start removeDead. Operand has 356 places, 379 transitions, 774 flow [2022-07-22 12:44:46,833 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 354 places, 375 transitions, 762 flow [2022-07-22 12:44:46,837 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-07-22 12:44:46,850 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 354 places, 375 transitions, 762 flow [2022-07-22 12:44:46,853 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 354 places, 375 transitions, 762 flow [2022-07-22 12:44:46,854 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 354 places, 375 transitions, 762 flow [2022-07-22 12:44:46,954 INFO L129 PetriNetUnfolder]: 28/375 cut-off events. [2022-07-22 12:44:46,954 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:44:46,961 INFO L84 FinitePrefix]: Finished finitePrefix Result has 384 conditions, 375 events. 28/375 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 903 event pairs, 0 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 263. Up to 2 conditions per place. [2022-07-22 12:44:46,993 INFO L116 LiptonReduction]: Number of co-enabled transitions 35532 [2022-07-22 12:44:57,997 INFO L131 LiptonReduction]: Checked pairs total: 28625 [2022-07-22 12:44:57,997 INFO L133 LiptonReduction]: Total number of compositions: 448 [2022-07-22 12:44:58,023 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:44:58,023 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:44:58,023 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:44:58,024 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:44:58,024 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:44:58,024 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:44:58,024 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:44:58,025 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:44:58,027 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:44:58,063 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 17 [2022-07-22 12:44:58,064 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:44:58,064 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:44:58,071 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:44:58,071 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:44:58,071 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:44:58,071 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 26 states, but on-demand construction may add more states [2022-07-22 12:44:58,075 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 17 [2022-07-22 12:44:58,075 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:44:58,075 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:44:58,076 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:44:58,076 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:44:58,083 INFO L748 eck$LassoCheckResult]: Stem: 359#[ULTIMATE.startENTRY]don't care [1580] ULTIMATE.startENTRY-->L113-6: Formula: (let ((.cse1 (store |v_#valid_229| |v_ULTIMATE.start_main_~#t1~0#1.base_63| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_51| 1)) (.cse2 (select |v_#memory_int_161| 1))) (and (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|) 1 0) 0)) (= (select |v_#valid_229| |v_ULTIMATE.start_main_~#t1~0#1.base_63|) 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| 0)) (= |v_#NULL.base_14| 0) (= (select |v_#valid_229| 2) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_17| v_~N~0_92) (= (select |v_#valid_229| 1) 1) (= |v_#NULL.offset_14| 0) (= 2 (select |v_#length_196| 1)) (= (store (store (store |v_#length_196| |v_ULTIMATE.start_main_~#t1~0#1.base_63| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_51| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|)) |v_#length_194|) (= v_~A~0.base_113 0) (< |v_#StackHeapBarrier_41| |v_ULTIMATE.start_main_~#t1~0#1.base_63|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| |v_#StackHeapBarrier_41|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| 0)) (= |v_#valid_227| (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_56| 0) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|) 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_66| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_51|) 0) (= v_~A~0.offset_113 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_55| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_45| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_17| |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|) (= (select .cse2 1) 0) (< 0 |v_#StackHeapBarrier_41|) (= (select |v_#length_196| 2) 22) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49| 0) (= (select |v_#valid_229| 0) 0) (= 48 (select .cse2 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|) (< |v_#StackHeapBarrier_41| |v_ULTIMATE.start_main_~#t2~0#1.base_51|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_41|, #valid=|v_#valid_229|, #memory_int=|v_#memory_int_161|, #length=|v_#length_196|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49|, ~A~0.base=v_~A~0.base_113, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_34|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_45|, #NULL.offset=|v_#NULL.offset_14|, ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.offset_35|, ULTIMATE.start_create_fresh_int_array_#t~post34#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post34#1_23|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_34|, ~cap2~0=v_~cap2~0_51, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_19|, #length=|v_#length_194|, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_39|, ULTIMATE.start_create_fresh_int_array_#t~nondet35#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet35#1_26|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|, ~i~0=v_~i~0_139, ~bag2~0=v_~bag2~0_112, ~sum2~0=v_~sum2~0_101, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_66|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_30|, #StackHeapBarrier=|v_#StackHeapBarrier_41|, ~sum1~0=v_~sum1~0_111, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_32|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_35|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_21|, ~j~0=v_~j~0_125, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_39|, ULTIMATE.start_main_#t~nondet25#1=|v_ULTIMATE.start_main_#t~nondet25#1_36|, ~bag1~0=v_~bag1~0_120, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_56|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_38|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_30|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_17|, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_24|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_107|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_38|, ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_34|, ULTIMATE.start_main_#t~nondet23#1=|v_ULTIMATE.start_main_#t~nondet23#1_32|, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_29|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_34|, ~N~0=v_~N~0_92, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_63|, #NULL.base=|v_#NULL.base_14|, ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.base_35|, ~A~0.offset=v_~A~0.offset_113, #valid=|v_#valid_227|, ~cap1~0=v_~cap1~0_55, #memory_int=|v_#memory_int_161|, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_38|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_36|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_51|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.offset, ULTIMATE.start_create_fresh_int_array_#t~post34#1, ULTIMATE.start_main_#t~nondet22#1, ~cap2~0, ULTIMATE.start_main_#t~nondet30#1, #length, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet35#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~i~0, ~bag2~0, ~sum2~0, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~sum1~0, ULTIMATE.start_main_#t~nondet20#1, ULTIMATE.start_main_#t~pre27#1, ULTIMATE.start_main_#t~nondet28#1, ~j~0, ULTIMATE.start_main_#t~ret26#1.base, ULTIMATE.start_main_#t~nondet25#1, ~bag1~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_main_#t~mem31#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~mem32#1, ULTIMATE.start_main_#t~nondet23#1, ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.base, ~A~0.offset, #valid, ~cap1~0, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_#t~nondet19#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 362#[L113-6]don't care [2022-07-22 12:44:58,083 INFO L750 eck$LassoCheckResult]: Loop: 362#[L113-6]don't care [1460] L113-6-->L113-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_37| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31| .cse1))) (and (<= 0 .cse0) (= (store |v_#memory_int_88| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31| (store (select |v_#memory_int_88| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet35#1_17|)) |v_#memory_int_87|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_37| |v_ULTIMATE.start_create_fresh_int_array_~size#1_44|) (= (select |v_#valid_137| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|) 1) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31| .cse1 4) (select |v_#length_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_36| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_37| 1))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_#t~nondet35#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet35#1_17|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|, #valid=|v_#valid_137|, #memory_int=|v_#memory_int_88|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_37|, #length=|v_#length_110|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_44|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post34#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post34#1_15|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|, #valid=|v_#valid_137|, #memory_int=|v_#memory_int_87|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_36|, #length=|v_#length_110|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_44|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post34#1, ULTIMATE.start_create_fresh_int_array_#t~nondet35#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1] 362#[L113-6]don't care [2022-07-22 12:44:58,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:58,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1611, now seen corresponding path program 1 times [2022-07-22 12:44:58,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:44:58,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591272991] [2022-07-22 12:44:58,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:44:58,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:44:58,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:58,291 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:44:58,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:58,385 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:44:58,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:58,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1491, now seen corresponding path program 1 times [2022-07-22 12:44:58,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:44:58,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771203304] [2022-07-22 12:44:58,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:44:58,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:44:58,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:58,420 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:44:58,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:58,437 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:44:58,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:44:58,439 INFO L85 PathProgramCache]: Analyzing trace with hash 51401, now seen corresponding path program 1 times [2022-07-22 12:44:58,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:44:58,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173301374] [2022-07-22 12:44:58,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:44:58,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:44:58,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:58,473 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:44:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:44:58,508 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:44:58,966 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:44:58,968 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:44:58,968 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:44:58,968 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:44:58,968 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:44:58,969 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:58,969 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:44:58,969 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:44:58,969 INFO L133 ssoRankerPreferences]: Filename of dumped script: parallel-misc-1.wvr.c_BEv2_Iteration1_Lasso [2022-07-22 12:44:58,969 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:44:58,969 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:44:58,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:59,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:59,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:59,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:59,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:59,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:59,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:59,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:59,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:59,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:59,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:59,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:59,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:59,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:59,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:59,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:59,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:59,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:59,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:59,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:59,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:59,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:59,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:59,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:59,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:59,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:59,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:59,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:59,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:59,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:59,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:59,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:59,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:59,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:59,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:59,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:59,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:59,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:59,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:59,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:59,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:59,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:59,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:44:59,856 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:44:59,862 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:44:59,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:59,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:59,867 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:44:59,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-22 12:44:59,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-22 12:44:59,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:59,888 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:44:59,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:59,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:44:59,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:59,891 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:44:59,891 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:44:59,905 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:44:59,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-07-22 12:44:59,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:44:59,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:44:59,944 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:44:59,953 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:44:59,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:44:59,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:44:59,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:44:59,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:44:59,965 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:44:59,966 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:44:59,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-22 12:44:59,978 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:00,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-22 12:45:00,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:00,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:00,017 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:45:00,019 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:45:00,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:00,027 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:45:00,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:00,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:00,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:00,029 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:45:00,029 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:45:00,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-22 12:45:00,038 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:00,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-22 12:45:00,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:00,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:00,066 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:45:00,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-22 12:45:00,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:45:00,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:00,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:00,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:00,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:00,079 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:45:00,079 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:45:00,086 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:00,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-22 12:45:00,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:00,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:00,123 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:45:00,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-22 12:45:00,134 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:45:00,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:00,141 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:45:00,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:00,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:00,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:00,143 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:45:00,143 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:45:00,144 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:00,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-22 12:45:00,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:00,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:00,167 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:45:00,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-22 12:45:00,169 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:45:00,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:00,177 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:45:00,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:00,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:00,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:00,178 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:45:00,179 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:45:00,191 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:00,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-22 12:45:00,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:00,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:00,217 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:45:00,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-22 12:45:00,221 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:45:00,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:00,231 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:45:00,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:00,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:00,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:00,232 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:45:00,232 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:45:00,248 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:00,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-22 12:45:00,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:00,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:00,287 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:45:00,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-22 12:45:00,289 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:45:00,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:00,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:00,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:00,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:00,301 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:45:00,301 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:45:00,314 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:00,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-22 12:45:00,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:00,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:00,341 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:45:00,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-22 12:45:00,370 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:45:00,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:00,377 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:45:00,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:00,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:00,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:00,378 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:45:00,378 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:45:00,380 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:00,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-07-22 12:45:00,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:00,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:00,404 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:45:00,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-22 12:45:00,405 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:45:00,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:00,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:00,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:00,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:00,415 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:45:00,415 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:45:00,435 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:00,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-22 12:45:00,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:00,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:00,474 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:45:00,479 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:45:00,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:00,487 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:45:00,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:00,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:00,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:00,488 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:45:00,488 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:45:00,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-22 12:45:00,498 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:00,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-22 12:45:00,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:00,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:00,536 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:45:00,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-22 12:45:00,538 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:45:00,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:00,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:00,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:00,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:00,548 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:45:00,549 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:45:00,565 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:00,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-22 12:45:00,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:00,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:00,596 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:45:00,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-22 12:45:00,597 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:45:00,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:00,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:00,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:00,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:00,607 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:45:00,607 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:45:00,610 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:00,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-22 12:45:00,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:00,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:00,634 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:45:00,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-22 12:45:00,638 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:45:00,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:00,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:00,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:00,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:00,648 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:45:00,648 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:45:00,673 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:00,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-22 12:45:00,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:00,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:00,713 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:45:00,719 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:45:00,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:00,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:00,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:00,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:00,734 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:45:00,734 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:45:00,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-22 12:45:00,750 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:45:00,792 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2022-07-22 12:45:00,792 INFO L444 ModelExtractionUtils]: 12 out of 22 variables were initially zero. Simplification set additionally 7 variables to zero. [2022-07-22 12:45:00,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:00,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:00,796 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:45:00,803 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:45:00,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-22 12:45:00,836 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:45:00,836 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:45:00,837 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_~size#1) = -1*ULTIMATE.start_create_fresh_int_array_~i~1#1 + 1*ULTIMATE.start_create_fresh_int_array_~size#1 Supporting invariants [] [2022-07-22 12:45:00,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-22 12:45:00,944 INFO L257 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2022-07-22 12:45:00,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:45:01,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:45:01,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:45:01,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:45:01,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:45:01,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:45:01,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:45:01,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:45:01,121 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-22 12:45:01,127 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 26 states, but on-demand construction may add more states Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:45:01,177 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 26 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 28 states and 64 transitions. Complement of second has 3 states. [2022-07-22 12:45:01,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:45:01,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:45:01,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2022-07-22 12:45:01,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 1 letters. [2022-07-22 12:45:01,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:45:01,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-22 12:45:01,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:45:01,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 2 letters. [2022-07-22 12:45:01,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:45:01,191 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 64 transitions. [2022-07-22 12:45:01,194 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 16 [2022-07-22 12:45:01,200 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 22 states and 53 transitions. [2022-07-22 12:45:01,201 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-07-22 12:45:01,202 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2022-07-22 12:45:01,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 53 transitions. [2022-07-22 12:45:01,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:45:01,204 INFO L220 hiAutomatonCegarLoop]: Abstraction has 22 states and 53 transitions. [2022-07-22 12:45:01,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 53 transitions. [2022-07-22 12:45:01,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-07-22 12:45:01,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.409090909090909) internal successors, (53), 21 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:45:01,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 53 transitions. [2022-07-22 12:45:01,242 INFO L242 hiAutomatonCegarLoop]: Abstraction has 22 states and 53 transitions. [2022-07-22 12:45:01,242 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 53 transitions. [2022-07-22 12:45:01,242 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:45:01,243 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 53 transitions. [2022-07-22 12:45:01,244 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 16 [2022-07-22 12:45:01,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:45:01,244 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:45:01,245 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-22 12:45:01,245 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:45:01,245 INFO L748 eck$LassoCheckResult]: Stem: 530#[ULTIMATE.startENTRY]don't care [1580] ULTIMATE.startENTRY-->L113-6: Formula: (let ((.cse1 (store |v_#valid_229| |v_ULTIMATE.start_main_~#t1~0#1.base_63| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_51| 1)) (.cse2 (select |v_#memory_int_161| 1))) (and (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|) 1 0) 0)) (= (select |v_#valid_229| |v_ULTIMATE.start_main_~#t1~0#1.base_63|) 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| 0)) (= |v_#NULL.base_14| 0) (= (select |v_#valid_229| 2) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_17| v_~N~0_92) (= (select |v_#valid_229| 1) 1) (= |v_#NULL.offset_14| 0) (= 2 (select |v_#length_196| 1)) (= (store (store (store |v_#length_196| |v_ULTIMATE.start_main_~#t1~0#1.base_63| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_51| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|)) |v_#length_194|) (= v_~A~0.base_113 0) (< |v_#StackHeapBarrier_41| |v_ULTIMATE.start_main_~#t1~0#1.base_63|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| |v_#StackHeapBarrier_41|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| 0)) (= |v_#valid_227| (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_56| 0) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|) 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_66| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_51|) 0) (= v_~A~0.offset_113 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_55| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_45| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_17| |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|) (= (select .cse2 1) 0) (< 0 |v_#StackHeapBarrier_41|) (= (select |v_#length_196| 2) 22) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49| 0) (= (select |v_#valid_229| 0) 0) (= 48 (select .cse2 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|) (< |v_#StackHeapBarrier_41| |v_ULTIMATE.start_main_~#t2~0#1.base_51|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_41|, #valid=|v_#valid_229|, #memory_int=|v_#memory_int_161|, #length=|v_#length_196|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49|, ~A~0.base=v_~A~0.base_113, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_34|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_45|, #NULL.offset=|v_#NULL.offset_14|, ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.offset_35|, ULTIMATE.start_create_fresh_int_array_#t~post34#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post34#1_23|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_34|, ~cap2~0=v_~cap2~0_51, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_19|, #length=|v_#length_194|, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_39|, ULTIMATE.start_create_fresh_int_array_#t~nondet35#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet35#1_26|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|, ~i~0=v_~i~0_139, ~bag2~0=v_~bag2~0_112, ~sum2~0=v_~sum2~0_101, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_66|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_30|, #StackHeapBarrier=|v_#StackHeapBarrier_41|, ~sum1~0=v_~sum1~0_111, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_32|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_35|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_21|, ~j~0=v_~j~0_125, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_39|, ULTIMATE.start_main_#t~nondet25#1=|v_ULTIMATE.start_main_#t~nondet25#1_36|, ~bag1~0=v_~bag1~0_120, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_56|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_38|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_30|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_17|, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_24|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_107|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_38|, ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_34|, ULTIMATE.start_main_#t~nondet23#1=|v_ULTIMATE.start_main_#t~nondet23#1_32|, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_29|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_34|, ~N~0=v_~N~0_92, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_63|, #NULL.base=|v_#NULL.base_14|, ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.base_35|, ~A~0.offset=v_~A~0.offset_113, #valid=|v_#valid_227|, ~cap1~0=v_~cap1~0_55, #memory_int=|v_#memory_int_161|, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_38|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_36|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_51|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.offset, ULTIMATE.start_create_fresh_int_array_#t~post34#1, ULTIMATE.start_main_#t~nondet22#1, ~cap2~0, ULTIMATE.start_main_#t~nondet30#1, #length, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet35#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~i~0, ~bag2~0, ~sum2~0, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~sum1~0, ULTIMATE.start_main_#t~nondet20#1, ULTIMATE.start_main_#t~pre27#1, ULTIMATE.start_main_#t~nondet28#1, ~j~0, ULTIMATE.start_main_#t~ret26#1.base, ULTIMATE.start_main_#t~nondet25#1, ~bag1~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_main_#t~mem31#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~mem32#1, ULTIMATE.start_main_#t~nondet23#1, ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.base, ~A~0.offset, #valid, ~cap1~0, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_#t~nondet19#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 532#[L113-6]don't care [1556] L113-6-->L97-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| v_~A~0.base_Out_2) (= |v_#memory_int_Out_2| (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre27#1_Out_2|))) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre27#1_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10|) (= v_~A~0.offset_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (and (= v_~bag1~0_In_1 v_~i~0_In_3) (= v_~bag1~0_In_1 0) (= v_~bag1~0_In_1 v_~bag2~0_In_1) (= v_~sum2~0_In_1 v_~bag1~0_In_1) (= v_~bag1~0_In_1 v_~sum1~0_In_1) (= v_~j~0_In_3 v_~bag1~0_In_1)) 1 0)) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, ~j~0=v_~j~0_In_3, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ~i~0=v_~i~0_In_3, ~bag2~0=v_~bag2~0_In_1, ~bag1~0=v_~bag1~0_In_1, ~sum2~0=v_~sum2~0_In_1, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|, #pthreadsForks=|v_#pthreadsForks_In_1|, ~sum1~0=v_~sum1~0_In_1, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|} OutVars{~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, ~j~0=v_~j~0_In_3, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_Out_2|, ~bag1~0=v_~bag1~0_In_1, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3|, 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_In_1|, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10|, #length=|v_#length_In_3|, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ~i~0=v_~i~0_In_3, ~bag2~0=v_~bag2~0_In_1, ~sum2~0=v_~sum2~0_In_1, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, ~A~0.offset=v_~A~0.offset_Out_2, ~sum1~0=v_~sum1~0_In_1, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_Out_2|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret26#1.base, #memory_int, ULTIMATE.start_main_#t~pre27#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 542#[L97-3]don't care [1131] L97-3-->L46-1: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre27#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_6|} OutVars{thread1Thread1of1ForFork1_#t~post7#1=|v_thread1Thread1of1ForFork1_#t~post7#1_8|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_8|, thread1Thread1of1ForFork1_#t~ret4#1=|v_thread1Thread1of1ForFork1_#t~ret4#1_8|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_42|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_18|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_8|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_#t~ret5#1=|v_thread1Thread1of1ForFork1_#t~ret5#1_8|, thread1Thread1of1ForFork1_#t~ret2#1=|v_thread1Thread1of1ForFork1_#t~ret2#1_12|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_34|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_6|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_8|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_42|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_10|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_18|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_66|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_26|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post7#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_#t~ret4#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_#t~ret8#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_#t~ret5#1, thread1Thread1of1ForFork1_#t~ret2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 528#[L97-4, L46-1]don't care [2022-07-22 12:45:01,246 INFO L750 eck$LassoCheckResult]: Loop: 528#[L97-4, L46-1]don't care [1578] L46-1-->L46-1: Formula: false InVars {} OutVars{thread1Thread1of1ForFork1_#t~post7#1=|v_thread1Thread1of1ForFork1_#t~post7#1_43|, ~i~0=v_~i~0_135, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_35|, ~bag1~0=v_~bag1~0_116, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_199|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_87|, ~sum1~0=v_~sum1~0_109, thread1Thread1of1ForFork1_#t~ret5#1=|v_thread1Thread1of1ForFork1_#t~ret5#1_43|, thread1Thread1of1ForFork1_#t~ret2#1=|v_thread1Thread1of1ForFork1_#t~ret2#1_53|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_191|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_193|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_59|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_95|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_159|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_251|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post7#1, ~i~0, thread1Thread1of1ForFork1_#t~mem6#1, ~bag1~0, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_plus_#in~a#1, ~sum1~0, thread1Thread1of1ForFork1_#t~ret5#1, thread1Thread1of1ForFork1_#t~ret2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 528#[L97-4, L46-1]don't care [2022-07-22 12:45:01,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:45:01,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1597538, now seen corresponding path program 1 times [2022-07-22 12:45:01,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:45:01,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286213879] [2022-07-22 12:45:01,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:45:01,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:45:01,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:01,283 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:45:01,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:01,321 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:45:01,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:45:01,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1609, now seen corresponding path program 1 times [2022-07-22 12:45:01,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:45:01,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497325067] [2022-07-22 12:45:01,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:45:01,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:45:01,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:45:01,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:45:01,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:45:01,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497325067] [2022-07-22 12:45:01,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497325067] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:45:01,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:45:01,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-07-22 12:45:01,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150868640] [2022-07-22 12:45:01,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:45:01,351 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-07-22 12:45:01,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:45:01,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 12:45:01,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 12:45:01,357 INFO L87 Difference]: Start difference. First operand 22 states and 53 transitions. cyclomatic complexity: 42 Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:45:01,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:45:01,390 INFO L93 Difference]: Finished difference Result 22 states and 47 transitions. [2022-07-22 12:45:01,390 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 47 transitions. [2022-07-22 12:45:01,392 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 16 [2022-07-22 12:45:01,393 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 47 transitions. [2022-07-22 12:45:01,393 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2022-07-22 12:45:01,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2022-07-22 12:45:01,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 47 transitions. [2022-07-22 12:45:01,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:45:01,394 INFO L220 hiAutomatonCegarLoop]: Abstraction has 22 states and 47 transitions. [2022-07-22 12:45:01,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 47 transitions. [2022-07-22 12:45:01,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-07-22 12:45:01,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 21 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:45:01,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 47 transitions. [2022-07-22 12:45:01,398 INFO L242 hiAutomatonCegarLoop]: Abstraction has 22 states and 47 transitions. [2022-07-22 12:45:01,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 12:45:01,400 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 47 transitions. [2022-07-22 12:45:01,400 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:45:01,400 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 47 transitions. [2022-07-22 12:45:01,401 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 16 [2022-07-22 12:45:01,401 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:45:01,401 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:45:01,402 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-22 12:45:01,402 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:45:01,403 INFO L748 eck$LassoCheckResult]: Stem: 601#[ULTIMATE.startENTRY]don't care [1580] ULTIMATE.startENTRY-->L113-6: Formula: (let ((.cse1 (store |v_#valid_229| |v_ULTIMATE.start_main_~#t1~0#1.base_63| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_51| 1)) (.cse2 (select |v_#memory_int_161| 1))) (and (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|) 1 0) 0)) (= (select |v_#valid_229| |v_ULTIMATE.start_main_~#t1~0#1.base_63|) 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| 0)) (= |v_#NULL.base_14| 0) (= (select |v_#valid_229| 2) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_17| v_~N~0_92) (= (select |v_#valid_229| 1) 1) (= |v_#NULL.offset_14| 0) (= 2 (select |v_#length_196| 1)) (= (store (store (store |v_#length_196| |v_ULTIMATE.start_main_~#t1~0#1.base_63| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_51| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|)) |v_#length_194|) (= v_~A~0.base_113 0) (< |v_#StackHeapBarrier_41| |v_ULTIMATE.start_main_~#t1~0#1.base_63|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| |v_#StackHeapBarrier_41|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| 0)) (= |v_#valid_227| (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_56| 0) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|) 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_66| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_51|) 0) (= v_~A~0.offset_113 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_55| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_45| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_17| |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|) (= (select .cse2 1) 0) (< 0 |v_#StackHeapBarrier_41|) (= (select |v_#length_196| 2) 22) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49| 0) (= (select |v_#valid_229| 0) 0) (= 48 (select .cse2 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|) (< |v_#StackHeapBarrier_41| |v_ULTIMATE.start_main_~#t2~0#1.base_51|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_41|, #valid=|v_#valid_229|, #memory_int=|v_#memory_int_161|, #length=|v_#length_196|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49|, ~A~0.base=v_~A~0.base_113, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_34|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_45|, #NULL.offset=|v_#NULL.offset_14|, ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.offset_35|, ULTIMATE.start_create_fresh_int_array_#t~post34#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post34#1_23|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_34|, ~cap2~0=v_~cap2~0_51, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_19|, #length=|v_#length_194|, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_39|, ULTIMATE.start_create_fresh_int_array_#t~nondet35#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet35#1_26|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|, ~i~0=v_~i~0_139, ~bag2~0=v_~bag2~0_112, ~sum2~0=v_~sum2~0_101, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_66|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_30|, #StackHeapBarrier=|v_#StackHeapBarrier_41|, ~sum1~0=v_~sum1~0_111, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_32|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_35|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_21|, ~j~0=v_~j~0_125, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_39|, ULTIMATE.start_main_#t~nondet25#1=|v_ULTIMATE.start_main_#t~nondet25#1_36|, ~bag1~0=v_~bag1~0_120, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_56|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_38|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_30|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_17|, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_24|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_107|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_38|, ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_34|, ULTIMATE.start_main_#t~nondet23#1=|v_ULTIMATE.start_main_#t~nondet23#1_32|, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_29|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_34|, ~N~0=v_~N~0_92, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_63|, #NULL.base=|v_#NULL.base_14|, ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.base_35|, ~A~0.offset=v_~A~0.offset_113, #valid=|v_#valid_227|, ~cap1~0=v_~cap1~0_55, #memory_int=|v_#memory_int_161|, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_38|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_36|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_51|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.offset, ULTIMATE.start_create_fresh_int_array_#t~post34#1, ULTIMATE.start_main_#t~nondet22#1, ~cap2~0, ULTIMATE.start_main_#t~nondet30#1, #length, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet35#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~i~0, ~bag2~0, ~sum2~0, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~sum1~0, ULTIMATE.start_main_#t~nondet20#1, ULTIMATE.start_main_#t~pre27#1, ULTIMATE.start_main_#t~nondet28#1, ~j~0, ULTIMATE.start_main_#t~ret26#1.base, ULTIMATE.start_main_#t~nondet25#1, ~bag1~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_main_#t~mem31#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~mem32#1, ULTIMATE.start_main_#t~nondet23#1, ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.base, ~A~0.offset, #valid, ~cap1~0, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_#t~nondet19#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 603#[L113-6]don't care [1556] L113-6-->L97-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| v_~A~0.base_Out_2) (= |v_#memory_int_Out_2| (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre27#1_Out_2|))) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre27#1_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10|) (= v_~A~0.offset_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (and (= v_~bag1~0_In_1 v_~i~0_In_3) (= v_~bag1~0_In_1 0) (= v_~bag1~0_In_1 v_~bag2~0_In_1) (= v_~sum2~0_In_1 v_~bag1~0_In_1) (= v_~bag1~0_In_1 v_~sum1~0_In_1) (= v_~j~0_In_3 v_~bag1~0_In_1)) 1 0)) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, ~j~0=v_~j~0_In_3, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ~i~0=v_~i~0_In_3, ~bag2~0=v_~bag2~0_In_1, ~bag1~0=v_~bag1~0_In_1, ~sum2~0=v_~sum2~0_In_1, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|, #pthreadsForks=|v_#pthreadsForks_In_1|, ~sum1~0=v_~sum1~0_In_1, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|} OutVars{~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, ~j~0=v_~j~0_In_3, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_Out_2|, ~bag1~0=v_~bag1~0_In_1, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3|, 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_In_1|, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10|, #length=|v_#length_In_3|, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ~i~0=v_~i~0_In_3, ~bag2~0=v_~bag2~0_In_1, ~sum2~0=v_~sum2~0_In_1, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, ~A~0.offset=v_~A~0.offset_Out_2, ~sum1~0=v_~sum1~0_In_1, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_Out_2|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret26#1.base, #memory_int, ULTIMATE.start_main_#t~pre27#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 613#[L97-3]don't care [1131] L97-3-->L46-1: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre27#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_6|} OutVars{thread1Thread1of1ForFork1_#t~post7#1=|v_thread1Thread1of1ForFork1_#t~post7#1_8|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_8|, thread1Thread1of1ForFork1_#t~ret4#1=|v_thread1Thread1of1ForFork1_#t~ret4#1_8|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_42|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_18|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_8|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_#t~ret5#1=|v_thread1Thread1of1ForFork1_#t~ret5#1_8|, thread1Thread1of1ForFork1_#t~ret2#1=|v_thread1Thread1of1ForFork1_#t~ret2#1_12|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_34|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_6|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_8|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_42|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_10|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_18|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_66|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_26|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post7#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_#t~ret4#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_#t~ret8#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_#t~ret5#1, thread1Thread1of1ForFork1_#t~ret2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 599#[L97-4, L46-1]don't care [2022-07-22 12:45:01,403 INFO L750 eck$LassoCheckResult]: Loop: 599#[L97-4, L46-1]don't care [1575] L46-1-->L122-1: Formula: (let ((.cse0 (* v_~i~0_In_9 4))) (let ((.cse2 (+ |v_thread1Thread1of1ForFork1_plus_~b#1_Out_10| |v_thread1Thread1of1ForFork1_plus_~a#1_Out_10|)) (.cse1 (+ .cse0 v_~A~0.offset_In_5))) (and (= |v_thread1Thread1of1ForFork1_plus_~b#1_Out_10| |v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_10|) (<= (+ .cse0 v_~A~0.offset_In_5 4) (select |v_#length_In_9| v_~A~0.base_In_5)) (= (select |v_#valid_In_9| v_~A~0.base_In_5) 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_22| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_14|) (= v_~bag1~0_In_7 |v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_10|) (< v_~i~0_In_9 v_~N~0_In_7) (= |v_thread1Thread1of1ForFork1_#t~mem1#1_Out_6| |v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_10|) (<= 0 .cse1) (= |v_thread1Thread1of1ForFork1_plus_#res#1_Out_18| .cse2) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_22| 0)) (= (ite (or (<= |v_thread1Thread1of1ForFork1_plus_~b#1_Out_10| 0) (<= .cse2 2147483647)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_14|) (not (= (ite (or (<= 0 |v_thread1Thread1of1ForFork1_plus_~b#1_Out_10|) (<= 0 (+ |v_thread1Thread1of1ForFork1_plus_~b#1_Out_10| |v_thread1Thread1of1ForFork1_plus_~a#1_Out_10| 2147483648))) 1 0) 0)) (= (select (select |v_#memory_int_In_7| v_~A~0.base_In_5) .cse1) |v_thread1Thread1of1ForFork1_#t~mem1#1_Out_6|) (= |v_thread1Thread1of1ForFork1_plus_~a#1_Out_10| |v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_10|)))) InVars {~A~0.base=v_~A~0.base_In_5, ~A~0.offset=v_~A~0.offset_In_5, ~i~0=v_~i~0_In_9, #valid=|v_#valid_In_9|, ~bag1~0=v_~bag1~0_In_7, #memory_int=|v_#memory_int_In_7|, #length=|v_#length_In_9|, ~N~0=v_~N~0_In_7} OutVars{~A~0.base=v_~A~0.base_In_5, ~i~0=v_~i~0_In_9, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_Out_10|, ~bag1~0=v_~bag1~0_In_7, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_10|, ~N~0=v_~N~0_In_7, ~A~0.offset=v_~A~0.offset_In_5, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_14|, #valid=|v_#valid_In_9|, #memory_int=|v_#memory_int_In_7|, #length=|v_#length_In_9|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_Out_10|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_Out_6|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_10|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_Out_18|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_22|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 595#[L122-1, L97-4]don't care [1574] L122-1-->L46-1: Formula: (let ((.cse14 (* v_~i~0_In_7 4))) (let ((.cse13 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_Out_6| |v_thread1Thread1of1ForFork1_plus_~b#1_Out_6|)) (.cse12 (+ v_~A~0.offset_In_3 .cse14))) (let ((.cse0 (<= (+ v_~A~0.offset_In_3 .cse14 4) (select |v_#length_In_7| v_~A~0.base_In_3))) (.cse4 (select (select |v_#memory_int_In_5| v_~A~0.base_In_3) .cse12)) (.cse1 (= |v_thread1Thread1of1ForFork1_plus_#res#1_Out_14| .cse13)) (.cse2 (not (= (ite (or (<= 0 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_Out_6| 2147483648 |v_thread1Thread1of1ForFork1_plus_~b#1_Out_6|)) (<= 0 |v_thread1Thread1of1ForFork1_plus_~b#1_Out_6|)) 1 0) 0))) (.cse3 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10| (ite (or (<= |v_thread1Thread1of1ForFork1_plus_~b#1_Out_6| 0) (<= .cse13 2147483647)) 1 0))) (.cse5 (= (select |v_#valid_In_7| v_~A~0.base_In_3) 1)) (.cse6 (= v_~i~0_Out_2 (+ v_~i~0_In_7 1))) (.cse7 (= |v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_6| |v_thread1Thread1of1ForFork1_plus_~b#1_Out_6|)) (.cse8 (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_18| 0))) (.cse9 (<= 0 .cse12)) (.cse10 (= |v_thread1Thread1of1ForFork1_plus_~a#1_Out_6| |v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_6|)) (.cse11 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_18| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|))) (or (and .cse0 .cse1 (= |v_thread1Thread1of1ForFork1_#t~ret5#1_In_1| |v_thread1Thread1of1ForFork1_#t~ret5#1_Out_2|) (= |v_thread1Thread1of1ForFork1_plus_#res#1_Out_14| v_~bag1~0_Out_2) .cse2 (= v_~sum1~0_Out_6 v_~sum1~0_In_5) .cse3 (< |v_thread1Thread1of1ForFork1_plus_#res#1_In_1| v_~cap1~0_In_1) (= |v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_6| .cse4) .cse5 (= |v_thread1Thread1of1ForFork1_#t~mem6#1_In_1| |v_thread1Thread1of1ForFork1_#t~mem6#1_Out_2|) .cse6 .cse7 (= v_~bag1~0_In_5 |v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_6|) .cse8 .cse9 .cse10 .cse11) (and (= |v_thread1Thread1of1ForFork1_#t~ret4#1_In_1| |v_thread1Thread1of1ForFork1_#t~ret4#1_Out_2|) .cse0 (= .cse4 v_~bag1~0_Out_2) .cse1 .cse2 .cse3 (<= v_~cap1~0_In_1 |v_thread1Thread1of1ForFork1_plus_#res#1_In_1|) (= |v_thread1Thread1of1ForFork1_plus_#res#1_Out_14| v_~sum1~0_Out_6) .cse5 (= |v_thread1Thread1of1ForFork1_#t~mem3#1_Out_2| |v_thread1Thread1of1ForFork1_#t~mem3#1_In_1|) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_6| v_~bag1~0_In_5) (= |v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_6| v_~sum1~0_In_5)))))) InVars {~A~0.base=v_~A~0.base_In_3, ~i~0=v_~i~0_In_7, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_In_1|, thread1Thread1of1ForFork1_#t~ret4#1=|v_thread1Thread1of1ForFork1_#t~ret4#1_In_1|, ~bag1~0=v_~bag1~0_In_5, ~A~0.offset=v_~A~0.offset_In_3, ~sum1~0=v_~sum1~0_In_5, thread1Thread1of1ForFork1_#t~ret5#1=|v_thread1Thread1of1ForFork1_#t~ret5#1_In_1|, #valid=|v_#valid_In_7|, ~cap1~0=v_~cap1~0_In_1, #memory_int=|v_#memory_int_In_5|, #length=|v_#length_In_7|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_In_1|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_In_1|} OutVars{thread1Thread1of1ForFork1_#t~post7#1=|v_thread1Thread1of1ForFork1_#t~post7#1_Out_2|, ~A~0.base=v_~A~0.base_In_3, ~i~0=v_~i~0_Out_2, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_Out_2|, thread1Thread1of1ForFork1_#t~ret4#1=|v_thread1Thread1of1ForFork1_#t~ret4#1_Out_2|, ~bag1~0=v_~bag1~0_Out_2, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_Out_6|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_6|, ~A~0.offset=v_~A~0.offset_In_3, ~sum1~0=v_~sum1~0_Out_6, thread1Thread1of1ForFork1_#t~ret5#1=|v_thread1Thread1of1ForFork1_#t~ret5#1_Out_2|, thread1Thread1of1ForFork1_#t~ret2#1=|v_thread1Thread1of1ForFork1_#t~ret2#1_Out_2|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|, #valid=|v_#valid_In_7|, ~cap1~0=v_~cap1~0_In_1, #memory_int=|v_#memory_int_In_5|, #length=|v_#length_In_7|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_Out_2|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_Out_6|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_Out_2|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_6|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_Out_14|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_18|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post7#1, ~i~0, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_#t~ret4#1, ~bag1~0, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_plus_#in~a#1, ~sum1~0, thread1Thread1of1ForFork1_#t~ret5#1, thread1Thread1of1ForFork1_#t~ret2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 599#[L97-4, L46-1]don't care [2022-07-22 12:45:01,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:45:01,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1597538, now seen corresponding path program 2 times [2022-07-22 12:45:01,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:45:01,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924599552] [2022-07-22 12:45:01,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:45:01,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:45:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:01,432 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:45:01,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:01,467 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:45:01,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:45:01,468 INFO L85 PathProgramCache]: Analyzing trace with hash 51360, now seen corresponding path program 1 times [2022-07-22 12:45:01,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:45:01,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689688021] [2022-07-22 12:45:01,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:45:01,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:45:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:01,492 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:45:01,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:01,511 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:45:01,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:45:01,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1535284417, now seen corresponding path program 1 times [2022-07-22 12:45:01,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:45:01,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642336993] [2022-07-22 12:45:01,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:45:01,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:45:01,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:45:01,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:45:01,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:45:01,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642336993] [2022-07-22 12:45:01,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642336993] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:45:01,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:45:01,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 12:45:01,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815221007] [2022-07-22 12:45:01,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:45:02,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:45:02,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 12:45:02,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 12:45:02,528 INFO L87 Difference]: Start difference. First operand 22 states and 47 transitions. cyclomatic complexity: 36 Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:45:02,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:45:02,609 INFO L93 Difference]: Finished difference Result 35 states and 63 transitions. [2022-07-22 12:45:02,609 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 63 transitions. [2022-07-22 12:45:02,611 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 16 [2022-07-22 12:45:02,611 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 22 states and 46 transitions. [2022-07-22 12:45:02,611 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2022-07-22 12:45:02,612 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2022-07-22 12:45:02,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 46 transitions. [2022-07-22 12:45:02,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:45:02,612 INFO L220 hiAutomatonCegarLoop]: Abstraction has 22 states and 46 transitions. [2022-07-22 12:45:02,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 46 transitions. [2022-07-22 12:45:02,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-07-22 12:45:02,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 21 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:45:02,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 46 transitions. [2022-07-22 12:45:02,616 INFO L242 hiAutomatonCegarLoop]: Abstraction has 22 states and 46 transitions. [2022-07-22 12:45:02,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 12:45:02,617 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 46 transitions. [2022-07-22 12:45:02,617 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 12:45:02,617 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 46 transitions. [2022-07-22 12:45:02,618 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 16 [2022-07-22 12:45:02,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:45:02,619 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:45:02,619 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 12:45:02,619 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:45:02,620 INFO L748 eck$LassoCheckResult]: Stem: 691#[ULTIMATE.startENTRY]don't care [1580] ULTIMATE.startENTRY-->L113-6: Formula: (let ((.cse1 (store |v_#valid_229| |v_ULTIMATE.start_main_~#t1~0#1.base_63| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_51| 1)) (.cse2 (select |v_#memory_int_161| 1))) (and (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|) 1 0) 0)) (= (select |v_#valid_229| |v_ULTIMATE.start_main_~#t1~0#1.base_63|) 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| 0)) (= |v_#NULL.base_14| 0) (= (select |v_#valid_229| 2) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_17| v_~N~0_92) (= (select |v_#valid_229| 1) 1) (= |v_#NULL.offset_14| 0) (= 2 (select |v_#length_196| 1)) (= (store (store (store |v_#length_196| |v_ULTIMATE.start_main_~#t1~0#1.base_63| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_51| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|)) |v_#length_194|) (= v_~A~0.base_113 0) (< |v_#StackHeapBarrier_41| |v_ULTIMATE.start_main_~#t1~0#1.base_63|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| |v_#StackHeapBarrier_41|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| 0)) (= |v_#valid_227| (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_56| 0) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|) 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_66| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_51|) 0) (= v_~A~0.offset_113 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_55| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_45| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_17| |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|) (= (select .cse2 1) 0) (< 0 |v_#StackHeapBarrier_41|) (= (select |v_#length_196| 2) 22) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49| 0) (= (select |v_#valid_229| 0) 0) (= 48 (select .cse2 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|) (< |v_#StackHeapBarrier_41| |v_ULTIMATE.start_main_~#t2~0#1.base_51|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_41|, #valid=|v_#valid_229|, #memory_int=|v_#memory_int_161|, #length=|v_#length_196|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49|, ~A~0.base=v_~A~0.base_113, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_34|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_45|, #NULL.offset=|v_#NULL.offset_14|, ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.offset_35|, ULTIMATE.start_create_fresh_int_array_#t~post34#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post34#1_23|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_34|, ~cap2~0=v_~cap2~0_51, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_19|, #length=|v_#length_194|, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_39|, ULTIMATE.start_create_fresh_int_array_#t~nondet35#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet35#1_26|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|, ~i~0=v_~i~0_139, ~bag2~0=v_~bag2~0_112, ~sum2~0=v_~sum2~0_101, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_66|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_30|, #StackHeapBarrier=|v_#StackHeapBarrier_41|, ~sum1~0=v_~sum1~0_111, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_32|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_35|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_21|, ~j~0=v_~j~0_125, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_39|, ULTIMATE.start_main_#t~nondet25#1=|v_ULTIMATE.start_main_#t~nondet25#1_36|, ~bag1~0=v_~bag1~0_120, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_56|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_38|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_30|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_17|, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_24|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_107|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_38|, ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_34|, ULTIMATE.start_main_#t~nondet23#1=|v_ULTIMATE.start_main_#t~nondet23#1_32|, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_29|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_34|, ~N~0=v_~N~0_92, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_63|, #NULL.base=|v_#NULL.base_14|, ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.base_35|, ~A~0.offset=v_~A~0.offset_113, #valid=|v_#valid_227|, ~cap1~0=v_~cap1~0_55, #memory_int=|v_#memory_int_161|, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_38|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_36|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_51|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.offset, ULTIMATE.start_create_fresh_int_array_#t~post34#1, ULTIMATE.start_main_#t~nondet22#1, ~cap2~0, ULTIMATE.start_main_#t~nondet30#1, #length, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet35#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~i~0, ~bag2~0, ~sum2~0, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~sum1~0, ULTIMATE.start_main_#t~nondet20#1, ULTIMATE.start_main_#t~pre27#1, ULTIMATE.start_main_#t~nondet28#1, ~j~0, ULTIMATE.start_main_#t~ret26#1.base, ULTIMATE.start_main_#t~nondet25#1, ~bag1~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_main_#t~mem31#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~mem32#1, ULTIMATE.start_main_#t~nondet23#1, ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.base, ~A~0.offset, #valid, ~cap1~0, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_#t~nondet19#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 693#[L113-6]don't care [1460] L113-6-->L113-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_37| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31| .cse1))) (and (<= 0 .cse0) (= (store |v_#memory_int_88| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31| (store (select |v_#memory_int_88| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet35#1_17|)) |v_#memory_int_87|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_37| |v_ULTIMATE.start_create_fresh_int_array_~size#1_44|) (= (select |v_#valid_137| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|) 1) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31| .cse1 4) (select |v_#length_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_36| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_37| 1))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_#t~nondet35#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet35#1_17|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|, #valid=|v_#valid_137|, #memory_int=|v_#memory_int_88|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_37|, #length=|v_#length_110|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_44|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post34#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post34#1_15|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|, #valid=|v_#valid_137|, #memory_int=|v_#memory_int_87|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_36|, #length=|v_#length_110|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_44|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post34#1, ULTIMATE.start_create_fresh_int_array_#t~nondet35#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1] 723#[L113-6]don't care [1556] L113-6-->L97-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| v_~A~0.base_Out_2) (= |v_#memory_int_Out_2| (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre27#1_Out_2|))) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre27#1_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10|) (= v_~A~0.offset_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (and (= v_~bag1~0_In_1 v_~i~0_In_3) (= v_~bag1~0_In_1 0) (= v_~bag1~0_In_1 v_~bag2~0_In_1) (= v_~sum2~0_In_1 v_~bag1~0_In_1) (= v_~bag1~0_In_1 v_~sum1~0_In_1) (= v_~j~0_In_3 v_~bag1~0_In_1)) 1 0)) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, ~j~0=v_~j~0_In_3, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ~i~0=v_~i~0_In_3, ~bag2~0=v_~bag2~0_In_1, ~bag1~0=v_~bag1~0_In_1, ~sum2~0=v_~sum2~0_In_1, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|, #pthreadsForks=|v_#pthreadsForks_In_1|, ~sum1~0=v_~sum1~0_In_1, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|} OutVars{~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, ~j~0=v_~j~0_In_3, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_Out_2|, ~bag1~0=v_~bag1~0_In_1, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3|, 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_In_1|, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10|, #length=|v_#length_In_3|, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ~i~0=v_~i~0_In_3, ~bag2~0=v_~bag2~0_In_1, ~sum2~0=v_~sum2~0_In_1, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, ~A~0.offset=v_~A~0.offset_Out_2, ~sum1~0=v_~sum1~0_In_1, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_Out_2|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret26#1.base, #memory_int, ULTIMATE.start_main_#t~pre27#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 703#[L97-3]don't care [1131] L97-3-->L46-1: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre27#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_6|} OutVars{thread1Thread1of1ForFork1_#t~post7#1=|v_thread1Thread1of1ForFork1_#t~post7#1_8|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_8|, thread1Thread1of1ForFork1_#t~ret4#1=|v_thread1Thread1of1ForFork1_#t~ret4#1_8|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_42|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_18|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_8|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_#t~ret5#1=|v_thread1Thread1of1ForFork1_#t~ret5#1_8|, thread1Thread1of1ForFork1_#t~ret2#1=|v_thread1Thread1of1ForFork1_#t~ret2#1_12|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_34|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_6|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_8|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_42|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_10|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_18|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_66|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_26|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post7#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_#t~ret4#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_#t~ret8#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_#t~ret5#1, thread1Thread1of1ForFork1_#t~ret2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 689#[L97-4, L46-1]don't care [2022-07-22 12:45:02,620 INFO L750 eck$LassoCheckResult]: Loop: 689#[L97-4, L46-1]don't care [1575] L46-1-->L122-1: Formula: (let ((.cse0 (* v_~i~0_In_9 4))) (let ((.cse2 (+ |v_thread1Thread1of1ForFork1_plus_~b#1_Out_10| |v_thread1Thread1of1ForFork1_plus_~a#1_Out_10|)) (.cse1 (+ .cse0 v_~A~0.offset_In_5))) (and (= |v_thread1Thread1of1ForFork1_plus_~b#1_Out_10| |v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_10|) (<= (+ .cse0 v_~A~0.offset_In_5 4) (select |v_#length_In_9| v_~A~0.base_In_5)) (= (select |v_#valid_In_9| v_~A~0.base_In_5) 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_22| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_14|) (= v_~bag1~0_In_7 |v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_10|) (< v_~i~0_In_9 v_~N~0_In_7) (= |v_thread1Thread1of1ForFork1_#t~mem1#1_Out_6| |v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_10|) (<= 0 .cse1) (= |v_thread1Thread1of1ForFork1_plus_#res#1_Out_18| .cse2) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_22| 0)) (= (ite (or (<= |v_thread1Thread1of1ForFork1_plus_~b#1_Out_10| 0) (<= .cse2 2147483647)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_14|) (not (= (ite (or (<= 0 |v_thread1Thread1of1ForFork1_plus_~b#1_Out_10|) (<= 0 (+ |v_thread1Thread1of1ForFork1_plus_~b#1_Out_10| |v_thread1Thread1of1ForFork1_plus_~a#1_Out_10| 2147483648))) 1 0) 0)) (= (select (select |v_#memory_int_In_7| v_~A~0.base_In_5) .cse1) |v_thread1Thread1of1ForFork1_#t~mem1#1_Out_6|) (= |v_thread1Thread1of1ForFork1_plus_~a#1_Out_10| |v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_10|)))) InVars {~A~0.base=v_~A~0.base_In_5, ~A~0.offset=v_~A~0.offset_In_5, ~i~0=v_~i~0_In_9, #valid=|v_#valid_In_9|, ~bag1~0=v_~bag1~0_In_7, #memory_int=|v_#memory_int_In_7|, #length=|v_#length_In_9|, ~N~0=v_~N~0_In_7} OutVars{~A~0.base=v_~A~0.base_In_5, ~i~0=v_~i~0_In_9, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_Out_10|, ~bag1~0=v_~bag1~0_In_7, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_10|, ~N~0=v_~N~0_In_7, ~A~0.offset=v_~A~0.offset_In_5, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_14|, #valid=|v_#valid_In_9|, #memory_int=|v_#memory_int_In_7|, #length=|v_#length_In_9|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_Out_10|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_Out_6|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_10|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_Out_18|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_22|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 685#[L122-1, L97-4]don't care [1574] L122-1-->L46-1: Formula: (let ((.cse14 (* v_~i~0_In_7 4))) (let ((.cse13 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_Out_6| |v_thread1Thread1of1ForFork1_plus_~b#1_Out_6|)) (.cse12 (+ v_~A~0.offset_In_3 .cse14))) (let ((.cse0 (<= (+ v_~A~0.offset_In_3 .cse14 4) (select |v_#length_In_7| v_~A~0.base_In_3))) (.cse4 (select (select |v_#memory_int_In_5| v_~A~0.base_In_3) .cse12)) (.cse1 (= |v_thread1Thread1of1ForFork1_plus_#res#1_Out_14| .cse13)) (.cse2 (not (= (ite (or (<= 0 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_Out_6| 2147483648 |v_thread1Thread1of1ForFork1_plus_~b#1_Out_6|)) (<= 0 |v_thread1Thread1of1ForFork1_plus_~b#1_Out_6|)) 1 0) 0))) (.cse3 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10| (ite (or (<= |v_thread1Thread1of1ForFork1_plus_~b#1_Out_6| 0) (<= .cse13 2147483647)) 1 0))) (.cse5 (= (select |v_#valid_In_7| v_~A~0.base_In_3) 1)) (.cse6 (= v_~i~0_Out_2 (+ v_~i~0_In_7 1))) (.cse7 (= |v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_6| |v_thread1Thread1of1ForFork1_plus_~b#1_Out_6|)) (.cse8 (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_18| 0))) (.cse9 (<= 0 .cse12)) (.cse10 (= |v_thread1Thread1of1ForFork1_plus_~a#1_Out_6| |v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_6|)) (.cse11 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_18| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|))) (or (and .cse0 .cse1 (= |v_thread1Thread1of1ForFork1_#t~ret5#1_In_1| |v_thread1Thread1of1ForFork1_#t~ret5#1_Out_2|) (= |v_thread1Thread1of1ForFork1_plus_#res#1_Out_14| v_~bag1~0_Out_2) .cse2 (= v_~sum1~0_Out_6 v_~sum1~0_In_5) .cse3 (< |v_thread1Thread1of1ForFork1_plus_#res#1_In_1| v_~cap1~0_In_1) (= |v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_6| .cse4) .cse5 (= |v_thread1Thread1of1ForFork1_#t~mem6#1_In_1| |v_thread1Thread1of1ForFork1_#t~mem6#1_Out_2|) .cse6 .cse7 (= v_~bag1~0_In_5 |v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_6|) .cse8 .cse9 .cse10 .cse11) (and (= |v_thread1Thread1of1ForFork1_#t~ret4#1_In_1| |v_thread1Thread1of1ForFork1_#t~ret4#1_Out_2|) .cse0 (= .cse4 v_~bag1~0_Out_2) .cse1 .cse2 .cse3 (<= v_~cap1~0_In_1 |v_thread1Thread1of1ForFork1_plus_#res#1_In_1|) (= |v_thread1Thread1of1ForFork1_plus_#res#1_Out_14| v_~sum1~0_Out_6) .cse5 (= |v_thread1Thread1of1ForFork1_#t~mem3#1_Out_2| |v_thread1Thread1of1ForFork1_#t~mem3#1_In_1|) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_6| v_~bag1~0_In_5) (= |v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_6| v_~sum1~0_In_5)))))) InVars {~A~0.base=v_~A~0.base_In_3, ~i~0=v_~i~0_In_7, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_In_1|, thread1Thread1of1ForFork1_#t~ret4#1=|v_thread1Thread1of1ForFork1_#t~ret4#1_In_1|, ~bag1~0=v_~bag1~0_In_5, ~A~0.offset=v_~A~0.offset_In_3, ~sum1~0=v_~sum1~0_In_5, thread1Thread1of1ForFork1_#t~ret5#1=|v_thread1Thread1of1ForFork1_#t~ret5#1_In_1|, #valid=|v_#valid_In_7|, ~cap1~0=v_~cap1~0_In_1, #memory_int=|v_#memory_int_In_5|, #length=|v_#length_In_7|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_In_1|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_In_1|} OutVars{thread1Thread1of1ForFork1_#t~post7#1=|v_thread1Thread1of1ForFork1_#t~post7#1_Out_2|, ~A~0.base=v_~A~0.base_In_3, ~i~0=v_~i~0_Out_2, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_Out_2|, thread1Thread1of1ForFork1_#t~ret4#1=|v_thread1Thread1of1ForFork1_#t~ret4#1_Out_2|, ~bag1~0=v_~bag1~0_Out_2, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_Out_6|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_6|, ~A~0.offset=v_~A~0.offset_In_3, ~sum1~0=v_~sum1~0_Out_6, thread1Thread1of1ForFork1_#t~ret5#1=|v_thread1Thread1of1ForFork1_#t~ret5#1_Out_2|, thread1Thread1of1ForFork1_#t~ret2#1=|v_thread1Thread1of1ForFork1_#t~ret2#1_Out_2|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|, #valid=|v_#valid_In_7|, ~cap1~0=v_~cap1~0_In_1, #memory_int=|v_#memory_int_In_5|, #length=|v_#length_In_7|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_Out_2|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_Out_6|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_Out_2|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_6|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_Out_14|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_18|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post7#1, ~i~0, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_#t~ret4#1, ~bag1~0, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_plus_#in~a#1, ~sum1~0, thread1Thread1of1ForFork1_#t~ret5#1, thread1Thread1of1ForFork1_#t~ret2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 689#[L97-4, L46-1]don't care [2022-07-22 12:45:02,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:45:02,621 INFO L85 PathProgramCache]: Analyzing trace with hash 49445728, now seen corresponding path program 1 times [2022-07-22 12:45:02,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:45:02,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073445422] [2022-07-22 12:45:02,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:45:02,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:45:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:02,648 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:45:02,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:02,746 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:45:02,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:45:02,747 INFO L85 PathProgramCache]: Analyzing trace with hash 51360, now seen corresponding path program 2 times [2022-07-22 12:45:02,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:45:02,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076036910] [2022-07-22 12:45:02,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:45:02,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:45:02,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:02,777 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:45:02,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-22 12:45:02,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:02,796 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:45:02,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:45:02,797 INFO L85 PathProgramCache]: Analyzing trace with hash 272754751, now seen corresponding path program 1 times [2022-07-22 12:45:02,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:45:02,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40568188] [2022-07-22 12:45:02,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:45:02,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:45:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:02,844 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:45:02,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:02,899 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:45:04,898 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:45:04,898 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:45:04,898 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:45:04,898 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:45:04,898 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:45:04,898 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:04,899 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:45:04,899 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:45:04,899 INFO L133 ssoRankerPreferences]: Filename of dumped script: parallel-misc-1.wvr.c_BEv2_Iteration4_Lasso [2022-07-22 12:45:04,899 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:45:04,899 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:45:04,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:04,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:04,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:06,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:06,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:06,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:06,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:06,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:06,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:06,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:06,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:06,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:06,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:06,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:06,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:06,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:06,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:06,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:06,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:06,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:06,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:06,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:06,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:06,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:06,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:06,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:06,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:06,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:06,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:06,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:06,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:06,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:06,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:06,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:06,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:06,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:06,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:06,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:06,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:06,816 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 21 [2022-07-22 12:45:09,187 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:45:09,187 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:45:09,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:09,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:09,191 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:45:09,197 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:45:09,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:09,206 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:45:09,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:09,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-22 12:45:09,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:09,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:09,207 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:45:09,207 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:45:09,214 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:09,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-22 12:45:09,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:09,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:09,237 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:45:09,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-22 12:45:09,239 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:45:09,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:09,247 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:45:09,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:09,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:09,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:09,248 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:45:09,249 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:45:09,250 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:09,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-22 12:45:09,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:09,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:09,276 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:45:09,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-22 12:45:09,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-22 12:45:09,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:09,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:09,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:09,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:09,294 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:45:09,294 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:45:09,318 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:09,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-22 12:45:09,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:09,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:09,354 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:45:09,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-22 12:45:09,358 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:45:09,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:09,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:09,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:09,366 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:09,368 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:45:09,368 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:45:09,372 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:09,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-22 12:45:09,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:09,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:09,398 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:45:09,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-22 12:45:09,399 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:45:09,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:09,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:09,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:09,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:09,408 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:45:09,408 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:45:09,411 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:09,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-22 12:45:09,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:09,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:09,437 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:45:09,440 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:45:09,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:09,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:09,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:09,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:09,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-22 12:45:09,451 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:45:09,451 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:45:09,454 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:09,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-22 12:45:09,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:09,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:09,478 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:45:09,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-22 12:45:09,480 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:45:09,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:09,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:09,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:09,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:09,489 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:45:09,489 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:45:09,492 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:09,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-07-22 12:45:09,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:09,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:09,516 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:45:09,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-22 12:45:09,518 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:45:09,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:09,525 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-07-22 12:45:09,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:09,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:09,532 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-22 12:45:09,532 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:45:09,552 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:09,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-22 12:45:09,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:09,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:09,590 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:45:09,593 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:45:09,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:09,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:09,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:09,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:09,604 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:45:09,604 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:45:09,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-22 12:45:09,608 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:09,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-07-22 12:45:09,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:09,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:09,631 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:45:09,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-22 12:45:09,634 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:45:09,641 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:09,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:09,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:09,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:09,644 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:45:09,644 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:45:09,653 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:09,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-07-22 12:45:09,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:09,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:09,679 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:45:09,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-22 12:45:09,681 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:45:09,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:09,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:09,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:09,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:09,690 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:45:09,690 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:45:09,695 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:09,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-07-22 12:45:09,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:09,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:09,718 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:45:09,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-22 12:45:09,721 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:45:09,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:09,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:09,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:09,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:09,731 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:45:09,731 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:45:09,754 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:09,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-07-22 12:45:09,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:09,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:09,790 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:45:09,792 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:45:09,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-07-22 12:45:09,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:09,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:09,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:09,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:09,801 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:45:09,801 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:45:09,805 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:09,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-07-22 12:45:09,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:09,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:09,830 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:45:09,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-07-22 12:45:09,833 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:45:09,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:09,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:09,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:09,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:09,842 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:45:09,842 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:45:09,846 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:09,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-07-22 12:45:09,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:09,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:09,870 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:45:09,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-07-22 12:45:09,871 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:45:09,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:09,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:09,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:09,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:09,892 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:45:09,892 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:45:09,918 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:45:09,991 INFO L443 ModelExtractionUtils]: Simplification made 19 calls to the SMT solver. [2022-07-22 12:45:09,992 INFO L444 ModelExtractionUtils]: 3 out of 37 variables were initially zero. Simplification set additionally 31 variables to zero. [2022-07-22 12:45:09,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:09,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:09,993 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:45:10,001 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:45:10,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-07-22 12:45:10,026 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:45:10,027 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:45:10,027 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~i~0, ~N~0) = -1*~i~0 + 1*~N~0 Supporting invariants [] [2022-07-22 12:45:10,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-07-22 12:45:10,208 INFO L257 tatePredicateManager]: 25 out of 25 supporting invariants were superfluous and have been removed [2022-07-22 12:45:10,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:45:10,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:45:10,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:45:10,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:45:10,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:45:10,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:45:10,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:45:10,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:45:10,276 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 12:45:10,276 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 46 transitions. cyclomatic complexity: 35 Second operand has 3 states, 3 states have (on average 2.0) 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-22 12:45:10,333 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 46 transitions. cyclomatic complexity: 35. Second operand has 3 states, 3 states have (on average 2.0) 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) Result 52 states and 118 transitions. Complement of second has 5 states. [2022-07-22 12:45:10,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-22 12:45:10,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) 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-22 12:45:10,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2022-07-22 12:45:10,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 4 letters. Loop has 2 letters. [2022-07-22 12:45:10,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:45:10,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 6 letters. Loop has 2 letters. [2022-07-22 12:45:10,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:45:10,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 4 letters. Loop has 4 letters. [2022-07-22 12:45:10,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:45:10,336 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 118 transitions. [2022-07-22 12:45:10,338 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 16 [2022-07-22 12:45:10,339 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 46 states and 106 transitions. [2022-07-22 12:45:10,339 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2022-07-22 12:45:10,340 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2022-07-22 12:45:10,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 106 transitions. [2022-07-22 12:45:10,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:45:10,340 INFO L220 hiAutomatonCegarLoop]: Abstraction has 46 states and 106 transitions. [2022-07-22 12:45:10,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 106 transitions. [2022-07-22 12:45:10,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2022-07-22 12:45:10,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.342857142857143) internal successors, (82), 34 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-22 12:45:10,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 82 transitions. [2022-07-22 12:45:10,345 INFO L242 hiAutomatonCegarLoop]: Abstraction has 35 states and 82 transitions. [2022-07-22 12:45:10,346 INFO L425 stractBuchiCegarLoop]: Abstraction has 35 states and 82 transitions. [2022-07-22 12:45:10,346 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 12:45:10,346 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 82 transitions. [2022-07-22 12:45:10,347 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 16 [2022-07-22 12:45:10,347 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:45:10,347 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:45:10,347 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 12:45:10,348 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:45:10,348 INFO L748 eck$LassoCheckResult]: Stem: 929#[ULTIMATE.startENTRY]don't care [1580] ULTIMATE.startENTRY-->L113-6: Formula: (let ((.cse1 (store |v_#valid_229| |v_ULTIMATE.start_main_~#t1~0#1.base_63| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_51| 1)) (.cse2 (select |v_#memory_int_161| 1))) (and (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|) 1 0) 0)) (= (select |v_#valid_229| |v_ULTIMATE.start_main_~#t1~0#1.base_63|) 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| 0)) (= |v_#NULL.base_14| 0) (= (select |v_#valid_229| 2) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_17| v_~N~0_92) (= (select |v_#valid_229| 1) 1) (= |v_#NULL.offset_14| 0) (= 2 (select |v_#length_196| 1)) (= (store (store (store |v_#length_196| |v_ULTIMATE.start_main_~#t1~0#1.base_63| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_51| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|)) |v_#length_194|) (= v_~A~0.base_113 0) (< |v_#StackHeapBarrier_41| |v_ULTIMATE.start_main_~#t1~0#1.base_63|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| |v_#StackHeapBarrier_41|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| 0)) (= |v_#valid_227| (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_56| 0) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|) 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_66| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_51|) 0) (= v_~A~0.offset_113 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_55| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_45| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_17| |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|) (= (select .cse2 1) 0) (< 0 |v_#StackHeapBarrier_41|) (= (select |v_#length_196| 2) 22) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49| 0) (= (select |v_#valid_229| 0) 0) (= 48 (select .cse2 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|) (< |v_#StackHeapBarrier_41| |v_ULTIMATE.start_main_~#t2~0#1.base_51|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_41|, #valid=|v_#valid_229|, #memory_int=|v_#memory_int_161|, #length=|v_#length_196|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49|, ~A~0.base=v_~A~0.base_113, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_34|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_45|, #NULL.offset=|v_#NULL.offset_14|, ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.offset_35|, ULTIMATE.start_create_fresh_int_array_#t~post34#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post34#1_23|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_34|, ~cap2~0=v_~cap2~0_51, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_19|, #length=|v_#length_194|, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_39|, ULTIMATE.start_create_fresh_int_array_#t~nondet35#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet35#1_26|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|, ~i~0=v_~i~0_139, ~bag2~0=v_~bag2~0_112, ~sum2~0=v_~sum2~0_101, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_66|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_30|, #StackHeapBarrier=|v_#StackHeapBarrier_41|, ~sum1~0=v_~sum1~0_111, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_32|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_35|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_21|, ~j~0=v_~j~0_125, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_39|, ULTIMATE.start_main_#t~nondet25#1=|v_ULTIMATE.start_main_#t~nondet25#1_36|, ~bag1~0=v_~bag1~0_120, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_56|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_38|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_30|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_17|, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_24|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_107|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_38|, ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_34|, ULTIMATE.start_main_#t~nondet23#1=|v_ULTIMATE.start_main_#t~nondet23#1_32|, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_29|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_34|, ~N~0=v_~N~0_92, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_63|, #NULL.base=|v_#NULL.base_14|, ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.base_35|, ~A~0.offset=v_~A~0.offset_113, #valid=|v_#valid_227|, ~cap1~0=v_~cap1~0_55, #memory_int=|v_#memory_int_161|, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_38|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_36|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_51|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.offset, ULTIMATE.start_create_fresh_int_array_#t~post34#1, ULTIMATE.start_main_#t~nondet22#1, ~cap2~0, ULTIMATE.start_main_#t~nondet30#1, #length, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet35#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~i~0, ~bag2~0, ~sum2~0, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~sum1~0, ULTIMATE.start_main_#t~nondet20#1, ULTIMATE.start_main_#t~pre27#1, ULTIMATE.start_main_#t~nondet28#1, ~j~0, ULTIMATE.start_main_#t~ret26#1.base, ULTIMATE.start_main_#t~nondet25#1, ~bag1~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_main_#t~mem31#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~mem32#1, ULTIMATE.start_main_#t~nondet23#1, ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.base, ~A~0.offset, #valid, ~cap1~0, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_#t~nondet19#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 931#[L113-6]don't care [1460] L113-6-->L113-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_37| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31| .cse1))) (and (<= 0 .cse0) (= (store |v_#memory_int_88| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31| (store (select |v_#memory_int_88| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet35#1_17|)) |v_#memory_int_87|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_37| |v_ULTIMATE.start_create_fresh_int_array_~size#1_44|) (= (select |v_#valid_137| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|) 1) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31| .cse1 4) (select |v_#length_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_36| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_37| 1))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_#t~nondet35#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet35#1_17|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|, #valid=|v_#valid_137|, #memory_int=|v_#memory_int_88|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_37|, #length=|v_#length_110|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_44|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post34#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post34#1_15|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|, #valid=|v_#valid_137|, #memory_int=|v_#memory_int_87|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_36|, #length=|v_#length_110|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_44|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post34#1, ULTIMATE.start_create_fresh_int_array_#t~nondet35#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1] 983#[L113-6]don't care [1556] L113-6-->L97-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| v_~A~0.base_Out_2) (= |v_#memory_int_Out_2| (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre27#1_Out_2|))) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre27#1_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10|) (= v_~A~0.offset_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (and (= v_~bag1~0_In_1 v_~i~0_In_3) (= v_~bag1~0_In_1 0) (= v_~bag1~0_In_1 v_~bag2~0_In_1) (= v_~sum2~0_In_1 v_~bag1~0_In_1) (= v_~bag1~0_In_1 v_~sum1~0_In_1) (= v_~j~0_In_3 v_~bag1~0_In_1)) 1 0)) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, ~j~0=v_~j~0_In_3, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ~i~0=v_~i~0_In_3, ~bag2~0=v_~bag2~0_In_1, ~bag1~0=v_~bag1~0_In_1, ~sum2~0=v_~sum2~0_In_1, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|, #pthreadsForks=|v_#pthreadsForks_In_1|, ~sum1~0=v_~sum1~0_In_1, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|} OutVars{~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, ~j~0=v_~j~0_In_3, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_Out_2|, ~bag1~0=v_~bag1~0_In_1, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3|, 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_In_1|, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10|, #length=|v_#length_In_3|, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ~i~0=v_~i~0_In_3, ~bag2~0=v_~bag2~0_In_1, ~sum2~0=v_~sum2~0_In_1, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, ~A~0.offset=v_~A~0.offset_Out_2, ~sum1~0=v_~sum1~0_In_1, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_Out_2|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret26#1.base, #memory_int, ULTIMATE.start_main_#t~pre27#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 947#[L97-3]don't care [1131] L97-3-->L46-1: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre27#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_6|} OutVars{thread1Thread1of1ForFork1_#t~post7#1=|v_thread1Thread1of1ForFork1_#t~post7#1_8|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_8|, thread1Thread1of1ForFork1_#t~ret4#1=|v_thread1Thread1of1ForFork1_#t~ret4#1_8|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_42|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_18|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_8|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_#t~ret5#1=|v_thread1Thread1of1ForFork1_#t~ret5#1_8|, thread1Thread1of1ForFork1_#t~ret2#1=|v_thread1Thread1of1ForFork1_#t~ret2#1_12|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_34|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_6|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_8|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_42|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_10|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_18|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_66|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_26|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post7#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_#t~ret4#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_#t~ret8#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_#t~ret5#1, thread1Thread1of1ForFork1_#t~ret2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 949#[L97-4, L46-1]don't care [1445] L97-4-->L98-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_27|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_27| 4) (select |v_#length_94| |v_ULTIMATE.start_main_~#t2~0#1.base_33|)) (= (select |v_#valid_121| |v_ULTIMATE.start_main_~#t2~0#1.base_33|) 1) (= |v_#memory_int_75| (store |v_#memory_int_76| |v_ULTIMATE.start_main_~#t2~0#1.base_33| (store (select |v_#memory_int_76| |v_ULTIMATE.start_main_~#t2~0#1.base_33|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre29#1_19|))) (= |v_#pthreadsForks_26| |v_ULTIMATE.start_main_#t~pre29#1_19|) (= |v_#pthreadsForks_25| (+ |v_#pthreadsForks_26| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_121|, #memory_int=|v_#memory_int_76|, #length=|v_#length_94|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|} OutVars{ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_19|, #pthreadsForks=|v_#pthreadsForks_25|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_121|, #memory_int=|v_#memory_int_75|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_17|, #length=|v_#length_94|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre29#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre27#1, ULTIMATE.start_main_#t~nondet28#1] 953#[L98-3, L46-1]don't care [2022-07-22 12:45:10,349 INFO L750 eck$LassoCheckResult]: Loop: 953#[L98-3, L46-1]don't care [1575] L46-1-->L122-1: Formula: (let ((.cse0 (* v_~i~0_In_9 4))) (let ((.cse2 (+ |v_thread1Thread1of1ForFork1_plus_~b#1_Out_10| |v_thread1Thread1of1ForFork1_plus_~a#1_Out_10|)) (.cse1 (+ .cse0 v_~A~0.offset_In_5))) (and (= |v_thread1Thread1of1ForFork1_plus_~b#1_Out_10| |v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_10|) (<= (+ .cse0 v_~A~0.offset_In_5 4) (select |v_#length_In_9| v_~A~0.base_In_5)) (= (select |v_#valid_In_9| v_~A~0.base_In_5) 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_22| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_14|) (= v_~bag1~0_In_7 |v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_10|) (< v_~i~0_In_9 v_~N~0_In_7) (= |v_thread1Thread1of1ForFork1_#t~mem1#1_Out_6| |v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_10|) (<= 0 .cse1) (= |v_thread1Thread1of1ForFork1_plus_#res#1_Out_18| .cse2) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_22| 0)) (= (ite (or (<= |v_thread1Thread1of1ForFork1_plus_~b#1_Out_10| 0) (<= .cse2 2147483647)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_14|) (not (= (ite (or (<= 0 |v_thread1Thread1of1ForFork1_plus_~b#1_Out_10|) (<= 0 (+ |v_thread1Thread1of1ForFork1_plus_~b#1_Out_10| |v_thread1Thread1of1ForFork1_plus_~a#1_Out_10| 2147483648))) 1 0) 0)) (= (select (select |v_#memory_int_In_7| v_~A~0.base_In_5) .cse1) |v_thread1Thread1of1ForFork1_#t~mem1#1_Out_6|) (= |v_thread1Thread1of1ForFork1_plus_~a#1_Out_10| |v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_10|)))) InVars {~A~0.base=v_~A~0.base_In_5, ~A~0.offset=v_~A~0.offset_In_5, ~i~0=v_~i~0_In_9, #valid=|v_#valid_In_9|, ~bag1~0=v_~bag1~0_In_7, #memory_int=|v_#memory_int_In_7|, #length=|v_#length_In_9|, ~N~0=v_~N~0_In_7} OutVars{~A~0.base=v_~A~0.base_In_5, ~i~0=v_~i~0_In_9, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_Out_10|, ~bag1~0=v_~bag1~0_In_7, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_10|, ~N~0=v_~N~0_In_7, ~A~0.offset=v_~A~0.offset_In_5, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_14|, #valid=|v_#valid_In_9|, #memory_int=|v_#memory_int_In_7|, #length=|v_#length_In_9|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_Out_10|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_Out_6|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_10|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_Out_18|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_22|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 955#[L98-3, L122-1]don't care [1574] L122-1-->L46-1: Formula: (let ((.cse14 (* v_~i~0_In_7 4))) (let ((.cse13 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_Out_6| |v_thread1Thread1of1ForFork1_plus_~b#1_Out_6|)) (.cse12 (+ v_~A~0.offset_In_3 .cse14))) (let ((.cse0 (<= (+ v_~A~0.offset_In_3 .cse14 4) (select |v_#length_In_7| v_~A~0.base_In_3))) (.cse4 (select (select |v_#memory_int_In_5| v_~A~0.base_In_3) .cse12)) (.cse1 (= |v_thread1Thread1of1ForFork1_plus_#res#1_Out_14| .cse13)) (.cse2 (not (= (ite (or (<= 0 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_Out_6| 2147483648 |v_thread1Thread1of1ForFork1_plus_~b#1_Out_6|)) (<= 0 |v_thread1Thread1of1ForFork1_plus_~b#1_Out_6|)) 1 0) 0))) (.cse3 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10| (ite (or (<= |v_thread1Thread1of1ForFork1_plus_~b#1_Out_6| 0) (<= .cse13 2147483647)) 1 0))) (.cse5 (= (select |v_#valid_In_7| v_~A~0.base_In_3) 1)) (.cse6 (= v_~i~0_Out_2 (+ v_~i~0_In_7 1))) (.cse7 (= |v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_6| |v_thread1Thread1of1ForFork1_plus_~b#1_Out_6|)) (.cse8 (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_18| 0))) (.cse9 (<= 0 .cse12)) (.cse10 (= |v_thread1Thread1of1ForFork1_plus_~a#1_Out_6| |v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_6|)) (.cse11 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_18| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|))) (or (and .cse0 .cse1 (= |v_thread1Thread1of1ForFork1_#t~ret5#1_In_1| |v_thread1Thread1of1ForFork1_#t~ret5#1_Out_2|) (= |v_thread1Thread1of1ForFork1_plus_#res#1_Out_14| v_~bag1~0_Out_2) .cse2 (= v_~sum1~0_Out_6 v_~sum1~0_In_5) .cse3 (< |v_thread1Thread1of1ForFork1_plus_#res#1_In_1| v_~cap1~0_In_1) (= |v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_6| .cse4) .cse5 (= |v_thread1Thread1of1ForFork1_#t~mem6#1_In_1| |v_thread1Thread1of1ForFork1_#t~mem6#1_Out_2|) .cse6 .cse7 (= v_~bag1~0_In_5 |v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_6|) .cse8 .cse9 .cse10 .cse11) (and (= |v_thread1Thread1of1ForFork1_#t~ret4#1_In_1| |v_thread1Thread1of1ForFork1_#t~ret4#1_Out_2|) .cse0 (= .cse4 v_~bag1~0_Out_2) .cse1 .cse2 .cse3 (<= v_~cap1~0_In_1 |v_thread1Thread1of1ForFork1_plus_#res#1_In_1|) (= |v_thread1Thread1of1ForFork1_plus_#res#1_Out_14| v_~sum1~0_Out_6) .cse5 (= |v_thread1Thread1of1ForFork1_#t~mem3#1_Out_2| |v_thread1Thread1of1ForFork1_#t~mem3#1_In_1|) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_6| v_~bag1~0_In_5) (= |v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_6| v_~sum1~0_In_5)))))) InVars {~A~0.base=v_~A~0.base_In_3, ~i~0=v_~i~0_In_7, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_In_1|, thread1Thread1of1ForFork1_#t~ret4#1=|v_thread1Thread1of1ForFork1_#t~ret4#1_In_1|, ~bag1~0=v_~bag1~0_In_5, ~A~0.offset=v_~A~0.offset_In_3, ~sum1~0=v_~sum1~0_In_5, thread1Thread1of1ForFork1_#t~ret5#1=|v_thread1Thread1of1ForFork1_#t~ret5#1_In_1|, #valid=|v_#valid_In_7|, ~cap1~0=v_~cap1~0_In_1, #memory_int=|v_#memory_int_In_5|, #length=|v_#length_In_7|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_In_1|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_In_1|} OutVars{thread1Thread1of1ForFork1_#t~post7#1=|v_thread1Thread1of1ForFork1_#t~post7#1_Out_2|, ~A~0.base=v_~A~0.base_In_3, ~i~0=v_~i~0_Out_2, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_Out_2|, thread1Thread1of1ForFork1_#t~ret4#1=|v_thread1Thread1of1ForFork1_#t~ret4#1_Out_2|, ~bag1~0=v_~bag1~0_Out_2, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_Out_6|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_6|, ~A~0.offset=v_~A~0.offset_In_3, ~sum1~0=v_~sum1~0_Out_6, thread1Thread1of1ForFork1_#t~ret5#1=|v_thread1Thread1of1ForFork1_#t~ret5#1_Out_2|, thread1Thread1of1ForFork1_#t~ret2#1=|v_thread1Thread1of1ForFork1_#t~ret2#1_Out_2|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|, #valid=|v_#valid_In_7|, ~cap1~0=v_~cap1~0_In_1, #memory_int=|v_#memory_int_In_5|, #length=|v_#length_In_7|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_Out_2|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_Out_6|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_Out_2|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_6|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_Out_14|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_18|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post7#1, ~i~0, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_#t~ret4#1, ~bag1~0, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_plus_#in~a#1, ~sum1~0, thread1Thread1of1ForFork1_#t~ret5#1, thread1Thread1of1ForFork1_#t~ret2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 953#[L98-3, L46-1]don't care [2022-07-22 12:45:10,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:45:10,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1532819013, now seen corresponding path program 1 times [2022-07-22 12:45:10,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:45:10,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241352527] [2022-07-22 12:45:10,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:45:10,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:45:10,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:10,392 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:45:10,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:10,432 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:45:10,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:45:10,436 INFO L85 PathProgramCache]: Analyzing trace with hash 51360, now seen corresponding path program 3 times [2022-07-22 12:45:10,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:45:10,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955677182] [2022-07-22 12:45:10,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:45:10,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:45:10,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:10,466 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:45:10,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:10,490 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:45:10,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:45:10,492 INFO L85 PathProgramCache]: Analyzing trace with hash -134660636, now seen corresponding path program 1 times [2022-07-22 12:45:10,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:45:10,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730112306] [2022-07-22 12:45:10,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:45:10,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:45:10,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:10,559 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:45:10,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:10,680 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:45:10,746 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-22 12:45:13,005 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:45:13,005 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:45:13,005 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:45:13,005 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:45:13,005 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:45:13,006 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:13,006 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:45:13,006 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:45:13,006 INFO L133 ssoRankerPreferences]: Filename of dumped script: parallel-misc-1.wvr.c_BEv2_Iteration5_Lasso [2022-07-22 12:45:13,006 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:45:13,006 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:45:13,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:13,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:13,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:13,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:13,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:13,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:13,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:14,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:14,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:14,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:14,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:14,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:14,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:14,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:14,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:14,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:14,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:14,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:14,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:14,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:14,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:14,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:14,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:14,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:14,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:14,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:14,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:14,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:14,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:14,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:14,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:14,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:14,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:14,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:14,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:14,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:14,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:14,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:14,822 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2022-07-22 12:45:16,278 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:45:16,279 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:45:16,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:16,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:16,284 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:45:16,286 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:45:16,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-07-22 12:45:16,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:16,294 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:45:16,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:16,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:16,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:16,295 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:45:16,295 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:45:16,296 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:16,318 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-22 12:45:16,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:16,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:16,319 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:45:16,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-07-22 12:45:16,321 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:45:16,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:16,328 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:45:16,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:16,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:16,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:16,329 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:45:16,329 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:45:16,330 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:16,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2022-07-22 12:45:16,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:16,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:16,354 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:45:16,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-07-22 12:45:16,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-22 12:45:16,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:16,363 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:45:16,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:16,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:16,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:16,363 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:45:16,363 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:45:16,364 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:16,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-07-22 12:45:16,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:16,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:16,388 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:45:16,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-07-22 12:45:16,390 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:45:16,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:16,396 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:45:16,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:16,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:16,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:16,397 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:45:16,397 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:45:16,398 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:16,421 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-22 12:45:16,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:16,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:16,422 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:45:16,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-07-22 12:45:16,427 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:45:16,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:16,434 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:45:16,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:16,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:16,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:16,434 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:45:16,435 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:45:16,435 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:16,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-07-22 12:45:16,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:16,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:16,460 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:45:16,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-07-22 12:45:16,461 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:45:16,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:16,468 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:45:16,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:16,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:16,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:16,468 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:45:16,468 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:45:16,469 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:16,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-07-22 12:45:16,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:16,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:16,493 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:45:16,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-07-22 12:45:16,496 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:45:16,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:16,504 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-07-22 12:45:16,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:16,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:16,508 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-22 12:45:16,508 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:45:16,533 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:16,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-07-22 12:45:16,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:16,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:16,573 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:45:16,576 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:45:16,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:16,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:16,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:16,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:16,587 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:45:16,587 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:45:16,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-07-22 12:45:16,596 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:16,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2022-07-22 12:45:16,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:16,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:16,632 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:45:16,639 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:45:16,648 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:16,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:16,648 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:16,648 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:16,650 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:45:16,651 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:45:16,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-07-22 12:45:16,665 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:16,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-07-22 12:45:16,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:16,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:16,709 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:45:16,715 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:45:16,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:16,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:16,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:16,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:16,726 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:45:16,726 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:45:16,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-07-22 12:45:16,737 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:16,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-07-22 12:45:16,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:16,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:16,774 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:45:16,777 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:45:16,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:16,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:16,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:16,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:16,789 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:45:16,789 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:45:16,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-07-22 12:45:16,801 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:16,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2022-07-22 12:45:16,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:16,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:16,838 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:45:16,841 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:45:16,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:16,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:16,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:16,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:16,859 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:45:16,860 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:45:16,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-07-22 12:45:16,883 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:45:16,938 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2022-07-22 12:45:16,939 INFO L444 ModelExtractionUtils]: 8 out of 40 variables were initially zero. Simplification set additionally 29 variables to zero. [2022-07-22 12:45:16,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:16,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:16,941 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:45:16,948 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:45:16,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-07-22 12:45:16,974 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:45:16,975 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:45:16,975 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~i~0, ~N~0) = -1*~i~0 + 1*~N~0 Supporting invariants [] [2022-07-22 12:45:17,031 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-22 12:45:17,211 INFO L257 tatePredicateManager]: 29 out of 29 supporting invariants were superfluous and have been removed [2022-07-22 12:45:17,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:45:17,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:45:17,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:45:17,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:45:17,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:45:17,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:45:17,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:45:17,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:45:17,276 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 12:45:17,276 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 82 transitions. cyclomatic complexity: 64 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:45:17,351 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 82 transitions. cyclomatic complexity: 64. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 64 states and 149 transitions. Complement of second has 5 states. [2022-07-22 12:45:17,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-22 12:45:17,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:45:17,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2022-07-22 12:45:17,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 5 letters. Loop has 2 letters. [2022-07-22 12:45:17,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:45:17,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-22 12:45:17,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:45:17,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 5 letters. Loop has 4 letters. [2022-07-22 12:45:17,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:45:17,356 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 149 transitions. [2022-07-22 12:45:17,358 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 16 [2022-07-22 12:45:17,362 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 58 states and 137 transitions. [2022-07-22 12:45:17,362 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2022-07-22 12:45:17,363 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2022-07-22 12:45:17,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 137 transitions. [2022-07-22 12:45:17,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:45:17,363 INFO L220 hiAutomatonCegarLoop]: Abstraction has 58 states and 137 transitions. [2022-07-22 12:45:17,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 137 transitions. [2022-07-22 12:45:17,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 34. [2022-07-22 12:45:17,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.3823529411764706) internal successors, (81), 33 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-22 12:45:17,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 81 transitions. [2022-07-22 12:45:17,373 INFO L242 hiAutomatonCegarLoop]: Abstraction has 34 states and 81 transitions. [2022-07-22 12:45:17,373 INFO L425 stractBuchiCegarLoop]: Abstraction has 34 states and 81 transitions. [2022-07-22 12:45:17,373 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-22 12:45:17,373 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 81 transitions. [2022-07-22 12:45:17,380 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 14 [2022-07-22 12:45:17,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:45:17,380 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:45:17,381 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:45:17,381 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:45:17,381 INFO L748 eck$LassoCheckResult]: Stem: 1220#[ULTIMATE.startENTRY]don't care [1580] ULTIMATE.startENTRY-->L113-6: Formula: (let ((.cse1 (store |v_#valid_229| |v_ULTIMATE.start_main_~#t1~0#1.base_63| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_51| 1)) (.cse2 (select |v_#memory_int_161| 1))) (and (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|) 1 0) 0)) (= (select |v_#valid_229| |v_ULTIMATE.start_main_~#t1~0#1.base_63|) 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| 0)) (= |v_#NULL.base_14| 0) (= (select |v_#valid_229| 2) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_17| v_~N~0_92) (= (select |v_#valid_229| 1) 1) (= |v_#NULL.offset_14| 0) (= 2 (select |v_#length_196| 1)) (= (store (store (store |v_#length_196| |v_ULTIMATE.start_main_~#t1~0#1.base_63| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_51| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|)) |v_#length_194|) (= v_~A~0.base_113 0) (< |v_#StackHeapBarrier_41| |v_ULTIMATE.start_main_~#t1~0#1.base_63|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| |v_#StackHeapBarrier_41|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| 0)) (= |v_#valid_227| (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_56| 0) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|) 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_66| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_51|) 0) (= v_~A~0.offset_113 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_55| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_45| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_17| |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|) (= (select .cse2 1) 0) (< 0 |v_#StackHeapBarrier_41|) (= (select |v_#length_196| 2) 22) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49| 0) (= (select |v_#valid_229| 0) 0) (= 48 (select .cse2 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|) (< |v_#StackHeapBarrier_41| |v_ULTIMATE.start_main_~#t2~0#1.base_51|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_41|, #valid=|v_#valid_229|, #memory_int=|v_#memory_int_161|, #length=|v_#length_196|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49|, ~A~0.base=v_~A~0.base_113, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_34|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_45|, #NULL.offset=|v_#NULL.offset_14|, ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.offset_35|, ULTIMATE.start_create_fresh_int_array_#t~post34#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post34#1_23|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_34|, ~cap2~0=v_~cap2~0_51, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_19|, #length=|v_#length_194|, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_39|, ULTIMATE.start_create_fresh_int_array_#t~nondet35#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet35#1_26|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|, ~i~0=v_~i~0_139, ~bag2~0=v_~bag2~0_112, ~sum2~0=v_~sum2~0_101, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_66|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_30|, #StackHeapBarrier=|v_#StackHeapBarrier_41|, ~sum1~0=v_~sum1~0_111, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_32|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_35|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_21|, ~j~0=v_~j~0_125, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_39|, ULTIMATE.start_main_#t~nondet25#1=|v_ULTIMATE.start_main_#t~nondet25#1_36|, ~bag1~0=v_~bag1~0_120, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_56|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_38|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_30|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_17|, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_24|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_107|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_38|, ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_34|, ULTIMATE.start_main_#t~nondet23#1=|v_ULTIMATE.start_main_#t~nondet23#1_32|, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_29|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_34|, ~N~0=v_~N~0_92, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_63|, #NULL.base=|v_#NULL.base_14|, ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.base_35|, ~A~0.offset=v_~A~0.offset_113, #valid=|v_#valid_227|, ~cap1~0=v_~cap1~0_55, #memory_int=|v_#memory_int_161|, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_38|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_36|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_51|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.offset, ULTIMATE.start_create_fresh_int_array_#t~post34#1, ULTIMATE.start_main_#t~nondet22#1, ~cap2~0, ULTIMATE.start_main_#t~nondet30#1, #length, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet35#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~i~0, ~bag2~0, ~sum2~0, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~sum1~0, ULTIMATE.start_main_#t~nondet20#1, ULTIMATE.start_main_#t~pre27#1, ULTIMATE.start_main_#t~nondet28#1, ~j~0, ULTIMATE.start_main_#t~ret26#1.base, ULTIMATE.start_main_#t~nondet25#1, ~bag1~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_main_#t~mem31#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~mem32#1, ULTIMATE.start_main_#t~nondet23#1, ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.base, ~A~0.offset, #valid, ~cap1~0, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_#t~nondet19#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1222#[L113-6]don't care [1460] L113-6-->L113-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_37| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31| .cse1))) (and (<= 0 .cse0) (= (store |v_#memory_int_88| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31| (store (select |v_#memory_int_88| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet35#1_17|)) |v_#memory_int_87|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_37| |v_ULTIMATE.start_create_fresh_int_array_~size#1_44|) (= (select |v_#valid_137| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|) 1) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31| .cse1 4) (select |v_#length_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_36| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_37| 1))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_#t~nondet35#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet35#1_17|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|, #valid=|v_#valid_137|, #memory_int=|v_#memory_int_88|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_37|, #length=|v_#length_110|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_44|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post34#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post34#1_15|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|, #valid=|v_#valid_137|, #memory_int=|v_#memory_int_87|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_36|, #length=|v_#length_110|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_44|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post34#1, ULTIMATE.start_create_fresh_int_array_#t~nondet35#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1] 1272#[L113-6]don't care [1556] L113-6-->L97-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| v_~A~0.base_Out_2) (= |v_#memory_int_Out_2| (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre27#1_Out_2|))) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre27#1_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10|) (= v_~A~0.offset_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (and (= v_~bag1~0_In_1 v_~i~0_In_3) (= v_~bag1~0_In_1 0) (= v_~bag1~0_In_1 v_~bag2~0_In_1) (= v_~sum2~0_In_1 v_~bag1~0_In_1) (= v_~bag1~0_In_1 v_~sum1~0_In_1) (= v_~j~0_In_3 v_~bag1~0_In_1)) 1 0)) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, ~j~0=v_~j~0_In_3, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ~i~0=v_~i~0_In_3, ~bag2~0=v_~bag2~0_In_1, ~bag1~0=v_~bag1~0_In_1, ~sum2~0=v_~sum2~0_In_1, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|, #pthreadsForks=|v_#pthreadsForks_In_1|, ~sum1~0=v_~sum1~0_In_1, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|} OutVars{~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, ~j~0=v_~j~0_In_3, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_Out_2|, ~bag1~0=v_~bag1~0_In_1, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3|, 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_In_1|, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10|, #length=|v_#length_In_3|, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ~i~0=v_~i~0_In_3, ~bag2~0=v_~bag2~0_In_1, ~sum2~0=v_~sum2~0_In_1, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, ~A~0.offset=v_~A~0.offset_Out_2, ~sum1~0=v_~sum1~0_In_1, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_Out_2|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret26#1.base, #memory_int, ULTIMATE.start_main_#t~pre27#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1238#[L97-3]don't care [1131] L97-3-->L46-1: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre27#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_6|} OutVars{thread1Thread1of1ForFork1_#t~post7#1=|v_thread1Thread1of1ForFork1_#t~post7#1_8|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_8|, thread1Thread1of1ForFork1_#t~ret4#1=|v_thread1Thread1of1ForFork1_#t~ret4#1_8|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_42|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_18|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_8|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_#t~ret5#1=|v_thread1Thread1of1ForFork1_#t~ret5#1_8|, thread1Thread1of1ForFork1_#t~ret2#1=|v_thread1Thread1of1ForFork1_#t~ret2#1_12|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_34|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_6|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_8|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_42|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_10|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_18|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_66|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_26|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post7#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_#t~ret4#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_#t~ret8#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_#t~ret5#1, thread1Thread1of1ForFork1_#t~ret2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 1240#[L97-4, L46-1]don't care [1445] L97-4-->L98-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_27|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_27| 4) (select |v_#length_94| |v_ULTIMATE.start_main_~#t2~0#1.base_33|)) (= (select |v_#valid_121| |v_ULTIMATE.start_main_~#t2~0#1.base_33|) 1) (= |v_#memory_int_75| (store |v_#memory_int_76| |v_ULTIMATE.start_main_~#t2~0#1.base_33| (store (select |v_#memory_int_76| |v_ULTIMATE.start_main_~#t2~0#1.base_33|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre29#1_19|))) (= |v_#pthreadsForks_26| |v_ULTIMATE.start_main_#t~pre29#1_19|) (= |v_#pthreadsForks_25| (+ |v_#pthreadsForks_26| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_26|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_121|, #memory_int=|v_#memory_int_76|, #length=|v_#length_94|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|} OutVars{ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_19|, #pthreadsForks=|v_#pthreadsForks_25|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_121|, #memory_int=|v_#memory_int_75|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_17|, #length=|v_#length_94|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre29#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre27#1, ULTIMATE.start_main_#t~nondet28#1] 1244#[L98-3, L46-1]don't care [1128] L98-3-->L63-1: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre29#1_6|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_6|} OutVars{thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_18|, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_6|, thread2Thread1of1ForFork0_#t~post15#1=|v_thread2Thread1of1ForFork0_#t~post15#1_8|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_#t~mem11#1=|v_thread2Thread1of1ForFork0_#t~mem11#1_8|, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_42|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_34|, thread2Thread1of1ForFork0_#t~ret13#1=|v_thread2Thread1of1ForFork0_#t~ret13#1_8|, thread2Thread1of1ForFork0_#t~mem9#1=|v_thread2Thread1of1ForFork0_#t~mem9#1_10|, thread2Thread1of1ForFork0_#t~ret10#1=|v_thread2Thread1of1ForFork0_#t~ret10#1_12|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_66|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_18|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_#t~mem14#1=|v_thread2Thread1of1ForFork0_#t~mem14#1_8|, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_42|, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_26|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#t~ret12#1=|v_thread2Thread1of1ForFork0_#t~ret12#1_8|, thread2Thread1of1ForFork0_#t~ret16#1=|v_thread2Thread1of1ForFork0_#t~ret16#1_8|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork0_#t~post15#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_#t~mem11#1, thread2Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~ret13#1, thread2Thread1of1ForFork0_#t~mem9#1, thread2Thread1of1ForFork0_#t~ret10#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#t~mem14#1, thread2Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#t~ret12#1, thread2Thread1of1ForFork0_#t~ret16#1] 1246#[L98-4, L63-1, L46-1]don't care [2022-07-22 12:45:17,383 INFO L750 eck$LassoCheckResult]: Loop: 1246#[L98-4, L63-1, L46-1]don't care [1579] L63-1-->L63-1: Formula: (let ((.cse0 (* v_~j~0_122 4))) (let ((.cse11 (+ v_~A~0.offset_111 .cse0))) (let ((.cse2 (select (select |v_#memory_int_159| v_~A~0.base_111) .cse11))) (let ((.cse1 (+ .cse2 v_~bag2~0_109))) (and (<= (+ v_~A~0.offset_111 .cse0 4) (select |v_#length_192| v_~A~0.base_111)) (not (= (ite (or (<= .cse1 2147483647) (<= .cse2 0)) 1 0) 0)) (= (select |v_#valid_225| v_~A~0.base_111) 1) (< v_~j~0_122 v_~N~0_90) (let ((.cse10 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_197| |v_thread2Thread1of1ForFork0_plus_~b#1_199|))) (let ((.cse3 (<= 0 .cse11)) (.cse4 (= (ite (or (<= .cse10 2147483647) (<= |v_thread2Thread1of1ForFork0_plus_~b#1_199| 0)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_211|)) (.cse5 (= |v_thread2Thread1of1ForFork0_plus_#in~b#1_95| |v_thread2Thread1of1ForFork0_plus_~b#1_199|)) (.cse6 (= .cse10 |v_thread2Thread1of1ForFork0_plus_#res#1_143|)) (.cse7 (= v_~j~0_121 (+ v_~j~0_122 1))) (.cse8 (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_267| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_211|)) (.cse9 (= |v_thread2Thread1of1ForFork0_plus_~a#1_197| |v_thread2Thread1of1ForFork0_plus_#in~a#1_93|))) (or (and (= .cse2 |v_thread2Thread1of1ForFork0_plus_#in~b#1_95|) (= v_~bag2~0_108 |v_thread2Thread1of1ForFork0_plus_#res#1_143|) .cse3 .cse4 (= |v_thread2Thread1of1ForFork0_#t~mem14#1_34| |v_thread2Thread1of1ForFork0_#t~mem14#1_33|) (= v_~sum2~0_97 v_~sum2~0_98) .cse5 (= v_~bag2~0_109 |v_thread2Thread1of1ForFork0_plus_#in~a#1_93|) (= |v_thread2Thread1of1ForFork0_#t~ret13#1_32| |v_thread2Thread1of1ForFork0_#t~ret13#1_31|) .cse6 .cse7 .cse8 (< .cse1 v_~cap2~0_49) .cse9) (and .cse3 (= v_~sum2~0_97 |v_thread2Thread1of1ForFork0_plus_#res#1_143|) (= |v_thread2Thread1of1ForFork0_#t~ret12#1_34| |v_thread2Thread1of1ForFork0_#t~ret12#1_33|) (= v_~sum2~0_98 |v_thread2Thread1of1ForFork0_plus_#in~a#1_93|) .cse4 (= |v_thread2Thread1of1ForFork0_#t~mem11#1_31| |v_thread2Thread1of1ForFork0_#t~mem11#1_32|) .cse5 .cse6 (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_267| 0)) .cse7 .cse8 (not (= (ite (or (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_197| |v_thread2Thread1of1ForFork0_plus_~b#1_199| 2147483648)) (<= 0 |v_thread2Thread1of1ForFork0_plus_~b#1_199|)) 1 0) 0)) (= .cse2 v_~bag2~0_108) .cse9 (<= v_~cap2~0_49 .cse1) (= v_~bag2~0_109 |v_thread2Thread1of1ForFork0_plus_#in~b#1_95|))))) (not (= (ite (or (<= 0 (+ .cse2 v_~bag2~0_109 2147483648)) (<= 0 .cse2)) 1 0) 0))))))) InVars {~A~0.base=v_~A~0.base_111, ~j~0=v_~j~0_122, thread2Thread1of1ForFork0_#t~mem11#1=|v_thread2Thread1of1ForFork0_#t~mem11#1_32|, ~bag2~0=v_~bag2~0_109, ~sum2~0=v_~sum2~0_98, thread2Thread1of1ForFork0_#t~ret13#1=|v_thread2Thread1of1ForFork0_#t~ret13#1_32|, ~N~0=v_~N~0_90, ~A~0.offset=v_~A~0.offset_111, thread2Thread1of1ForFork0_#t~mem14#1=|v_thread2Thread1of1ForFork0_#t~mem14#1_34|, ~cap2~0=v_~cap2~0_49, #valid=|v_#valid_225|, #memory_int=|v_#memory_int_159|, #length=|v_#length_192|, thread2Thread1of1ForFork0_#t~ret12#1=|v_thread2Thread1of1ForFork0_#t~ret12#1_34|} OutVars{thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_93|, ~A~0.base=v_~A~0.base_111, ~j~0=v_~j~0_121, thread2Thread1of1ForFork0_#t~post15#1=|v_thread2Thread1of1ForFork0_#t~post15#1_35|, thread2Thread1of1ForFork0_#t~mem11#1=|v_thread2Thread1of1ForFork0_#t~mem11#1_31|, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_197|, ~bag2~0=v_~bag2~0_108, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_211|, ~sum2~0=v_~sum2~0_97, thread2Thread1of1ForFork0_#t~ret13#1=|v_thread2Thread1of1ForFork0_#t~ret13#1_31|, ~N~0=v_~N~0_90, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_267|, thread2Thread1of1ForFork0_#t~ret10#1=|v_thread2Thread1of1ForFork0_#t~ret10#1_47|, thread2Thread1of1ForFork0_#t~mem9#1=|v_thread2Thread1of1ForFork0_#t~mem9#1_55|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_95|, ~A~0.offset=v_~A~0.offset_111, thread2Thread1of1ForFork0_#t~mem14#1=|v_thread2Thread1of1ForFork0_#t~mem14#1_33|, ~cap2~0=v_~cap2~0_49, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_143|, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_199|, #valid=|v_#valid_225|, #memory_int=|v_#memory_int_159|, #length=|v_#length_192|, thread2Thread1of1ForFork0_#t~ret12#1=|v_thread2Thread1of1ForFork0_#t~ret12#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_plus_#in~a#1, ~j~0, thread2Thread1of1ForFork0_#t~post15#1, thread2Thread1of1ForFork0_#t~mem11#1, thread2Thread1of1ForFork0_plus_~a#1, ~bag2~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~sum2~0, thread2Thread1of1ForFork0_#t~ret13#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~ret10#1, thread2Thread1of1ForFork0_#t~mem9#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork0_#t~mem14#1, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork0_#t~ret12#1] 1246#[L98-4, L63-1, L46-1]don't care [2022-07-22 12:45:17,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:45:17,384 INFO L85 PathProgramCache]: Analyzing trace with hash 272750275, now seen corresponding path program 1 times [2022-07-22 12:45:17,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:45:17,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634402231] [2022-07-22 12:45:17,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:45:17,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:45:17,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:17,419 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:45:17,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:17,456 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:45:17,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:45:17,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1610, now seen corresponding path program 1 times [2022-07-22 12:45:17,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:45:17,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223421306] [2022-07-22 12:45:17,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:45:17,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:45:17,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:17,466 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:45:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:17,478 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:45:17,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:45:17,480 INFO L85 PathProgramCache]: Analyzing trace with hash -134674488, now seen corresponding path program 1 times [2022-07-22 12:45:17,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:45:17,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499995779] [2022-07-22 12:45:17,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:45:17,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:45:17,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:17,569 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:45:17,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:17,616 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:45:17,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2022-07-22 12:45:19,567 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:45:19,568 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:45:19,568 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:45:19,568 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:45:19,568 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:45:19,568 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:19,568 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:45:19,568 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:45:19,568 INFO L133 ssoRankerPreferences]: Filename of dumped script: parallel-misc-1.wvr.c_BEv2_Iteration6_Lasso [2022-07-22 12:45:19,568 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:45:19,568 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:45:19,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:19,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:19,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:19,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:19,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:19,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:19,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:19,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:19,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:19,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:19,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:19,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:19,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:19,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:19,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:19,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:19,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:19,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:19,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:19,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:19,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:19,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:19,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:19,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:19,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:19,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:19,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:19,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:19,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:19,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:19,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:19,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:19,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:19,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:19,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:19,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:19,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:19,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:19,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:19,871 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:910) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:819) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:253) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:356) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.runCegarLoops(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:331) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-22 12:45:19,875 INFO L158 Benchmark]: Toolchain (without parser) took 35054.44ms. Allocated memory was 160.4MB in the beginning and 299.9MB in the end (delta: 139.5MB). Free memory was 134.6MB in the beginning and 131.1MB in the end (delta: 3.5MB). Peak memory consumption was 180.0MB. Max. memory is 8.0GB. [2022-07-22 12:45:19,876 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 160.4MB. Free memory is still 131.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:45:19,876 INFO L158 Benchmark]: CACSL2BoogieTranslator took 340.01ms. Allocated memory is still 160.4MB. Free memory was 134.3MB in the beginning and 122.9MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-07-22 12:45:19,877 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.82ms. Allocated memory is still 160.4MB. Free memory was 122.8MB in the beginning and 120.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:45:19,877 INFO L158 Benchmark]: Boogie Preprocessor took 65.24ms. Allocated memory is still 160.4MB. Free memory was 120.3MB in the beginning and 118.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:45:19,877 INFO L158 Benchmark]: RCFGBuilder took 970.17ms. Allocated memory is still 160.4MB. Free memory was 118.3MB in the beginning and 132.9MB in the end (delta: -14.6MB). Peak memory consumption was 19.3MB. Max. memory is 8.0GB. [2022-07-22 12:45:19,878 INFO L158 Benchmark]: BuchiAutomizer took 33606.24ms. Allocated memory was 160.4MB in the beginning and 299.9MB in the end (delta: 139.5MB). Free memory was 132.9MB in the beginning and 131.1MB in the end (delta: 1.9MB). Peak memory consumption was 177.5MB. Max. memory is 8.0GB. [2022-07-22 12:45:19,880 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.18ms. Allocated memory is still 160.4MB. Free memory is still 131.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 340.01ms. Allocated memory is still 160.4MB. Free memory was 134.3MB in the beginning and 122.9MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.82ms. Allocated memory is still 160.4MB. Free memory was 122.8MB in the beginning and 120.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 65.24ms. Allocated memory is still 160.4MB. Free memory was 120.3MB in the beginning and 118.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 970.17ms. Allocated memory is still 160.4MB. Free memory was 118.3MB in the beginning and 132.9MB in the end (delta: -14.6MB). Peak memory consumption was 19.3MB. Max. memory is 8.0GB. * BuchiAutomizer took 33606.24ms. Allocated memory was 160.4MB in the beginning and 299.9MB in the end (delta: 139.5MB). Free memory was 132.9MB in the beginning and 131.1MB in the end (delta: 1.9MB). Peak memory consumption was 177.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.1s, 354 PlacesBefore, 20 PlacesAfterwards, 375 TransitionsBefore, 17 TransitionsAfterwards, 35532 CoEnabledTransitionPairs, 7 FixpointIterations, 99 TrivialSequentialCompositions, 238 ConcurrentSequentialCompositions, 19 TrivialYvCompositions, 68 ConcurrentYvCompositions, 24 ChoiceCompositions, 448 TotalNumberOfCompositions, 28625 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 28193, positive: 28170, positive conditional: 0, positive unconditional: 28170, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 20152, positive: 20137, positive conditional: 0, positive unconditional: 20137, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 28193, positive: 8033, positive conditional: 0, positive unconditional: 8033, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 20152, unknown conditional: 0, unknown unconditional: 20152] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 19, Positive conditional cache size: 0, Positive unconditional cache size: 19, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2 - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-22 12:45:19,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...