/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-semanticLbe.epf -i ../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:20:36,745 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:20:36,749 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:20:36,809 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:20:36,810 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:20:36,812 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:20:36,819 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:20:36,825 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:20:36,827 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:20:36,835 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:20:36,845 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:20:36,846 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:20:36,847 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:20:36,849 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:20:36,850 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:20:36,852 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:20:36,853 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:20:36,854 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:20:36,858 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:20:36,869 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:20:36,873 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:20:36,876 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:20:36,877 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:20:36,878 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:20:36,880 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:20:36,890 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:20:36,890 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:20:36,891 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:20:36,892 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:20:36,893 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:20:36,894 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:20:36,895 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:20:36,897 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:20:36,898 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:20:36,899 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:20:36,900 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:20:36,900 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:20:36,901 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:20:36,901 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:20:36,902 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:20:36,904 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:20:36,905 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:20:36,912 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf [2022-07-22 12:20:36,961 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:20:36,962 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:20:36,962 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:20:36,962 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:20:36,963 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:20:36,965 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:20:36,965 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:20:36,965 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:20:36,965 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:20:36,966 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:20:36,966 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:20:36,967 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:20:36,967 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:20:36,967 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:20:36,967 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:20:36,967 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:20:36,968 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:20:36,968 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:20:36,968 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:20:36,968 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:20:36,968 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:20:36,969 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:20:36,969 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:20:36,969 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:20:36,969 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:20:36,969 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:20:36,969 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:20:36,970 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:20:36,970 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:20:36,970 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:20:36,971 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:20:36,973 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:20:36,973 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:20:37,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:20:37,405 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:20:37,408 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:20:37,409 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:20:37,410 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:20:37,412 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2022-07-22 12:20:37,491 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de453edd1/b0dc3b939eb34171bf07b65a866f48a4/FLAGc1696e661 [2022-07-22 12:20:38,057 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:20:38,058 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2022-07-22 12:20:38,070 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de453edd1/b0dc3b939eb34171bf07b65a866f48a4/FLAGc1696e661 [2022-07-22 12:20:38,423 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de453edd1/b0dc3b939eb34171bf07b65a866f48a4 [2022-07-22 12:20:38,427 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:20:38,433 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:20:38,435 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:20:38,435 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:20:38,439 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:20:38,440 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:20:38" (1/1) ... [2022-07-22 12:20:38,441 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a5e9986 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:20:38, skipping insertion in model container [2022-07-22 12:20:38,441 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:20:38" (1/1) ... [2022-07-22 12:20:38,449 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:20:38,470 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:20:38,651 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-bad-counter-queue.wvr.c[2428,2441] [2022-07-22 12:20:38,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:20:38,678 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:20:38,725 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-bad-counter-queue.wvr.c[2428,2441] [2022-07-22 12:20:38,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:20:38,750 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:20:38,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:20:38 WrapperNode [2022-07-22 12:20:38,751 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:20:38,752 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:20:38,753 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:20:38,753 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:20:38,760 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:20:38" (1/1) ... [2022-07-22 12:20:38,769 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:20:38" (1/1) ... [2022-07-22 12:20:38,798 INFO L137 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 140 [2022-07-22 12:20:38,799 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:20:38,800 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:20:38,800 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:20:38,800 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:20:38,812 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:20:38" (1/1) ... [2022-07-22 12:20:38,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:20:38" (1/1) ... [2022-07-22 12:20:38,815 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:20:38" (1/1) ... [2022-07-22 12:20:38,816 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:20:38" (1/1) ... [2022-07-22 12:20:38,825 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:20:38" (1/1) ... [2022-07-22 12:20:38,830 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:20:38" (1/1) ... [2022-07-22 12:20:38,832 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:20:38" (1/1) ... [2022-07-22 12:20:38,835 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:20:38,836 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:20:38,836 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:20:38,837 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:20:38,837 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:20:38" (1/1) ... [2022-07-22 12:20:38,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:20:38,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:20:38,876 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:20:38,898 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:20:38,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:20:38,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:20:38,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:20:38,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:20:38,944 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 12:20:38,944 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 12:20:38,944 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 12:20:38,945 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 12:20:38,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:20:38,945 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 12:20:38,945 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 12:20:38,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 12:20:38,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:20:38,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:20:38,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:20:38,948 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:20:39,037 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:20:39,038 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:20:39,394 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:20:39,670 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:20:39,671 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-22 12:20:39,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:20:39 BoogieIcfgContainer [2022-07-22 12:20:39,675 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:20:39,676 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:20:39,677 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:20:39,681 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:20:39,682 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:20:39,682 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:20:38" (1/3) ... [2022-07-22 12:20:39,684 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53d3c908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:20:39, skipping insertion in model container [2022-07-22 12:20:39,684 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:20:39,684 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:20:38" (2/3) ... [2022-07-22 12:20:39,684 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53d3c908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:20:39, skipping insertion in model container [2022-07-22 12:20:39,685 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:20:39,685 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:20:39" (3/3) ... [2022-07-22 12:20:39,686 INFO L322 chiAutomizerObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2022-07-22 12:20:39,791 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-22 12:20:39,831 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 114 places, 118 transitions, 252 flow [2022-07-22 12:20:39,887 INFO L129 PetriNetUnfolder]: 9/114 cut-off events. [2022-07-22 12:20:39,887 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:20:39,892 INFO L84 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 114 events. 9/114 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2022-07-22 12:20:39,892 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 118 transitions, 252 flow [2022-07-22 12:20:39,901 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 114 transitions, 240 flow [2022-07-22 12:20:39,905 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-07-22 12:20:39,925 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 114 transitions, 240 flow [2022-07-22 12:20:39,929 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 114 transitions, 240 flow [2022-07-22 12:20:39,929 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 112 places, 114 transitions, 240 flow [2022-07-22 12:20:39,956 INFO L129 PetriNetUnfolder]: 9/114 cut-off events. [2022-07-22 12:20:39,956 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:20:39,957 INFO L84 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 114 events. 9/114 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2022-07-22 12:20:39,959 INFO L116 LiptonReduction]: Number of co-enabled transitions 572 [2022-07-22 12:20:44,100 INFO L131 LiptonReduction]: Checked pairs total: 874 [2022-07-22 12:20:44,100 INFO L133 LiptonReduction]: Total number of compositions: 113 [2022-07-22 12:20:44,125 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:20:44,125 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:20:44,125 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:20:44,125 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:20:44,125 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:20:44,126 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:20:44,126 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:20:44,126 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:20:44,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:20:44,171 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 33 [2022-07-22 12:20:44,172 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:20:44,172 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:20:44,177 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:20:44,177 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:20:44,177 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:20:44,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 52 states, but on-demand construction may add more states [2022-07-22 12:20:44,184 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 33 [2022-07-22 12:20:44,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:20:44,185 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:20:44,185 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:20:44,185 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:20:44,190 INFO L748 eck$LassoCheckResult]: Stem: 117#[ULTIMATE.startENTRY]don't care [542] ULTIMATE.startENTRY-->L97-6: Formula: (let ((.cse2 (store |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 1))) (let ((.cse1 (select |v_#memory_int_In_1| 1)) (.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 1))) (and (= v_~N~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|) 0) (= (select |v_#valid_In_3| 2) 1) (= 0 |v_#NULL.base_Out_2|) (= (select .cse1 1) 0) (= 48 (select .cse1 0)) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|) (= (select |v_#valid_In_3| 1) 1) (= |v_#NULL.offset_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) 0) (= v_~A~0.base_Out_2 0) (< 0 |v_#StackHeapBarrier_In_3|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|) 0) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 1) |v_#valid_Out_6|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= 2 (select |v_#length_In_3| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_Out_6| 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2| 0) (= (select |v_#valid_In_3| 0) 0) (= v_~A~0.offset_Out_2 0) (= v_~counter~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 0)) (= |v_#length_Out_6| (store (store (store |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| |v_#StackHeapBarrier_In_3|) (= (select |v_#length_In_3| 2) 31) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|)))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_3|, #valid=|v_#valid_In_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_Out_2|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10|, #length=|v_#length_Out_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_Out_6|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_Out_6|, ~counter~0=v_~counter~0_Out_2, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset_Out_6|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_2|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ~A~0.offset=v_~A~0.offset_Out_2, #valid=|v_#valid_Out_6|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~mem13#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_create_fresh_int_array_#t~post16#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_create_fresh_int_array_#t~nondet17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #length, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base, ~counter~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #valid, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 120#[L97-6]don't care [2022-07-22 12:20:44,191 INFO L750 eck$LassoCheckResult]: Loop: 120#[L97-6]don't care [527] L97-6-->L97-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_41| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37| 4) (select |v_#length_134| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|)) (= (select |v_#valid_163| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_40| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_41| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_41| |v_ULTIMATE.start_create_fresh_int_array_~size#1_46|) (= (store |v_#memory_int_108| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| (store (select |v_#memory_int_108| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_23|)) |v_#memory_int_107|) (<= 0 .cse1)))) InVars {ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_23|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|, #valid=|v_#valid_163|, #memory_int=|v_#memory_int_108|, #length=|v_#length_134|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_41|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_46|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|, ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_19|, #valid=|v_#valid_163|, #memory_int=|v_#memory_int_107|, #length=|v_#length_134|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_40|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_46|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet17#1, ULTIMATE.start_create_fresh_int_array_#t~post16#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~2#1] 120#[L97-6]don't care [2022-07-22 12:20:44,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:20:44,197 INFO L85 PathProgramCache]: Analyzing trace with hash 573, now seen corresponding path program 1 times [2022-07-22 12:20:44,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:20:44,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633030865] [2022-07-22 12:20:44,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:20:44,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:20:44,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:20:44,351 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:20:44,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:20:44,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:20:44,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:20:44,403 INFO L85 PathProgramCache]: Analyzing trace with hash 558, now seen corresponding path program 1 times [2022-07-22 12:20:44,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:20:44,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284102996] [2022-07-22 12:20:44,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:20:44,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:20:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:20:44,414 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:20:44,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:20:44,424 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:20:44,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:20:44,426 INFO L85 PathProgramCache]: Analyzing trace with hash 18290, now seen corresponding path program 1 times [2022-07-22 12:20:44,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:20:44,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134053042] [2022-07-22 12:20:44,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:20:44,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:20:44,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:20:44,490 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:20:44,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:20:44,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:20:45,220 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:20:45,221 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:20:45,221 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:20:45,221 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:20:45,221 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:20:45,221 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:20:45,222 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:20:45,222 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:20:45,222 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-bad-counter-queue.wvr.c_BEv2_Iteration1_Lasso [2022-07-22 12:20:45,222 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:20:45,222 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:20:45,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:20:45,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:20:45,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:20:45,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:20:45,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:20:45,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:20:45,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:20:45,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:20:45,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:20:45,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:20:45,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:20:45,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:20:45,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:20:45,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:20:45,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:20:45,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:20:45,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:20:45,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:20:45,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:20:45,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:20:45,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:20:45,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:20:45,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:20:45,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:20:45,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:20:45,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:20:45,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:20:45,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:20:46,010 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:20:46,015 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:20:46,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:20:46,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:20:46,023 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:20:46,026 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:20:46,027 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:20:46,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:20:46,036 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:20:46,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:20:46,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:20:46,037 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:20:46,039 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:20:46,039 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:20:46,044 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:20:46,066 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:20:46,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:20:46,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:20:46,068 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:20:46,075 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:20:46,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:20:46,083 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:20:46,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:20:46,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:20:46,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:20:46,084 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:20:46,084 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:20:46,086 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:20:46,086 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:20:46,115 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:20:46,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:20:46,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:20:46,117 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:20:46,120 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:20:46,122 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:20:46,127 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:20:46,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:20:46,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:20:46,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:20:46,132 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:20:46,132 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:20:46,144 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:20:46,175 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:20:46,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:20:46,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:20:46,176 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:20:46,177 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:20:46,180 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:20:46,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:20:46,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:20:46,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:20:46,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:20:46,191 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:20:46,191 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:20:46,202 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:20:46,237 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:20:46,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:20:46,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:20:46,240 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:20:46,252 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:20:46,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:20:46,261 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:20:46,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:20:46,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:20:46,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:20:46,262 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:20:46,263 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:20:46,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:20:46,273 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:20:46,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-22 12:20:46,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:20:46,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:20:46,301 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:20:46,302 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:20:46,305 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:20:46,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:20:46,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:20:46,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:20:46,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:20:46,317 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:20:46,317 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:20:46,321 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:20:46,342 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:20:46,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:20:46,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:20:46,344 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:20:46,345 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:20:46,345 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:20:46,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:20:46,352 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:20:46,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:20:46,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:20:46,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:20:46,352 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:20:46,353 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:20:46,353 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:20:46,377 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:20:46,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:20:46,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:20:46,378 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:20:46,379 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:20:46,380 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:20:46,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:20:46,386 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:20:46,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:20:46,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:20:46,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:20:46,387 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:20:46,388 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:20:46,396 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:20:46,420 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:20:46,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:20:46,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:20:46,422 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:20:46,424 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:20:46,424 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:20:46,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:20:46,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:20:46,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:20:46,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:20:46,438 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:20:46,439 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:20:46,453 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:20:46,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-07-22 12:20:46,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:20:46,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:20:46,487 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:20:46,489 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:20:46,490 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:20:46,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:20:46,498 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:20:46,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:20:46,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:20:46,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:20:46,499 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:20:46,499 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:20:46,514 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:20:46,549 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:20:46,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:20:46,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:20:46,550 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:20:46,556 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:20:46,561 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:20:46,563 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:20:46,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:20:46,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:20:46,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:20:46,566 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:20:46,566 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:20:46,581 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:20:46,615 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:20:46,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:20:46,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:20:46,617 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:20:46,622 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:20:46,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:20:46,630 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:20:46,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:20:46,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:20:46,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:20:46,631 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:20:46,631 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:20:46,632 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:20:46,644 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:20:46,673 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:20:46,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:20:46,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:20:46,674 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:20:46,675 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:20:46,676 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:20:46,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:20:46,683 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:20:46,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:20:46,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:20:46,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:20:46,684 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:20:46,684 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:20:46,685 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:20:46,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-07-22 12:20:46,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:20:46,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:20:46,711 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:20:46,712 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:20:46,713 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:20:46,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:20:46,720 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:20:46,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:20:46,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:20:46,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:20:46,721 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:20:46,721 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:20:46,722 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:20:46,744 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:20:46,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:20:46,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:20:46,745 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:20:46,746 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:20:46,749 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:20:46,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:20:46,757 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:20:46,757 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:20:46,757 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:20:46,759 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:20:46,760 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:20:46,784 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:20:46,818 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:20:46,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:20:46,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:20:46,820 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:20:46,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:20:46,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:20:46,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:20:46,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:20:46,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:20:46,836 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:20:46,836 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:20:46,840 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:20:46,850 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:20:46,884 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:20:46,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:20:46,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:20:46,886 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:20:46,891 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:20:46,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:20:46,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:20:46,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:20:46,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:20:46,902 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:20:46,902 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:20:46,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-22 12:20:46,915 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:20:46,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-22 12:20:46,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:20:46,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:20:46,952 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:20:46,959 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:20:46,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:20:46,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:20:46,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:20:46,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:20:46,981 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:20:46,982 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:20:46,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-22 12:20:47,001 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:20:47,045 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-07-22 12:20:47,045 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. [2022-07-22 12:20:47,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:20:47,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:20:47,056 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:20:47,096 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:20:47,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-22 12:20:47,120 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:20:47,120 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:20:47,121 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1) = -1*ULTIMATE.start_create_fresh_int_array_~i~2#1 + 1*ULTIMATE.start_create_fresh_int_array_~size#1 Supporting invariants [] [2022-07-22 12:20:47,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-22 12:20:47,237 INFO L257 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2022-07-22 12:20:47,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:20:47,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:20:47,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:20:47,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:20:47,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:20:47,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:20:47,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:20:47,330 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:20:47,373 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:20:47,376 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 52 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:20:47,419 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 52 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 54 states and 120 transitions. Complement of second has 3 states. [2022-07-22 12:20:47,422 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:20:47,427 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:20:47,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2022-07-22 12:20:47,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 1 letters. [2022-07-22 12:20:47,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:20:47,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-22 12:20:47,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:20:47,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 2 letters. [2022-07-22 12:20:47,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:20:47,432 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 120 transitions. [2022-07-22 12:20:47,435 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 32 [2022-07-22 12:20:47,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 48 states and 109 transitions. [2022-07-22 12:20:47,443 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2022-07-22 12:20:47,443 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2022-07-22 12:20:47,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 109 transitions. [2022-07-22 12:20:47,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:20:47,445 INFO L220 hiAutomatonCegarLoop]: Abstraction has 48 states and 109 transitions. [2022-07-22 12:20:47,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 109 transitions. [2022-07-22 12:20:47,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-07-22 12:20:47,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 2.2708333333333335) internal successors, (109), 47 states have internal predecessors, (109), 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:20:47,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 109 transitions. [2022-07-22 12:20:47,479 INFO L242 hiAutomatonCegarLoop]: Abstraction has 48 states and 109 transitions. [2022-07-22 12:20:47,479 INFO L425 stractBuchiCegarLoop]: Abstraction has 48 states and 109 transitions. [2022-07-22 12:20:47,479 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:20:47,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 109 transitions. [2022-07-22 12:20:47,481 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 32 [2022-07-22 12:20:47,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:20:47,482 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:20:47,482 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 12:20:47,482 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:20:47,483 INFO L748 eck$LassoCheckResult]: Stem: 438#[ULTIMATE.startENTRY]don't care [542] ULTIMATE.startENTRY-->L97-6: Formula: (let ((.cse2 (store |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 1))) (let ((.cse1 (select |v_#memory_int_In_1| 1)) (.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 1))) (and (= v_~N~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|) 0) (= (select |v_#valid_In_3| 2) 1) (= 0 |v_#NULL.base_Out_2|) (= (select .cse1 1) 0) (= 48 (select .cse1 0)) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|) (= (select |v_#valid_In_3| 1) 1) (= |v_#NULL.offset_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) 0) (= v_~A~0.base_Out_2 0) (< 0 |v_#StackHeapBarrier_In_3|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|) 0) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 1) |v_#valid_Out_6|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= 2 (select |v_#length_In_3| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_Out_6| 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2| 0) (= (select |v_#valid_In_3| 0) 0) (= v_~A~0.offset_Out_2 0) (= v_~counter~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 0)) (= |v_#length_Out_6| (store (store (store |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| |v_#StackHeapBarrier_In_3|) (= (select |v_#length_In_3| 2) 31) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|)))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_3|, #valid=|v_#valid_In_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_Out_2|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10|, #length=|v_#length_Out_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_Out_6|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_Out_6|, ~counter~0=v_~counter~0_Out_2, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset_Out_6|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_2|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ~A~0.offset=v_~A~0.offset_Out_2, #valid=|v_#valid_Out_6|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~mem13#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_create_fresh_int_array_#t~post16#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_create_fresh_int_array_#t~nondet17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #length, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base, ~counter~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #valid, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 368#[L97-6]don't care [531] L97-6-->L81-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_19| |v_#pthreadsForks_42|) (= |v_#pthreadsForks_41| (+ |v_#pthreadsForks_42| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|) (= |v_#memory_int_111| (store |v_#memory_int_112| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_112| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre9#1_19|))) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| v_~A~0.offset_63) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| v_~A~0.base_63) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_31|) (select |v_#length_136| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (= (select |v_#valid_169| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) 1) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_46| |v_ULTIMATE.start_create_fresh_int_array_~size#1_50|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_31|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|, #pthreadsForks=|v_#pthreadsForks_42|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|, #valid=|v_#valid_169|, #memory_int=|v_#memory_int_112|, #length=|v_#length_136|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_46|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_50|} OutVars{~A~0.base=v_~A~0.base_63, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_19|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_50|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_23|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22|, ~A~0.offset=v_~A~0.offset_63, #pthreadsForks=|v_#pthreadsForks_41|, #valid=|v_#valid_169|, #memory_int=|v_#memory_int_111|, #length=|v_#length_136|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_23|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_46|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #pthreadsForks, ULTIMATE.start_main_#t~pre9#1, #memory_int, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~ret8#1.base] 370#[L81-3]don't care [424] L81-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread1Thread1of1ForFork0_thidvar0_2) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|} OutVars{thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_6|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_4|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_8|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_4|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_4|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~tmp~0#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_#res#1.base] 432#[L81-4, thread1ENTRY]don't care [400] thread1ENTRY-->L49-4: Formula: (= |v_thread1Thread1of1ForFork0_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1] 422#[L81-4, L49-4]don't care [2022-07-22 12:20:47,483 INFO L750 eck$LassoCheckResult]: Loop: 422#[L81-4, L49-4]don't care [430] L49-4-->L52: Formula: (let ((.cse2 (* |v_thread1Thread1of1ForFork0_~i~0#1_15| 4))) (let ((.cse0 (+ .cse2 v_~A~0.offset_27)) (.cse1 (+ |v_thread1Thread1of1ForFork0_plus_~a#1_5| |v_thread1Thread1of1ForFork0_plus_~b#1_5|))) (and (not (= 0 (ite (or (<= 0 |v_thread1Thread1of1ForFork0_plus_~b#1_5|) (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_~a#1_5| |v_thread1Thread1of1ForFork0_plus_~b#1_5| 2147483648))) 1 0))) (<= 0 .cse0) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_5| v_~counter~0_29) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_5| |v_thread1Thread1of1ForFork0_plus_~b#1_5|) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_5| |v_thread1Thread1of1ForFork0_plus_~a#1_5|) (= |v_thread1Thread1of1ForFork0_plus_#res#1_5| .cse1) (<= (+ .cse2 v_~A~0.offset_27 4) (select |v_#length_38| v_~A~0.base_27)) (= (select |v_#valid_43| v_~A~0.base_27) 1) (= (select (select |v_#memory_int_35| v_~A~0.base_27) .cse0) |v_thread1Thread1of1ForFork0_plus_#in~b#1_5|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse1 2147483647) (<= |v_thread1Thread1of1ForFork0_plus_~b#1_5| 0)) 1 0)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_5| |v_thread1Thread1of1ForFork0_~tmp~0#1_7|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (< |v_thread1Thread1of1ForFork0_~i~0#1_15| v_~N~0_8)))) InVars {~counter~0=v_~counter~0_29, ~A~0.base=v_~A~0.base_27, ~A~0.offset=v_~A~0.offset_27, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_15|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_35|, #length=|v_#length_38|, ~N~0=v_~N~0_8} OutVars{~counter~0=v_~counter~0_29, ~A~0.base=v_~A~0.base_27, thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_7|, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_5|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_5|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_5|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_5|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~N~0=v_~N~0_8, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~A~0.offset=v_~A~0.offset_27, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_15|, #valid=|v_#valid_43|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_35|, #length=|v_#length_38|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_5|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~tmp~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] 426#[L81-4, L52]don't care [519] L52-->L49-4: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_51| (+ |v_thread1Thread1of1ForFork0_~i~0#1_52| 1)) (= |v_thread1Thread1of1ForFork0_~tmp~0#1_31| v_~counter~0_74)) InVars {thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_31|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_52|} OutVars{~counter~0=v_~counter~0_74, thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_31|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_19|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_51|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_~i~0#1] 422#[L81-4, L49-4]don't care [2022-07-22 12:20:47,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:20:47,484 INFO L85 PathProgramCache]: Analyzing trace with hash 17594078, now seen corresponding path program 1 times [2022-07-22 12:20:47,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:20:47,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202589629] [2022-07-22 12:20:47,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:20:47,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:20:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:20:47,519 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:20:47,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:20:47,561 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:20:47,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:20:47,562 INFO L85 PathProgramCache]: Analyzing trace with hash 14810, now seen corresponding path program 1 times [2022-07-22 12:20:47,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:20:47,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573180328] [2022-07-22 12:20:47,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:20:47,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:20:47,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:20:47,573 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:20:47,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:20:47,583 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:20:47,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:20:47,584 INFO L85 PathProgramCache]: Analyzing trace with hash -271946377, now seen corresponding path program 1 times [2022-07-22 12:20:47,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:20:47,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057665795] [2022-07-22 12:20:47,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:20:47,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:20:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:20:47,670 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:20:47,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:20:47,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057665795] [2022-07-22 12:20:47,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057665795] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:20:47,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:20:47,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 12:20:47,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133088407] [2022-07-22 12:20:47,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:20:47,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-22 12:20:47,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:20:47,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 12:20:47,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 12:20:47,921 INFO L87 Difference]: Start difference. First operand 48 states and 109 transitions. cyclomatic complexity: 76 Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:20:48,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:20:48,033 INFO L93 Difference]: Finished difference Result 83 states and 179 transitions. [2022-07-22 12:20:48,033 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 179 transitions. [2022-07-22 12:20:48,037 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 48 [2022-07-22 12:20:48,039 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 79 states and 171 transitions. [2022-07-22 12:20:48,039 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78 [2022-07-22 12:20:48,039 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2022-07-22 12:20:48,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 171 transitions. [2022-07-22 12:20:48,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:20:48,041 INFO L220 hiAutomatonCegarLoop]: Abstraction has 79 states and 171 transitions. [2022-07-22 12:20:48,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 171 transitions. [2022-07-22 12:20:48,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 65. [2022-07-22 12:20:48,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 2.276923076923077) internal successors, (148), 64 states have internal predecessors, (148), 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:20:48,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 148 transitions. [2022-07-22 12:20:48,049 INFO L242 hiAutomatonCegarLoop]: Abstraction has 65 states and 148 transitions. [2022-07-22 12:20:48,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 12:20:48,050 INFO L425 stractBuchiCegarLoop]: Abstraction has 65 states and 148 transitions. [2022-07-22 12:20:48,051 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:20:48,051 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 148 transitions. [2022-07-22 12:20:48,053 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 40 [2022-07-22 12:20:48,053 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:20:48,053 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:20:48,053 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 12:20:48,053 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:20:48,054 INFO L748 eck$LassoCheckResult]: Stem: 639#[ULTIMATE.startENTRY]don't care [542] ULTIMATE.startENTRY-->L97-6: Formula: (let ((.cse2 (store |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 1))) (let ((.cse1 (select |v_#memory_int_In_1| 1)) (.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 1))) (and (= v_~N~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|) 0) (= (select |v_#valid_In_3| 2) 1) (= 0 |v_#NULL.base_Out_2|) (= (select .cse1 1) 0) (= 48 (select .cse1 0)) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|) (= (select |v_#valid_In_3| 1) 1) (= |v_#NULL.offset_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) 0) (= v_~A~0.base_Out_2 0) (< 0 |v_#StackHeapBarrier_In_3|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|) 0) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 1) |v_#valid_Out_6|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= 2 (select |v_#length_In_3| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_Out_6| 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2| 0) (= (select |v_#valid_In_3| 0) 0) (= v_~A~0.offset_Out_2 0) (= v_~counter~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 0)) (= |v_#length_Out_6| (store (store (store |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| |v_#StackHeapBarrier_In_3|) (= (select |v_#length_In_3| 2) 31) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|)))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_3|, #valid=|v_#valid_In_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_Out_2|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10|, #length=|v_#length_Out_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_Out_6|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_Out_6|, ~counter~0=v_~counter~0_Out_2, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset_Out_6|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_2|, ~N~0=v_~N~0_Out_2, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ~A~0.offset=v_~A~0.offset_Out_2, #valid=|v_#valid_Out_6|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_Out_2|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~mem13#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_create_fresh_int_array_#t~post16#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_create_fresh_int_array_#t~nondet17#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #length, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base, ~counter~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #valid, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 561#[L97-6]don't care [527] L97-6-->L97-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_41| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37| 4) (select |v_#length_134| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|)) (= (select |v_#valid_163| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_40| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_41| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_41| |v_ULTIMATE.start_create_fresh_int_array_~size#1_46|) (= (store |v_#memory_int_108| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| (store (select |v_#memory_int_108| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_23|)) |v_#memory_int_107|) (<= 0 .cse1)))) InVars {ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_23|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|, #valid=|v_#valid_163|, #memory_int=|v_#memory_int_108|, #length=|v_#length_134|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_41|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_46|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|, ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_19|, #valid=|v_#valid_163|, #memory_int=|v_#memory_int_107|, #length=|v_#length_134|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_40|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_46|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet17#1, ULTIMATE.start_create_fresh_int_array_#t~post16#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~2#1] 565#[L97-6]don't care [531] L97-6-->L81-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_19| |v_#pthreadsForks_42|) (= |v_#pthreadsForks_41| (+ |v_#pthreadsForks_42| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|) (= |v_#memory_int_111| (store |v_#memory_int_112| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_112| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre9#1_19|))) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| v_~A~0.offset_63) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| v_~A~0.base_63) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_31|) (select |v_#length_136| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (= (select |v_#valid_169| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) 1) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_46| |v_ULTIMATE.start_create_fresh_int_array_~size#1_50|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_31|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|, #pthreadsForks=|v_#pthreadsForks_42|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|, #valid=|v_#valid_169|, #memory_int=|v_#memory_int_112|, #length=|v_#length_136|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_46|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_50|} OutVars{~A~0.base=v_~A~0.base_63, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_19|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_50|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_23|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22|, ~A~0.offset=v_~A~0.offset_63, #pthreadsForks=|v_#pthreadsForks_41|, #valid=|v_#valid_169|, #memory_int=|v_#memory_int_111|, #length=|v_#length_136|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_23|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_46|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #pthreadsForks, ULTIMATE.start_main_#t~pre9#1, #memory_int, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~ret8#1.base] 567#[L81-3]don't care [424] L81-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread1Thread1of1ForFork0_thidvar0_2) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|} OutVars{thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_6|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_4|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_8|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_4|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_4|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~tmp~0#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_#res#1.base] 677#[L81-4, thread1ENTRY]don't care [400] thread1ENTRY-->L49-4: Formula: (= |v_thread1Thread1of1ForFork0_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1] 663#[L81-4, L49-4]don't care [2022-07-22 12:20:48,055 INFO L750 eck$LassoCheckResult]: Loop: 663#[L81-4, L49-4]don't care [430] L49-4-->L52: Formula: (let ((.cse2 (* |v_thread1Thread1of1ForFork0_~i~0#1_15| 4))) (let ((.cse0 (+ .cse2 v_~A~0.offset_27)) (.cse1 (+ |v_thread1Thread1of1ForFork0_plus_~a#1_5| |v_thread1Thread1of1ForFork0_plus_~b#1_5|))) (and (not (= 0 (ite (or (<= 0 |v_thread1Thread1of1ForFork0_plus_~b#1_5|) (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_~a#1_5| |v_thread1Thread1of1ForFork0_plus_~b#1_5| 2147483648))) 1 0))) (<= 0 .cse0) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_5| v_~counter~0_29) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_5| |v_thread1Thread1of1ForFork0_plus_~b#1_5|) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_5| |v_thread1Thread1of1ForFork0_plus_~a#1_5|) (= |v_thread1Thread1of1ForFork0_plus_#res#1_5| .cse1) (<= (+ .cse2 v_~A~0.offset_27 4) (select |v_#length_38| v_~A~0.base_27)) (= (select |v_#valid_43| v_~A~0.base_27) 1) (= (select (select |v_#memory_int_35| v_~A~0.base_27) .cse0) |v_thread1Thread1of1ForFork0_plus_#in~b#1_5|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse1 2147483647) (<= |v_thread1Thread1of1ForFork0_plus_~b#1_5| 0)) 1 0)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_5| |v_thread1Thread1of1ForFork0_~tmp~0#1_7|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (< |v_thread1Thread1of1ForFork0_~i~0#1_15| v_~N~0_8)))) InVars {~counter~0=v_~counter~0_29, ~A~0.base=v_~A~0.base_27, ~A~0.offset=v_~A~0.offset_27, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_15|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_35|, #length=|v_#length_38|, ~N~0=v_~N~0_8} OutVars{~counter~0=v_~counter~0_29, ~A~0.base=v_~A~0.base_27, thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_7|, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_5|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_5|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_5|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_5|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~N~0=v_~N~0_8, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~A~0.offset=v_~A~0.offset_27, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_15|, #valid=|v_#valid_43|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_35|, #length=|v_#length_38|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_5|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~tmp~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] 661#[L81-4, L52]don't care [519] L52-->L49-4: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_51| (+ |v_thread1Thread1of1ForFork0_~i~0#1_52| 1)) (= |v_thread1Thread1of1ForFork0_~tmp~0#1_31| v_~counter~0_74)) InVars {thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_31|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_52|} OutVars{~counter~0=v_~counter~0_74, thread1Thread1of1ForFork0_~tmp~0#1=|v_thread1Thread1of1ForFork0_~tmp~0#1_31|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_19|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_51|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_~i~0#1] 663#[L81-4, L49-4]don't care [2022-07-22 12:20:48,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:20:48,055 INFO L85 PathProgramCache]: Analyzing trace with hash 545401225, now seen corresponding path program 1 times [2022-07-22 12:20:48,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:20:48,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297195447] [2022-07-22 12:20:48,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:20:48,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:20:48,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:20:48,083 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:20:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:20:48,111 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:20:48,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:20:48,116 INFO L85 PathProgramCache]: Analyzing trace with hash 14810, now seen corresponding path program 2 times [2022-07-22 12:20:48,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:20:48,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236636769] [2022-07-22 12:20:48,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:20:48,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:20:48,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:20:48,139 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:20:48,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:20:48,156 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:20:48,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:20:48,157 INFO L85 PathProgramCache]: Analyzing trace with hash 144580962, now seen corresponding path program 1 times [2022-07-22 12:20:48,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:20:48,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411433772] [2022-07-22 12:20:48,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:20:48,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:20:48,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:20:48,226 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:20:48,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:20:48,280 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:20:49,577 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:20:49,577 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:20:49,577 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:20:49,577 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:20:49,577 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:20:49,577 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:20:49,577 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:20:49,577 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:20:49,578 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-bad-counter-queue.wvr.c_BEv2_Iteration3_Lasso [2022-07-22 12:20:49,578 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:20:49,578 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:20:49,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:20:49,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:20:49,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:20:49,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:20:49,801 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:20:49,804 INFO L158 Benchmark]: Toolchain (without parser) took 11374.54ms. Allocated memory was 163.6MB in the beginning and 237.0MB in the end (delta: 73.4MB). Free memory was 137.4MB in the beginning and 198.2MB in the end (delta: -60.8MB). Peak memory consumption was 111.4MB. Max. memory is 8.0GB. [2022-07-22 12:20:49,804 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 163.6MB. Free memory was 133.4MB in the beginning and 132.9MB in the end (delta: 445.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:20:49,805 INFO L158 Benchmark]: CACSL2BoogieTranslator took 317.06ms. Allocated memory is still 163.6MB. Free memory was 137.2MB in the beginning and 126.3MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-07-22 12:20:49,806 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.47ms. Allocated memory is still 163.6MB. Free memory was 126.3MB in the beginning and 124.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:20:49,807 INFO L158 Benchmark]: Boogie Preprocessor took 35.85ms. Allocated memory is still 163.6MB. Free memory was 124.2MB in the beginning and 122.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:20:49,807 INFO L158 Benchmark]: RCFGBuilder took 839.09ms. Allocated memory is still 163.6MB. Free memory was 122.7MB in the beginning and 138.1MB in the end (delta: -15.4MB). Peak memory consumption was 19.4MB. Max. memory is 8.0GB. [2022-07-22 12:20:49,808 INFO L158 Benchmark]: BuchiAutomizer took 10126.24ms. Allocated memory was 163.6MB in the beginning and 237.0MB in the end (delta: 73.4MB). Free memory was 137.6MB in the beginning and 198.2MB in the end (delta: -60.6MB). Peak memory consumption was 110.9MB. Max. memory is 8.0GB. [2022-07-22 12:20:49,812 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.23ms. Allocated memory is still 163.6MB. Free memory was 133.4MB in the beginning and 132.9MB in the end (delta: 445.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 317.06ms. Allocated memory is still 163.6MB. Free memory was 137.2MB in the beginning and 126.3MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.47ms. Allocated memory is still 163.6MB. Free memory was 126.3MB in the beginning and 124.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.85ms. Allocated memory is still 163.6MB. Free memory was 124.2MB in the beginning and 122.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 839.09ms. Allocated memory is still 163.6MB. Free memory was 122.7MB in the beginning and 138.1MB in the end (delta: -15.4MB). Peak memory consumption was 19.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 10126.24ms. Allocated memory was 163.6MB in the beginning and 237.0MB in the end (delta: 73.4MB). Free memory was 137.6MB in the beginning and 198.2MB in the end (delta: -60.6MB). Peak memory consumption was 110.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.2s, 112 PlacesBefore, 23 PlacesAfterwards, 114 TransitionsBefore, 19 TransitionsAfterwards, 572 CoEnabledTransitionPairs, 7 FixpointIterations, 73 TrivialSequentialCompositions, 17 ConcurrentSequentialCompositions, 13 TrivialYvCompositions, 4 ConcurrentYvCompositions, 6 ChoiceCompositions, 113 TotalNumberOfCompositions, 874 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 679, positive: 641, positive conditional: 0, positive unconditional: 641, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 392, positive: 377, positive conditional: 0, positive unconditional: 377, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 392, positive: 377, positive conditional: 0, positive unconditional: 377, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 69, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 69, negative conditional: 0, negative unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 679, positive: 264, positive conditional: 0, positive unconditional: 264, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 392, unknown conditional: 0, unknown unconditional: 392] , Statistics on independence cache: Total cache size (in pairs): 46, Positive cache size: 41, Positive conditional cache size: 0, Positive unconditional cache size: 41, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5 - 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:20:49,858 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...