/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf -i ../../../trunk/examples/svcomp/weaver/array-eq-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:14:13,900 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:14:13,903 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:14:13,956 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:14:13,956 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:14:13,958 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:14:13,960 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:14:13,962 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:14:13,964 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:14:13,966 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:14:13,967 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:14:13,968 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:14:13,969 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:14:13,970 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:14:13,971 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:14:13,972 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:14:13,973 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:14:13,974 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:14:13,976 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:14:13,979 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:14:13,980 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:14:13,981 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:14:13,983 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:14:13,984 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:14:13,985 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:14:13,989 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:14:13,990 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:14:13,990 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:14:13,991 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:14:13,992 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:14:13,993 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:14:13,994 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:14:13,995 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:14:13,996 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:14:13,997 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:14:13,998 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:14:13,998 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:14:13,999 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:14:14,000 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:14:14,000 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:14:14,001 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:14:14,005 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:14:14,006 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf [2022-07-22 12:14:14,058 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:14:14,058 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:14:14,059 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:14:14,059 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:14:14,061 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:14:14,061 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:14:14,061 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:14:14,062 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:14:14,062 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:14:14,063 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:14:14,063 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:14:14,063 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:14:14,063 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:14:14,064 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:14:14,064 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:14:14,064 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:14:14,064 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:14:14,064 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:14:14,065 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:14:14,065 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:14:14,065 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:14:14,065 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:14:14,065 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:14:14,066 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:14:14,066 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:14:14,066 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:14:14,066 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:14:14,066 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:14:14,067 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:14:14,067 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:14:14,067 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:14:14,070 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:14:14,070 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:14:14,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:14:14,515 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:14:14,518 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:14:14,520 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:14:14,520 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:14:14,522 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/array-eq-symm.wvr.c [2022-07-22 12:14:14,605 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0aa36b7f/2ccf8abb08604caf92fd7deea270b08a/FLAG182807d7f [2022-07-22 12:14:15,306 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:14:15,307 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/array-eq-symm.wvr.c [2022-07-22 12:14:15,317 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0aa36b7f/2ccf8abb08604caf92fd7deea270b08a/FLAG182807d7f [2022-07-22 12:14:15,665 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0aa36b7f/2ccf8abb08604caf92fd7deea270b08a [2022-07-22 12:14:15,668 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:14:15,674 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:14:15,678 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:14:15,678 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:14:15,683 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:14:15,684 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:14:15" (1/1) ... [2022-07-22 12:14:15,686 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@431503b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:14:15, skipping insertion in model container [2022-07-22 12:14:15,686 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:14:15" (1/1) ... [2022-07-22 12:14:15,695 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:14:15,720 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:14:15,907 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/array-eq-symm.wvr.c[2251,2264] [2022-07-22 12:14:15,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:14:15,931 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:14:15,955 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/array-eq-symm.wvr.c[2251,2264] [2022-07-22 12:14:15,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:14:15,977 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:14:15,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:14:15 WrapperNode [2022-07-22 12:14:15,978 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:14:15,979 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:14:15,981 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:14:15,981 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:14:15,991 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:14:15" (1/1) ... [2022-07-22 12:14:16,011 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:14:15" (1/1) ... [2022-07-22 12:14:16,059 INFO L137 Inliner]: procedures = 23, calls = 29, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 108 [2022-07-22 12:14:16,059 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:14:16,061 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:14:16,061 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:14:16,061 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:14:16,075 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:14:15" (1/1) ... [2022-07-22 12:14:16,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:14:15" (1/1) ... [2022-07-22 12:14:16,095 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:14:15" (1/1) ... [2022-07-22 12:14:16,096 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:14:15" (1/1) ... [2022-07-22 12:14:16,113 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:14:15" (1/1) ... [2022-07-22 12:14:16,125 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:14:15" (1/1) ... [2022-07-22 12:14:16,133 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:14:15" (1/1) ... [2022-07-22 12:14:16,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:14:16,143 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:14:16,143 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:14:16,144 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:14:16,145 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:14:15" (1/1) ... [2022-07-22 12:14:16,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:14:16,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:14:16,209 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:14:16,231 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:14:16,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:14:16,302 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 12:14:16,303 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 12:14:16,303 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 12:14:16,303 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 12:14:16,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:14:16,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:14:16,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:14:16,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 12:14:16,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:14:16,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:14:16,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:14:16,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:14:16,307 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:14:16,457 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:14:16,459 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:14:16,837 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:14:16,849 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:14:16,850 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-22 12:14:16,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:14:16 BoogieIcfgContainer [2022-07-22 12:14:16,853 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:14:16,854 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:14:16,854 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:14:16,859 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:14:16,861 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:14:16,861 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:14:15" (1/3) ... [2022-07-22 12:14:16,862 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@15bb867f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:14:16, skipping insertion in model container [2022-07-22 12:14:16,863 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:14:16,863 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:14:15" (2/3) ... [2022-07-22 12:14:16,863 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@15bb867f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:14:16, skipping insertion in model container [2022-07-22 12:14:16,864 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:14:16,864 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:14:16" (3/3) ... [2022-07-22 12:14:16,865 INFO L322 chiAutomizerObserver]: Analyzing ICFG array-eq-symm.wvr.c [2022-07-22 12:14:16,968 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-22 12:14:17,017 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 161 places, 171 transitions, 358 flow [2022-07-22 12:14:17,146 INFO L129 PetriNetUnfolder]: 15/167 cut-off events. [2022-07-22 12:14:17,146 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:14:17,151 INFO L84 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 167 events. 15/167 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 110 event pairs, 0 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 127. Up to 3 conditions per place. [2022-07-22 12:14:17,152 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 171 transitions, 358 flow [2022-07-22 12:14:17,176 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 159 places, 167 transitions, 346 flow [2022-07-22 12:14:17,181 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-07-22 12:14:17,199 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 167 transitions, 346 flow [2022-07-22 12:14:17,202 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 167 transitions, 346 flow [2022-07-22 12:14:17,203 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 159 places, 167 transitions, 346 flow [2022-07-22 12:14:17,237 INFO L129 PetriNetUnfolder]: 15/167 cut-off events. [2022-07-22 12:14:17,237 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:14:17,239 INFO L84 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 167 events. 15/167 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 120 event pairs, 0 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 127. Up to 3 conditions per place. [2022-07-22 12:14:17,241 INFO L116 LiptonReduction]: Number of co-enabled transitions 992 [2022-07-22 12:14:23,263 INFO L131 LiptonReduction]: Checked pairs total: 1279 [2022-07-22 12:14:23,264 INFO L133 LiptonReduction]: Total number of compositions: 186 [2022-07-22 12:14:23,290 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:14:23,290 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:14:23,290 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:14:23,291 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:14:23,291 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:14:23,291 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:14:23,291 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:14:23,291 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:14:23,294 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:14:23,330 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 18 [2022-07-22 12:14:23,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:14:23,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:14:23,337 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:14:23,337 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:14:23,339 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:14:23,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 27 states, but on-demand construction may add more states [2022-07-22 12:14:23,347 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 18 [2022-07-22 12:14:23,348 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:14:23,348 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:14:23,348 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:14:23,348 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:14:23,356 INFO L748 eck$LassoCheckResult]: Stem: 164#[ULTIMATE.startENTRY]don't care [625] ULTIMATE.startENTRY-->L95-6: Formula: (let ((.cse0 (store |v_#valid_In_9| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse2 (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1)) (.cse1 (select |v_#memory_int_In_3| 1))) (and (= |v_#length_Out_14| (store (store (store |v_#length_In_9| |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_14| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|))) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| |v_#StackHeapBarrier_In_7|) (= 0 |v_#NULL.base_Out_2|) (= v_~An~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= v_~i_AB~0_Out_2 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| 4294967296) 1073741823) 1 0)) (= (select .cse1 0) 48) (= (select |v_#valid_In_9| 0) 0) (= 20 (select |v_#length_In_9| 2)) (= (select |v_#valid_In_9| 1) 1) (= |v_#valid_Out_18| (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| 1)) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| 0)) (< |v_#StackHeapBarrier_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= |v_#NULL.offset_Out_2| 0) (= v_~A~0.base_Out_2 0) (< 0 |v_#StackHeapBarrier_In_7|) (= v_~B~0.base_Out_2 0) (< |v_#StackHeapBarrier_In_7| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= (select |v_#valid_In_9| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (select |v_#length_In_9| 1) 2) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|) 1 0) 0)) (= v_~i_BA~0_Out_2 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|) (= (select |v_#valid_In_9| 2) 1) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18| 0)) (= v_~B~0.offset_Out_2 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_14| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_10| 0) (= v_~A~0.offset_Out_2 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (= 0 (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14|)) (= 0 (select .cse1 1)) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|)))) InVars {#memory_int=|v_#memory_int_In_3|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, #length=|v_#length_In_9|, #valid=|v_#valid_In_9|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_14|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_Out_2|, ~B~0.base=v_~B~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_10|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base_Out_14|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset_Out_14|, 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|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, 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_18|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_Out_6|, #length=|v_#length_Out_14|, ~B~0.offset=v_~B~0.offset_Out_2, ULTIMATE.start_main_#t~ret10#1.base=|v_ULTIMATE.start_main_#t~ret10#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14|, ULTIMATE.start_main_#t~ret10#1.offset=|v_ULTIMATE.start_main_#t~ret10#1.offset_Out_2|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_Out_2|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ~i_AB~0=v_~i_AB~0_Out_2, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|, ~An~0=v_~An~0_Out_2, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_Out_6|, ~A~0.offset=v_~A~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_Out_6|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, #valid=|v_#valid_Out_18|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_Out_2|, #memory_int=|v_#memory_int_In_3|, ~i_BA~0=v_~i_BA~0_Out_2, ~Bn~0=v_~Bn~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~pre13#1, ~B~0.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #length, ~B~0.offset, ULTIMATE.start_main_#t~ret10#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~ret10#1.offset, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_#res#1, ~i_AB~0, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~An~0, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret9#1.offset, ~A~0.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, ~i_BA~0, ~Bn~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 167#[L95-6]don't care [2022-07-22 12:14:23,357 INFO L750 eck$LassoCheckResult]: Loop: 167#[L95-6]don't care [583] L95-6-->L95-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_66| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_59| .cse1))) (and (= (store |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_59| (store (select |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_59|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_38|)) |v_#memory_int_109|) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_59| 4 .cse1) (select |v_#length_133| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_59|)) (= (select |v_#valid_164| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_59|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_87|) (<= 0 .cse0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_66| 1))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_59|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_59|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_66|, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_38|, #valid=|v_#valid_164|, #memory_int=|v_#memory_int_110|, #length=|v_#length_133|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_87|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_59|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_59|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_65|, #valid=|v_#valid_164|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_43|, #memory_int=|v_#memory_int_109|, #length=|v_#length_133|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_87|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #memory_int] 167#[L95-6]don't care [2022-07-22 12:14:23,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:14:23,365 INFO L85 PathProgramCache]: Analyzing trace with hash 656, now seen corresponding path program 1 times [2022-07-22 12:14:23,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:14:23,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129284381] [2022-07-22 12:14:23,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:14:23,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:14:23,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:14:23,518 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:14:23,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:14:23,567 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:14:23,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:14:23,571 INFO L85 PathProgramCache]: Analyzing trace with hash 614, now seen corresponding path program 1 times [2022-07-22 12:14:23,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:14:23,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277379283] [2022-07-22 12:14:23,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:14:23,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:14:23,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:14:23,583 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:14:23,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:14:23,592 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:14:23,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:14:23,594 INFO L85 PathProgramCache]: Analyzing trace with hash 20919, now seen corresponding path program 1 times [2022-07-22 12:14:23,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:14:23,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239175486] [2022-07-22 12:14:23,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:14:23,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:14:23,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:14:23,640 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:14:23,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:14:23,668 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:14:24,448 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:14:24,449 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:14:24,449 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:14:24,449 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:14:24,449 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:14:24,449 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:14:24,450 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:14:24,450 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:14:24,450 INFO L133 ssoRankerPreferences]: Filename of dumped script: array-eq-symm.wvr.c_BEv2_Iteration1_Lasso [2022-07-22 12:14:24,450 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:14:24,450 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:14:24,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:24,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:24,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:24,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:24,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:24,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:24,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:24,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:24,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:24,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:24,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:24,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:24,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:24,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:24,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:24,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:24,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:24,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:24,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:24,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:24,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:24,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:24,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:24,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:24,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:24,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:24,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:24,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:24,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:24,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:24,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:24,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:24,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:24,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:24,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:25,329 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:14:25,334 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:14:25,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:14:25,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:14:25,339 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:14:25,350 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:14:25,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:14:25,360 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:14:25,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:14:25,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:14:25,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:14:25,363 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:14:25,363 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:14:25,365 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:14:25,376 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:14:25,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-22 12:14:25,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:14:25,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:14:25,403 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:14:25,404 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:14:25,405 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:14:25,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:14:25,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:14:25,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:14:25,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:14:25,417 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:14:25,418 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:14:25,422 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:14:25,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-07-22 12:14:25,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:14:25,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:14:25,445 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:14:25,447 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:14:25,447 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:14:25,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:14:25,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:14:25,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:14:25,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:14:25,458 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:14:25,458 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:14:25,472 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:14:25,496 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:14:25,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:14:25,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:14:25,498 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:14:25,499 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:14:25,499 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:14:25,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:14:25,506 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:14:25,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:14:25,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:14:25,507 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:14:25,507 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:14:25,507 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:14:25,508 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:14:25,532 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:14:25,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:14:25,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:14:25,534 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:14:25,535 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:14:25,536 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:14:25,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:14:25,542 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:14:25,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:14:25,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:14:25,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:14:25,544 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:14:25,544 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:14:25,568 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:14:25,607 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:14:25,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:14:25,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:14:25,608 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:14:25,618 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:14:25,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:14:25,626 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:14:25,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:14:25,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:14:25,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:14:25,627 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:14:25,627 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:14:25,629 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:14:25,638 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:14:25,660 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:14:25,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:14:25,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:14:25,662 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:14:25,662 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:14:25,663 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:14:25,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:14:25,669 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:14:25,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:14:25,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:14:25,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:14:25,670 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:14:25,670 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:14:25,671 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:14:25,693 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:14:25,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:14:25,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:14:25,695 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:14:25,695 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:14:25,698 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:14:25,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:14:25,705 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:14:25,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:14:25,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:14:25,706 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:14:25,706 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:14:25,707 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:14:25,709 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:14:25,733 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:14:25,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:14:25,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:14:25,735 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:14:25,736 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:14:25,737 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:14:25,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:14:25,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:14:25,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:14:25,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:14:25,757 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:14:25,758 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:14:25,768 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:14:25,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-07-22 12:14:25,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:14:25,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:14:25,794 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:14:25,795 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:14:25,797 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:14:25,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:14:25,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:14:25,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:14:25,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:14:25,810 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:14:25,810 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:14:25,832 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:14:25,854 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:14:25,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:14:25,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:14:25,856 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:14:25,857 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:14:25,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:14:25,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:14:25,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:14:25,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:14:25,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:14:25,867 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:14:25,867 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:14:25,893 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:14:25,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-22 12:14:25,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:14:25,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:14:25,928 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:14:25,932 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:14:25,933 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:14:25,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:14:25,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:14:25,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:14:25,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:14:25,944 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:14:25,944 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:14:25,962 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:14:25,997 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:14:25,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:14:25,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:14:25,999 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:14:26,003 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:14:26,003 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:14:26,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:14:26,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:14:26,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:14:26,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:14:26,015 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:14:26,016 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:14:26,031 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:14:26,068 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:14:26,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:14:26,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:14:26,070 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:14:26,071 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:14:26,074 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:14:26,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:14:26,081 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:14:26,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:14:26,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:14:26,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:14:26,082 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:14:26,082 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:14:26,104 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:14:26,126 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:14:26,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:14:26,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:14:26,128 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:14:26,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-22 12:14:26,129 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:14:26,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:14:26,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:14:26,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:14:26,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:14:26,144 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:14:26,144 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:14:26,160 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:14:26,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-22 12:14:26,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:14:26,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:14:26,195 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:14:26,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-22 12:14:26,201 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:14:26,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:14:26,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:14:26,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:14:26,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:14:26,213 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:14:26,213 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:14:26,226 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:14:26,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-22 12:14:26,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:14:26,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:14:26,265 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:14:26,271 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:14:26,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-22 12:14:26,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:14:26,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:14:26,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:14:26,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:14:26,282 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:14:26,283 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:14:26,300 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:14:26,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-22 12:14:26,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:14:26,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:14:26,341 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:14:26,350 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:14:26,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:14:26,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:14:26,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:14:26,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:14:26,362 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:14:26,362 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:14:26,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-22 12:14:26,377 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:14:26,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-22 12:14:26,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:14:26,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:14:26,414 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:14:26,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-22 12:14:26,417 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:14:26,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:14:26,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:14:26,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:14:26,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:14:26,430 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:14:26,431 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:14:26,447 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:14:26,488 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-07-22 12:14:26,488 INFO L444 ModelExtractionUtils]: 10 out of 22 variables were initially zero. Simplification set additionally 9 variables to zero. [2022-07-22 12:14:26,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:14:26,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:14:26,492 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:14:26,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-22 12:14:26,503 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:14:26,522 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:14:26,522 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:14:26,523 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1) = -1*ULTIMATE.start_create_fresh_int_array_~i~0#1 + 1*ULTIMATE.start_create_fresh_int_array_~size#1 Supporting invariants [] [2022-07-22 12:14:26,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-22 12:14:26,686 INFO L257 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2022-07-22 12:14:26,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:14:26,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:14:26,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:14:26,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:14:26,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:14:26,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:14:26,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:14:26,756 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:14:26,792 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:14:26,795 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 27 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:14:26,839 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 27 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 30 states and 68 transitions. Complement of second has 3 states. [2022-07-22 12:14:26,841 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:14:26,847 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:14:26,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2022-07-22 12:14:26,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 1 letters. [2022-07-22 12:14:26,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:14:26,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-22 12:14:26,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:14:26,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 2 letters. [2022-07-22 12:14:26,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:14:26,851 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 68 transitions. [2022-07-22 12:14:26,854 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 17 [2022-07-22 12:14:26,859 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 24 states and 55 transitions. [2022-07-22 12:14:26,861 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2022-07-22 12:14:26,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2022-07-22 12:14:26,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 55 transitions. [2022-07-22 12:14:26,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:14:26,863 INFO L220 hiAutomatonCegarLoop]: Abstraction has 24 states and 55 transitions. [2022-07-22 12:14:26,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 55 transitions. [2022-07-22 12:14:26,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2022-07-22 12:14:26,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 22 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:14:26,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 53 transitions. [2022-07-22 12:14:26,896 INFO L242 hiAutomatonCegarLoop]: Abstraction has 23 states and 53 transitions. [2022-07-22 12:14:26,897 INFO L425 stractBuchiCegarLoop]: Abstraction has 23 states and 53 transitions. [2022-07-22 12:14:26,897 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:14:26,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 53 transitions. [2022-07-22 12:14:26,898 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 17 [2022-07-22 12:14:26,898 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:14:26,899 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:14:26,899 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 12:14:26,899 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:14:26,900 INFO L748 eck$LassoCheckResult]: Stem: 329#[ULTIMATE.startENTRY]don't care [625] ULTIMATE.startENTRY-->L95-6: Formula: (let ((.cse0 (store |v_#valid_In_9| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse2 (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1)) (.cse1 (select |v_#memory_int_In_3| 1))) (and (= |v_#length_Out_14| (store (store (store |v_#length_In_9| |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_14| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|))) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| |v_#StackHeapBarrier_In_7|) (= 0 |v_#NULL.base_Out_2|) (= v_~An~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= v_~i_AB~0_Out_2 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| 4294967296) 1073741823) 1 0)) (= (select .cse1 0) 48) (= (select |v_#valid_In_9| 0) 0) (= 20 (select |v_#length_In_9| 2)) (= (select |v_#valid_In_9| 1) 1) (= |v_#valid_Out_18| (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| 1)) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| 0)) (< |v_#StackHeapBarrier_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= |v_#NULL.offset_Out_2| 0) (= v_~A~0.base_Out_2 0) (< 0 |v_#StackHeapBarrier_In_7|) (= v_~B~0.base_Out_2 0) (< |v_#StackHeapBarrier_In_7| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= (select |v_#valid_In_9| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (select |v_#length_In_9| 1) 2) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|) 1 0) 0)) (= v_~i_BA~0_Out_2 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|) (= (select |v_#valid_In_9| 2) 1) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18| 0)) (= v_~B~0.offset_Out_2 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_14| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_10| 0) (= v_~A~0.offset_Out_2 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (= 0 (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14|)) (= 0 (select .cse1 1)) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|)))) InVars {#memory_int=|v_#memory_int_In_3|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, #length=|v_#length_In_9|, #valid=|v_#valid_In_9|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_14|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_Out_2|, ~B~0.base=v_~B~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_10|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base_Out_14|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset_Out_14|, 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|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, 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_18|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_Out_6|, #length=|v_#length_Out_14|, ~B~0.offset=v_~B~0.offset_Out_2, ULTIMATE.start_main_#t~ret10#1.base=|v_ULTIMATE.start_main_#t~ret10#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14|, ULTIMATE.start_main_#t~ret10#1.offset=|v_ULTIMATE.start_main_#t~ret10#1.offset_Out_2|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_Out_2|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ~i_AB~0=v_~i_AB~0_Out_2, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|, ~An~0=v_~An~0_Out_2, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_Out_6|, ~A~0.offset=v_~A~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_Out_6|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, #valid=|v_#valid_Out_18|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_Out_2|, #memory_int=|v_#memory_int_In_3|, ~i_BA~0=v_~i_BA~0_Out_2, ~Bn~0=v_~Bn~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~pre13#1, ~B~0.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #length, ~B~0.offset, ULTIMATE.start_main_#t~ret10#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~ret10#1.offset, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_#res#1, ~i_AB~0, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~An~0, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret9#1.offset, ~A~0.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, ~i_BA~0, ~Bn~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 331#[L95-6]don't care [623] L95-6-->L95-14: Formula: (and (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_107|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_125|) 1 0) 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_108| |v_ULTIMATE.start_create_fresh_int_array_~size#1_126|)) (= (select |v_#valid_265| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_105|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_105| |v_#StackHeapBarrier_62|) (= v_~A~0.offset_43 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_106|) (= v_~A~0.base_43 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_106|) (= (store |v_#length_222| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_105| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_125| 4)) |v_#length_221|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_105| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_49| |v_ULTIMATE.start_create_fresh_int_array_~size#1_125|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_151| 0)) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_125| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_123|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_105| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_123| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_151|) (= |v_#valid_264| (store |v_#valid_265| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_105| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_49| v_~Bn~0_70)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_106|, #StackHeapBarrier=|v_#StackHeapBarrier_62|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_106|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_108|, #valid=|v_#valid_265|, #length=|v_#length_222|, ~Bn~0=v_~Bn~0_70, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_126|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_105|, ~A~0.base=v_~A~0.base_43, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_105|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_107|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base_87|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset_87|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_63|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_125|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_63|, #StackHeapBarrier=|v_#StackHeapBarrier_62|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_41|, ~A~0.offset=v_~A~0.offset_43, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_49|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_151|, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_65|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_41|, #valid=|v_#valid_264|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_69|, #length=|v_#length_221|, ~Bn~0=v_~Bn~0_70, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_123|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret9#1.offset, ~A~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_main_#t~ret9#1.base, #valid, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 335#[L95-14]don't care [2022-07-22 12:14:26,900 INFO L750 eck$LassoCheckResult]: Loop: 335#[L95-14]don't care [570] L95-14-->L95-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_58| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49|))) (and (= |v_#memory_int_93| (store |v_#memory_int_94| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| (store (select |v_#memory_int_94| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_32|))) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49| 4) (select |v_#length_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|)) (= (select |v_#valid_136| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|) 1) (<= 0 .cse0) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_58| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_57|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_58| |v_ULTIMATE.start_create_fresh_int_array_~size#1_73|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_58|, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_32|, #valid=|v_#valid_136|, #memory_int=|v_#memory_int_94|, #length=|v_#length_107|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_57|, #valid=|v_#valid_136|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_37|, #memory_int=|v_#memory_int_93|, #length=|v_#length_107|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #memory_int] 335#[L95-14]don't care [2022-07-22 12:14:26,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:14:26,901 INFO L85 PathProgramCache]: Analyzing trace with hash 20959, now seen corresponding path program 1 times [2022-07-22 12:14:26,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:14:26,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283479274] [2022-07-22 12:14:26,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:14:26,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:14:26,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:14:26,930 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:14:26,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:14:26,963 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:14:26,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:14:26,964 INFO L85 PathProgramCache]: Analyzing trace with hash 601, now seen corresponding path program 1 times [2022-07-22 12:14:26,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:14:26,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669489472] [2022-07-22 12:14:26,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:14:26,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:14:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:14:26,974 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:14:26,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:14:26,992 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:14:26,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:14:26,994 INFO L85 PathProgramCache]: Analyzing trace with hash 650299, now seen corresponding path program 1 times [2022-07-22 12:14:26,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:14:26,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233811689] [2022-07-22 12:14:26,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:14:26,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:14:27,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:14:27,078 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:14:27,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:14:27,136 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:14:27,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-22 12:14:28,412 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:14:28,412 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:14:28,413 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:14:28,413 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:14:28,413 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:14:28,413 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:14:28,413 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:14:28,413 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:14:28,413 INFO L133 ssoRankerPreferences]: Filename of dumped script: array-eq-symm.wvr.c_BEv2_Iteration2_Lasso [2022-07-22 12:14:28,413 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:14:28,414 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:14:28,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:28,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:28,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:28,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:28,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:28,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:28,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:28,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:28,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:28,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:28,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:28,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:28,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:28,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:28,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:28,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:28,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:28,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:28,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:28,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:28,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:28,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:28,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:28,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:28,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:28,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:28,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:28,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:28,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:28,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:28,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:28,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:28,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:29,454 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:14:29,455 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:14:29,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:14:29,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:14:29,456 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:14:29,458 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:14:29,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:14:29,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:14:29,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:14:29,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:14:29,468 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:14:29,468 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:14:29,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-22 12:14:29,472 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:14:29,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-22 12:14:29,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:14:29,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:14:29,496 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:14:29,498 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:14:29,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-22 12:14:29,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:14:29,505 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:14:29,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:14:29,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:14:29,505 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:14:29,506 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:14:29,506 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:14:29,513 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:14:29,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-07-22 12:14:29,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:14:29,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:14:29,536 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:14:29,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-22 12:14:29,539 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:14:29,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:14:29,546 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:14:29,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:14:29,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:14:29,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:14:29,546 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:14:29,547 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:14:29,548 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:14:29,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-07-22 12:14:29,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:14:29,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:14:29,571 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:14:29,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-22 12:14:29,573 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:14:29,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:14:29,579 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:14:29,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:14:29,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:14:29,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:14:29,580 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:14:29,580 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:14:29,581 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:14:29,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-07-22 12:14:29,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:14:29,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:14:29,606 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:14:29,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-22 12:14:29,609 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:14:29,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:14:29,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:14:29,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:14:29,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:14:29,617 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:14:29,617 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:14:29,620 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:14:29,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-07-22 12:14:29,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:14:29,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:14:29,644 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:14:29,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-22 12:14:29,647 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:14:29,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:14:29,654 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:14:29,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:14:29,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:14:29,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:14:29,655 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:14:29,655 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:14:29,663 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:14:29,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-07-22 12:14:29,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:14:29,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:14:29,686 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:14:29,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:14:29,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-22 12:14:29,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:14:29,694 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:14:29,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:14:29,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:14:29,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:14:29,695 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:14:29,695 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:14:29,696 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:14:29,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-07-22 12:14:29,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:14:29,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:14:29,720 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:14:29,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-22 12:14:29,722 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:14:29,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:14:29,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:14:29,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:14:29,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:14:29,730 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:14:29,730 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:14:29,733 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:14:29,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-07-22 12:14:29,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:14:29,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:14:29,756 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:14:29,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-07-22 12:14:29,758 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:14:29,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:14:29,766 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:14:29,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:14:29,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:14:29,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:14:29,767 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:14:29,767 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:14:29,782 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:14:29,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-07-22 12:14:29,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:14:29,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:14:29,820 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:14:29,822 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:14:29,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:14:29,831 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:14:29,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:14:29,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:14:29,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:14:29,832 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:14:29,832 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:14:29,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-07-22 12:14:29,843 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:14:29,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-07-22 12:14:29,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:14:29,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:14:29,883 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:14:29,886 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:14:29,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:14:29,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:14:29,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:14:29,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:14:29,898 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:14:29,898 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:14:29,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-07-22 12:14:29,917 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:14:29,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-07-22 12:14:29,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:14:29,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:14:29,959 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:14:29,961 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:14:29,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:14:29,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:14:29,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:14:29,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:14:29,972 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:14:29,972 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:14:29,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-07-22 12:14:29,985 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:14:30,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-07-22 12:14:30,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:14:30,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:14:30,027 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:14:30,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:14:30,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:14:30,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:14:30,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:14:30,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:14:30,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-07-22 12:14:30,080 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:14:30,080 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:14:30,096 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:14:30,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-07-22 12:14:30,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:14:30,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:14:30,135 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:14:30,137 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:14:30,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-07-22 12:14:30,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:14:30,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:14:30,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:14:30,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:14:30,147 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:14:30,147 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:14:30,165 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:14:30,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-07-22 12:14:30,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:14:30,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:14:30,199 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:14:30,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-07-22 12:14:30,201 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:14:30,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:14:30,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:14:30,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:14:30,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:14:30,213 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:14:30,213 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:14:30,224 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:14:30,256 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2022-07-22 12:14:30,256 INFO L444 ModelExtractionUtils]: 10 out of 22 variables were initially zero. Simplification set additionally 9 variables to zero. [2022-07-22 12:14:30,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:14:30,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:14:30,258 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:14:30,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-07-22 12:14:30,259 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:14:30,266 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:14:30,267 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:14:30,267 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1) = -1*ULTIMATE.start_create_fresh_int_array_~i~0#1 + 1*ULTIMATE.start_create_fresh_int_array_~size#1 Supporting invariants [] [2022-07-22 12:14:30,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2022-07-22 12:14:30,366 INFO L257 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2022-07-22 12:14:30,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:14:30,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:14:30,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:14:30,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:14:30,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:14:30,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:14:30,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:14:30,426 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:14:30,427 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:14:30,427 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 53 transitions. cyclomatic complexity: 42 Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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:14:30,454 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 53 transitions. cyclomatic complexity: 42. Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 24 states and 55 transitions. Complement of second has 3 states. [2022-07-22 12:14:30,455 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:14:30,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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:14:30,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 4 transitions. [2022-07-22 12:14:30,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 4 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-22 12:14:30,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:14:30,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 4 transitions. Stem has 3 letters. Loop has 1 letters. [2022-07-22 12:14:30,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:14:30,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 4 transitions. Stem has 2 letters. Loop has 2 letters. [2022-07-22 12:14:30,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:14:30,457 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 55 transitions. [2022-07-22 12:14:30,462 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 16 [2022-07-22 12:14:30,467 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 55 transitions. [2022-07-22 12:14:30,467 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2022-07-22 12:14:30,468 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2022-07-22 12:14:30,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 55 transitions. [2022-07-22 12:14:30,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:14:30,468 INFO L220 hiAutomatonCegarLoop]: Abstraction has 24 states and 55 transitions. [2022-07-22 12:14:30,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 55 transitions. [2022-07-22 12:14:30,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-07-22 12:14:30,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 23 states have internal predecessors, (55), 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:14:30,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 55 transitions. [2022-07-22 12:14:30,481 INFO L242 hiAutomatonCegarLoop]: Abstraction has 24 states and 55 transitions. [2022-07-22 12:14:30,481 INFO L425 stractBuchiCegarLoop]: Abstraction has 24 states and 55 transitions. [2022-07-22 12:14:30,481 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:14:30,482 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 55 transitions. [2022-07-22 12:14:30,483 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 16 [2022-07-22 12:14:30,483 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:14:30,483 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:14:30,483 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 12:14:30,483 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:14:30,486 INFO L748 eck$LassoCheckResult]: Stem: 504#[ULTIMATE.startENTRY]don't care [625] ULTIMATE.startENTRY-->L95-6: Formula: (let ((.cse0 (store |v_#valid_In_9| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse2 (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1)) (.cse1 (select |v_#memory_int_In_3| 1))) (and (= |v_#length_Out_14| (store (store (store |v_#length_In_9| |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_14| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|))) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| |v_#StackHeapBarrier_In_7|) (= 0 |v_#NULL.base_Out_2|) (= v_~An~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= v_~i_AB~0_Out_2 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| 4294967296) 1073741823) 1 0)) (= (select .cse1 0) 48) (= (select |v_#valid_In_9| 0) 0) (= 20 (select |v_#length_In_9| 2)) (= (select |v_#valid_In_9| 1) 1) (= |v_#valid_Out_18| (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| 1)) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| 0)) (< |v_#StackHeapBarrier_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= |v_#NULL.offset_Out_2| 0) (= v_~A~0.base_Out_2 0) (< 0 |v_#StackHeapBarrier_In_7|) (= v_~B~0.base_Out_2 0) (< |v_#StackHeapBarrier_In_7| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= (select |v_#valid_In_9| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (select |v_#length_In_9| 1) 2) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|) 1 0) 0)) (= v_~i_BA~0_Out_2 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|) (= (select |v_#valid_In_9| 2) 1) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18| 0)) (= v_~B~0.offset_Out_2 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_14| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_10| 0) (= v_~A~0.offset_Out_2 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (= 0 (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14|)) (= 0 (select .cse1 1)) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|)))) InVars {#memory_int=|v_#memory_int_In_3|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, #length=|v_#length_In_9|, #valid=|v_#valid_In_9|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_14|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_Out_2|, ~B~0.base=v_~B~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_10|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base_Out_14|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset_Out_14|, 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|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, 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_18|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_Out_6|, #length=|v_#length_Out_14|, ~B~0.offset=v_~B~0.offset_Out_2, ULTIMATE.start_main_#t~ret10#1.base=|v_ULTIMATE.start_main_#t~ret10#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14|, ULTIMATE.start_main_#t~ret10#1.offset=|v_ULTIMATE.start_main_#t~ret10#1.offset_Out_2|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_Out_2|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ~i_AB~0=v_~i_AB~0_Out_2, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|, ~An~0=v_~An~0_Out_2, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_Out_6|, ~A~0.offset=v_~A~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_Out_6|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, #valid=|v_#valid_Out_18|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_Out_2|, #memory_int=|v_#memory_int_In_3|, ~i_BA~0=v_~i_BA~0_Out_2, ~Bn~0=v_~Bn~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~pre13#1, ~B~0.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #length, ~B~0.offset, ULTIMATE.start_main_#t~ret10#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~ret10#1.offset, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_#res#1, ~i_AB~0, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~An~0, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret9#1.offset, ~A~0.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, ~i_BA~0, ~Bn~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 506#[L95-6]don't care [623] L95-6-->L95-14: Formula: (and (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_107|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_125|) 1 0) 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_108| |v_ULTIMATE.start_create_fresh_int_array_~size#1_126|)) (= (select |v_#valid_265| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_105|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_105| |v_#StackHeapBarrier_62|) (= v_~A~0.offset_43 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_106|) (= v_~A~0.base_43 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_106|) (= (store |v_#length_222| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_105| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_125| 4)) |v_#length_221|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_105| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_49| |v_ULTIMATE.start_create_fresh_int_array_~size#1_125|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_151| 0)) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_125| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_123|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_105| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_123| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_151|) (= |v_#valid_264| (store |v_#valid_265| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_105| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_49| v_~Bn~0_70)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_106|, #StackHeapBarrier=|v_#StackHeapBarrier_62|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_106|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_108|, #valid=|v_#valid_265|, #length=|v_#length_222|, ~Bn~0=v_~Bn~0_70, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_126|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_105|, ~A~0.base=v_~A~0.base_43, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_105|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_107|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base_87|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset_87|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_63|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_125|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_63|, #StackHeapBarrier=|v_#StackHeapBarrier_62|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_41|, ~A~0.offset=v_~A~0.offset_43, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_49|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_151|, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_65|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_41|, #valid=|v_#valid_264|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_69|, #length=|v_#length_221|, ~Bn~0=v_~Bn~0_70, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_123|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret9#1.offset, ~A~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_main_#t~ret9#1.base, #valid, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 518#[L95-14]don't care [605] L95-14-->L79-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_45| v_~B~0.offset_61) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_45| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_77|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_81| |v_ULTIMATE.start_create_fresh_int_array_~size#1_103|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_45| v_~B~0.base_61) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_45| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_77|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_29|) (select |v_#length_175| |v_ULTIMATE.start_main_~#t1~0#1.base_33|)) (= (select |v_#valid_214| |v_ULTIMATE.start_main_~#t1~0#1.base_33|) 1) (= (store |v_#memory_int_148| |v_ULTIMATE.start_main_~#t1~0#1.base_33| (store (select |v_#memory_int_148| |v_ULTIMATE.start_main_~#t1~0#1.base_33|) |v_ULTIMATE.start_main_~#t1~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre11#1_33|)) |v_#memory_int_147|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_29|) (= |v_#pthreadsForks_73| (+ |v_#pthreadsForks_74| 1)) (= |v_ULTIMATE.start_main_#t~pre11#1_33| |v_#pthreadsForks_74|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_77|, #pthreadsForks=|v_#pthreadsForks_74|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_77|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_81|, #valid=|v_#valid_214|, #memory_int=|v_#memory_int_148|, #length=|v_#length_175|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_33|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_103|} OutVars{ULTIMATE.start_main_#t~ret10#1.base=|v_ULTIMATE.start_main_#t~ret10#1.base_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_77|, ~B~0.base=v_~B~0.base_61, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_33|, ULTIMATE.start_main_#t~ret10#1.offset=|v_ULTIMATE.start_main_#t~ret10#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_77|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_81|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_45|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_103|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_45|, #pthreadsForks=|v_#pthreadsForks_73|, #valid=|v_#valid_214|, #memory_int=|v_#memory_int_147|, #length=|v_#length_175|, ~B~0.offset=v_~B~0.offset_61} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret10#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~B~0.base, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~ret10#1.offset, #pthreadsForks, #memory_int, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~B~0.offset] 546#[L79-3]don't care [434] L79-3-->L47-5: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread1Thread1of1ForFork0_#t~mem1=|v_thread1Thread1of1ForFork0_#t~mem1_12|, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_12|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_8|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1, thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post3, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 510#[L47-5, L79-4]don't care [2022-07-22 12:14:30,486 INFO L750 eck$LassoCheckResult]: Loop: 510#[L47-5, L79-4]don't care [509] L47-5-->L47-1: Formula: (let ((.cse1 (* v_~i_AB~0_27 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_13))) (and (< v_~i_AB~0_27 v_~An~0_18) (<= 0 .cse0) (= |v_thread1Thread1of1ForFork0_#t~mem1_23| (select (select |v_#memory_int_57| v_~A~0.base_13) .cse0)) (< v_~i_AB~0_27 v_~Bn~0_20) (= (select |v_#valid_76| v_~A~0.base_13) 1) (<= (+ .cse1 v_~A~0.offset_13 4) (select |v_#length_61| v_~A~0.base_13))))) InVars {~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_13, #valid=|v_#valid_76|, ~i_AB~0=v_~i_AB~0_27, #memory_int=|v_#memory_int_57|, #length=|v_#length_61|, ~Bn~0=v_~Bn~0_20, ~An~0=v_~An~0_18} OutVars{~A~0.base=v_~A~0.base_13, thread1Thread1of1ForFork0_#t~mem1=|v_thread1Thread1of1ForFork0_#t~mem1_23|, ~A~0.offset=v_~A~0.offset_13, #valid=|v_#valid_76|, ~i_AB~0=v_~i_AB~0_27, #memory_int=|v_#memory_int_57|, #length=|v_#length_61|, ~Bn~0=v_~Bn~0_20, ~An~0=v_~An~0_18} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1] 508#[L47-1, L79-4]don't care [592] L47-1-->L47-5: Formula: (let ((.cse0 (* v_~i_AB~0_74 4))) (let ((.cse1 (+ v_~B~0.offset_53 .cse0))) (and (<= (+ v_~B~0.offset_53 .cse0 4) (select |v_#length_157| v_~B~0.base_53)) (= v_~i_AB~0_73 (+ v_~i_AB~0_74 1)) (= |v_thread1Thread1of1ForFork0_#t~mem1_70| (select (select |v_#memory_int_139| v_~B~0.base_53) .cse1)) (<= 0 .cse1) (= (select |v_#valid_188| v_~B~0.base_53) 1)))) InVars {thread1Thread1of1ForFork0_#t~mem1=|v_thread1Thread1of1ForFork0_#t~mem1_70|, ~B~0.base=v_~B~0.base_53, #valid=|v_#valid_188|, ~i_AB~0=v_~i_AB~0_74, #memory_int=|v_#memory_int_139|, #length=|v_#length_157|, ~B~0.offset=v_~B~0.offset_53} OutVars{thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_55|, ~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_15|, #valid=|v_#valid_188|, ~i_AB~0=v_~i_AB~0_73, #memory_int=|v_#memory_int_139|, #length=|v_#length_157|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1, thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~post3, ~i_AB~0] 510#[L47-5, L79-4]don't care [2022-07-22 12:14:30,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:14:30,487 INFO L85 PathProgramCache]: Analyzing trace with hash 20160788, now seen corresponding path program 1 times [2022-07-22 12:14:30,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:14:30,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218668428] [2022-07-22 12:14:30,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:14:30,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:14:30,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:14:30,563 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:14:30,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:14:30,594 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:14:30,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:14:30,595 INFO L85 PathProgramCache]: Analyzing trace with hash 17332, now seen corresponding path program 1 times [2022-07-22 12:14:30,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:14:30,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146284894] [2022-07-22 12:14:30,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:14:30,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:14:30,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:14:30,602 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:14:30,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:14:30,608 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:14:30,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:14:30,609 INFO L85 PathProgramCache]: Analyzing trace with hash -2100302841, now seen corresponding path program 1 times [2022-07-22 12:14:30,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:14:30,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389552762] [2022-07-22 12:14:30,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:14:30,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:14:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:14:30,700 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:14:30,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:14:30,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389552762] [2022-07-22 12:14:30,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389552762] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:14:30,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:14:30,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 12:14:30,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240232598] [2022-07-22 12:14:30,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:14:30,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:14:30,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 12:14:30,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 12:14:30,779 INFO L87 Difference]: Start difference. First operand 24 states and 55 transitions. cyclomatic complexity: 43 Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:14:30,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:14:30,879 INFO L93 Difference]: Finished difference Result 55 states and 122 transitions. [2022-07-22 12:14:30,879 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 122 transitions. [2022-07-22 12:14:30,882 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 30 [2022-07-22 12:14:30,883 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 53 states and 119 transitions. [2022-07-22 12:14:30,883 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2022-07-22 12:14:30,884 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2022-07-22 12:14:30,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 119 transitions. [2022-07-22 12:14:30,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:14:30,885 INFO L220 hiAutomatonCegarLoop]: Abstraction has 53 states and 119 transitions. [2022-07-22 12:14:30,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 119 transitions. [2022-07-22 12:14:30,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 29. [2022-07-22 12:14:30,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 28 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:14:30,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 65 transitions. [2022-07-22 12:14:30,890 INFO L242 hiAutomatonCegarLoop]: Abstraction has 29 states and 65 transitions. [2022-07-22 12:14:30,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 12:14:30,891 INFO L425 stractBuchiCegarLoop]: Abstraction has 29 states and 65 transitions. [2022-07-22 12:14:30,891 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 12:14:30,892 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 65 transitions. [2022-07-22 12:14:30,892 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 18 [2022-07-22 12:14:30,893 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:14:30,893 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:14:30,893 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 12:14:30,893 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:14:30,894 INFO L748 eck$LassoCheckResult]: Stem: 619#[ULTIMATE.startENTRY]don't care [625] ULTIMATE.startENTRY-->L95-6: Formula: (let ((.cse0 (store |v_#valid_In_9| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse2 (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1)) (.cse1 (select |v_#memory_int_In_3| 1))) (and (= |v_#length_Out_14| (store (store (store |v_#length_In_9| |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_14| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|))) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| |v_#StackHeapBarrier_In_7|) (= 0 |v_#NULL.base_Out_2|) (= v_~An~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= v_~i_AB~0_Out_2 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| 4294967296) 1073741823) 1 0)) (= (select .cse1 0) 48) (= (select |v_#valid_In_9| 0) 0) (= 20 (select |v_#length_In_9| 2)) (= (select |v_#valid_In_9| 1) 1) (= |v_#valid_Out_18| (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| 1)) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| 0)) (< |v_#StackHeapBarrier_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= |v_#NULL.offset_Out_2| 0) (= v_~A~0.base_Out_2 0) (< 0 |v_#StackHeapBarrier_In_7|) (= v_~B~0.base_Out_2 0) (< |v_#StackHeapBarrier_In_7| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= (select |v_#valid_In_9| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (select |v_#length_In_9| 1) 2) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|) 1 0) 0)) (= v_~i_BA~0_Out_2 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|) (= (select |v_#valid_In_9| 2) 1) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18| 0)) (= v_~B~0.offset_Out_2 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_14| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_10| 0) (= v_~A~0.offset_Out_2 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (= 0 (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14|)) (= 0 (select .cse1 1)) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|)))) InVars {#memory_int=|v_#memory_int_In_3|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, #length=|v_#length_In_9|, #valid=|v_#valid_In_9|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_14|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_Out_2|, ~B~0.base=v_~B~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_10|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base_Out_14|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset_Out_14|, 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|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, 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_18|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_Out_6|, #length=|v_#length_Out_14|, ~B~0.offset=v_~B~0.offset_Out_2, ULTIMATE.start_main_#t~ret10#1.base=|v_ULTIMATE.start_main_#t~ret10#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14|, ULTIMATE.start_main_#t~ret10#1.offset=|v_ULTIMATE.start_main_#t~ret10#1.offset_Out_2|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_Out_2|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ~i_AB~0=v_~i_AB~0_Out_2, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|, ~An~0=v_~An~0_Out_2, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_Out_6|, ~A~0.offset=v_~A~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_Out_6|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, #valid=|v_#valid_Out_18|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_Out_2|, #memory_int=|v_#memory_int_In_3|, ~i_BA~0=v_~i_BA~0_Out_2, ~Bn~0=v_~Bn~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~pre13#1, ~B~0.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #length, ~B~0.offset, ULTIMATE.start_main_#t~ret10#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~ret10#1.offset, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_#res#1, ~i_AB~0, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~An~0, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret9#1.offset, ~A~0.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, ~i_BA~0, ~Bn~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 621#[L95-6]don't care [623] L95-6-->L95-14: Formula: (and (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_107|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_125|) 1 0) 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_108| |v_ULTIMATE.start_create_fresh_int_array_~size#1_126|)) (= (select |v_#valid_265| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_105|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_105| |v_#StackHeapBarrier_62|) (= v_~A~0.offset_43 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_106|) (= v_~A~0.base_43 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_106|) (= (store |v_#length_222| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_105| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_125| 4)) |v_#length_221|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_105| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_49| |v_ULTIMATE.start_create_fresh_int_array_~size#1_125|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_151| 0)) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_125| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_123|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_105| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_123| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_151|) (= |v_#valid_264| (store |v_#valid_265| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_105| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_49| v_~Bn~0_70)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_106|, #StackHeapBarrier=|v_#StackHeapBarrier_62|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_106|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_108|, #valid=|v_#valid_265|, #length=|v_#length_222|, ~Bn~0=v_~Bn~0_70, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_126|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_105|, ~A~0.base=v_~A~0.base_43, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_105|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_107|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base_87|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset_87|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_63|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_125|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_63|, #StackHeapBarrier=|v_#StackHeapBarrier_62|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_41|, ~A~0.offset=v_~A~0.offset_43, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_49|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_151|, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_65|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_41|, #valid=|v_#valid_264|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_69|, #length=|v_#length_221|, ~Bn~0=v_~Bn~0_70, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_123|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret9#1.offset, ~A~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_main_#t~ret9#1.base, #valid, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 639#[L95-14]don't care [570] L95-14-->L95-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_58| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49|))) (and (= |v_#memory_int_93| (store |v_#memory_int_94| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| (store (select |v_#memory_int_94| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_32|))) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49| 4) (select |v_#length_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|)) (= (select |v_#valid_136| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|) 1) (<= 0 .cse0) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_58| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_57|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_58| |v_ULTIMATE.start_create_fresh_int_array_~size#1_73|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_58|, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_32|, #valid=|v_#valid_136|, #memory_int=|v_#memory_int_94|, #length=|v_#length_107|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_57|, #valid=|v_#valid_136|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_37|, #memory_int=|v_#memory_int_93|, #length=|v_#length_107|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #memory_int] 669#[L95-14]don't care [605] L95-14-->L79-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_45| v_~B~0.offset_61) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_45| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_77|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_81| |v_ULTIMATE.start_create_fresh_int_array_~size#1_103|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_45| v_~B~0.base_61) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_45| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_77|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_29|) (select |v_#length_175| |v_ULTIMATE.start_main_~#t1~0#1.base_33|)) (= (select |v_#valid_214| |v_ULTIMATE.start_main_~#t1~0#1.base_33|) 1) (= (store |v_#memory_int_148| |v_ULTIMATE.start_main_~#t1~0#1.base_33| (store (select |v_#memory_int_148| |v_ULTIMATE.start_main_~#t1~0#1.base_33|) |v_ULTIMATE.start_main_~#t1~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre11#1_33|)) |v_#memory_int_147|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_29|) (= |v_#pthreadsForks_73| (+ |v_#pthreadsForks_74| 1)) (= |v_ULTIMATE.start_main_#t~pre11#1_33| |v_#pthreadsForks_74|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_77|, #pthreadsForks=|v_#pthreadsForks_74|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_77|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_81|, #valid=|v_#valid_214|, #memory_int=|v_#memory_int_148|, #length=|v_#length_175|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_33|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_103|} OutVars{ULTIMATE.start_main_#t~ret10#1.base=|v_ULTIMATE.start_main_#t~ret10#1.base_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_77|, ~B~0.base=v_~B~0.base_61, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_33|, ULTIMATE.start_main_#t~ret10#1.offset=|v_ULTIMATE.start_main_#t~ret10#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_77|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_81|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_45|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_103|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_45|, #pthreadsForks=|v_#pthreadsForks_73|, #valid=|v_#valid_214|, #memory_int=|v_#memory_int_147|, #length=|v_#length_175|, ~B~0.offset=v_~B~0.offset_61} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret10#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~B~0.base, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~ret10#1.offset, #pthreadsForks, #memory_int, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~B~0.offset] 671#[L79-3]don't care [434] L79-3-->L47-5: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread1Thread1of1ForFork0_#t~mem1=|v_thread1Thread1of1ForFork0_#t~mem1_12|, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_12|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_8|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1, thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post3, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 631#[L47-5, L79-4]don't care [2022-07-22 12:14:30,894 INFO L750 eck$LassoCheckResult]: Loop: 631#[L47-5, L79-4]don't care [509] L47-5-->L47-1: Formula: (let ((.cse1 (* v_~i_AB~0_27 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_13))) (and (< v_~i_AB~0_27 v_~An~0_18) (<= 0 .cse0) (= |v_thread1Thread1of1ForFork0_#t~mem1_23| (select (select |v_#memory_int_57| v_~A~0.base_13) .cse0)) (< v_~i_AB~0_27 v_~Bn~0_20) (= (select |v_#valid_76| v_~A~0.base_13) 1) (<= (+ .cse1 v_~A~0.offset_13 4) (select |v_#length_61| v_~A~0.base_13))))) InVars {~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_13, #valid=|v_#valid_76|, ~i_AB~0=v_~i_AB~0_27, #memory_int=|v_#memory_int_57|, #length=|v_#length_61|, ~Bn~0=v_~Bn~0_20, ~An~0=v_~An~0_18} OutVars{~A~0.base=v_~A~0.base_13, thread1Thread1of1ForFork0_#t~mem1=|v_thread1Thread1of1ForFork0_#t~mem1_23|, ~A~0.offset=v_~A~0.offset_13, #valid=|v_#valid_76|, ~i_AB~0=v_~i_AB~0_27, #memory_int=|v_#memory_int_57|, #length=|v_#length_61|, ~Bn~0=v_~Bn~0_20, ~An~0=v_~An~0_18} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1] 629#[L47-1, L79-4]don't care [592] L47-1-->L47-5: Formula: (let ((.cse0 (* v_~i_AB~0_74 4))) (let ((.cse1 (+ v_~B~0.offset_53 .cse0))) (and (<= (+ v_~B~0.offset_53 .cse0 4) (select |v_#length_157| v_~B~0.base_53)) (= v_~i_AB~0_73 (+ v_~i_AB~0_74 1)) (= |v_thread1Thread1of1ForFork0_#t~mem1_70| (select (select |v_#memory_int_139| v_~B~0.base_53) .cse1)) (<= 0 .cse1) (= (select |v_#valid_188| v_~B~0.base_53) 1)))) InVars {thread1Thread1of1ForFork0_#t~mem1=|v_thread1Thread1of1ForFork0_#t~mem1_70|, ~B~0.base=v_~B~0.base_53, #valid=|v_#valid_188|, ~i_AB~0=v_~i_AB~0_74, #memory_int=|v_#memory_int_139|, #length=|v_#length_157|, ~B~0.offset=v_~B~0.offset_53} OutVars{thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_55|, ~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_15|, #valid=|v_#valid_188|, ~i_AB~0=v_~i_AB~0_73, #memory_int=|v_#memory_int_139|, #length=|v_#length_157|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1, thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~post3, ~i_AB~0] 631#[L47-5, L79-4]don't care [2022-07-22 12:14:30,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:14:30,895 INFO L85 PathProgramCache]: Analyzing trace with hash 624956528, now seen corresponding path program 1 times [2022-07-22 12:14:30,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:14:30,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111799912] [2022-07-22 12:14:30,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:14:30,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:14:30,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:14:30,925 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:14:30,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:14:30,957 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:14:30,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:14:30,958 INFO L85 PathProgramCache]: Analyzing trace with hash 17332, now seen corresponding path program 2 times [2022-07-22 12:14:30,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:14:30,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497123161] [2022-07-22 12:14:30,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:14:30,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:14:30,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:14:30,965 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:14:30,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:14:30,971 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:14:30,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:14:30,972 INFO L85 PathProgramCache]: Analyzing trace with hash -712181661, now seen corresponding path program 1 times [2022-07-22 12:14:30,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:14:30,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488463643] [2022-07-22 12:14:30,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:14:30,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:14:30,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:14:31,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 12:14:31,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:14:31,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488463643] [2022-07-22 12:14:31,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488463643] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:14:31,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:14:31,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 12:14:31,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414612091] [2022-07-22 12:14:31,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:14:31,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:14:31,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 12:14:31,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 12:14:31,090 INFO L87 Difference]: Start difference. First operand 29 states and 65 transitions. cyclomatic complexity: 50 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:14:31,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:14:31,147 INFO L93 Difference]: Finished difference Result 49 states and 101 transitions. [2022-07-22 12:14:31,148 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 101 transitions. [2022-07-22 12:14:31,149 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 26 [2022-07-22 12:14:31,150 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 47 states and 98 transitions. [2022-07-22 12:14:31,150 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2022-07-22 12:14:31,151 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2022-07-22 12:14:31,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 98 transitions. [2022-07-22 12:14:31,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:14:31,152 INFO L220 hiAutomatonCegarLoop]: Abstraction has 47 states and 98 transitions. [2022-07-22 12:14:31,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 98 transitions. [2022-07-22 12:14:31,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 31. [2022-07-22 12:14:31,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.225806451612903) internal successors, (69), 30 states have internal predecessors, (69), 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:14:31,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 69 transitions. [2022-07-22 12:14:31,156 INFO L242 hiAutomatonCegarLoop]: Abstraction has 31 states and 69 transitions. [2022-07-22 12:14:31,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 12:14:31,158 INFO L425 stractBuchiCegarLoop]: Abstraction has 31 states and 69 transitions. [2022-07-22 12:14:31,158 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 12:14:31,158 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 69 transitions. [2022-07-22 12:14:31,159 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 18 [2022-07-22 12:14:31,159 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:14:31,159 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:14:31,159 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:14:31,159 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:14:31,160 INFO L748 eck$LassoCheckResult]: Stem: 735#[ULTIMATE.startENTRY]don't care [625] ULTIMATE.startENTRY-->L95-6: Formula: (let ((.cse0 (store |v_#valid_In_9| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse2 (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1)) (.cse1 (select |v_#memory_int_In_3| 1))) (and (= |v_#length_Out_14| (store (store (store |v_#length_In_9| |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_14| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|))) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| |v_#StackHeapBarrier_In_7|) (= 0 |v_#NULL.base_Out_2|) (= v_~An~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|) (= v_~i_AB~0_Out_2 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| 4294967296) 1073741823) 1 0)) (= (select .cse1 0) 48) (= (select |v_#valid_In_9| 0) 0) (= 20 (select |v_#length_In_9| 2)) (= (select |v_#valid_In_9| 1) 1) (= |v_#valid_Out_18| (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| 1)) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14| 0)) (< |v_#StackHeapBarrier_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= |v_#NULL.offset_Out_2| 0) (= v_~A~0.base_Out_2 0) (< 0 |v_#StackHeapBarrier_In_7|) (= v_~B~0.base_Out_2 0) (< |v_#StackHeapBarrier_In_7| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= (select |v_#valid_In_9| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (select |v_#length_In_9| 1) 2) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|) 1 0) 0)) (= v_~i_BA~0_Out_2 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18|) (= (select |v_#valid_In_9| 2) 1) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_18| 0)) (= v_~B~0.offset_Out_2 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_14| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_10| 0) (= v_~A~0.offset_Out_2 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (= 0 (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14|)) (= 0 (select .cse1 1)) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_6|)))) InVars {#memory_int=|v_#memory_int_In_3|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, #length=|v_#length_In_9|, #valid=|v_#valid_In_9|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_14|, ~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_Out_2|, ~B~0.base=v_~B~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_10|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base_Out_14|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset_Out_14|, 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|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, 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_18|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_Out_6|, #length=|v_#length_Out_14|, ~B~0.offset=v_~B~0.offset_Out_2, ULTIMATE.start_main_#t~ret10#1.base=|v_ULTIMATE.start_main_#t~ret10#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_14|, ULTIMATE.start_main_#t~ret10#1.offset=|v_ULTIMATE.start_main_#t~ret10#1.offset_Out_2|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_Out_2|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ~i_AB~0=v_~i_AB~0_Out_2, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|, ~An~0=v_~An~0_Out_2, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_14|, #StackHeapBarrier=|v_#StackHeapBarrier_In_7|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_Out_6|, ~A~0.offset=v_~A~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_Out_6|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, #valid=|v_#valid_Out_18|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_Out_2|, #memory_int=|v_#memory_int_In_3|, ~i_BA~0=v_~i_BA~0_Out_2, ~Bn~0=v_~Bn~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~pre13#1, ~B~0.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #length, ~B~0.offset, ULTIMATE.start_main_#t~ret10#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~ret10#1.offset, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_#res#1, ~i_AB~0, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~An~0, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret9#1.offset, ~A~0.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, ~i_BA~0, ~Bn~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 737#[L95-6]don't care [583] L95-6-->L95-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_66| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_59| .cse1))) (and (= (store |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_59| (store (select |v_#memory_int_110| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_59|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_38|)) |v_#memory_int_109|) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_59| 4 .cse1) (select |v_#length_133| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_59|)) (= (select |v_#valid_164| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_59|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_87|) (<= 0 .cse0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_66| 1))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_59|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_59|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_66|, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_38|, #valid=|v_#valid_164|, #memory_int=|v_#memory_int_110|, #length=|v_#length_133|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_87|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_59|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_59|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_65|, #valid=|v_#valid_164|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_43|, #memory_int=|v_#memory_int_109|, #length=|v_#length_133|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_87|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #memory_int] 739#[L95-6]don't care [623] L95-6-->L95-14: Formula: (and (= 0 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_107|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_125|) 1 0) 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_108| |v_ULTIMATE.start_create_fresh_int_array_~size#1_126|)) (= (select |v_#valid_265| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_105|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_105| |v_#StackHeapBarrier_62|) (= v_~A~0.offset_43 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_106|) (= v_~A~0.base_43 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_106|) (= (store |v_#length_222| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_105| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_125| 4)) |v_#length_221|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_105| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_49| |v_ULTIMATE.start_create_fresh_int_array_~size#1_125|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_151| 0)) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_125| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_123|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_105| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_123| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_151|) (= |v_#valid_264| (store |v_#valid_265| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_105| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_49| v_~Bn~0_70)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_106|, #StackHeapBarrier=|v_#StackHeapBarrier_62|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_106|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_108|, #valid=|v_#valid_265|, #length=|v_#length_222|, ~Bn~0=v_~Bn~0_70, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_126|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_105|, ~A~0.base=v_~A~0.base_43, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_105|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_107|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base_87|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset_87|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_63|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_125|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_63|, #StackHeapBarrier=|v_#StackHeapBarrier_62|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_41|, ~A~0.offset=v_~A~0.offset_43, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_49|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_151|, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_65|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_41|, #valid=|v_#valid_264|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_69|, #length=|v_#length_221|, ~Bn~0=v_~Bn~0_70, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_123|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret9#1.offset, ~A~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_main_#t~ret9#1.base, #valid, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #length, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 743#[L95-14]don't care [570] L95-14-->L95-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_58| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49|))) (and (= |v_#memory_int_93| (store |v_#memory_int_94| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| (store (select |v_#memory_int_94| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_32|))) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49| 4) (select |v_#length_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|)) (= (select |v_#valid_136| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|) 1) (<= 0 .cse0) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_58| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_57|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_58| |v_ULTIMATE.start_create_fresh_int_array_~size#1_73|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_58|, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_32|, #valid=|v_#valid_136|, #memory_int=|v_#memory_int_94|, #length=|v_#length_107|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_57|, #valid=|v_#valid_136|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_37|, #memory_int=|v_#memory_int_93|, #length=|v_#length_107|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #memory_int] 795#[L95-14]don't care [605] L95-14-->L79-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_45| v_~B~0.offset_61) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_45| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_77|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_81| |v_ULTIMATE.start_create_fresh_int_array_~size#1_103|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_45| v_~B~0.base_61) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_45| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_77|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_29|) (select |v_#length_175| |v_ULTIMATE.start_main_~#t1~0#1.base_33|)) (= (select |v_#valid_214| |v_ULTIMATE.start_main_~#t1~0#1.base_33|) 1) (= (store |v_#memory_int_148| |v_ULTIMATE.start_main_~#t1~0#1.base_33| (store (select |v_#memory_int_148| |v_ULTIMATE.start_main_~#t1~0#1.base_33|) |v_ULTIMATE.start_main_~#t1~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre11#1_33|)) |v_#memory_int_147|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_29|) (= |v_#pthreadsForks_73| (+ |v_#pthreadsForks_74| 1)) (= |v_ULTIMATE.start_main_#t~pre11#1_33| |v_#pthreadsForks_74|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_77|, #pthreadsForks=|v_#pthreadsForks_74|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_77|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_81|, #valid=|v_#valid_214|, #memory_int=|v_#memory_int_148|, #length=|v_#length_175|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_33|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_103|} OutVars{ULTIMATE.start_main_#t~ret10#1.base=|v_ULTIMATE.start_main_#t~ret10#1.base_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_77|, ~B~0.base=v_~B~0.base_61, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_33|, ULTIMATE.start_main_#t~ret10#1.offset=|v_ULTIMATE.start_main_#t~ret10#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_77|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_81|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_45|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_103|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_45|, #pthreadsForks=|v_#pthreadsForks_73|, #valid=|v_#valid_214|, #memory_int=|v_#memory_int_147|, #length=|v_#length_175|, ~B~0.offset=v_~B~0.offset_61} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret10#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~B~0.base, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~ret10#1.offset, #pthreadsForks, #memory_int, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~B~0.offset] 793#[L79-3]don't care [434] L79-3-->L47-5: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread1Thread1of1ForFork0_#t~mem1=|v_thread1Thread1of1ForFork0_#t~mem1_12|, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_12|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_8|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1, thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post3, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 747#[L47-5, L79-4]don't care [2022-07-22 12:14:31,161 INFO L750 eck$LassoCheckResult]: Loop: 747#[L47-5, L79-4]don't care [509] L47-5-->L47-1: Formula: (let ((.cse1 (* v_~i_AB~0_27 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_13))) (and (< v_~i_AB~0_27 v_~An~0_18) (<= 0 .cse0) (= |v_thread1Thread1of1ForFork0_#t~mem1_23| (select (select |v_#memory_int_57| v_~A~0.base_13) .cse0)) (< v_~i_AB~0_27 v_~Bn~0_20) (= (select |v_#valid_76| v_~A~0.base_13) 1) (<= (+ .cse1 v_~A~0.offset_13 4) (select |v_#length_61| v_~A~0.base_13))))) InVars {~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_13, #valid=|v_#valid_76|, ~i_AB~0=v_~i_AB~0_27, #memory_int=|v_#memory_int_57|, #length=|v_#length_61|, ~Bn~0=v_~Bn~0_20, ~An~0=v_~An~0_18} OutVars{~A~0.base=v_~A~0.base_13, thread1Thread1of1ForFork0_#t~mem1=|v_thread1Thread1of1ForFork0_#t~mem1_23|, ~A~0.offset=v_~A~0.offset_13, #valid=|v_#valid_76|, ~i_AB~0=v_~i_AB~0_27, #memory_int=|v_#memory_int_57|, #length=|v_#length_61|, ~Bn~0=v_~Bn~0_20, ~An~0=v_~An~0_18} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1] 745#[L47-1, L79-4]don't care [592] L47-1-->L47-5: Formula: (let ((.cse0 (* v_~i_AB~0_74 4))) (let ((.cse1 (+ v_~B~0.offset_53 .cse0))) (and (<= (+ v_~B~0.offset_53 .cse0 4) (select |v_#length_157| v_~B~0.base_53)) (= v_~i_AB~0_73 (+ v_~i_AB~0_74 1)) (= |v_thread1Thread1of1ForFork0_#t~mem1_70| (select (select |v_#memory_int_139| v_~B~0.base_53) .cse1)) (<= 0 .cse1) (= (select |v_#valid_188| v_~B~0.base_53) 1)))) InVars {thread1Thread1of1ForFork0_#t~mem1=|v_thread1Thread1of1ForFork0_#t~mem1_70|, ~B~0.base=v_~B~0.base_53, #valid=|v_#valid_188|, ~i_AB~0=v_~i_AB~0_74, #memory_int=|v_#memory_int_139|, #length=|v_#length_157|, ~B~0.offset=v_~B~0.offset_53} OutVars{thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_55|, ~B~0.base=v_~B~0.base_53, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_15|, #valid=|v_#valid_188|, ~i_AB~0=v_~i_AB~0_73, #memory_int=|v_#memory_int_139|, #length=|v_#length_157|, ~B~0.offset=v_~B~0.offset_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1, thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~post3, ~i_AB~0] 747#[L47-5, L79-4]don't care [2022-07-22 12:14:31,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:14:31,161 INFO L85 PathProgramCache]: Analyzing trace with hash -2136573929, now seen corresponding path program 1 times [2022-07-22 12:14:31,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:14:31,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579013475] [2022-07-22 12:14:31,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:14:31,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:14:31,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:14:31,191 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:14:31,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:14:31,215 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:14:31,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:14:31,216 INFO L85 PathProgramCache]: Analyzing trace with hash 17332, now seen corresponding path program 3 times [2022-07-22 12:14:31,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:14:31,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067646693] [2022-07-22 12:14:31,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:14:31,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:14:31,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:14:31,227 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:14:31,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:14:31,240 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:14:31,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:14:31,241 INFO L85 PathProgramCache]: Analyzing trace with hash -253161910, now seen corresponding path program 1 times [2022-07-22 12:14:31,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:14:31,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030326938] [2022-07-22 12:14:31,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:14:31,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:14:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:14:31,320 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:14:31,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:14:31,401 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:14:32,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-07-22 12:14:33,269 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:14:33,270 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:14:33,270 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:14:33,270 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:14:33,270 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:14:33,270 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:14:33,270 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:14:33,270 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:14:33,271 INFO L133 ssoRankerPreferences]: Filename of dumped script: array-eq-symm.wvr.c_BEv2_Iteration5_Lasso [2022-07-22 12:14:33,271 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:14:33,271 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:14:33,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:33,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:33,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:33,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:33,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:33,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:33,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:33,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:33,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:33,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:33,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:33,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:33,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:33,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:14:33,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:14:33,734 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:14:33,737 INFO L158 Benchmark]: Toolchain (without parser) took 18067.04ms. Allocated memory was 158.3MB in the beginning and 245.4MB in the end (delta: 87.0MB). Free memory was 133.3MB in the beginning and 138.8MB in the end (delta: -5.5MB). Peak memory consumption was 142.7MB. Max. memory is 8.0GB. [2022-07-22 12:14:33,738 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 158.3MB. Free memory was 127.5MB in the beginning and 127.0MB in the end (delta: 440.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:14:33,738 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.20ms. Allocated memory is still 158.3MB. Free memory was 133.2MB in the beginning and 122.1MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-07-22 12:14:33,739 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.18ms. Allocated memory is still 158.3MB. Free memory was 121.9MB in the beginning and 120.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:14:33,739 INFO L158 Benchmark]: Boogie Preprocessor took 79.06ms. Allocated memory is still 158.3MB. Free memory was 120.2MB in the beginning and 118.8MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-22 12:14:33,740 INFO L158 Benchmark]: RCFGBuilder took 709.74ms. Allocated memory is still 158.3MB. Free memory was 118.6MB in the beginning and 137.8MB in the end (delta: -19.2MB). Peak memory consumption was 19.0MB. Max. memory is 8.0GB. [2022-07-22 12:14:33,741 INFO L158 Benchmark]: BuchiAutomizer took 16882.50ms. Allocated memory was 158.3MB in the beginning and 245.4MB in the end (delta: 87.0MB). Free memory was 137.8MB in the beginning and 138.8MB in the end (delta: -1.0MB). Peak memory consumption was 145.8MB. Max. memory is 8.0GB. [2022-07-22 12:14:33,743 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 158.3MB. Free memory was 127.5MB in the beginning and 127.0MB in the end (delta: 440.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 300.20ms. Allocated memory is still 158.3MB. Free memory was 133.2MB in the beginning and 122.1MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 80.18ms. Allocated memory is still 158.3MB. Free memory was 121.9MB in the beginning and 120.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 79.06ms. Allocated memory is still 158.3MB. Free memory was 120.2MB in the beginning and 118.8MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 709.74ms. Allocated memory is still 158.3MB. Free memory was 118.6MB in the beginning and 137.8MB in the end (delta: -19.2MB). Peak memory consumption was 19.0MB. Max. memory is 8.0GB. * BuchiAutomizer took 16882.50ms. Allocated memory was 158.3MB in the beginning and 245.4MB in the end (delta: 87.0MB). Free memory was 137.8MB in the beginning and 138.8MB in the end (delta: -1.0MB). Peak memory consumption was 145.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.1s, 159 PlacesBefore, 21 PlacesAfterwards, 167 TransitionsBefore, 19 TransitionsAfterwards, 992 CoEnabledTransitionPairs, 7 FixpointIterations, 115 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 22 TrivialYvCompositions, 8 ConcurrentYvCompositions, 10 ChoiceCompositions, 186 TotalNumberOfCompositions, 1279 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1180, positive: 1140, positive conditional: 0, positive unconditional: 1140, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 792, positive: 777, positive conditional: 0, positive unconditional: 777, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 792, positive: 777, positive conditional: 0, positive unconditional: 777, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 98, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 98, negative conditional: 0, negative unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1180, positive: 363, positive conditional: 0, positive unconditional: 363, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 792, unknown conditional: 0, unknown unconditional: 792] , Statistics on independence cache: Total cache size (in pairs): 36, Positive cache size: 33, Positive conditional cache size: 0, Positive unconditional cache size: 33, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3 - 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:14:33,791 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...