/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-syntacticLbe.epf -i ../../../trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:48:26,399 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:48:26,402 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:48:26,454 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:48:26,454 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:48:26,456 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:48:26,463 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:48:26,469 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:48:26,471 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:48:26,477 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:48:26,478 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:48:26,481 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:48:26,482 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:48:26,484 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:48:26,486 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:48:26,491 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:48:26,493 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:48:26,494 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:48:26,514 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:48:26,517 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:48:26,519 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:48:26,520 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:48:26,521 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:48:26,522 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:48:26,523 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:48:26,526 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:48:26,526 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:48:26,527 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:48:26,527 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:48:26,528 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:48:26,529 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:48:26,529 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:48:26,530 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:48:26,531 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:48:26,532 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:48:26,533 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:48:26,533 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:48:26,534 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:48:26,534 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:48:26,534 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:48:26,535 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:48:26,536 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:48:26,537 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:48:26,565 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:48:26,566 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:48:26,566 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:48:26,566 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:48:26,568 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:48:26,568 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:48:26,568 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:48:26,568 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:48:26,568 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:48:26,569 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:48:26,569 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:48:26,569 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:48:26,569 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:48:26,569 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:48:26,570 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:48:26,570 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:48:26,570 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:48:26,570 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:48:26,570 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:48:26,570 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:48:26,571 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:48:26,571 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:48:26,571 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:48:26,571 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:48:26,571 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:48:26,571 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:48:26,572 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:48:26,572 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:48:26,572 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:48:26,572 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:48:26,572 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:48:26,573 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-07-22 12:48:26,574 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:48:26,574 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:48:26,927 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:48:26,951 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:48:26,954 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:48:26,955 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:48:26,956 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:48:26,957 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c [2022-07-22 12:48:27,040 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0179171c/b38679bbb6a349e5afadbb5f414b224e/FLAG7bb609f25 [2022-07-22 12:48:27,681 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:48:27,682 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c [2022-07-22 12:48:27,693 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0179171c/b38679bbb6a349e5afadbb5f414b224e/FLAG7bb609f25 [2022-07-22 12:48:27,990 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0179171c/b38679bbb6a349e5afadbb5f414b224e [2022-07-22 12:48:27,993 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:48:27,999 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:48:28,003 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:48:28,003 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:48:28,007 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:48:28,009 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:48:27" (1/1) ... [2022-07-22 12:48:28,010 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7527f5ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:48:28, skipping insertion in model container [2022-07-22 12:48:28,011 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:48:27" (1/1) ... [2022-07-22 12:48:28,023 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:48:28,053 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:48:28,266 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c[3019,3032] [2022-07-22 12:48:28,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:48:28,284 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:48:28,316 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c[3019,3032] [2022-07-22 12:48:28,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:48:28,343 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:48:28,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:48:28 WrapperNode [2022-07-22 12:48:28,343 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:48:28,345 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:48:28,345 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:48:28,345 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:48:28,355 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:48:28" (1/1) ... [2022-07-22 12:48:28,367 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:48:28" (1/1) ... [2022-07-22 12:48:28,400 INFO L137 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 135 [2022-07-22 12:48:28,401 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:48:28,402 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:48:28,402 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:48:28,402 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:48:28,412 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:48:28" (1/1) ... [2022-07-22 12:48:28,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:48:28" (1/1) ... [2022-07-22 12:48:28,417 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:48:28" (1/1) ... [2022-07-22 12:48:28,418 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:48:28" (1/1) ... [2022-07-22 12:48:28,427 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:48:28" (1/1) ... [2022-07-22 12:48:28,433 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:48:28" (1/1) ... [2022-07-22 12:48:28,435 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:48:28" (1/1) ... [2022-07-22 12:48:28,440 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:48:28,441 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:48:28,441 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:48:28,442 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:48:28,443 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:48:28" (1/1) ... [2022-07-22 12:48:28,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:28,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:28,503 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:48:28,533 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:48:28,596 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:48:28,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:48:28,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:48:28,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:48:28,597 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 12:48:28,598 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 12:48:28,598 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 12:48:28,600 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 12:48:28,600 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-22 12:48:28,601 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-22 12:48:28,601 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-07-22 12:48:28,602 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-07-22 12:48:28,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:48:28,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 12:48:28,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 12:48:28,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 12:48:28,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:48:28,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:48:28,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:48:28,606 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:48:28,765 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:48:28,767 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:48:29,122 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:48:29,325 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:48:29,325 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-22 12:48:29,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:48:29 BoogieIcfgContainer [2022-07-22 12:48:29,329 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:48:29,333 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:48:29,333 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:48:29,342 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:48:29,346 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:48:29,347 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:48:27" (1/3) ... [2022-07-22 12:48:29,370 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@766e963e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:48:29, skipping insertion in model container [2022-07-22 12:48:29,371 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:48:29,371 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:48:28" (2/3) ... [2022-07-22 12:48:29,372 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@766e963e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:48:29, skipping insertion in model container [2022-07-22 12:48:29,372 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:48:29,372 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:48:29" (3/3) ... [2022-07-22 12:48:29,374 INFO L322 chiAutomizerObserver]: Analyzing ICFG popl20-min-max-dec.wvr.c [2022-07-22 12:48:29,604 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-07-22 12:48:29,658 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 170 places, 173 transitions, 378 flow [2022-07-22 12:48:29,791 INFO L129 PetriNetUnfolder]: 12/165 cut-off events. [2022-07-22 12:48:29,791 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-07-22 12:48:29,799 INFO L84 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 165 events. 12/165 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 111 event pairs, 0 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2022-07-22 12:48:29,800 INFO L82 GeneralOperation]: Start removeDead. Operand has 170 places, 173 transitions, 378 flow [2022-07-22 12:48:29,820 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 166 places, 165 transitions, 354 flow [2022-07-22 12:48:29,824 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-07-22 12:48:29,837 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 165 transitions, 354 flow [2022-07-22 12:48:29,841 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 166 places, 165 transitions, 354 flow [2022-07-22 12:48:29,842 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 166 places, 165 transitions, 354 flow [2022-07-22 12:48:29,914 INFO L129 PetriNetUnfolder]: 12/165 cut-off events. [2022-07-22 12:48:29,914 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-07-22 12:48:29,917 INFO L84 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 165 events. 12/165 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 115 event pairs, 0 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2022-07-22 12:48:29,920 INFO L116 LiptonReduction]: Number of co-enabled transitions 2280 [2022-07-22 12:48:37,453 INFO L131 LiptonReduction]: Checked pairs total: 3511 [2022-07-22 12:48:37,454 INFO L133 LiptonReduction]: Total number of compositions: 156 [2022-07-22 12:48:37,482 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:48:37,482 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:48:37,483 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:48:37,483 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:48:37,483 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:48:37,484 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:48:37,484 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:48:37,484 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:48:37,487 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:48:37,714 INFO L131 ngComponentsAnalysis]: Automaton has 225 accepting balls. 225 [2022-07-22 12:48:37,714 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:48:37,714 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:48:37,726 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:48:37,726 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:48:37,726 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:48:37,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 396 states, but on-demand construction may add more states [2022-07-22 12:48:37,766 INFO L131 ngComponentsAnalysis]: Automaton has 225 accepting balls. 225 [2022-07-22 12:48:37,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:48:37,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:48:37,767 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:48:37,767 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:48:37,776 INFO L748 eck$LassoCheckResult]: Stem: 173#[ULTIMATE.startENTRY]don't care [677] ULTIMATE.startENTRY-->L130-6: Formula: (let ((.cse2 (store |v_#valid_278| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57| 1))) (let ((.cse4 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_55| 1))) (let ((.cse0 (select |v_#memory_int_175| 1)) (.cse1 (store .cse4 |v_ULTIMATE.start_main_~#t4~0#1.base_57| 1))) (and (= (select |v_#valid_278| 1) 1) (= (select .cse0 1) 0) (not (= (ite (< 0 v_~N~0_71) 1 0) 0)) (< |v_#StackHeapBarrier_45| |v_ULTIMATE.start_main_~#t2~0#1.base_57|) (< |v_#StackHeapBarrier_45| |v_ULTIMATE.start_main_~#t4~0#1.base_57|) (= 25 (select |v_#length_207| 2)) (= v_~A~0.base_88 0) (= (select |v_#valid_278| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) 0) (= v_~b1~0_20 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_15| |v_ULTIMATE.start_create_fresh_int_array_~size#1_56|) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57|) 0) (= (select |v_#length_207| 1) 2) (= (store (store (store (store (store |v_#length_207| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_55| 4) |v_ULTIMATE.start_main_~#t4~0#1.base_57| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_56|)) |v_#length_205|) (= v_~max~0_52 0) (= (select .cse0 0) 48) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_45| 0) (< |v_#StackHeapBarrier_45| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_109| 0)) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43| 1) |v_#valid_276|) (= v_~b2~0_20 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43| 0) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_55|) 0) (= (select .cse4 |v_ULTIMATE.start_main_~#t4~0#1.base_57|) 0) (< 0 |v_#StackHeapBarrier_45|) (= v_~A~0.offset_88 0) (= v_~v_assert~0_32 0) (= v_~min~0_58 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_45| 0) (= (select |v_#valid_278| 2) 1) (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_50| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_15| v_~N~0_71) (= |v_#NULL.offset_8| 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43| |v_#StackHeapBarrier_45|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43| 0)) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_56| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= |v_#NULL.base_8| 0) (< |v_#StackHeapBarrier_45| |v_ULTIMATE.start_main_~#t3~0#1.base_55|) (= (select |v_#valid_278| 0) 0) (= 0 |v_ULTIMATE.start_main_~#t4~0#1.offset_45|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_109| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_45|, #valid=|v_#valid_278|, #memory_int=|v_#memory_int_175|, #length=|v_#length_207|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|, ULTIMATE.start_main_#t~mem26#1=|v_ULTIMATE.start_main_#t~mem26#1_22|, ~A~0.base=v_~A~0.base_88, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_45|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_29|, ULTIMATE.start_main_#t~mem27#1=|v_ULTIMATE.start_main_#t~mem27#1_22|, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_22|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_37|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_21|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_31|, #length=|v_#length_205|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_57|, ~b1~0=v_~b1~0_20, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_25|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_56|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_24|, ~v_assert~0=v_~v_assert~0_32, #StackHeapBarrier=|v_#StackHeapBarrier_45|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_37|, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_21|, ~min~0=v_~min~0_58, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_26|, ~b2~0=v_~b2~0_20, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_45|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_55|, ~max~0=v_~max~0_52, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_24|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_33|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_31|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_15|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_109|, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_31|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_40|, ~N~0=v_~N~0_71, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_50|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_51|, #NULL.base=|v_#NULL.base_8|, ~A~0.offset=v_~A~0.offset_88, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_31|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_26|, #valid=|v_#valid_276|, #memory_int=|v_#memory_int_175|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_45|, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_19|, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_32|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_57|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~mem26#1, ~A~0.base, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_main_#t~pre21#1, ULTIMATE.start_main_#t~mem27#1, ULTIMATE.start_main_#t~mem25#1, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset, ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~ret16#1.offset, #length, ULTIMATE.start_main_~#t4~0#1.base, ~b1~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~v_assert~0, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base, ULTIMATE.start_main_#t~nondet20#1, ~min~0, ULTIMATE.start_main_#t~nondet15#1, ~b2~0, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, ~max~0, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~pre19#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret16#1.base, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ~A~0.offset, ULTIMATE.start_main_#t~pre23#1, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, #valid, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_#t~mem28#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 176#[L130-6]don't care [2022-07-22 12:48:37,777 INFO L750 eck$LassoCheckResult]: Loop: 176#[L130-6]don't care [659] L130-6-->L130-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_33| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27| .cse1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_32| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_33| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_40|) (= (store |v_#memory_int_164| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27| (store (select |v_#memory_int_164| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_17|)) |v_#memory_int_163|) (<= 0 .cse0) (= (select |v_#valid_238| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) 1) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27| 4 .cse1) (select |v_#length_183| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_17|, #valid=|v_#valid_238|, #memory_int=|v_#memory_int_164|, #length=|v_#length_183|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_33|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_40|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_15|, #valid=|v_#valid_238|, #memory_int=|v_#memory_int_163|, #length=|v_#length_183|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_32|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_40|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~3#1] 176#[L130-6]don't care [2022-07-22 12:48:37,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:37,789 INFO L85 PathProgramCache]: Analyzing trace with hash 708, now seen corresponding path program 1 times [2022-07-22 12:48:37,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:37,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582908424] [2022-07-22 12:48:37,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:37,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:38,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:38,053 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:38,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:38,104 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:38,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:38,108 INFO L85 PathProgramCache]: Analyzing trace with hash 690, now seen corresponding path program 1 times [2022-07-22 12:48:38,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:38,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848054220] [2022-07-22 12:48:38,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:38,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:38,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:38,119 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:38,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:38,128 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:38,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:38,131 INFO L85 PathProgramCache]: Analyzing trace with hash 22607, now seen corresponding path program 1 times [2022-07-22 12:48:38,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:38,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620999258] [2022-07-22 12:48:38,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:38,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:38,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:38,176 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:38,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:38,241 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:39,638 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:48:39,639 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:48:39,640 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:48:39,640 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:48:39,640 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:48:39,641 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:39,641 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:48:39,642 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:48:39,643 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-min-max-dec.wvr.c_BEv2_Iteration1_Lasso [2022-07-22 12:48:39,643 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:48:39,644 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:48:39,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:39,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:39,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:39,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:39,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:39,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:39,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:40,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:48:40,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:48:40,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:40,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:40,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:40,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:40,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:48:40,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:48:40,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:48:40,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:48:40,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:40,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:40,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:40,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:48:40,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:48:40,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:48:40,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:48:40,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:48:40,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:40,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:48:40,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:40,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:40,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:40,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:40,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:48:40,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:48:40,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:40,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:48:40,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:40,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:48:40,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:48:40,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:48:40,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:48:40,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:40,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:48:40,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:40,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:40,998 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:48:41,004 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:48:41,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:41,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:41,012 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:48:41,020 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:48:41,021 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:48:41,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:41,031 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:41,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:41,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:41,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:41,034 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:41,035 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:41,049 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:41,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:41,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:41,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:41,088 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:48:41,092 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:48:41,093 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:48:41,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:41,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:41,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:41,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:41,105 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:48:41,106 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:48:41,112 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:41,152 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:48:41,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:41,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:41,154 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:48:41,163 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:48:41,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:41,177 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:41,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:41,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:41,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:41,180 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:41,180 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:41,182 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:48:41,192 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:41,217 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:48:41,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:41,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:41,219 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:48:41,220 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:48:41,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:48:41,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:41,228 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:41,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:41,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:41,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:41,230 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:41,230 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:41,231 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:41,253 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:48:41,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:41,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:41,255 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:48:41,264 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:48:41,265 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:48:41,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:41,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:41,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:41,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:41,276 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:48:41,276 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:48:41,281 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:41,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-07-22 12:48:41,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:41,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:41,311 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:48:41,314 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:48:41,315 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:48:41,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:41,323 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:48:41,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:41,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:41,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:41,324 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:48:41,324 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:48:41,325 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:41,347 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:48:41,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:41,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:41,348 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:48:41,349 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:48:41,351 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:41,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:41,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:41,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:41,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:41,362 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:48:41,362 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:48:41,385 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:41,407 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:48:41,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:41,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:41,409 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:48:41,410 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:48:41,413 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:48:41,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:41,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:41,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:41,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:41,424 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:48:41,424 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:48:41,435 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:41,463 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:48:41,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:41,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:41,466 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:48:41,466 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:48:41,467 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:41,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:41,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:41,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:41,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:41,477 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:48:41,477 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:48:41,486 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:41,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-22 12:48:41,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:41,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:41,511 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:48:41,512 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:48:41,513 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:48:41,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:41,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:41,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:41,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:41,522 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:48:41,523 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:48:41,548 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:41,583 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:48:41,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:41,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:41,585 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:48:41,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:41,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:41,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:41,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:41,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:41,601 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:48:41,601 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:48:41,606 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:48:41,614 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:41,651 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:48:41,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:41,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:41,653 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:48:41,661 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:48:41,662 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:48:41,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:41,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:41,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:41,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:41,675 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:48:41,675 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:48:41,688 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:41,722 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:48:41,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:41,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:41,724 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:48:41,725 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:48:41,728 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:48:41,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:41,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:41,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:41,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:41,742 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:48:41,742 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:48:41,756 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:41,793 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:48:41,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:41,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:41,795 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:48:41,800 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:48:41,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:41,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:41,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:41,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:41,812 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:48:41,812 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:48:41,817 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:48:41,829 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:48:41,865 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:48:41,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:41,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:41,868 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:48:41,879 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:48:41,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:48:41,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:48:41,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:48:41,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:48:41,894 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:48:41,894 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:48:41,903 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:48:41,912 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:48:41,935 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2022-07-22 12:48:41,935 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2022-07-22 12:48:41,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:41,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:48:41,939 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:48:41,945 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:48:41,955 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:48:41,979 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:48:41,980 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:48:41,980 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_~size#1) = -1*ULTIMATE.start_create_fresh_int_array_~i~3#1 + 1*ULTIMATE.start_create_fresh_int_array_~size#1 Supporting invariants [] [2022-07-22 12:48:42,023 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:48:42,168 INFO L257 tatePredicateManager]: 27 out of 27 supporting invariants were superfluous and have been removed [2022-07-22 12:48:42,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:42,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:42,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:48:42,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:42,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:42,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:48:42,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:48:42,247 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:48:42,284 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:48:42,287 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 396 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:48:42,365 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 396 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 398 states and 1476 transitions. Complement of second has 3 states. [2022-07-22 12:48:42,372 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:48:42,380 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:48:42,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2022-07-22 12:48:42,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 1 letters. [2022-07-22 12:48:42,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:42,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-22 12:48:42,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:42,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 2 letters. [2022-07-22 12:48:42,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:48:42,386 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 398 states and 1476 transitions. [2022-07-22 12:48:42,397 INFO L131 ngComponentsAnalysis]: Automaton has 224 accepting balls. 224 [2022-07-22 12:48:42,419 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 398 states to 378 states and 1420 transitions. [2022-07-22 12:48:42,421 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 376 [2022-07-22 12:48:42,428 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 377 [2022-07-22 12:48:42,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 378 states and 1420 transitions. [2022-07-22 12:48:42,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:48:42,441 INFO L220 hiAutomatonCegarLoop]: Abstraction has 378 states and 1420 transitions. [2022-07-22 12:48:42,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states and 1420 transitions. [2022-07-22 12:48:42,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2022-07-22 12:48:42,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 378 states have (on average 3.7566137566137567) internal successors, (1420), 377 states have internal predecessors, (1420), 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:48:42,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1420 transitions. [2022-07-22 12:48:42,521 INFO L242 hiAutomatonCegarLoop]: Abstraction has 378 states and 1420 transitions. [2022-07-22 12:48:42,522 INFO L425 stractBuchiCegarLoop]: Abstraction has 378 states and 1420 transitions. [2022-07-22 12:48:42,522 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:48:42,522 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 378 states and 1420 transitions. [2022-07-22 12:48:42,529 INFO L131 ngComponentsAnalysis]: Automaton has 224 accepting balls. 224 [2022-07-22 12:48:42,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:48:42,529 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:48:42,530 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 12:48:42,530 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:48:42,531 INFO L748 eck$LassoCheckResult]: Stem: 2250#[ULTIMATE.startENTRY]don't care [677] ULTIMATE.startENTRY-->L130-6: Formula: (let ((.cse2 (store |v_#valid_278| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57| 1))) (let ((.cse4 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_55| 1))) (let ((.cse0 (select |v_#memory_int_175| 1)) (.cse1 (store .cse4 |v_ULTIMATE.start_main_~#t4~0#1.base_57| 1))) (and (= (select |v_#valid_278| 1) 1) (= (select .cse0 1) 0) (not (= (ite (< 0 v_~N~0_71) 1 0) 0)) (< |v_#StackHeapBarrier_45| |v_ULTIMATE.start_main_~#t2~0#1.base_57|) (< |v_#StackHeapBarrier_45| |v_ULTIMATE.start_main_~#t4~0#1.base_57|) (= 25 (select |v_#length_207| 2)) (= v_~A~0.base_88 0) (= (select |v_#valid_278| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) 0) (= v_~b1~0_20 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_15| |v_ULTIMATE.start_create_fresh_int_array_~size#1_56|) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57|) 0) (= (select |v_#length_207| 1) 2) (= (store (store (store (store (store |v_#length_207| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_55| 4) |v_ULTIMATE.start_main_~#t4~0#1.base_57| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_56|)) |v_#length_205|) (= v_~max~0_52 0) (= (select .cse0 0) 48) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_45| 0) (< |v_#StackHeapBarrier_45| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_109| 0)) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43| 1) |v_#valid_276|) (= v_~b2~0_20 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43| 0) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_55|) 0) (= (select .cse4 |v_ULTIMATE.start_main_~#t4~0#1.base_57|) 0) (< 0 |v_#StackHeapBarrier_45|) (= v_~A~0.offset_88 0) (= v_~v_assert~0_32 0) (= v_~min~0_58 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_45| 0) (= (select |v_#valid_278| 2) 1) (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_50| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_15| v_~N~0_71) (= |v_#NULL.offset_8| 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43| |v_#StackHeapBarrier_45|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43| 0)) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_56| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= |v_#NULL.base_8| 0) (< |v_#StackHeapBarrier_45| |v_ULTIMATE.start_main_~#t3~0#1.base_55|) (= (select |v_#valid_278| 0) 0) (= 0 |v_ULTIMATE.start_main_~#t4~0#1.offset_45|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_109| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_45|, #valid=|v_#valid_278|, #memory_int=|v_#memory_int_175|, #length=|v_#length_207|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|, ULTIMATE.start_main_#t~mem26#1=|v_ULTIMATE.start_main_#t~mem26#1_22|, ~A~0.base=v_~A~0.base_88, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_45|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_29|, ULTIMATE.start_main_#t~mem27#1=|v_ULTIMATE.start_main_#t~mem27#1_22|, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_22|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_37|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_21|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_31|, #length=|v_#length_205|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_57|, ~b1~0=v_~b1~0_20, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_25|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_56|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_24|, ~v_assert~0=v_~v_assert~0_32, #StackHeapBarrier=|v_#StackHeapBarrier_45|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_37|, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_21|, ~min~0=v_~min~0_58, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_26|, ~b2~0=v_~b2~0_20, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_45|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_55|, ~max~0=v_~max~0_52, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_24|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_33|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_31|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_15|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_109|, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_31|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_40|, ~N~0=v_~N~0_71, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_50|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_51|, #NULL.base=|v_#NULL.base_8|, ~A~0.offset=v_~A~0.offset_88, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_31|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_26|, #valid=|v_#valid_276|, #memory_int=|v_#memory_int_175|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_45|, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_19|, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_32|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_57|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~mem26#1, ~A~0.base, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_main_#t~pre21#1, ULTIMATE.start_main_#t~mem27#1, ULTIMATE.start_main_#t~mem25#1, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset, ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~ret16#1.offset, #length, ULTIMATE.start_main_~#t4~0#1.base, ~b1~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~v_assert~0, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base, ULTIMATE.start_main_#t~nondet20#1, ~min~0, ULTIMATE.start_main_#t~nondet15#1, ~b2~0, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, ~max~0, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~pre19#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret16#1.base, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ~A~0.offset, ULTIMATE.start_main_#t~pre23#1, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, #valid, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_#t~mem28#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2246#[L130-6]don't care [663] L130-6-->L110-3: Formula: (and (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_38| |v_ULTIMATE.start_create_fresh_int_array_~size#1_46|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_16| v_~A~0.base_82) (= |v_#pthreadsForks_61| (+ |v_#pthreadsForks_62| 1)) (= (select |v_#valid_242| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_16| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|) (= |v_ULTIMATE.start_main_#t~pre17#1_27| |v_#pthreadsForks_62|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_33|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_16| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_16| v_~A~0.offset_82) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_33|) (select |v_#length_187| |v_ULTIMATE.start_main_~#t1~0#1.base_37|)) (= (store |v_#memory_int_168| |v_ULTIMATE.start_main_~#t1~0#1.base_37| (store (select |v_#memory_int_168| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) |v_ULTIMATE.start_main_~#t1~0#1.offset_33| |v_ULTIMATE.start_main_#t~pre17#1_27|)) |v_#memory_int_167|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|, #pthreadsForks=|v_#pthreadsForks_62|, 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_242|, #memory_int=|v_#memory_int_168|, #length=|v_#length_187|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_37|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_38|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_46|} OutVars{ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_25|, ~A~0.base=v_~A~0.base_82, 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|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_37|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_16|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_38|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_46|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_16|, ~A~0.offset=v_~A~0.offset_82, #pthreadsForks=|v_#pthreadsForks_61|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_25|, #valid=|v_#valid_242|, #memory_int=|v_#memory_int_167|, #length=|v_#length_187|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret16#1.base, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #pthreadsForks, ULTIMATE.start_main_#t~ret16#1.offset, #memory_int, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~pre17#1] 2234#[L110-3]don't care [508] L110-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre17#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|} OutVars{thread1Thread1of1ForFork0_#t~mem1=|v_thread1Thread1of1ForFork0_#t~mem1_4|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_4|, thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_4|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_14, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~ite5=|v_thread1Thread1of1ForFork0_#t~ite5_4|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~mem4, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~ite5] 2090#[thread1ENTRY, L110-4]don't care [469] thread1ENTRY-->L50: Formula: (and (= (select (select |v_#memory_int_37| v_~A~0.base_20) v_~A~0.offset_20) v_~min~0_16) (<= (+ v_~A~0.offset_20 4) (select |v_#length_39| v_~A~0.base_20)) (<= 0 v_~A~0.offset_20) (= (select |v_#valid_48| v_~A~0.base_20) 1)) InVars {#memory_int=|v_#memory_int_37|, ~A~0.base=v_~A~0.base_20, #length=|v_#length_39|, ~A~0.offset=v_~A~0.offset_20, #valid=|v_#valid_48|} OutVars{~A~0.base=v_~A~0.base_20, thread1Thread1of1ForFork0_#t~mem1=|v_thread1Thread1of1ForFork0_#t~mem1_1|, ~A~0.offset=v_~A~0.offset_20, ~min~0=v_~min~0_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_37|, #length=|v_#length_39|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1, ~min~0] 2084#[L50, L110-4]don't care [587] L50-->L56-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_21 0) (= v_~b1~0_6 1)) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_21, ~b1~0=v_~b1~0_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0, ~b1~0] 1764#[L110-4, L56-4]don't care [2022-07-22 12:48:42,531 INFO L750 eck$LassoCheckResult]: Loop: 1764#[L110-4, L56-4]don't care [632] L56-4-->L56-4: Formula: (let ((.cse3 (* v_thread1Thread1of1ForFork0_~i~0_28 4))) (let ((.cse2 (+ .cse3 v_~A~0.offset_70))) (and (let ((.cse1 (select (select |v_#memory_int_135| v_~A~0.base_70) .cse2))) (let ((.cse0 (< v_~min~0_47 .cse1))) (or (and (= |v_thread1_#t~mem4_30| |v_thread1Thread1of1ForFork0_#t~mem4_14|) (= v_~min~0_47 v_~min~0_46) .cse0) (and (not .cse0) (= .cse1 |v_thread1_#t~mem4_30|) (= v_~min~0_46 |v_thread1_#t~mem4_30|))))) (< v_thread1Thread1of1ForFork0_~i~0_28 v_~N~0_41) (<= 0 .cse2) (= (select |v_#valid_176| v_~A~0.base_70) 1) (<= (+ .cse3 v_~A~0.offset_70 4) (select |v_#length_145| v_~A~0.base_70)) (= (+ v_thread1Thread1of1ForFork0_~i~0_28 1) v_thread1Thread1of1ForFork0_~i~0_27)))) InVars {~A~0.base=v_~A~0.base_70, ~A~0.offset=v_~A~0.offset_70, thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_14|, ~min~0=v_~min~0_47, #valid=|v_#valid_176|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_28, #memory_int=|v_#memory_int_135|, #length=|v_#length_145|, ~N~0=v_~N~0_41} OutVars{~A~0.base=v_~A~0.base_70, ~A~0.offset=v_~A~0.offset_70, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_9|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_17|, ~min~0=v_~min~0_46, #valid=|v_#valid_176|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_27, #memory_int=|v_#memory_int_135|, #length=|v_#length_145|, ~N~0=v_~N~0_41, thread1Thread1of1ForFork0_#t~ite5=|v_thread1Thread1of1ForFork0_#t~ite5_9|} AuxVars[|v_thread1_#t~mem4_30|] AssignedVars[thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~mem4, thread1Thread1of1ForFork0_#t~post2, ~min~0, thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_#t~ite5] 1764#[L110-4, L56-4]don't care [2022-07-22 12:48:42,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:42,532 INFO L85 PathProgramCache]: Analyzing trace with hash 674107615, now seen corresponding path program 1 times [2022-07-22 12:48:42,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:42,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854154157] [2022-07-22 12:48:42,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:42,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:42,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:48:42,618 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:48:42,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:48:42,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854154157] [2022-07-22 12:48:42,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854154157] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:48:42,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:48:42,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 12:48:42,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146796628] [2022-07-22 12:48:42,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:48:42,624 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-07-22 12:48:42,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:42,625 INFO L85 PathProgramCache]: Analyzing trace with hash 663, now seen corresponding path program 1 times [2022-07-22 12:48:42,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:42,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456230697] [2022-07-22 12:48:42,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:42,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:42,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:42,633 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:42,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:42,641 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:42,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:48:42,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 12:48:42,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 12:48:42,720 INFO L87 Difference]: Start difference. First operand 378 states and 1420 transitions. cyclomatic complexity: 1267 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 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:48:42,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:48:42,802 INFO L93 Difference]: Finished difference Result 378 states and 1419 transitions. [2022-07-22 12:48:42,802 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 378 states and 1419 transitions. [2022-07-22 12:48:42,811 INFO L131 ngComponentsAnalysis]: Automaton has 224 accepting balls. 224 [2022-07-22 12:48:42,818 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 378 states to 378 states and 1419 transitions. [2022-07-22 12:48:42,819 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 377 [2022-07-22 12:48:42,820 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 377 [2022-07-22 12:48:42,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 378 states and 1419 transitions. [2022-07-22 12:48:42,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:48:42,822 INFO L220 hiAutomatonCegarLoop]: Abstraction has 378 states and 1419 transitions. [2022-07-22 12:48:42,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states and 1419 transitions. [2022-07-22 12:48:42,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2022-07-22 12:48:42,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 378 states have (on average 3.753968253968254) internal successors, (1419), 377 states have internal predecessors, (1419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:48:42,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1419 transitions. [2022-07-22 12:48:42,847 INFO L242 hiAutomatonCegarLoop]: Abstraction has 378 states and 1419 transitions. [2022-07-22 12:48:42,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 12:48:42,849 INFO L425 stractBuchiCegarLoop]: Abstraction has 378 states and 1419 transitions. [2022-07-22 12:48:42,849 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:48:42,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 378 states and 1419 transitions. [2022-07-22 12:48:42,859 INFO L131 ngComponentsAnalysis]: Automaton has 224 accepting balls. 224 [2022-07-22 12:48:42,859 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:48:42,859 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:48:42,860 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:48:42,860 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:48:42,861 INFO L748 eck$LassoCheckResult]: Stem: 3390#[ULTIMATE.startENTRY]don't care [677] ULTIMATE.startENTRY-->L130-6: Formula: (let ((.cse2 (store |v_#valid_278| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57| 1))) (let ((.cse4 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_55| 1))) (let ((.cse0 (select |v_#memory_int_175| 1)) (.cse1 (store .cse4 |v_ULTIMATE.start_main_~#t4~0#1.base_57| 1))) (and (= (select |v_#valid_278| 1) 1) (= (select .cse0 1) 0) (not (= (ite (< 0 v_~N~0_71) 1 0) 0)) (< |v_#StackHeapBarrier_45| |v_ULTIMATE.start_main_~#t2~0#1.base_57|) (< |v_#StackHeapBarrier_45| |v_ULTIMATE.start_main_~#t4~0#1.base_57|) (= 25 (select |v_#length_207| 2)) (= v_~A~0.base_88 0) (= (select |v_#valid_278| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) 0) (= v_~b1~0_20 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_15| |v_ULTIMATE.start_create_fresh_int_array_~size#1_56|) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|) 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57|) 0) (= (select |v_#length_207| 1) 2) (= (store (store (store (store (store |v_#length_207| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_55| 4) |v_ULTIMATE.start_main_~#t4~0#1.base_57| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_56|)) |v_#length_205|) (= v_~max~0_52 0) (= (select .cse0 0) 48) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_45| 0) (< |v_#StackHeapBarrier_45| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_109| 0)) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43| 1) |v_#valid_276|) (= v_~b2~0_20 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43| 0) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_55|) 0) (= (select .cse4 |v_ULTIMATE.start_main_~#t4~0#1.base_57|) 0) (< 0 |v_#StackHeapBarrier_45|) (= v_~A~0.offset_88 0) (= v_~v_assert~0_32 0) (= v_~min~0_58 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_45| 0) (= (select |v_#valid_278| 2) 1) (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_50| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_15| v_~N~0_71) (= |v_#NULL.offset_8| 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43| |v_#StackHeapBarrier_45|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43| 0)) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_56| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= |v_#NULL.base_8| 0) (< |v_#StackHeapBarrier_45| |v_ULTIMATE.start_main_~#t3~0#1.base_55|) (= (select |v_#valid_278| 0) 0) (= 0 |v_ULTIMATE.start_main_~#t4~0#1.offset_45|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_109| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_45|, #valid=|v_#valid_278|, #memory_int=|v_#memory_int_175|, #length=|v_#length_207|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|, ULTIMATE.start_main_#t~mem26#1=|v_ULTIMATE.start_main_#t~mem26#1_22|, ~A~0.base=v_~A~0.base_88, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_45|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_29|, ULTIMATE.start_main_#t~mem27#1=|v_ULTIMATE.start_main_#t~mem27#1_22|, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_22|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_37|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_21|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_31|, #length=|v_#length_205|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_57|, ~b1~0=v_~b1~0_20, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_25|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_56|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_24|, ~v_assert~0=v_~v_assert~0_32, #StackHeapBarrier=|v_#StackHeapBarrier_45|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_37|, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_21|, ~min~0=v_~min~0_58, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_26|, ~b2~0=v_~b2~0_20, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_45|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_55|, ~max~0=v_~max~0_52, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_24|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_33|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_31|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_15|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_109|, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_31|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_40|, ~N~0=v_~N~0_71, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_50|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_51|, #NULL.base=|v_#NULL.base_8|, ~A~0.offset=v_~A~0.offset_88, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_31|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_26|, #valid=|v_#valid_276|, #memory_int=|v_#memory_int_175|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_45|, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_19|, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_32|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_57|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~mem26#1, ~A~0.base, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_main_#t~pre21#1, ULTIMATE.start_main_#t~mem27#1, ULTIMATE.start_main_#t~mem25#1, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset, ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~ret16#1.offset, #length, ULTIMATE.start_main_~#t4~0#1.base, ~b1~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~v_assert~0, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base, ULTIMATE.start_main_#t~nondet20#1, ~min~0, ULTIMATE.start_main_#t~nondet15#1, ~b2~0, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, ~max~0, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~pre19#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret16#1.base, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ~A~0.offset, ULTIMATE.start_main_#t~pre23#1, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, #valid, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_#t~mem28#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 3386#[L130-6]don't care [659] L130-6-->L130-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_33| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27| .cse1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_32| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_33| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_40|) (= (store |v_#memory_int_164| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27| (store (select |v_#memory_int_164| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_17|)) |v_#memory_int_163|) (<= 0 .cse0) (= (select |v_#valid_238| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) 1) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27| 4 .cse1) (select |v_#length_183| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_17|, #valid=|v_#valid_238|, #memory_int=|v_#memory_int_164|, #length=|v_#length_183|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_33|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_40|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_15|, #valid=|v_#valid_238|, #memory_int=|v_#memory_int_163|, #length=|v_#length_183|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_32|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_40|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~3#1] 3388#[L130-6]don't care [663] L130-6-->L110-3: Formula: (and (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_38| |v_ULTIMATE.start_create_fresh_int_array_~size#1_46|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_16| v_~A~0.base_82) (= |v_#pthreadsForks_61| (+ |v_#pthreadsForks_62| 1)) (= (select |v_#valid_242| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_16| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|) (= |v_ULTIMATE.start_main_#t~pre17#1_27| |v_#pthreadsForks_62|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_33|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_16| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_16| v_~A~0.offset_82) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_33|) (select |v_#length_187| |v_ULTIMATE.start_main_~#t1~0#1.base_37|)) (= (store |v_#memory_int_168| |v_ULTIMATE.start_main_~#t1~0#1.base_37| (store (select |v_#memory_int_168| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) |v_ULTIMATE.start_main_~#t1~0#1.offset_33| |v_ULTIMATE.start_main_#t~pre17#1_27|)) |v_#memory_int_167|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|, #pthreadsForks=|v_#pthreadsForks_62|, 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_242|, #memory_int=|v_#memory_int_168|, #length=|v_#length_187|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_37|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_38|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_46|} OutVars{ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_25|, ~A~0.base=v_~A~0.base_82, 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|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_37|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_16|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_38|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_46|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_16|, ~A~0.offset=v_~A~0.offset_82, #pthreadsForks=|v_#pthreadsForks_61|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_25|, #valid=|v_#valid_242|, #memory_int=|v_#memory_int_167|, #length=|v_#length_187|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret16#1.base, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #pthreadsForks, ULTIMATE.start_main_#t~ret16#1.offset, #memory_int, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~pre17#1] 3372#[L110-3]don't care [508] L110-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre17#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|} OutVars{thread1Thread1of1ForFork0_#t~mem1=|v_thread1Thread1of1ForFork0_#t~mem1_4|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_4|, thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_4|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_14, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~ite5=|v_thread1Thread1of1ForFork0_#t~ite5_4|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~mem4, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~ite5] 3230#[thread1ENTRY, L110-4]don't care [469] thread1ENTRY-->L50: Formula: (and (= (select (select |v_#memory_int_37| v_~A~0.base_20) v_~A~0.offset_20) v_~min~0_16) (<= (+ v_~A~0.offset_20 4) (select |v_#length_39| v_~A~0.base_20)) (<= 0 v_~A~0.offset_20) (= (select |v_#valid_48| v_~A~0.base_20) 1)) InVars {#memory_int=|v_#memory_int_37|, ~A~0.base=v_~A~0.base_20, #length=|v_#length_39|, ~A~0.offset=v_~A~0.offset_20, #valid=|v_#valid_48|} OutVars{~A~0.base=v_~A~0.base_20, thread1Thread1of1ForFork0_#t~mem1=|v_thread1Thread1of1ForFork0_#t~mem1_1|, ~A~0.offset=v_~A~0.offset_20, ~min~0=v_~min~0_16, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_37|, #length=|v_#length_39|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1, ~min~0] 3226#[L50, L110-4]don't care [587] L50-->L56-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_21 0) (= v_~b1~0_6 1)) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_21, ~b1~0=v_~b1~0_6} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0, ~b1~0] 2904#[L110-4, L56-4]don't care [2022-07-22 12:48:42,861 INFO L750 eck$LassoCheckResult]: Loop: 2904#[L110-4, L56-4]don't care [632] L56-4-->L56-4: Formula: (let ((.cse3 (* v_thread1Thread1of1ForFork0_~i~0_28 4))) (let ((.cse2 (+ .cse3 v_~A~0.offset_70))) (and (let ((.cse1 (select (select |v_#memory_int_135| v_~A~0.base_70) .cse2))) (let ((.cse0 (< v_~min~0_47 .cse1))) (or (and (= |v_thread1_#t~mem4_30| |v_thread1Thread1of1ForFork0_#t~mem4_14|) (= v_~min~0_47 v_~min~0_46) .cse0) (and (not .cse0) (= .cse1 |v_thread1_#t~mem4_30|) (= v_~min~0_46 |v_thread1_#t~mem4_30|))))) (< v_thread1Thread1of1ForFork0_~i~0_28 v_~N~0_41) (<= 0 .cse2) (= (select |v_#valid_176| v_~A~0.base_70) 1) (<= (+ .cse3 v_~A~0.offset_70 4) (select |v_#length_145| v_~A~0.base_70)) (= (+ v_thread1Thread1of1ForFork0_~i~0_28 1) v_thread1Thread1of1ForFork0_~i~0_27)))) InVars {~A~0.base=v_~A~0.base_70, ~A~0.offset=v_~A~0.offset_70, thread1Thread1of1ForFork0_#t~mem4=|v_thread1Thread1of1ForFork0_#t~mem4_14|, ~min~0=v_~min~0_47, #valid=|v_#valid_176|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_28, #memory_int=|v_#memory_int_135|, #length=|v_#length_145|, ~N~0=v_~N~0_41} OutVars{~A~0.base=v_~A~0.base_70, ~A~0.offset=v_~A~0.offset_70, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_9|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_17|, ~min~0=v_~min~0_46, #valid=|v_#valid_176|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_27, #memory_int=|v_#memory_int_135|, #length=|v_#length_145|, ~N~0=v_~N~0_41, thread1Thread1of1ForFork0_#t~ite5=|v_thread1Thread1of1ForFork0_#t~ite5_9|} AuxVars[|v_thread1_#t~mem4_30|] AssignedVars[thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~mem4, thread1Thread1of1ForFork0_#t~post2, ~min~0, thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_#t~ite5] 2904#[L110-4, L56-4]don't care [2022-07-22 12:48:42,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:42,862 INFO L85 PathProgramCache]: Analyzing trace with hash -576542486, now seen corresponding path program 1 times [2022-07-22 12:48:42,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:42,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263677475] [2022-07-22 12:48:42,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:42,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:42,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:42,951 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:42,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:42,982 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:42,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:42,983 INFO L85 PathProgramCache]: Analyzing trace with hash 663, now seen corresponding path program 2 times [2022-07-22 12:48:42,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:42,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620360819] [2022-07-22 12:48:42,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:42,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:42,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:42,990 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:42,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:42,996 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:42,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:48:42,997 INFO L85 PathProgramCache]: Analyzing trace with hash -692947250, now seen corresponding path program 1 times [2022-07-22 12:48:42,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:48:42,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134897323] [2022-07-22 12:48:42,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:48:42,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:48:43,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:43,038 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:48:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:48:43,147 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:48:43,192 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:48:45,449 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:48:45,450 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:48:45,450 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:48:45,450 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:48:45,450 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:48:45,450 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:48:45,451 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:48:45,451 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:48:45,451 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-min-max-dec.wvr.c_BEv2_Iteration3_Lasso [2022-07-22 12:48:45,451 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:48:45,451 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:48:45,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:45,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:45,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:45,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:45,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:45,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:45,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:45,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:45,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:45,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:45,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:45,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:45,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:45,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:45,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:45,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:45,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:48:45,864 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:48:45,867 INFO L158 Benchmark]: Toolchain (without parser) took 17872.03ms. Allocated memory was 151.0MB in the beginning and 250.6MB in the end (delta: 99.6MB). Free memory was 125.2MB in the beginning and 102.1MB in the end (delta: 23.1MB). Peak memory consumption was 148.7MB. Max. memory is 8.0GB. [2022-07-22 12:48:45,868 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 151.0MB. Free memory is still 122.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:48:45,869 INFO L158 Benchmark]: CACSL2BoogieTranslator took 341.04ms. Allocated memory is still 151.0MB. Free memory was 124.9MB in the beginning and 113.4MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-07-22 12:48:45,870 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.13ms. Allocated memory is still 151.0MB. Free memory was 113.4MB in the beginning and 111.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:48:45,870 INFO L158 Benchmark]: Boogie Preprocessor took 38.66ms. Allocated memory is still 151.0MB. Free memory was 111.6MB in the beginning and 109.7MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-22 12:48:45,871 INFO L158 Benchmark]: RCFGBuilder took 887.63ms. Allocated memory is still 151.0MB. Free memory was 109.7MB in the beginning and 131.0MB in the end (delta: -21.3MB). Peak memory consumption was 28.5MB. Max. memory is 8.0GB. [2022-07-22 12:48:45,872 INFO L158 Benchmark]: BuchiAutomizer took 16533.30ms. Allocated memory was 151.0MB in the beginning and 250.6MB in the end (delta: 99.6MB). Free memory was 131.0MB in the beginning and 102.1MB in the end (delta: 29.0MB). Peak memory consumption was 153.8MB. Max. memory is 8.0GB. [2022-07-22 12:48:45,875 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.19ms. Allocated memory is still 151.0MB. Free memory is still 122.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 341.04ms. Allocated memory is still 151.0MB. Free memory was 124.9MB in the beginning and 113.4MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.13ms. Allocated memory is still 151.0MB. Free memory was 113.4MB in the beginning and 111.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.66ms. Allocated memory is still 151.0MB. Free memory was 111.6MB in the beginning and 109.7MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 887.63ms. Allocated memory is still 151.0MB. Free memory was 109.7MB in the beginning and 131.0MB in the end (delta: -21.3MB). Peak memory consumption was 28.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 16533.30ms. Allocated memory was 151.0MB in the beginning and 250.6MB in the end (delta: 99.6MB). Free memory was 131.0MB in the beginning and 102.1MB in the end (delta: 29.0MB). Peak memory consumption was 153.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.6s, 166 PlacesBefore, 40 PlacesAfterwards, 165 TransitionsBefore, 31 TransitionsAfterwards, 2280 CoEnabledTransitionPairs, 7 FixpointIterations, 89 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 17 TrivialYvCompositions, 6 ConcurrentYvCompositions, 8 ChoiceCompositions, 156 TotalNumberOfCompositions, 3511 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2544, positive: 2457, positive conditional: 0, positive unconditional: 2457, negative: 87, negative conditional: 0, negative unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1212, positive: 1181, positive conditional: 0, positive unconditional: 1181, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2544, positive: 1276, positive conditional: 0, positive unconditional: 1276, negative: 56, negative conditional: 0, negative unconditional: 56, unknown: 1212, unknown conditional: 0, unknown unconditional: 1212] , Statistics on independence cache: Total cache size (in pairs): 100, Positive cache size: 91, Positive conditional cache size: 0, Positive unconditional cache size: 91, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9 - 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:48:45,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...