/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-syntacticLbe.epf -i ../../../trunk/examples/svcomp/weaver/unroll-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:52:05,487 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:52:05,490 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:52:05,527 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:52:05,527 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:52:05,529 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:52:05,531 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:52:05,533 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:52:05,535 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:52:05,537 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:52:05,538 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:52:05,540 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:52:05,540 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:52:05,542 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:52:05,543 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:52:05,544 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:52:05,546 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:52:05,547 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:52:05,549 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:52:05,551 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:52:05,553 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:52:05,555 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:52:05,556 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:52:05,558 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:52:05,559 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:52:05,568 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:52:05,568 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:52:05,569 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:52:05,572 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:52:05,573 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:52:05,574 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:52:05,574 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:52:05,576 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:52:05,577 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:52:05,579 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:52:05,581 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:52:05,581 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:52:05,582 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:52:05,582 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:52:05,583 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:52:05,585 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:52:05,588 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:52:05,592 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-syntacticLbe.epf [2022-07-22 12:52:05,649 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:52:05,650 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:52:05,651 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:52:05,651 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:52:05,654 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:52:05,654 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:52:05,654 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:52:05,655 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:52:05,655 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:52:05,656 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:52:05,656 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:52:05,657 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:52:05,657 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:52:05,657 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:52:05,658 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:52:05,658 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:52:05,658 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:52:05,658 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:52:05,659 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:52:05,659 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:52:05,659 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:52:05,659 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:52:05,659 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:52:05,660 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:52:05,660 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:52:05,660 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:52:05,660 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:52:05,661 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:52:05,661 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:52:05,661 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:52:05,662 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:52:05,662 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-07-22 12:52:05,665 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:52:05,665 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:52:06,089 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:52:06,118 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:52:06,121 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:52:06,123 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:52:06,124 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:52:06,125 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-3.wvr.c [2022-07-22 12:52:06,208 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a3f16e9e/b8f232854f0546069e1fb5d818a1b91a/FLAG2ce0db4c9 [2022-07-22 12:52:07,010 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:52:07,011 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c [2022-07-22 12:52:07,020 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a3f16e9e/b8f232854f0546069e1fb5d818a1b91a/FLAG2ce0db4c9 [2022-07-22 12:52:07,365 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a3f16e9e/b8f232854f0546069e1fb5d818a1b91a [2022-07-22 12:52:07,369 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:52:07,377 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:52:07,379 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:52:07,379 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:52:07,384 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:52:07,385 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:52:07" (1/1) ... [2022-07-22 12:52:07,386 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3308b0e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:52:07, skipping insertion in model container [2022-07-22 12:52:07,387 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:52:07" (1/1) ... [2022-07-22 12:52:07,395 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:52:07,417 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:52:07,620 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/unroll-3.wvr.c[2500,2513] [2022-07-22 12:52:07,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:52:07,636 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:52:07,663 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/unroll-3.wvr.c[2500,2513] [2022-07-22 12:52:07,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:52:07,683 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:52:07,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:52:07 WrapperNode [2022-07-22 12:52:07,684 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:52:07,685 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:52:07,685 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:52:07,685 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:52:07,692 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:52:07" (1/1) ... [2022-07-22 12:52:07,703 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:52:07" (1/1) ... [2022-07-22 12:52:07,735 INFO L137 Inliner]: procedures = 24, calls = 34, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 142 [2022-07-22 12:52:07,736 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:52:07,739 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:52:07,739 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:52:07,739 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:52:07,751 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:52:07" (1/1) ... [2022-07-22 12:52:07,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:52:07" (1/1) ... [2022-07-22 12:52:07,755 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:52:07" (1/1) ... [2022-07-22 12:52:07,756 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:52:07" (1/1) ... [2022-07-22 12:52:07,764 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:52:07" (1/1) ... [2022-07-22 12:52:07,770 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:52:07" (1/1) ... [2022-07-22 12:52:07,772 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:52:07" (1/1) ... [2022-07-22 12:52:07,776 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:52:07,777 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:52:07,777 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:52:07,777 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:52:07,778 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:52:07" (1/1) ... [2022-07-22 12:52:07,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:07,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:07,819 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:52:07,844 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:52:07,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:52:07,888 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 12:52:07,888 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 12:52:07,888 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 12:52:07,889 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 12:52:07,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:52:07,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:52:07,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:52:07,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 12:52:07,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:52:07,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:52:07,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:52:07,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:52:07,892 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:52:07,989 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:52:07,991 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:52:08,385 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:52:08,411 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:52:08,411 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-22 12:52:08,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:52:08 BoogieIcfgContainer [2022-07-22 12:52:08,422 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:52:08,423 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:52:08,423 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:52:08,427 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:52:08,429 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:52:08,429 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:52:07" (1/3) ... [2022-07-22 12:52:08,430 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c6e29e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:52:08, skipping insertion in model container [2022-07-22 12:52:08,430 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:52:08,431 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:52:07" (2/3) ... [2022-07-22 12:52:08,431 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c6e29e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:52:08, skipping insertion in model container [2022-07-22 12:52:08,431 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:52:08,431 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:52:08" (3/3) ... [2022-07-22 12:52:08,433 INFO L322 chiAutomizerObserver]: Analyzing ICFG unroll-3.wvr.c [2022-07-22 12:52:08,695 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-22 12:52:08,778 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 174 places, 184 transitions, 384 flow [2022-07-22 12:52:08,943 INFO L129 PetriNetUnfolder]: 15/180 cut-off events. [2022-07-22 12:52:08,943 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:52:08,951 INFO L84 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 180 events. 15/180 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 171 event pairs, 0 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 108. Up to 2 conditions per place. [2022-07-22 12:52:08,952 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 184 transitions, 384 flow [2022-07-22 12:52:08,977 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 172 places, 180 transitions, 372 flow [2022-07-22 12:52:08,984 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-07-22 12:52:09,002 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 180 transitions, 372 flow [2022-07-22 12:52:09,011 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 172 places, 180 transitions, 372 flow [2022-07-22 12:52:09,012 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 172 places, 180 transitions, 372 flow [2022-07-22 12:52:09,091 INFO L129 PetriNetUnfolder]: 15/180 cut-off events. [2022-07-22 12:52:09,091 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:52:09,094 INFO L84 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 180 events. 15/180 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 173 event pairs, 0 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 108. Up to 2 conditions per place. [2022-07-22 12:52:09,099 INFO L116 LiptonReduction]: Number of co-enabled transitions 2856 [2022-07-22 12:52:15,193 INFO L131 LiptonReduction]: Checked pairs total: 2841 [2022-07-22 12:52:15,193 INFO L133 LiptonReduction]: Total number of compositions: 217 [2022-07-22 12:52:15,218 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:52:15,219 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:52:15,219 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:52:15,219 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:52:15,219 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:52:15,219 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:52:15,219 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:52:15,220 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:52:15,222 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:52:15,262 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 15 [2022-07-22 12:52:15,265 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:52:15,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:52:15,274 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:52:15,274 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:52:15,274 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:52:15,274 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 34 states, but on-demand construction may add more states [2022-07-22 12:52:15,283 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 15 [2022-07-22 12:52:15,285 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:52:15,285 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:52:15,285 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:52:15,285 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:52:15,292 INFO L748 eck$LassoCheckResult]: Stem: 177#[ULTIMATE.startENTRY]don't care [718] ULTIMATE.startENTRY-->L101-6: Formula: (let ((.cse1 (store |v_#valid_In_13| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1)) (.cse2 (select |v_#memory_int_In_11| 1))) (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|) (= (select |v_#length_In_13| 1) 2) (= |v_#valid_Out_10| (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 1)) (= (select |v_#valid_In_13| 0) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (= 0 |v_#NULL.base_Out_2|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= v_~x2~0_Out_14 0) (= v_~x1~0_Out_6 0) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|) (= |v_#NULL.offset_Out_2| 0) (= (select .cse2 1) 0) (< 0 |v_#StackHeapBarrier_In_3|) (= (select |v_#valid_In_13| 1) 1) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| 0)) (= v_~f~0.offset_Out_6 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_Out_6| 0) (= (select |v_#length_In_13| 2) 15) (= v_~f~0.base_Out_6 0) (not (= (ite (< 0 v_~size~0_Out_2) 1 0) 0)) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|) 0) (= v_~size~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= |v_#length_Out_6| (store (store (store |v_#length_In_13| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= (select |v_#valid_In_13| 2) 1) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= (select .cse2 0) 48) (= (select |v_#valid_In_13| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| |v_#StackHeapBarrier_In_3|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|)))) InVars {#memory_int=|v_#memory_int_In_11|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_13|, #valid=|v_#valid_In_13|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_Out_2|, ~f~0.base=v_~f~0.base_Out_6, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ~x1~0=v_~x1~0_Out_6, ~f~0.offset=v_~f~0.offset_Out_6, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_6|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_Out_6|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, #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|, ~x2~0=v_~x2~0_Out_14, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_Out_6|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_Out_6|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|, ~size~0=v_~size~0_Out_2, ULTIMATE.start_create_fresh_int_array_#t~post19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post19#1_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, 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_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_Out_2|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_Out_6|, #valid=|v_#valid_Out_10|, #memory_int=|v_#memory_int_In_11|, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset_Out_6|, ~n~0=v_~n~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet9#1, ~f~0.base, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~x1~0, ~f~0.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~ret11#1.base, ULTIMATE.start_main_#t~nondet13#1, #length, ULTIMATE.start_create_fresh_int_array_~i~2#1, ~x2~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~post19#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~ret11#1.offset, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 180#[L101-6]don't care [2022-07-22 12:52:15,293 INFO L750 eck$LassoCheckResult]: Loop: 180#[L101-6]don't care [683] L101-6-->L101-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_43| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_43| |v_ULTIMATE.start_create_fresh_int_array_~size#1_48|) (<= 0 .cse0) (= (store |v_#memory_int_88| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41| (store (select |v_#memory_int_88| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_25|)) |v_#memory_int_87|) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41| 4) (select |v_#length_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|)) (= (select |v_#valid_149| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_42| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_43| 1))))) InVars {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|, #valid=|v_#valid_149|, #memory_int=|v_#memory_int_88|, #length=|v_#length_110|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_25|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_43|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|} OutVars{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_create_fresh_int_array_#t~post19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post19#1_23|, #valid=|v_#valid_149|, #memory_int=|v_#memory_int_87|, #length=|v_#length_110|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_42|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post19#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_~i~2#1] 180#[L101-6]don't care [2022-07-22 12:52:15,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:15,302 INFO L85 PathProgramCache]: Analyzing trace with hash 749, now seen corresponding path program 1 times [2022-07-22 12:52:15,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:52:15,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455783395] [2022-07-22 12:52:15,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:52:15,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:52:15,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:15,517 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:52:15,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:15,608 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:52:15,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:15,612 INFO L85 PathProgramCache]: Analyzing trace with hash 714, now seen corresponding path program 1 times [2022-07-22 12:52:15,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:52:15,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103179147] [2022-07-22 12:52:15,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:52:15,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:52:15,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:15,650 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:52:15,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:15,661 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:52:15,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:15,663 INFO L85 PathProgramCache]: Analyzing trace with hash 23902, now seen corresponding path program 1 times [2022-07-22 12:52:15,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:52:15,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868058865] [2022-07-22 12:52:15,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:52:15,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:52:15,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:15,715 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:52:15,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:15,770 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:52:16,263 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:52:16,264 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:52:16,264 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:52:16,264 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:52:16,264 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:52:16,264 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:16,264 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:52:16,265 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:52:16,265 INFO L133 ssoRankerPreferences]: Filename of dumped script: unroll-3.wvr.c_BEv2_Iteration1_Lasso [2022-07-22 12:52:16,265 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:52:16,265 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:52:16,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:16,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:16,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:16,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:16,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:16,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:16,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:16,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:16,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:16,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:16,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:16,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:16,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:16,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:16,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:16,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:16,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:16,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:16,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:16,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:16,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:16,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:16,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:16,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:16,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:16,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:16,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:16,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:16,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:16,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:16,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:17,123 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:52:17,127 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:52:17,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:17,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:17,132 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:52:17,139 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:52:17,144 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:52:17,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:17,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:17,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:17,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:17,155 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:52:17,156 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:52:17,172 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:17,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-07-22 12:52:17,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:17,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:17,210 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:52:17,212 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:52:17,212 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:52:17,221 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:17,222 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:52:17,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:17,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:17,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:17,223 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:52:17,224 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:52:17,233 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:17,270 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:52:17,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:17,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:17,272 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:52:17,274 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:52:17,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:17,284 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:52:17,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:17,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:17,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:17,285 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:52:17,285 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:52:17,287 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:52:17,301 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:17,335 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:52:17,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:17,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:17,337 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:52:17,342 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:52:17,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:17,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:17,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:17,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:17,352 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:52:17,355 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:52:17,355 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:52:17,358 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:17,382 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:52:17,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:17,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:17,385 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:52:17,388 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:52:17,393 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:52:17,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:17,397 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:52:17,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:17,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:17,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:17,398 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:52:17,398 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:52:17,399 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:17,420 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:52:17,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:17,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:17,422 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:52:17,423 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:52:17,426 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:52:17,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:17,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:17,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:17,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:17,447 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:52:17,447 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:52:17,459 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:17,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-07-22 12:52:17,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:17,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:17,494 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:52:17,499 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:52:17,500 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:52:17,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:17,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:17,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:17,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:17,512 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:52:17,512 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:52:17,534 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:17,569 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:52:17,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:17,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:17,571 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:52:17,577 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:52:17,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:17,587 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-07-22 12:52:17,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:17,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:17,591 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-22 12:52:17,592 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:52:17,599 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:52:17,606 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:17,633 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:52:17,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:17,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:17,635 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:52:17,636 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:52:17,639 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:52:17,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:17,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:17,648 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:17,648 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:17,650 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:52:17,650 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:52:17,657 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:17,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-22 12:52:17,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:17,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:17,680 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:52:17,686 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:52:17,687 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:52:17,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:17,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:17,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:17,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:17,703 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:52:17,703 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:52:17,716 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:17,752 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:52:17,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:17,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:17,754 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:52:17,764 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:52:17,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:17,773 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:52:17,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:17,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:17,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:17,775 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:52:17,775 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:52:17,777 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:52:17,786 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:17,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-07-22 12:52:17,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:17,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:17,817 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:52:17,818 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:52:17,819 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:52:17,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:17,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:17,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:17,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:17,829 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:52:17,829 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:52:17,832 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:17,854 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:52:17,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:17,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:17,856 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:52:17,857 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:52:17,858 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:52:17,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:17,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:17,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:17,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:17,872 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:52:17,872 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:52:17,896 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:52:17,948 INFO L443 ModelExtractionUtils]: Simplification made 21 calls to the SMT solver. [2022-07-22 12:52:17,948 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 10 variables to zero. [2022-07-22 12:52:17,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:17,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:17,963 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:52:18,007 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:52:18,007 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:52:18,037 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-22 12:52:18,037 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:52:18,038 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~i~2#1, ~size~0) = -1*ULTIMATE.start_create_fresh_int_array_~i~2#1 + 1*~size~0 Supporting invariants [-1*ULTIMATE.start_create_fresh_int_array_~size#1 + 1*~size~0 >= 0] [2022-07-22 12:52:18,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-22 12:52:18,166 INFO L257 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2022-07-22 12:52:18,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:18,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:52:18,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:52:18,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:52:18,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:52:18,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 12:52:18,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:52:18,246 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:52:18,281 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:52:18,284 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 34 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:52:18,340 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 34 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 36 states and 77 transitions. Complement of second has 3 states. [2022-07-22 12:52:18,343 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:52:18,349 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:52:18,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2022-07-22 12:52:18,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 1 letters. [2022-07-22 12:52:18,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:52:18,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-22 12:52:18,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:52:18,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 2 letters. [2022-07-22 12:52:18,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:52:18,353 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 77 transitions. [2022-07-22 12:52:18,357 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 14 [2022-07-22 12:52:18,363 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 30 states and 66 transitions. [2022-07-22 12:52:18,364 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2022-07-22 12:52:18,364 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2022-07-22 12:52:18,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 66 transitions. [2022-07-22 12:52:18,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:52:18,367 INFO L220 hiAutomatonCegarLoop]: Abstraction has 30 states and 66 transitions. [2022-07-22 12:52:18,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 66 transitions. [2022-07-22 12:52:18,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-22 12:52:18,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.2) internal successors, (66), 29 states have internal predecessors, (66), 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:52:18,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 66 transitions. [2022-07-22 12:52:18,400 INFO L242 hiAutomatonCegarLoop]: Abstraction has 30 states and 66 transitions. [2022-07-22 12:52:18,400 INFO L425 stractBuchiCegarLoop]: Abstraction has 30 states and 66 transitions. [2022-07-22 12:52:18,400 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:52:18,400 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 66 transitions. [2022-07-22 12:52:18,402 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 14 [2022-07-22 12:52:18,402 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:52:18,403 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:52:18,403 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 12:52:18,403 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:52:18,404 INFO L748 eck$LassoCheckResult]: Stem: 415#[ULTIMATE.startENTRY]don't care [718] ULTIMATE.startENTRY-->L101-6: Formula: (let ((.cse1 (store |v_#valid_In_13| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1)) (.cse2 (select |v_#memory_int_In_11| 1))) (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|) (= (select |v_#length_In_13| 1) 2) (= |v_#valid_Out_10| (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 1)) (= (select |v_#valid_In_13| 0) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (= 0 |v_#NULL.base_Out_2|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= v_~x2~0_Out_14 0) (= v_~x1~0_Out_6 0) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|) (= |v_#NULL.offset_Out_2| 0) (= (select .cse2 1) 0) (< 0 |v_#StackHeapBarrier_In_3|) (= (select |v_#valid_In_13| 1) 1) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| 0)) (= v_~f~0.offset_Out_6 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_Out_6| 0) (= (select |v_#length_In_13| 2) 15) (= v_~f~0.base_Out_6 0) (not (= (ite (< 0 v_~size~0_Out_2) 1 0) 0)) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|) 0) (= v_~size~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= |v_#length_Out_6| (store (store (store |v_#length_In_13| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= (select |v_#valid_In_13| 2) 1) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= (select .cse2 0) 48) (= (select |v_#valid_In_13| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| |v_#StackHeapBarrier_In_3|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|)))) InVars {#memory_int=|v_#memory_int_In_11|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_13|, #valid=|v_#valid_In_13|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_Out_2|, ~f~0.base=v_~f~0.base_Out_6, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ~x1~0=v_~x1~0_Out_6, ~f~0.offset=v_~f~0.offset_Out_6, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_6|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_Out_6|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, #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|, ~x2~0=v_~x2~0_Out_14, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_Out_6|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_Out_6|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|, ~size~0=v_~size~0_Out_2, ULTIMATE.start_create_fresh_int_array_#t~post19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post19#1_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, 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_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_Out_2|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_Out_6|, #valid=|v_#valid_Out_10|, #memory_int=|v_#memory_int_In_11|, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset_Out_6|, ~n~0=v_~n~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet9#1, ~f~0.base, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~x1~0, ~f~0.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~ret11#1.base, ULTIMATE.start_main_#t~nondet13#1, #length, ULTIMATE.start_create_fresh_int_array_~i~2#1, ~x2~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~post19#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~ret11#1.offset, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 417#[L101-6]don't care [704] L101-6-->L85-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| v_~f~0.base_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6| 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_In_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_5|)) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre12#1_Out_2|) (= (select |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (= (store |v_#memory_int_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre12#1_Out_2|)) |v_#memory_int_Out_2|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= (ite (< (mod v_~n~0_In_5 4294967296) 1431655765) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= v_~f~0.offset_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, #pthreadsForks=|v_#pthreadsForks_In_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_In_3|, #length=|v_#length_In_5|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_In_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ~n~0=v_~n~0_In_5, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ~f~0.base=v_~f~0.base_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.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ~f~0.offset=v_~f~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_5|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_Out_2|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_Out_2|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_5|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_In_3|, ~n~0=v_~n~0_In_5, 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_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ~f~0.base, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base, #memory_int, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~f~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 405#[L85-3]don't care [496] L85-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_6|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_12|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_10|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_8|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 401#[thread1ENTRY, L85-4]don't care [426] thread1ENTRY-->L49-2: 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] 403#[L49-2, L85-4]don't care [2022-07-22 12:52:18,404 INFO L750 eck$LassoCheckResult]: Loop: 403#[L49-2, L85-4]don't care [706] L49-2-->L49-2: Formula: (let ((.cse1 (* v_~x1~0_In_1 4))) (let ((.cse0 (+ v_~f~0.offset_In_3 .cse1))) (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_7) 4294967296)) (<= 0 .cse0) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_3) .cse0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (<= (+ v_~f~0.offset_In_3 .cse1 4) (select |v_#length_In_7| v_~f~0.base_In_3)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (select |v_#valid_In_7| v_~f~0.base_In_3) 1)))) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_3, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_In_5|, #length=|v_#length_In_7|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_3} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_3, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_3, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_In_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #length=|v_#length_In_7|, ~n~0=v_~n~0_In_7, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] 403#[L49-2, L85-4]don't care [2022-07-22 12:52:18,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:18,405 INFO L85 PathProgramCache]: Analyzing trace with hash 23005805, now seen corresponding path program 1 times [2022-07-22 12:52:18,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:52:18,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355608839] [2022-07-22 12:52:18,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:52:18,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:52:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:52:18,502 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:52:18,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:52:18,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355608839] [2022-07-22 12:52:18,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355608839] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:52:18,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:52:18,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 12:52:18,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202061509] [2022-07-22 12:52:18,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:52:18,508 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-07-22 12:52:18,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:18,509 INFO L85 PathProgramCache]: Analyzing trace with hash 737, now seen corresponding path program 1 times [2022-07-22 12:52:18,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:52:18,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256346260] [2022-07-22 12:52:18,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:52:18,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:52:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:18,521 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:52:18,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:18,541 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:52:18,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:52:18,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 12:52:18,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 12:52:18,663 INFO L87 Difference]: Start difference. First operand 30 states and 66 transitions. cyclomatic complexity: 51 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:52:18,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:52:18,706 INFO L93 Difference]: Finished difference Result 30 states and 65 transitions. [2022-07-22 12:52:18,706 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 65 transitions. [2022-07-22 12:52:18,714 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 14 [2022-07-22 12:52:18,715 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 65 transitions. [2022-07-22 12:52:18,716 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2022-07-22 12:52:18,717 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2022-07-22 12:52:18,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 65 transitions. [2022-07-22 12:52:18,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:52:18,718 INFO L220 hiAutomatonCegarLoop]: Abstraction has 30 states and 65 transitions. [2022-07-22 12:52:18,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 65 transitions. [2022-07-22 12:52:18,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-22 12:52:18,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 29 states have internal predecessors, (65), 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:52:18,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 65 transitions. [2022-07-22 12:52:18,729 INFO L242 hiAutomatonCegarLoop]: Abstraction has 30 states and 65 transitions. [2022-07-22 12:52:18,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 12:52:18,730 INFO L425 stractBuchiCegarLoop]: Abstraction has 30 states and 65 transitions. [2022-07-22 12:52:18,731 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:52:18,731 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 65 transitions. [2022-07-22 12:52:18,736 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 14 [2022-07-22 12:52:18,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:52:18,737 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:52:18,737 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 12:52:18,737 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:52:18,738 INFO L748 eck$LassoCheckResult]: Stem: 511#[ULTIMATE.startENTRY]don't care [718] ULTIMATE.startENTRY-->L101-6: Formula: (let ((.cse1 (store |v_#valid_In_13| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1)) (.cse2 (select |v_#memory_int_In_11| 1))) (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|) (= (select |v_#length_In_13| 1) 2) (= |v_#valid_Out_10| (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 1)) (= (select |v_#valid_In_13| 0) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (= 0 |v_#NULL.base_Out_2|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= v_~x2~0_Out_14 0) (= v_~x1~0_Out_6 0) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|) (= |v_#NULL.offset_Out_2| 0) (= (select .cse2 1) 0) (< 0 |v_#StackHeapBarrier_In_3|) (= (select |v_#valid_In_13| 1) 1) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| 0)) (= v_~f~0.offset_Out_6 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_Out_6| 0) (= (select |v_#length_In_13| 2) 15) (= v_~f~0.base_Out_6 0) (not (= (ite (< 0 v_~size~0_Out_2) 1 0) 0)) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|) 0) (= v_~size~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= |v_#length_Out_6| (store (store (store |v_#length_In_13| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= (select |v_#valid_In_13| 2) 1) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= (select .cse2 0) 48) (= (select |v_#valid_In_13| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| |v_#StackHeapBarrier_In_3|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|)))) InVars {#memory_int=|v_#memory_int_In_11|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_13|, #valid=|v_#valid_In_13|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_Out_2|, ~f~0.base=v_~f~0.base_Out_6, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_14|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ~x1~0=v_~x1~0_Out_6, ~f~0.offset=v_~f~0.offset_Out_6, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_6|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_Out_6|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, #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|, ~x2~0=v_~x2~0_Out_14, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_Out_6|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_Out_6|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|, ~size~0=v_~size~0_Out_2, ULTIMATE.start_create_fresh_int_array_#t~post19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post19#1_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, 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_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_Out_2|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_Out_6|, #valid=|v_#valid_Out_10|, #memory_int=|v_#memory_int_In_11|, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset_Out_6|, ~n~0=v_~n~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_14|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet9#1, ~f~0.base, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~x1~0, ~f~0.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~ret11#1.base, ULTIMATE.start_main_#t~nondet13#1, #length, ULTIMATE.start_create_fresh_int_array_~i~2#1, ~x2~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~post19#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~ret11#1.offset, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 513#[L101-6]don't care [683] L101-6-->L101-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_43| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_43| |v_ULTIMATE.start_create_fresh_int_array_~size#1_48|) (<= 0 .cse0) (= (store |v_#memory_int_88| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41| (store (select |v_#memory_int_88| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_25|)) |v_#memory_int_87|) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41| 4) (select |v_#length_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|)) (= (select |v_#valid_149| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_42| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_43| 1))))) InVars {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|, #valid=|v_#valid_149|, #memory_int=|v_#memory_int_88|, #length=|v_#length_110|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_25|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_43|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|} OutVars{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_create_fresh_int_array_#t~post19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post19#1_23|, #valid=|v_#valid_149|, #memory_int=|v_#memory_int_87|, #length=|v_#length_110|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_42|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post19#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_~i~2#1] 525#[L101-6]don't care [704] L101-6-->L85-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| v_~f~0.base_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6| 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_In_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_5|)) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre12#1_Out_2|) (= (select |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (= (store |v_#memory_int_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre12#1_Out_2|)) |v_#memory_int_Out_2|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= (ite (< (mod v_~n~0_In_5 4294967296) 1431655765) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= v_~f~0.offset_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, #pthreadsForks=|v_#pthreadsForks_In_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_In_3|, #length=|v_#length_In_5|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_In_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ~n~0=v_~n~0_In_5, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ~f~0.base=v_~f~0.base_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.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ~f~0.offset=v_~f~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_5|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_Out_2|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_Out_2|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_5|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_In_3|, ~n~0=v_~n~0_In_5, 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_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ~f~0.base, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base, #memory_int, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~f~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 497#[L85-3]don't care [496] L85-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_6|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_12|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_10|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_8|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 499#[thread1ENTRY, L85-4]don't care [426] thread1ENTRY-->L49-2: 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] 501#[L49-2, L85-4]don't care [2022-07-22 12:52:18,739 INFO L750 eck$LassoCheckResult]: Loop: 501#[L49-2, L85-4]don't care [706] L49-2-->L49-2: Formula: (let ((.cse1 (* v_~x1~0_In_1 4))) (let ((.cse0 (+ v_~f~0.offset_In_3 .cse1))) (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (mod (* 3 v_~n~0_In_7) 4294967296)) (<= 0 .cse0) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_3) .cse0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_2|) (<= (+ v_~f~0.offset_In_3 .cse1 4) (select |v_#length_In_7| v_~f~0.base_In_3)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= (select |v_#valid_In_7| v_~f~0.base_In_3) 1)))) InVars {~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_3, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_In_5|, #length=|v_#length_In_7|, ~n~0=v_~n~0_In_7, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_3} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_3, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_3, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_In_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, #length=|v_#length_In_7|, ~n~0=v_~n~0_In_7, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] 501#[L49-2, L85-4]don't care [2022-07-22 12:52:18,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:18,739 INFO L85 PathProgramCache]: Analyzing trace with hash 712756828, now seen corresponding path program 1 times [2022-07-22 12:52:18,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:52:18,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744325795] [2022-07-22 12:52:18,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:52:18,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:52:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:18,838 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:52:18,893 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:52:18,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:18,908 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:52:18,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:18,909 INFO L85 PathProgramCache]: Analyzing trace with hash 737, now seen corresponding path program 2 times [2022-07-22 12:52:18,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:52:18,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024207457] [2022-07-22 12:52:18,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:52:18,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:52:18,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:18,932 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:52:18,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:18,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:52:18,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:18,951 INFO L85 PathProgramCache]: Analyzing trace with hash 620625894, now seen corresponding path program 1 times [2022-07-22 12:52:18,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:52:18,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184080468] [2022-07-22 12:52:18,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:52:18,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:52:19,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:19,039 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:52:19,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:19,118 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:52:20,686 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:52:20,687 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:52:20,687 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:52:20,687 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:52:20,687 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:52:20,687 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:20,687 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:52:20,687 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:52:20,688 INFO L133 ssoRankerPreferences]: Filename of dumped script: unroll-3.wvr.c_BEv2_Iteration3_Lasso [2022-07-22 12:52:20,688 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:52:20,688 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:52:20,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:20,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:20,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:20,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:20,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:20,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:20,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:20,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:20,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:20,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:20,957 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:52:20,961 INFO L158 Benchmark]: Toolchain (without parser) took 13587.23ms. Allocated memory is still 156.2MB. Free memory was 130.1MB in the beginning and 116.6MB in the end (delta: 13.5MB). Peak memory consumption was 86.0MB. Max. memory is 8.0GB. [2022-07-22 12:52:20,961 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 125.8MB. Free memory is still 78.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:52:20,962 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.95ms. Allocated memory is still 156.2MB. Free memory was 129.9MB in the beginning and 119.1MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-07-22 12:52:20,963 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.69ms. Allocated memory is still 156.2MB. Free memory was 118.9MB in the beginning and 116.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:52:20,963 INFO L158 Benchmark]: Boogie Preprocessor took 37.39ms. Allocated memory is still 156.2MB. Free memory was 116.9MB in the beginning and 115.6MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-22 12:52:20,964 INFO L158 Benchmark]: RCFGBuilder took 645.34ms. Allocated memory is still 156.2MB. Free memory was 115.4MB in the beginning and 99.3MB in the end (delta: 16.1MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-07-22 12:52:20,965 INFO L158 Benchmark]: BuchiAutomizer took 12536.48ms. Allocated memory is still 156.2MB. Free memory was 99.3MB in the beginning and 116.6MB in the end (delta: -17.3MB). Peak memory consumption was 55.6MB. Max. memory is 8.0GB. [2022-07-22 12:52:20,968 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.24ms. Allocated memory is still 125.8MB. Free memory is still 78.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 304.95ms. Allocated memory is still 156.2MB. Free memory was 129.9MB in the beginning and 119.1MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.69ms. Allocated memory is still 156.2MB. Free memory was 118.9MB in the beginning and 116.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.39ms. Allocated memory is still 156.2MB. Free memory was 116.9MB in the beginning and 115.6MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 645.34ms. Allocated memory is still 156.2MB. Free memory was 115.4MB in the beginning and 99.3MB in the end (delta: 16.1MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * BuchiAutomizer took 12536.48ms. Allocated memory is still 156.2MB. Free memory was 99.3MB in the beginning and 116.6MB in the end (delta: -17.3MB). Peak memory consumption was 55.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.2s, 172 PlacesBefore, 21 PlacesAfterwards, 180 TransitionsBefore, 17 TransitionsAfterwards, 2856 CoEnabledTransitionPairs, 8 FixpointIterations, 90 TrivialSequentialCompositions, 64 ConcurrentSequentialCompositions, 27 TrivialYvCompositions, 24 ConcurrentYvCompositions, 12 ChoiceCompositions, 217 TotalNumberOfCompositions, 2841 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2724, positive: 2712, positive conditional: 0, positive unconditional: 2712, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1653, positive: 1648, positive conditional: 0, positive unconditional: 1648, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2724, positive: 1064, positive conditional: 0, positive unconditional: 1064, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 1653, unknown conditional: 0, unknown unconditional: 1653] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 20, Positive conditional cache size: 0, Positive unconditional cache size: 20, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1 - 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:52:20,989 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...